java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-invgen/seq-3.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:05:01,993 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:05:01,995 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:05:02,007 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:05:02,008 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:05:02,009 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:05:02,010 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:05:02,013 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:05:02,015 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:05:02,018 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:05:02,019 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:05:02,020 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:05:02,020 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:05:02,028 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:05:02,029 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:05:02,030 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:05:02,034 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:05:02,036 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:05:02,039 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:05:02,042 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:05:02,046 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:05:02,047 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:05:02,048 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:05:02,049 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:05:02,051 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:05:02,051 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:05:02,051 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:05:02,052 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:05:02,053 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:05:02,054 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:05:02,054 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:05:02,055 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:05:02,055 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:05:02,056 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:05:02,057 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:05:02,057 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:05:02,058 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:05:02,058 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:05:02,058 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:05:02,060 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:05:02,061 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:05:02,063 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 02:05:02,082 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:05:02,082 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:05:02,083 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:05:02,083 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:05:02,084 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:05:02,084 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:05:02,084 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:05:02,084 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:05:02,085 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:05:02,085 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:05:02,085 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:05:02,086 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:05:02,086 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:05:02,086 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:05:02,086 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:05:02,086 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:05:02,087 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:05:02,087 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:05:02,087 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:05:02,087 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:05:02,087 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:05:02,088 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:05:02,088 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:05:02,088 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:05:02,088 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:05:02,088 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:05:02,089 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:05:02,089 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:05:02,089 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:05:02,089 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:05:02,120 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:05:02,134 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:05:02,137 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:05:02,139 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:05:02,139 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:05:02,140 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/seq-3.i [2019-09-10 02:05:02,199 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bdd5fc3a/e2b2dec984b94e0b95ee0c577bb6dd59/FLAG7a9b2d804 [2019-09-10 02:05:02,634 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:05:02,634 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/seq-3.i [2019-09-10 02:05:02,641 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bdd5fc3a/e2b2dec984b94e0b95ee0c577bb6dd59/FLAG7a9b2d804 [2019-09-10 02:05:03,049 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bdd5fc3a/e2b2dec984b94e0b95ee0c577bb6dd59 [2019-09-10 02:05:03,058 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:05:03,059 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:05:03,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:05:03,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:05:03,064 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:05:03,064 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:05:03" (1/1) ... [2019-09-10 02:05:03,067 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29b41648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:05:03, skipping insertion in model container [2019-09-10 02:05:03,067 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:05:03" (1/1) ... [2019-09-10 02:05:03,075 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:05:03,092 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:05:03,263 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:05:03,267 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:05:03,285 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:05:03,296 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:05:03,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:05:03 WrapperNode [2019-09-10 02:05:03,297 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:05:03,298 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:05:03,298 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:05:03,298 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:05:03,401 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:05:03" (1/1) ... [2019-09-10 02:05:03,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:05:03" (1/1) ... [2019-09-10 02:05:03,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:05:03" (1/1) ... [2019-09-10 02:05:03,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:05:03" (1/1) ... [2019-09-10 02:05:03,420 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:05:03" (1/1) ... [2019-09-10 02:05:03,426 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:05:03" (1/1) ... [2019-09-10 02:05:03,427 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:05:03" (1/1) ... [2019-09-10 02:05:03,428 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:05:03,429 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:05:03,429 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:05:03,429 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:05:03,430 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:05:03" (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 [2019-09-10 02:05:03,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:05:03,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:05:03,485 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-10 02:05:03,485 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:05:03,485 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:05:03,485 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 02:05:03,485 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 02:05:03,486 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:05:03,486 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:05:03,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:05:03,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:05:03,715 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:05:03,716 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-10 02:05:03,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:05:03 BoogieIcfgContainer [2019-09-10 02:05:03,718 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:05:03,719 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:05:03,719 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:05:03,734 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:05:03,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:05:03" (1/3) ... [2019-09-10 02:05:03,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c366955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:05:03, skipping insertion in model container [2019-09-10 02:05:03,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:05:03" (2/3) ... [2019-09-10 02:05:03,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c366955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:05:03, skipping insertion in model container [2019-09-10 02:05:03,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:05:03" (3/3) ... [2019-09-10 02:05:03,742 INFO L109 eAbstractionObserver]: Analyzing ICFG seq-3.i [2019-09-10 02:05:03,764 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:05:03,771 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:05:03,788 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:05:03,831 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:05:03,832 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:05:03,832 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:05:03,832 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:05:03,832 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:05:03,832 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:05:03,832 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:05:03,832 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:05:03,846 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-09-10 02:05:03,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-10 02:05:03,854 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:03,855 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:03,857 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:03,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:03,861 INFO L82 PathProgramCache]: Analyzing trace with hash 2112948751, now seen corresponding path program 1 times [2019-09-10 02:05:03,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:03,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:03,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:05:03,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:03,902 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:03,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:04,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:05:04,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:05:04,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:05:04,078 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:05:04,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:05:04,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:05:04,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:05:04,107 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 7 states. [2019-09-10 02:05:04,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:04,372 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2019-09-10 02:05:04,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:05:04,374 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-09-10 02:05:04,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:04,390 INFO L225 Difference]: With dead ends: 40 [2019-09-10 02:05:04,390 INFO L226 Difference]: Without dead ends: 28 [2019-09-10 02:05:04,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:05:04,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-10 02:05:04,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2019-09-10 02:05:04,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-10 02:05:04,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-09-10 02:05:04,451 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 16 [2019-09-10 02:05:04,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:04,452 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-09-10 02:05:04,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:05:04,452 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-09-10 02:05:04,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-10 02:05:04,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:04,455 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:04,455 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:04,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:04,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1040035417, now seen corresponding path program 1 times [2019-09-10 02:05:04,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:04,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:04,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:05:04,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:04,461 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:04,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:04,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:05:04,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:05:04,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:05:04,550 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:05:04,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:05:04,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:05:04,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:05:04,555 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 6 states. [2019-09-10 02:05:04,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:04,633 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2019-09-10 02:05:04,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:05:04,634 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-09-10 02:05:04,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:04,635 INFO L225 Difference]: With dead ends: 33 [2019-09-10 02:05:04,636 INFO L226 Difference]: Without dead ends: 33 [2019-09-10 02:05:04,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:05:04,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-10 02:05:04,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2019-09-10 02:05:04,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-10 02:05:04,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-09-10 02:05:04,649 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 17 [2019-09-10 02:05:04,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:04,649 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-09-10 02:05:04,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:05:04,650 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-09-10 02:05:04,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-10 02:05:04,652 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:04,653 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:04,653 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:04,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:04,654 INFO L82 PathProgramCache]: Analyzing trace with hash 349768240, now seen corresponding path program 1 times [2019-09-10 02:05:04,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:04,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:04,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:05:04,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:04,657 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:04,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:04,816 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:05:04,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:04,817 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:04,819 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2019-09-10 02:05:04,824 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [12], [19], [25], [32], [34], [38], [47], [49], [54], [57], [59], [62], [64], [65], [66], [67], [69], [70] [2019-09-10 02:05:04,873 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:05:04,873 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:05:05,123 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 02:05:05,126 INFO L272 AbstractInterpreter]: Visited 21 different actions 109 times. Merged at 6 different actions 35 times. Widened at 2 different actions 7 times. Performed 198 root evaluator evaluations with a maximum evaluation depth of 6. Performed 198 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 6 fixpoints after 2 different actions. Largest state had 12 variables. [2019-09-10 02:05:05,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:05,132 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 02:05:05,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:05,133 INFO L193 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 [2019-09-10 02:05:05,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:05:05,152 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:05:05,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:05,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 02:05:05,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:05,341 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:05:05,341 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:05,415 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:05:05,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:05,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2019-09-10 02:05:05,420 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:05,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 02:05:05,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 02:05:05,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-09-10 02:05:05,422 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 14 states. [2019-09-10 02:05:05,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:05,630 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2019-09-10 02:05:05,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:05:05,631 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2019-09-10 02:05:05,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:05,634 INFO L225 Difference]: With dead ends: 42 [2019-09-10 02:05:05,634 INFO L226 Difference]: Without dead ends: 37 [2019-09-10 02:05:05,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2019-09-10 02:05:05,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-10 02:05:05,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2019-09-10 02:05:05,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-10 02:05:05,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-09-10 02:05:05,649 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 24 [2019-09-10 02:05:05,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:05,649 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-09-10 02:05:05,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 02:05:05,649 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-09-10 02:05:05,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-10 02:05:05,650 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:05,651 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:05,651 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:05,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:05,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1141561007, now seen corresponding path program 1 times [2019-09-10 02:05:05,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:05,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:05,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:05:05,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:05,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:05,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:05,773 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:05:05,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:05,774 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:05,775 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2019-09-10 02:05:05,775 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [12], [19], [21], [25], [32], [38], [47], [49], [54], [57], [59], [62], [64], [65], [66], [67], [69], [70] [2019-09-10 02:05:05,778 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:05:05,778 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:05:05,882 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 02:05:05,883 INFO L272 AbstractInterpreter]: Visited 21 different actions 119 times. Merged at 8 different actions 45 times. Widened at 3 different actions 8 times. Performed 214 root evaluator evaluations with a maximum evaluation depth of 6. Performed 214 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 6 fixpoints after 2 different actions. Largest state had 12 variables. [2019-09-10 02:05:05,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:05,883 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 02:05:05,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:05,884 INFO L193 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) [2019-09-10 02:05:05,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:05:05,901 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:05:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:05,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 02:05:05,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:06,004 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:05:06,004 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:06,057 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:05:06,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:06,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2019-09-10 02:05:06,061 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:06,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 02:05:06,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 02:05:06,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:05:06,062 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 13 states. [2019-09-10 02:05:06,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:06,239 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2019-09-10 02:05:06,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:05:06,240 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-09-10 02:05:06,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:06,242 INFO L225 Difference]: With dead ends: 52 [2019-09-10 02:05:06,242 INFO L226 Difference]: Without dead ends: 47 [2019-09-10 02:05:06,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2019-09-10 02:05:06,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-10 02:05:06,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2019-09-10 02:05:06,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-10 02:05:06,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-09-10 02:05:06,249 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 24 [2019-09-10 02:05:06,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:06,250 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-09-10 02:05:06,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 02:05:06,250 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-09-10 02:05:06,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-10 02:05:06,251 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:06,251 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:06,252 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:06,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:06,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1152042552, now seen corresponding path program 2 times [2019-09-10 02:05:06,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:06,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:06,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:05:06,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:06,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:06,334 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:05:06,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:06,334 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:06,335 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:06,335 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:06,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:06,335 INFO L193 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) [2019-09-10 02:05:06,354 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:05:06,355 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:05:06,370 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-10 02:05:06,371 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:05:06,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-10 02:05:06,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:06,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:05:06,405 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:05:06,405 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:06,450 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:05:06,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:06,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2019-09-10 02:05:06,454 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:06,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:05:06,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:05:06,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:05:06,455 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 9 states. [2019-09-10 02:05:06,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:06,539 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2019-09-10 02:05:06,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:05:06,540 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-09-10 02:05:06,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:06,541 INFO L225 Difference]: With dead ends: 43 [2019-09-10 02:05:06,541 INFO L226 Difference]: Without dead ends: 43 [2019-09-10 02:05:06,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:05:06,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-10 02:05:06,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2019-09-10 02:05:06,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-10 02:05:06,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-09-10 02:05:06,551 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 25 [2019-09-10 02:05:06,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:06,552 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-09-10 02:05:06,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:05:06,552 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-09-10 02:05:06,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-10 02:05:06,559 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:06,559 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:06,559 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:06,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:06,560 INFO L82 PathProgramCache]: Analyzing trace with hash -805836049, now seen corresponding path program 3 times [2019-09-10 02:05:06,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:06,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:06,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:05:06,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:06,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:06,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:06,686 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 02:05:06,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:06,687 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:06,687 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:06,687 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:06,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:06,687 INFO L193 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 [2019-09-10 02:05:06,701 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:05:06,701 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:05:06,721 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:05:06,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:05:06,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-10 02:05:06,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:06,843 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 02:05:06,843 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:06,905 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 02:05:06,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:06,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 18 [2019-09-10 02:05:06,911 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:06,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 02:05:06,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 02:05:06,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2019-09-10 02:05:06,912 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 18 states. [2019-09-10 02:05:07,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:07,122 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2019-09-10 02:05:07,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:05:07,122 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2019-09-10 02:05:07,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:07,123 INFO L225 Difference]: With dead ends: 59 [2019-09-10 02:05:07,123 INFO L226 Difference]: Without dead ends: 51 [2019-09-10 02:05:07,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 50 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2019-09-10 02:05:07,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-10 02:05:07,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2019-09-10 02:05:07,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-10 02:05:07,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-09-10 02:05:07,130 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 32 [2019-09-10 02:05:07,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:07,130 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-09-10 02:05:07,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 02:05:07,131 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-09-10 02:05:07,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-10 02:05:07,132 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:07,132 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:07,132 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:07,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:07,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1418774638, now seen corresponding path program 1 times [2019-09-10 02:05:07,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:07,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:07,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:05:07,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:07,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:07,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:07,215 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 02:05:07,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:07,215 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:07,216 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2019-09-10 02:05:07,216 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [12], [19], [21], [25], [32], [34], [38], [47], [49], [54], [57], [59], [62], [64], [65], [66], [67], [69], [70] [2019-09-10 02:05:07,218 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:05:07,218 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:05:07,274 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 02:05:07,274 INFO L272 AbstractInterpreter]: Visited 22 different actions 146 times. Merged at 9 different actions 53 times. Widened at 4 different actions 12 times. Performed 308 root evaluator evaluations with a maximum evaluation depth of 6. Performed 308 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 13 fixpoints after 4 different actions. Largest state had 14 variables. [2019-09-10 02:05:07,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:07,275 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 02:05:07,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:07,275 INFO L193 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 [2019-09-10 02:05:07,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:05:07,297 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:05:07,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:07,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-10 02:05:07,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:07,414 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 02:05:07,414 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:07,489 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 02:05:07,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:07,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2019-09-10 02:05:07,493 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:07,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 02:05:07,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 02:05:07,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2019-09-10 02:05:07,494 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 17 states. [2019-09-10 02:05:07,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:07,709 INFO L93 Difference]: Finished difference Result 70 states and 84 transitions. [2019-09-10 02:05:07,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:05:07,709 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-09-10 02:05:07,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:07,711 INFO L225 Difference]: With dead ends: 70 [2019-09-10 02:05:07,711 INFO L226 Difference]: Without dead ends: 62 [2019-09-10 02:05:07,712 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 51 SyntacticMatches, 8 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=531, Unknown=0, NotChecked=0, Total=702 [2019-09-10 02:05:07,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-10 02:05:07,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 40. [2019-09-10 02:05:07,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-10 02:05:07,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-09-10 02:05:07,718 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 32 [2019-09-10 02:05:07,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:07,718 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-09-10 02:05:07,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 02:05:07,718 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-09-10 02:05:07,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-10 02:05:07,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:07,720 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:07,720 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:07,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:07,720 INFO L82 PathProgramCache]: Analyzing trace with hash -726221041, now seen corresponding path program 2 times [2019-09-10 02:05:07,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:07,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:07,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:05:07,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:07,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:07,819 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 02:05:07,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:07,820 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:07,820 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:07,820 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:07,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:07,820 INFO L193 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) [2019-09-10 02:05:07,841 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:05:07,841 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:05:07,858 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-10 02:05:07,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:05:07,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-10 02:05:07,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:07,949 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 02:05:07,949 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:08,009 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 02:05:08,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:08,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 16 [2019-09-10 02:05:08,013 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:08,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 02:05:08,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 02:05:08,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:05:08,014 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 16 states. [2019-09-10 02:05:08,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:08,211 INFO L93 Difference]: Finished difference Result 83 states and 102 transitions. [2019-09-10 02:05:08,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 02:05:08,211 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2019-09-10 02:05:08,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:08,213 INFO L225 Difference]: With dead ends: 83 [2019-09-10 02:05:08,213 INFO L226 Difference]: Without dead ends: 75 [2019-09-10 02:05:08,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 52 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2019-09-10 02:05:08,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-10 02:05:08,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 42. [2019-09-10 02:05:08,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-10 02:05:08,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2019-09-10 02:05:08,220 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 32 [2019-09-10 02:05:08,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:08,221 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2019-09-10 02:05:08,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 02:05:08,221 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2019-09-10 02:05:08,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-10 02:05:08,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:08,222 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:08,222 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:08,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:08,223 INFO L82 PathProgramCache]: Analyzing trace with hash -747175289, now seen corresponding path program 4 times [2019-09-10 02:05:08,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:08,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:08,224 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:05:08,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:08,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:08,279 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 02:05:08,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:08,280 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:08,280 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:08,280 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:08,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:08,280 INFO L193 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 [2019-09-10 02:05:08,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:05:08,295 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:05:08,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:08,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-10 02:05:08,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:08,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:05:08,344 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 02:05:08,344 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:08,385 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 02:05:08,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:08,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2019-09-10 02:05:08,389 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:08,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:05:08,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:05:08,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:05:08,391 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 10 states. [2019-09-10 02:05:08,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:08,478 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2019-09-10 02:05:08,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:05:08,478 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2019-09-10 02:05:08,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:08,479 INFO L225 Difference]: With dead ends: 53 [2019-09-10 02:05:08,479 INFO L226 Difference]: Without dead ends: 53 [2019-09-10 02:05:08,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:05:08,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-10 02:05:08,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2019-09-10 02:05:08,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-10 02:05:08,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2019-09-10 02:05:08,490 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 33 [2019-09-10 02:05:08,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:08,490 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2019-09-10 02:05:08,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:05:08,491 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2019-09-10 02:05:08,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-10 02:05:08,493 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:08,494 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:08,494 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:08,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:08,495 INFO L82 PathProgramCache]: Analyzing trace with hash -322593456, now seen corresponding path program 5 times [2019-09-10 02:05:08,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:08,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:08,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:05:08,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:08,496 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:08,608 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 02:05:08,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:08,609 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:08,609 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:08,609 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:08,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:08,609 INFO L193 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 [2019-09-10 02:05:08,631 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:05:08,631 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:05:08,648 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-10 02:05:08,648 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:05:08,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-10 02:05:08,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:08,816 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 02:05:08,816 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:08,895 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 02:05:08,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:08,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 22 [2019-09-10 02:05:08,900 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:08,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 02:05:08,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 02:05:08,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2019-09-10 02:05:08,902 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 22 states. [2019-09-10 02:05:09,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:09,167 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2019-09-10 02:05:09,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 02:05:09,169 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2019-09-10 02:05:09,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:09,170 INFO L225 Difference]: With dead ends: 76 [2019-09-10 02:05:09,170 INFO L226 Difference]: Without dead ends: 65 [2019-09-10 02:05:09,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 62 SyntacticMatches, 10 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=233, Invalid=759, Unknown=0, NotChecked=0, Total=992 [2019-09-10 02:05:09,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-10 02:05:09,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 50. [2019-09-10 02:05:09,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-10 02:05:09,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2019-09-10 02:05:09,177 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 40 [2019-09-10 02:05:09,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:09,177 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2019-09-10 02:05:09,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 02:05:09,177 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2019-09-10 02:05:09,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-10 02:05:09,178 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:09,178 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:09,179 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:09,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:09,179 INFO L82 PathProgramCache]: Analyzing trace with hash -81490993, now seen corresponding path program 2 times [2019-09-10 02:05:09,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:09,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:09,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:05:09,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:09,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:09,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:09,335 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 02:05:09,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:09,336 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:09,336 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:09,336 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:09,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:09,336 INFO L193 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 [2019-09-10 02:05:09,347 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:05:09,347 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:05:09,369 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-10 02:05:09,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:05:09,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-10 02:05:09,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:09,562 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 02:05:09,563 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:09,632 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 02:05:09,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:09,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2019-09-10 02:05:09,636 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:09,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 02:05:09,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 02:05:09,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2019-09-10 02:05:09,638 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 21 states. [2019-09-10 02:05:09,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:09,927 INFO L93 Difference]: Finished difference Result 91 states and 109 transitions. [2019-09-10 02:05:09,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 02:05:09,928 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-09-10 02:05:09,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:09,930 INFO L225 Difference]: With dead ends: 91 [2019-09-10 02:05:09,930 INFO L226 Difference]: Without dead ends: 80 [2019-09-10 02:05:09,931 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 63 SyntacticMatches, 10 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=869, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 02:05:09,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-10 02:05:09,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 50. [2019-09-10 02:05:09,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-10 02:05:09,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2019-09-10 02:05:09,937 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 40 [2019-09-10 02:05:09,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:09,937 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2019-09-10 02:05:09,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 02:05:09,938 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2019-09-10 02:05:09,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-10 02:05:09,938 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:09,939 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:09,939 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:09,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:09,939 INFO L82 PathProgramCache]: Analyzing trace with hash -2013376144, now seen corresponding path program 3 times [2019-09-10 02:05:09,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:09,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:09,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:05:09,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:09,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:10,040 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 02:05:10,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:10,040 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:10,041 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:10,041 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:10,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:10,041 INFO L193 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) [2019-09-10 02:05:10,058 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:05:10,059 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:05:10,078 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:05:10,078 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:05:10,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-10 02:05:10,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:10,197 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 02:05:10,198 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:10,283 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 02:05:10,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:10,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2019-09-10 02:05:10,288 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:10,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 02:05:10,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 02:05:10,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2019-09-10 02:05:10,291 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 20 states. [2019-09-10 02:05:10,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:10,594 INFO L93 Difference]: Finished difference Result 105 states and 128 transitions. [2019-09-10 02:05:10,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 02:05:10,594 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2019-09-10 02:05:10,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:10,596 INFO L225 Difference]: With dead ends: 105 [2019-09-10 02:05:10,596 INFO L226 Difference]: Without dead ends: 94 [2019-09-10 02:05:10,596 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 64 SyntacticMatches, 10 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=869, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 02:05:10,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-10 02:05:10,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 50. [2019-09-10 02:05:10,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-10 02:05:10,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2019-09-10 02:05:10,613 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 40 [2019-09-10 02:05:10,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:10,614 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2019-09-10 02:05:10,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 02:05:10,614 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2019-09-10 02:05:10,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-10 02:05:10,615 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:10,615 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:10,615 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:10,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:10,620 INFO L82 PathProgramCache]: Analyzing trace with hash 972346287, now seen corresponding path program 3 times [2019-09-10 02:05:10,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:10,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:10,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:05:10,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:10,622 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:10,747 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 02:05:10,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:10,748 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:10,748 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:10,748 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:10,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:10,748 INFO L193 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) [2019-09-10 02:05:10,780 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:05:10,781 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:05:10,796 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:05:10,797 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:05:10,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-10 02:05:10,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:10,931 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 02:05:10,931 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:10,996 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 02:05:10,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:11,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 19 [2019-09-10 02:05:11,000 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:11,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 02:05:11,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 02:05:11,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2019-09-10 02:05:11,001 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 19 states. [2019-09-10 02:05:11,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:11,261 INFO L93 Difference]: Finished difference Result 121 states and 150 transitions. [2019-09-10 02:05:11,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 02:05:11,261 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 40 [2019-09-10 02:05:11,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:11,263 INFO L225 Difference]: With dead ends: 121 [2019-09-10 02:05:11,263 INFO L226 Difference]: Without dead ends: 110 [2019-09-10 02:05:11,264 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 65 SyntacticMatches, 10 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=233, Invalid=759, Unknown=0, NotChecked=0, Total=992 [2019-09-10 02:05:11,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-10 02:05:11,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 52. [2019-09-10 02:05:11,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-10 02:05:11,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2019-09-10 02:05:11,272 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 40 [2019-09-10 02:05:11,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:11,272 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2019-09-10 02:05:11,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 02:05:11,272 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2019-09-10 02:05:11,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-10 02:05:11,273 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:11,273 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:11,273 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:11,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:11,274 INFO L82 PathProgramCache]: Analyzing trace with hash 803183848, now seen corresponding path program 6 times [2019-09-10 02:05:11,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:11,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:11,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:05:11,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:11,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:11,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:11,324 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 02:05:11,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:11,325 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:11,325 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:11,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:11,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:11,325 INFO L193 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) [2019-09-10 02:05:11,352 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:05:11,352 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:05:11,369 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:05:11,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:05:11,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 02:05:11,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:11,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:05:11,395 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 02:05:11,395 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:11,442 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 02:05:11,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:11,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2019-09-10 02:05:11,445 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:11,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 02:05:11,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 02:05:11,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:05:11,446 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 11 states. [2019-09-10 02:05:11,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:11,528 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2019-09-10 02:05:11,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 02:05:11,529 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2019-09-10 02:05:11,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:11,530 INFO L225 Difference]: With dead ends: 63 [2019-09-10 02:05:11,530 INFO L226 Difference]: Without dead ends: 63 [2019-09-10 02:05:11,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 76 SyntacticMatches, 8 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:05:11,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-10 02:05:11,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2019-09-10 02:05:11,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-10 02:05:11,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2019-09-10 02:05:11,535 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 41 [2019-09-10 02:05:11,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:11,535 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2019-09-10 02:05:11,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 02:05:11,536 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2019-09-10 02:05:11,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-10 02:05:11,536 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:11,537 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:11,537 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:11,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:11,537 INFO L82 PathProgramCache]: Analyzing trace with hash 481149903, now seen corresponding path program 7 times [2019-09-10 02:05:11,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:11,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:11,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:05:11,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:11,538 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:11,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:11,659 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 02:05:11,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:11,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:11,660 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:11,660 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:11,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:11,660 INFO L193 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 [2019-09-10 02:05:11,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:05:11,671 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:05:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:11,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 02:05:11,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:11,882 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 02:05:11,882 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:11,973 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 02:05:11,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:11,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 26 [2019-09-10 02:05:11,976 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:11,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 02:05:11,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 02:05:11,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-09-10 02:05:11,978 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand 26 states. [2019-09-10 02:05:12,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:12,293 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2019-09-10 02:05:12,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 02:05:12,295 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2019-09-10 02:05:12,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:12,296 INFO L225 Difference]: With dead ends: 93 [2019-09-10 02:05:12,296 INFO L226 Difference]: Without dead ends: 79 [2019-09-10 02:05:12,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 74 SyntacticMatches, 12 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=1091, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 02:05:12,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-09-10 02:05:12,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 60. [2019-09-10 02:05:12,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-10 02:05:12,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2019-09-10 02:05:12,302 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 48 [2019-09-10 02:05:12,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:12,302 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2019-09-10 02:05:12,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 02:05:12,302 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2019-09-10 02:05:12,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-10 02:05:12,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:12,303 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:12,303 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:12,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:12,304 INFO L82 PathProgramCache]: Analyzing trace with hash 439468878, now seen corresponding path program 4 times [2019-09-10 02:05:12,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:12,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:12,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:05:12,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:12,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:12,449 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 34 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 02:05:12,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:12,449 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:12,449 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:12,449 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:12,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:12,449 INFO L193 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 [2019-09-10 02:05:12,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:05:12,459 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:05:12,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:12,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 02:05:12,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:12,642 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 34 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 02:05:12,642 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:12,719 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 34 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 02:05:12,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:12,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 25 [2019-09-10 02:05:12,722 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:12,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 02:05:12,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 02:05:12,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2019-09-10 02:05:12,723 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 25 states. [2019-09-10 02:05:13,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:13,182 INFO L93 Difference]: Finished difference Result 112 states and 134 transitions. [2019-09-10 02:05:13,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 02:05:13,185 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2019-09-10 02:05:13,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:13,186 INFO L225 Difference]: With dead ends: 112 [2019-09-10 02:05:13,186 INFO L226 Difference]: Without dead ends: 98 [2019-09-10 02:05:13,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 75 SyntacticMatches, 12 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=351, Invalid=1289, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 02:05:13,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-10 02:05:13,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 60. [2019-09-10 02:05:13,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-10 02:05:13,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2019-09-10 02:05:13,192 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 48 [2019-09-10 02:05:13,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:13,192 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2019-09-10 02:05:13,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 02:05:13,193 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2019-09-10 02:05:13,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-10 02:05:13,193 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:13,193 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:13,194 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:13,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:13,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1501538321, now seen corresponding path program 5 times [2019-09-10 02:05:13,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:13,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:13,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:05:13,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:13,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:13,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:13,312 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 34 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 02:05:13,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:13,312 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:13,313 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:13,313 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:13,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:13,313 INFO L193 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) [2019-09-10 02:05:13,332 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:05:13,333 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:05:13,357 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-10 02:05:13,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:05:13,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 02:05:13,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:13,573 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 34 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 02:05:13,574 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:13,670 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 34 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 02:05:13,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:13,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 24 [2019-09-10 02:05:13,674 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:13,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 02:05:13,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 02:05:13,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2019-09-10 02:05:13,677 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 24 states. [2019-09-10 02:05:14,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:14,057 INFO L93 Difference]: Finished difference Result 130 states and 158 transitions. [2019-09-10 02:05:14,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 02:05:14,058 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 48 [2019-09-10 02:05:14,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:14,059 INFO L225 Difference]: With dead ends: 130 [2019-09-10 02:05:14,060 INFO L226 Difference]: Without dead ends: 116 [2019-09-10 02:05:14,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 76 SyntacticMatches, 12 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=364, Invalid=1358, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 02:05:14,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-10 02:05:14,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 60. [2019-09-10 02:05:14,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-10 02:05:14,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2019-09-10 02:05:14,066 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 48 [2019-09-10 02:05:14,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:14,067 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2019-09-10 02:05:14,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 02:05:14,067 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2019-09-10 02:05:14,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-10 02:05:14,068 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:14,068 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:14,068 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:14,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:14,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1068247854, now seen corresponding path program 6 times [2019-09-10 02:05:14,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:14,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:14,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:05:14,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:14,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:14,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:14,181 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 34 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 02:05:14,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:14,181 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:14,182 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:14,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:14,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:14,182 INFO L193 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 [2019-09-10 02:05:14,204 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:05:14,205 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:05:14,223 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:05:14,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:05:14,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 02:05:14,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:14,355 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 34 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 02:05:14,356 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:14,435 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 34 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 02:05:14,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:14,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2019-09-10 02:05:14,438 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:14,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 02:05:14,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 02:05:14,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2019-09-10 02:05:14,439 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 23 states. [2019-09-10 02:05:14,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:14,870 INFO L93 Difference]: Finished difference Result 147 states and 181 transitions. [2019-09-10 02:05:14,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 02:05:14,872 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2019-09-10 02:05:14,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:14,874 INFO L225 Difference]: With dead ends: 147 [2019-09-10 02:05:14,874 INFO L226 Difference]: Without dead ends: 133 [2019-09-10 02:05:14,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 77 SyntacticMatches, 12 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=351, Invalid=1289, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 02:05:14,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-10 02:05:14,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 60. [2019-09-10 02:05:14,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-10 02:05:14,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2019-09-10 02:05:14,881 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 48 [2019-09-10 02:05:14,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:14,881 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2019-09-10 02:05:14,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 02:05:14,882 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2019-09-10 02:05:14,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-10 02:05:14,882 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:14,882 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:14,883 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:14,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:14,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1982428175, now seen corresponding path program 4 times [2019-09-10 02:05:14,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:14,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:14,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:05:14,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:14,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:14,992 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 02:05:14,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:14,993 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:14,993 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:14,993 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:14,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:14,993 INFO L193 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 [2019-09-10 02:05:15,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:05:15,013 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:05:15,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:15,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 02:05:15,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:15,153 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 02:05:15,154 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:15,234 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 02:05:15,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:15,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 22 [2019-09-10 02:05:15,237 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:15,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 02:05:15,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 02:05:15,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2019-09-10 02:05:15,239 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 22 states. [2019-09-10 02:05:15,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:15,620 INFO L93 Difference]: Finished difference Result 166 states and 207 transitions. [2019-09-10 02:05:15,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 02:05:15,620 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2019-09-10 02:05:15,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:15,622 INFO L225 Difference]: With dead ends: 166 [2019-09-10 02:05:15,622 INFO L226 Difference]: Without dead ends: 152 [2019-09-10 02:05:15,623 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 78 SyntacticMatches, 12 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=1091, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 02:05:15,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-10 02:05:15,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 62. [2019-09-10 02:05:15,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-10 02:05:15,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2019-09-10 02:05:15,629 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 48 [2019-09-10 02:05:15,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:15,630 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2019-09-10 02:05:15,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 02:05:15,630 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2019-09-10 02:05:15,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-10 02:05:15,631 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:15,631 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:15,631 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:15,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:15,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1778035559, now seen corresponding path program 8 times [2019-09-10 02:05:15,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:15,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:15,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:05:15,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:15,633 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:15,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:15,696 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 02:05:15,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:15,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:15,697 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:15,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:15,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:15,697 INFO L193 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 [2019-09-10 02:05:15,707 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:05:15,707 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:05:15,727 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-10 02:05:15,727 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:05:15,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 02:05:15,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:15,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:05:15,753 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 02:05:15,754 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:15,814 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 02:05:15,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:15,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 12 [2019-09-10 02:05:15,817 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:15,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 02:05:15,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 02:05:15,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:05:15,818 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand 12 states. [2019-09-10 02:05:15,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:15,927 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2019-09-10 02:05:15,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:05:15,927 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 49 [2019-09-10 02:05:15,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:15,929 INFO L225 Difference]: With dead ends: 73 [2019-09-10 02:05:15,929 INFO L226 Difference]: Without dead ends: 73 [2019-09-10 02:05:15,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 91 SyntacticMatches, 10 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:05:15,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-09-10 02:05:15,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2019-09-10 02:05:15,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-10 02:05:15,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2019-09-10 02:05:15,933 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 49 [2019-09-10 02:05:15,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:15,934 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2019-09-10 02:05:15,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 02:05:15,934 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2019-09-10 02:05:15,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 02:05:15,934 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:15,935 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:15,935 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:15,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:15,935 INFO L82 PathProgramCache]: Analyzing trace with hash 928790640, now seen corresponding path program 9 times [2019-09-10 02:05:15,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:15,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:15,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:05:15,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:15,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:15,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:16,077 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 02:05:16,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:16,077 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:16,077 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:16,077 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:16,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:16,077 INFO L193 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 [2019-09-10 02:05:16,087 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:05:16,088 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:05:16,107 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:05:16,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:05:16,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 02:05:16,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:16,366 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 02:05:16,366 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:16,527 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 02:05:16,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:16,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 30 [2019-09-10 02:05:16,531 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:16,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-10 02:05:16,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-10 02:05:16,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2019-09-10 02:05:16,533 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand 30 states. [2019-09-10 02:05:16,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:16,879 INFO L93 Difference]: Finished difference Result 110 states and 129 transitions. [2019-09-10 02:05:16,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 02:05:16,880 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2019-09-10 02:05:16,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:16,881 INFO L225 Difference]: With dead ends: 110 [2019-09-10 02:05:16,881 INFO L226 Difference]: Without dead ends: 93 [2019-09-10 02:05:16,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 86 SyntacticMatches, 14 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=409, Invalid=1483, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 02:05:16,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-10 02:05:16,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 70. [2019-09-10 02:05:16,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-10 02:05:16,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2019-09-10 02:05:16,886 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 56 [2019-09-10 02:05:16,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:16,886 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2019-09-10 02:05:16,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-10 02:05:16,886 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2019-09-10 02:05:16,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 02:05:16,887 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:16,887 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:16,888 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:16,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:16,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1167832849, now seen corresponding path program 7 times [2019-09-10 02:05:16,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:16,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:16,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:05:16,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:16,889 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:16,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:17,028 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 50 proven. 11 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 02:05:17,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:17,028 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:17,029 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:17,029 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:17,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:17,029 INFO L193 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) [2019-09-10 02:05:17,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:05:17,052 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:05:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:17,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 02:05:17,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:17,294 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 50 proven. 11 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 02:05:17,294 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:17,385 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 50 proven. 11 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 02:05:17,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:17,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 29 [2019-09-10 02:05:17,388 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:17,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-10 02:05:17,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-10 02:05:17,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=645, Unknown=0, NotChecked=0, Total=812 [2019-09-10 02:05:17,389 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 29 states. [2019-09-10 02:05:17,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:17,839 INFO L93 Difference]: Finished difference Result 133 states and 159 transitions. [2019-09-10 02:05:17,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 02:05:17,842 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2019-09-10 02:05:17,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:17,844 INFO L225 Difference]: With dead ends: 133 [2019-09-10 02:05:17,845 INFO L226 Difference]: Without dead ends: 116 [2019-09-10 02:05:17,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 87 SyntacticMatches, 14 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=465, Invalid=1791, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 02:05:17,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-10 02:05:17,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 70. [2019-09-10 02:05:17,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-10 02:05:17,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2019-09-10 02:05:17,850 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 56 [2019-09-10 02:05:17,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:17,850 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2019-09-10 02:05:17,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-10 02:05:17,850 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2019-09-10 02:05:17,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 02:05:17,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:17,851 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:17,851 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:17,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:17,852 INFO L82 PathProgramCache]: Analyzing trace with hash -404181872, now seen corresponding path program 8 times [2019-09-10 02:05:17,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:17,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:17,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:05:17,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:17,854 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:17,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:17,978 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 50 proven. 9 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 02:05:17,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:17,978 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:17,978 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:17,978 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:17,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:17,979 INFO L193 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 [2019-09-10 02:05:17,993 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:05:17,994 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:05:18,016 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-10 02:05:18,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:05:18,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 02:05:18,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:18,231 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 50 proven. 9 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 02:05:18,231 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:18,330 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 50 proven. 9 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 02:05:18,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:18,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 28 [2019-09-10 02:05:18,333 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:18,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 02:05:18,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 02:05:18,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2019-09-10 02:05:18,335 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 28 states. [2019-09-10 02:05:18,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:18,903 INFO L93 Difference]: Finished difference Result 155 states and 188 transitions. [2019-09-10 02:05:18,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 02:05:18,903 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 56 [2019-09-10 02:05:18,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:18,905 INFO L225 Difference]: With dead ends: 155 [2019-09-10 02:05:18,905 INFO L226 Difference]: Without dead ends: 138 [2019-09-10 02:05:18,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 88 SyntacticMatches, 14 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 873 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=1954, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 02:05:18,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-09-10 02:05:18,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 70. [2019-09-10 02:05:18,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-10 02:05:18,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2019-09-10 02:05:18,916 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 56 [2019-09-10 02:05:18,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:18,916 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2019-09-10 02:05:18,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 02:05:18,916 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2019-09-10 02:05:18,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 02:05:18,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:18,917 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:18,917 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:18,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:18,918 INFO L82 PathProgramCache]: Analyzing trace with hash 174641359, now seen corresponding path program 9 times [2019-09-10 02:05:18,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:18,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:18,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:05:18,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:18,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:18,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:19,061 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 50 proven. 9 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 02:05:19,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:19,062 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:19,062 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:19,062 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:19,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:19,062 INFO L193 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) [2019-09-10 02:05:19,081 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:05:19,081 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:05:19,098 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:05:19,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:05:19,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 02:05:19,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:19,259 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 50 proven. 9 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 02:05:19,259 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:19,446 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 50 proven. 9 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 02:05:19,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:19,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 27 [2019-09-10 02:05:19,449 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:19,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-10 02:05:19,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-10 02:05:19,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2019-09-10 02:05:19,457 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 27 states. [2019-09-10 02:05:19,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:19,991 INFO L93 Difference]: Finished difference Result 176 states and 216 transitions. [2019-09-10 02:05:19,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 02:05:19,991 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 56 [2019-09-10 02:05:19,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:19,993 INFO L225 Difference]: With dead ends: 176 [2019-09-10 02:05:19,993 INFO L226 Difference]: Without dead ends: 159 [2019-09-10 02:05:19,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 89 SyntacticMatches, 14 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 849 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=1954, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 02:05:19,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-09-10 02:05:19,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 70. [2019-09-10 02:05:20,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-10 02:05:20,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2019-09-10 02:05:20,000 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 56 [2019-09-10 02:05:20,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:20,001 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2019-09-10 02:05:20,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-10 02:05:20,001 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2019-09-10 02:05:20,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 02:05:20,002 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:20,002 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:20,002 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:20,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:20,002 INFO L82 PathProgramCache]: Analyzing trace with hash 54765744, now seen corresponding path program 10 times [2019-09-10 02:05:20,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:20,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:20,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:05:20,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:20,003 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:20,147 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 50 proven. 11 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 02:05:20,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:20,147 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:20,147 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:20,147 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:20,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:20,148 INFO L193 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) [2019-09-10 02:05:20,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:05:20,166 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:05:20,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:20,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 02:05:20,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:20,383 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 50 proven. 11 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 02:05:20,383 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:20,498 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 50 proven. 11 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 02:05:20,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:20,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 26 [2019-09-10 02:05:20,503 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:20,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 02:05:20,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 02:05:20,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2019-09-10 02:05:20,504 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 26 states. [2019-09-10 02:05:20,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:20,981 INFO L93 Difference]: Finished difference Result 196 states and 243 transitions. [2019-09-10 02:05:20,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 02:05:20,982 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2019-09-10 02:05:20,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:20,983 INFO L225 Difference]: With dead ends: 196 [2019-09-10 02:05:20,984 INFO L226 Difference]: Without dead ends: 179 [2019-09-10 02:05:20,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 90 SyntacticMatches, 14 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=465, Invalid=1791, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 02:05:20,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-10 02:05:20,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 70. [2019-09-10 02:05:20,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-10 02:05:20,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2019-09-10 02:05:20,993 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 56 [2019-09-10 02:05:20,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:20,993 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2019-09-10 02:05:20,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 02:05:20,993 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2019-09-10 02:05:20,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 02:05:20,995 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:20,995 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:20,995 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:20,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:20,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1750216529, now seen corresponding path program 5 times [2019-09-10 02:05:20,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:20,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:20,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:05:20,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:20,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:21,142 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 02:05:21,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:21,142 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:21,142 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:21,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:21,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:21,143 INFO L193 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 [2019-09-10 02:05:21,156 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:05:21,157 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:05:21,175 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-10 02:05:21,175 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:05:21,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 02:05:21,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:21,316 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 02:05:21,316 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:21,428 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 02:05:21,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:21,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 25 [2019-09-10 02:05:21,431 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:21,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 02:05:21,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 02:05:21,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2019-09-10 02:05:21,432 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 25 states. [2019-09-10 02:05:21,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:21,811 INFO L93 Difference]: Finished difference Result 218 states and 273 transitions. [2019-09-10 02:05:21,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 02:05:21,818 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 56 [2019-09-10 02:05:21,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:21,819 INFO L225 Difference]: With dead ends: 218 [2019-09-10 02:05:21,819 INFO L226 Difference]: Without dead ends: 201 [2019-09-10 02:05:21,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 91 SyntacticMatches, 14 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=409, Invalid=1483, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 02:05:21,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-09-10 02:05:21,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 72. [2019-09-10 02:05:21,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-10 02:05:21,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2019-09-10 02:05:21,827 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 56 [2019-09-10 02:05:21,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:21,827 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2019-09-10 02:05:21,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 02:05:21,827 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2019-09-10 02:05:21,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 02:05:21,828 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:21,828 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:21,828 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:21,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:21,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1098123272, now seen corresponding path program 10 times [2019-09-10 02:05:21,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:21,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:21,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:05:21,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:21,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:21,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:21,893 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 31 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 02:05:21,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:21,894 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:21,894 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:21,894 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:21,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:21,894 INFO L193 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 [2019-09-10 02:05:21,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:05:21,905 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:05:21,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:21,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-10 02:05:21,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:21,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:05:21,950 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 31 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 02:05:21,950 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:22,012 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 31 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 02:05:22,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:22,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2019-09-10 02:05:22,015 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:22,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 02:05:22,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 02:05:22,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:05:22,016 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand 13 states. [2019-09-10 02:05:22,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:22,119 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2019-09-10 02:05:22,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 02:05:22,119 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-09-10 02:05:22,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:22,120 INFO L225 Difference]: With dead ends: 83 [2019-09-10 02:05:22,120 INFO L226 Difference]: Without dead ends: 83 [2019-09-10 02:05:22,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 106 SyntacticMatches, 12 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-09-10 02:05:22,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-09-10 02:05:22,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2019-09-10 02:05:22,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-10 02:05:22,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2019-09-10 02:05:22,124 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 57 [2019-09-10 02:05:22,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:22,125 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2019-09-10 02:05:22,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 02:05:22,125 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2019-09-10 02:05:22,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 02:05:22,126 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:22,126 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:22,126 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:22,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:22,127 INFO L82 PathProgramCache]: Analyzing trace with hash -159345489, now seen corresponding path program 11 times [2019-09-10 02:05:22,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:22,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:22,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:05:22,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:22,129 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:22,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:22,310 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 69 proven. 21 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-10 02:05:22,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:22,311 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:22,311 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:22,311 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:22,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:22,312 INFO L193 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) [2019-09-10 02:05:22,329 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:05:22,330 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:05:22,356 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-10 02:05:22,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:05:22,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-10 02:05:22,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:22,750 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 69 proven. 21 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-10 02:05:22,750 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:22,909 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 69 proven. 21 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-10 02:05:22,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:22,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 34 [2019-09-10 02:05:22,912 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:22,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-10 02:05:22,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-10 02:05:22,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 02:05:22,914 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 34 states. [2019-09-10 02:05:23,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:23,454 INFO L93 Difference]: Finished difference Result 127 states and 149 transitions. [2019-09-10 02:05:23,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 02:05:23,455 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2019-09-10 02:05:23,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:23,456 INFO L225 Difference]: With dead ends: 127 [2019-09-10 02:05:23,456 INFO L226 Difference]: Without dead ends: 107 [2019-09-10 02:05:23,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 98 SyntacticMatches, 16 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1025 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=515, Invalid=1935, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 02:05:23,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-10 02:05:23,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 80. [2019-09-10 02:05:23,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-10 02:05:23,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2019-09-10 02:05:23,461 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 64 [2019-09-10 02:05:23,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:23,461 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2019-09-10 02:05:23,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-10 02:05:23,462 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2019-09-10 02:05:23,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 02:05:23,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:23,463 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:23,463 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:23,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:23,464 INFO L82 PathProgramCache]: Analyzing trace with hash -966019538, now seen corresponding path program 11 times [2019-09-10 02:05:23,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:23,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:23,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:05:23,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:23,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:23,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:23,655 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 69 proven. 16 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-10 02:05:23,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:23,655 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:23,656 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:23,656 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:23,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:23,656 INFO L193 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) [2019-09-10 02:05:23,670 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:05:23,671 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:05:23,698 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-10 02:05:23,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:05:23,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-10 02:05:23,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:23,964 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 69 proven. 16 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-10 02:05:23,965 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:24,091 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 69 proven. 16 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-10 02:05:24,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:24,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 33 [2019-09-10 02:05:24,094 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:24,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-10 02:05:24,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-10 02:05:24,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=842, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 02:05:24,095 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand 33 states. [2019-09-10 02:05:24,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:24,620 INFO L93 Difference]: Finished difference Result 154 states and 184 transitions. [2019-09-10 02:05:24,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 02:05:24,620 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2019-09-10 02:05:24,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:24,621 INFO L225 Difference]: With dead ends: 154 [2019-09-10 02:05:24,621 INFO L226 Difference]: Without dead ends: 134 [2019-09-10 02:05:24,623 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 99 SyntacticMatches, 16 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1155 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=595, Invalid=2375, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 02:05:24,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-09-10 02:05:24,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 80. [2019-09-10 02:05:24,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-10 02:05:24,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2019-09-10 02:05:24,627 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 64 [2019-09-10 02:05:24,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:24,627 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2019-09-10 02:05:24,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-10 02:05:24,627 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2019-09-10 02:05:24,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 02:05:24,628 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:24,628 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:24,628 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:24,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:24,629 INFO L82 PathProgramCache]: Analyzing trace with hash -437851953, now seen corresponding path program 12 times [2019-09-10 02:05:24,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:24,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:24,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:05:24,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:24,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:24,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:24,783 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 69 proven. 13 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-10 02:05:24,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:24,784 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:24,784 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:24,784 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:24,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:24,785 INFO L193 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 [2019-09-10 02:05:24,793 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:05:24,794 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:05:24,814 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:05:24,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:05:24,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-10 02:05:24,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:25,078 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 69 proven. 13 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-10 02:05:25,078 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:25,229 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 69 proven. 13 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-10 02:05:25,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:25,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 32 [2019-09-10 02:05:25,233 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:25,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-10 02:05:25,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-10 02:05:25,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=795, Unknown=0, NotChecked=0, Total=992 [2019-09-10 02:05:25,235 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand 32 states. [2019-09-10 02:05:25,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:25,906 INFO L93 Difference]: Finished difference Result 180 states and 218 transitions. [2019-09-10 02:05:25,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 02:05:25,913 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 64 [2019-09-10 02:05:25,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:25,914 INFO L225 Difference]: With dead ends: 180 [2019-09-10 02:05:25,914 INFO L226 Difference]: Without dead ends: 160 [2019-09-10 02:05:25,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 100 SyntacticMatches, 16 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1236 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=649, Invalid=2657, Unknown=0, NotChecked=0, Total=3306 [2019-09-10 02:05:25,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-09-10 02:05:25,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 80. [2019-09-10 02:05:25,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-10 02:05:25,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2019-09-10 02:05:25,919 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 64 [2019-09-10 02:05:25,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:25,919 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2019-09-10 02:05:25,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-10 02:05:25,920 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2019-09-10 02:05:25,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 02:05:25,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:25,920 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:25,921 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:25,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:25,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1529192946, now seen corresponding path program 13 times [2019-09-10 02:05:25,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:25,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:25,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:05:25,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:25,922 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:26,102 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 69 proven. 12 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-10 02:05:26,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:26,103 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:26,103 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:26,104 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:26,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:26,105 INFO L193 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) [2019-09-10 02:05:26,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:05:26,130 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:05:26,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:26,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-10 02:05:26,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:26,483 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 69 proven. 12 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-10 02:05:26,483 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:26,625 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 69 proven. 12 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-10 02:05:26,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:26,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 31 [2019-09-10 02:05:26,628 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:26,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 02:05:26,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 02:05:26,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=746, Unknown=0, NotChecked=0, Total=930 [2019-09-10 02:05:26,629 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand 31 states. [2019-09-10 02:05:27,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:27,243 INFO L93 Difference]: Finished difference Result 205 states and 251 transitions. [2019-09-10 02:05:27,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 02:05:27,243 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 64 [2019-09-10 02:05:27,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:27,245 INFO L225 Difference]: With dead ends: 205 [2019-09-10 02:05:27,245 INFO L226 Difference]: Without dead ends: 185 [2019-09-10 02:05:27,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 101 SyntacticMatches, 16 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1248 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=668, Invalid=2754, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 02:05:27,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-10 02:05:27,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 80. [2019-09-10 02:05:27,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-10 02:05:27,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2019-09-10 02:05:27,252 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 64 [2019-09-10 02:05:27,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:27,253 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2019-09-10 02:05:27,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 02:05:27,253 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2019-09-10 02:05:27,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 02:05:27,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:27,253 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:27,254 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:27,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:27,254 INFO L82 PathProgramCache]: Analyzing trace with hash -317471505, now seen corresponding path program 14 times [2019-09-10 02:05:27,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:27,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:27,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:05:27,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:27,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:27,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:27,419 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 69 proven. 13 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-10 02:05:27,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:27,419 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:27,419 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:27,419 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:27,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:27,420 INFO L193 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) [2019-09-10 02:05:27,446 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:05:27,446 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:05:27,474 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-10 02:05:27,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:05:27,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-10 02:05:27,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:27,691 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 69 proven. 13 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-10 02:05:27,691 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:27,801 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 69 proven. 13 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-10 02:05:27,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:27,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 30 [2019-09-10 02:05:27,804 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:27,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-10 02:05:27,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-10 02:05:27,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2019-09-10 02:05:27,805 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand 30 states. [2019-09-10 02:05:28,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:28,498 INFO L93 Difference]: Finished difference Result 229 states and 283 transitions. [2019-09-10 02:05:28,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-10 02:05:28,499 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 64 [2019-09-10 02:05:28,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:28,501 INFO L225 Difference]: With dead ends: 229 [2019-09-10 02:05:28,501 INFO L226 Difference]: Without dead ends: 209 [2019-09-10 02:05:28,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 102 SyntacticMatches, 16 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1182 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=649, Invalid=2657, Unknown=0, NotChecked=0, Total=3306 [2019-09-10 02:05:28,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-09-10 02:05:28,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 80. [2019-09-10 02:05:28,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-10 02:05:28,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2019-09-10 02:05:28,514 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 64 [2019-09-10 02:05:28,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:28,514 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2019-09-10 02:05:28,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-10 02:05:28,514 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2019-09-10 02:05:28,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 02:05:28,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:28,515 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:28,515 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:28,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:28,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1802404370, now seen corresponding path program 15 times [2019-09-10 02:05:28,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:28,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:28,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:05:28,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:28,518 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:28,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:28,684 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 69 proven. 16 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-10 02:05:28,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:28,684 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:28,684 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:28,684 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:28,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:28,685 INFO L193 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) [2019-09-10 02:05:28,700 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:05:28,700 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:05:28,723 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:05:28,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:05:28,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-10 02:05:28,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:28,923 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 69 proven. 16 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-10 02:05:28,923 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:29,052 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 69 proven. 16 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-10 02:05:29,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:29,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 29 [2019-09-10 02:05:29,055 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:29,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-10 02:05:29,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-10 02:05:29,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2019-09-10 02:05:29,056 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand 29 states. [2019-09-10 02:05:29,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:29,556 INFO L93 Difference]: Finished difference Result 252 states and 314 transitions. [2019-09-10 02:05:29,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 02:05:29,556 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 64 [2019-09-10 02:05:29,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:29,558 INFO L225 Difference]: With dead ends: 252 [2019-09-10 02:05:29,558 INFO L226 Difference]: Without dead ends: 232 [2019-09-10 02:05:29,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 103 SyntacticMatches, 16 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=595, Invalid=2375, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 02:05:29,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-09-10 02:05:29,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 80. [2019-09-10 02:05:29,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-10 02:05:29,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2019-09-10 02:05:29,566 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 64 [2019-09-10 02:05:29,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:29,566 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2019-09-10 02:05:29,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-10 02:05:29,567 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2019-09-10 02:05:29,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 02:05:29,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:29,567 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:29,568 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:29,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:29,568 INFO L82 PathProgramCache]: Analyzing trace with hash -603379441, now seen corresponding path program 6 times [2019-09-10 02:05:29,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:29,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:29,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:05:29,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:29,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:29,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:29,972 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 69 proven. 21 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-10 02:05:29,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:29,973 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:29,973 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:29,973 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:29,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:29,973 INFO L193 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) [2019-09-10 02:05:29,986 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:05:29,986 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:05:30,009 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:05:30,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:05:30,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-10 02:05:30,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:30,224 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 69 proven. 21 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-10 02:05:30,225 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:30,351 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 69 proven. 21 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-10 02:05:30,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:30,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 28 [2019-09-10 02:05:30,354 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:30,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 02:05:30,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 02:05:30,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2019-09-10 02:05:30,356 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand 28 states. [2019-09-10 02:05:30,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:30,892 INFO L93 Difference]: Finished difference Result 277 states and 348 transitions. [2019-09-10 02:05:30,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 02:05:30,893 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 64 [2019-09-10 02:05:30,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:30,895 INFO L225 Difference]: With dead ends: 277 [2019-09-10 02:05:30,895 INFO L226 Difference]: Without dead ends: 257 [2019-09-10 02:05:30,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 104 SyntacticMatches, 16 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=515, Invalid=1935, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 02:05:30,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-09-10 02:05:30,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 82. [2019-09-10 02:05:30,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-10 02:05:30,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2019-09-10 02:05:30,902 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 64 [2019-09-10 02:05:30,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:30,903 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2019-09-10 02:05:30,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 02:05:30,903 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2019-09-10 02:05:30,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 02:05:30,903 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:30,904 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:30,904 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:30,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:30,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1476086855, now seen corresponding path program 12 times [2019-09-10 02:05:30,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:30,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:30,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:05:30,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:30,905 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:30,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:30,997 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 40 proven. 57 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-10 02:05:30,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:30,998 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:30,998 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:30,998 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:30,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:30,998 INFO L193 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) [2019-09-10 02:05:31,011 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:05:31,011 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:05:31,033 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:05:31,034 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:05:31,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-10 02:05:31,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:31,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:05:31,061 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 40 proven. 57 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-10 02:05:31,061 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:31,141 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 40 proven. 57 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (34)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 02:05:31,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:31,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 14 [2019-09-10 02:05:31,144 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:31,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 02:05:31,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 02:05:31,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-09-10 02:05:31,145 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 14 states. [2019-09-10 02:05:31,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:31,279 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2019-09-10 02:05:31,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 02:05:31,280 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2019-09-10 02:05:31,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:31,281 INFO L225 Difference]: With dead ends: 93 [2019-09-10 02:05:31,281 INFO L226 Difference]: Without dead ends: 93 [2019-09-10 02:05:31,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 121 SyntacticMatches, 14 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2019-09-10 02:05:31,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-10 02:05:31,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2019-09-10 02:05:31,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-09-10 02:05:31,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2019-09-10 02:05:31,285 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 65 [2019-09-10 02:05:31,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:31,286 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2019-09-10 02:05:31,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 02:05:31,286 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2019-09-10 02:05:31,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 02:05:31,286 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:31,287 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:31,287 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:31,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:31,287 INFO L82 PathProgramCache]: Analyzing trace with hash 711908240, now seen corresponding path program 13 times [2019-09-10 02:05:31,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:31,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:31,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:05:31,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:31,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:31,559 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 91 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-10 02:05:31,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:31,559 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:31,560 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:31,560 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:31,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:31,560 INFO L193 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) [2019-09-10 02:05:31,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:05:31,580 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:05:31,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:31,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-10 02:05:31,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:32,000 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 91 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-10 02:05:32,000 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:32,165 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 91 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (35)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 02:05:32,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:32,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 38 [2019-09-10 02:05:32,168 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:32,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-10 02:05:32,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-10 02:05:32,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1115, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 02:05:32,169 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand 38 states. [2019-09-10 02:05:32,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:32,756 INFO L93 Difference]: Finished difference Result 144 states and 169 transitions. [2019-09-10 02:05:32,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 02:05:32,757 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2019-09-10 02:05:32,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:32,758 INFO L225 Difference]: With dead ends: 144 [2019-09-10 02:05:32,758 INFO L226 Difference]: Without dead ends: 121 [2019-09-10 02:05:32,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 110 SyntacticMatches, 18 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1336 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=633, Invalid=2447, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 02:05:32,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-09-10 02:05:32,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 90. [2019-09-10 02:05:32,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-10 02:05:32,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2019-09-10 02:05:32,762 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 72 [2019-09-10 02:05:32,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:32,763 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2019-09-10 02:05:32,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-10 02:05:32,763 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2019-09-10 02:05:32,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 02:05:32,764 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:32,764 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:32,764 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:32,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:32,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1067191823, now seen corresponding path program 16 times [2019-09-10 02:05:32,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:32,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:32,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:05:32,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:32,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:32,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:33,057 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 91 proven. 22 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-10 02:05:33,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:33,057 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:33,057 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:33,057 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:33,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:33,058 INFO L193 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) [2019-09-10 02:05:33,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:05:33,072 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:05:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:33,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-10 02:05:33,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:33,563 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 91 proven. 22 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-10 02:05:33,563 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:33,742 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 91 proven. 22 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (36)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 02:05:33,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:33,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 37 [2019-09-10 02:05:33,745 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:33,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-10 02:05:33,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-10 02:05:33,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=1065, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 02:05:33,747 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 37 states. [2019-09-10 02:05:34,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:34,493 INFO L93 Difference]: Finished difference Result 175 states and 209 transitions. [2019-09-10 02:05:34,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 02:05:34,495 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2019-09-10 02:05:34,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:34,496 INFO L225 Difference]: With dead ends: 175 [2019-09-10 02:05:34,496 INFO L226 Difference]: Without dead ends: 152 [2019-09-10 02:05:34,497 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 111 SyntacticMatches, 18 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1524 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=741, Invalid=3041, Unknown=0, NotChecked=0, Total=3782 [2019-09-10 02:05:34,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-10 02:05:34,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 90. [2019-09-10 02:05:34,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-10 02:05:34,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2019-09-10 02:05:34,501 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 72 [2019-09-10 02:05:34,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:34,501 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2019-09-10 02:05:34,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-10 02:05:34,501 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2019-09-10 02:05:34,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 02:05:34,502 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:34,502 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:34,502 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:34,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:34,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1355747248, now seen corresponding path program 17 times [2019-09-10 02:05:34,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:34,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:34,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:05:34,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:34,504 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:34,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:34,674 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 91 proven. 18 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-10 02:05:34,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:34,674 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:34,674 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:34,674 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:34,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:34,674 INFO L193 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 [2019-09-10 02:05:34,695 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:05:34,696 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:05:34,722 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-10 02:05:34,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:05:34,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-10 02:05:34,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:35,130 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 91 proven. 18 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-10 02:05:35,130 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:35,271 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 91 proven. 18 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (37)] Exception during sending of exit command (exit): Stream closed [2019-09-10 02:05:35,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:35,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 36 [2019-09-10 02:05:35,274 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:35,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-10 02:05:35,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-10 02:05:35,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1013, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 02:05:35,275 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 36 states. [2019-09-10 02:05:35,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:35,962 INFO L93 Difference]: Finished difference Result 205 states and 248 transitions. [2019-09-10 02:05:35,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-10 02:05:35,962 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 72 [2019-09-10 02:05:35,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:35,964 INFO L225 Difference]: With dead ends: 205 [2019-09-10 02:05:35,964 INFO L226 Difference]: Without dead ends: 182 [2019-09-10 02:05:35,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 112 SyntacticMatches, 18 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1662 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=823, Invalid=3467, Unknown=0, NotChecked=0, Total=4290 [2019-09-10 02:05:35,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-10 02:05:35,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 90. [2019-09-10 02:05:35,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-10 02:05:35,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2019-09-10 02:05:35,969 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 72 [2019-09-10 02:05:35,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:35,969 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2019-09-10 02:05:35,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-10 02:05:35,969 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2019-09-10 02:05:35,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 02:05:35,970 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:35,970 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:35,970 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:35,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:35,971 INFO L82 PathProgramCache]: Analyzing trace with hash 810866159, now seen corresponding path program 18 times [2019-09-10 02:05:35,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:35,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:35,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:05:35,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:35,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:35,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:36,183 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 91 proven. 16 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-10 02:05:36,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:36,183 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:36,183 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:36,184 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:36,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:36,184 INFO L193 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) [2019-09-10 02:05:36,196 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:05:36,196 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:05:36,220 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:05:36,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:05:36,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-10 02:05:36,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:36,517 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 91 proven. 16 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-10 02:05:36,517 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:36,648 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 91 proven. 16 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-10 02:05:36,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:36,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 35 [2019-09-10 02:05:36,651 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:36,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-10 02:05:36,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-10 02:05:36,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=959, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 02:05:36,653 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 35 states. [2019-09-10 02:05:37,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:37,470 INFO L93 Difference]: Finished difference Result 234 states and 286 transitions. [2019-09-10 02:05:37,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-10 02:05:37,470 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 72 [2019-09-10 02:05:37,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:37,472 INFO L225 Difference]: With dead ends: 234 [2019-09-10 02:05:37,472 INFO L226 Difference]: Without dead ends: 211 [2019-09-10 02:05:37,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 113 SyntacticMatches, 18 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1724 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=867, Invalid=3689, Unknown=0, NotChecked=0, Total=4556 [2019-09-10 02:05:37,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-10 02:05:37,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 90. [2019-09-10 02:05:37,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-10 02:05:37,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2019-09-10 02:05:37,478 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 72 [2019-09-10 02:05:37,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:37,478 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2019-09-10 02:05:37,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-10 02:05:37,479 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2019-09-10 02:05:37,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 02:05:37,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:37,479 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:37,480 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:37,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:37,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1007825968, now seen corresponding path program 19 times [2019-09-10 02:05:37,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:37,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:37,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:05:37,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:37,481 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:37,678 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 91 proven. 16 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-10 02:05:37,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:37,678 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:37,679 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:37,679 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:37,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:37,679 INFO L193 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 [2019-09-10 02:05:37,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:05:37,693 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:05:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:37,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-10 02:05:37,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:37,966 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 91 proven. 16 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-10 02:05:37,967 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:38,119 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 91 proven. 16 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (39)] Exception during sending of exit command (exit): Stream closed [2019-09-10 02:05:38,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:38,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 34 [2019-09-10 02:05:38,122 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:38,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-10 02:05:38,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-10 02:05:38,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=903, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 02:05:38,123 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 34 states. [2019-09-10 02:05:38,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:38,935 INFO L93 Difference]: Finished difference Result 262 states and 323 transitions. [2019-09-10 02:05:38,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-10 02:05:38,936 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 72 [2019-09-10 02:05:38,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:38,938 INFO L225 Difference]: With dead ends: 262 [2019-09-10 02:05:38,938 INFO L226 Difference]: Without dead ends: 239 [2019-09-10 02:05:38,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 114 SyntacticMatches, 18 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1696 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=867, Invalid=3689, Unknown=0, NotChecked=0, Total=4556 [2019-09-10 02:05:38,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-09-10 02:05:38,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 90. [2019-09-10 02:05:38,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-10 02:05:38,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2019-09-10 02:05:38,944 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 72 [2019-09-10 02:05:38,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:38,944 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2019-09-10 02:05:38,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-10 02:05:38,945 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2019-09-10 02:05:38,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 02:05:38,945 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:38,945 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:38,945 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:38,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:38,946 INFO L82 PathProgramCache]: Analyzing trace with hash 2120095183, now seen corresponding path program 20 times [2019-09-10 02:05:38,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:38,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:38,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:05:38,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:38,947 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:38,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:39,122 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 91 proven. 18 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-10 02:05:39,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:39,123 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:39,124 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:39,124 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:39,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:39,125 INFO L193 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 [2019-09-10 02:05:39,133 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:05:39,133 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:05:39,159 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-10 02:05:39,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:05:39,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-10 02:05:39,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:39,430 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 91 proven. 18 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-10 02:05:39,431 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:39,559 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 91 proven. 18 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-10 02:05:39,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:39,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 33 [2019-09-10 02:05:39,561 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:39,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-10 02:05:39,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-10 02:05:39,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=845, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 02:05:39,562 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 33 states. [2019-09-10 02:05:40,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:40,272 INFO L93 Difference]: Finished difference Result 289 states and 359 transitions. [2019-09-10 02:05:40,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-10 02:05:40,273 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 72 [2019-09-10 02:05:40,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:40,275 INFO L225 Difference]: With dead ends: 289 [2019-09-10 02:05:40,275 INFO L226 Difference]: Without dead ends: 266 [2019-09-10 02:05:40,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 115 SyntacticMatches, 18 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1572 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=823, Invalid=3467, Unknown=0, NotChecked=0, Total=4290 [2019-09-10 02:05:40,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-09-10 02:05:40,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 90. [2019-09-10 02:05:40,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-10 02:05:40,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2019-09-10 02:05:40,282 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 72 [2019-09-10 02:05:40,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:40,282 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2019-09-10 02:05:40,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-10 02:05:40,282 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2019-09-10 02:05:40,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 02:05:40,283 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:40,283 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:40,283 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:40,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:40,283 INFO L82 PathProgramCache]: Analyzing trace with hash 835522544, now seen corresponding path program 21 times [2019-09-10 02:05:40,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:40,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:40,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:05:40,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:40,285 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:40,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:40,461 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 91 proven. 22 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-10 02:05:40,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:40,461 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:40,461 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:40,461 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:40,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:40,462 INFO L193 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 [2019-09-10 02:05:40,471 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:05:40,472 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:05:40,494 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:05:40,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:05:40,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-10 02:05:40,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:40,776 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 91 proven. 22 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-10 02:05:40,777 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:40,981 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 91 proven. 22 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-10 02:05:40,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:40,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 32 [2019-09-10 02:05:40,986 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:40,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-10 02:05:40,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-10 02:05:40,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=785, Unknown=0, NotChecked=0, Total=992 [2019-09-10 02:05:40,988 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 32 states. [2019-09-10 02:05:41,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:41,661 INFO L93 Difference]: Finished difference Result 315 states and 394 transitions. [2019-09-10 02:05:41,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-10 02:05:41,661 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 72 [2019-09-10 02:05:41,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:41,664 INFO L225 Difference]: With dead ends: 315 [2019-09-10 02:05:41,664 INFO L226 Difference]: Without dead ends: 292 [2019-09-10 02:05:41,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 116 SyntacticMatches, 18 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1354 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=741, Invalid=3041, Unknown=0, NotChecked=0, Total=3782 [2019-09-10 02:05:41,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-09-10 02:05:41,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 90. [2019-09-10 02:05:41,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-10 02:05:41,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2019-09-10 02:05:41,672 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 72 [2019-09-10 02:05:41,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:41,672 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2019-09-10 02:05:41,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-10 02:05:41,672 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2019-09-10 02:05:41,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 02:05:41,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:41,673 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:41,673 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:41,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:41,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1284125265, now seen corresponding path program 7 times [2019-09-10 02:05:41,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:41,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:41,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:05:41,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:41,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:41,890 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 91 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-10 02:05:41,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:41,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:41,891 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:41,891 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:41,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:41,891 INFO L193 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) [2019-09-10 02:05:41,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:05:41,911 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:05:41,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:41,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-10 02:05:41,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:42,205 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 91 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-10 02:05:42,205 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:42,361 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 91 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-10 02:05:42,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:42,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 31 [2019-09-10 02:05:42,364 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:42,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 02:05:42,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 02:05:42,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930 [2019-09-10 02:05:42,365 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 31 states. [2019-09-10 02:05:42,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:42,987 INFO L93 Difference]: Finished difference Result 343 states and 432 transitions. [2019-09-10 02:05:42,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-10 02:05:42,988 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 72 [2019-09-10 02:05:42,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:42,990 INFO L225 Difference]: With dead ends: 343 [2019-09-10 02:05:42,991 INFO L226 Difference]: Without dead ends: 320 [2019-09-10 02:05:42,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 117 SyntacticMatches, 18 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1056 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=633, Invalid=2447, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 02:05:42,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-09-10 02:05:42,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 92. [2019-09-10 02:05:42,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-09-10 02:05:42,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2019-09-10 02:05:42,998 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 72 [2019-09-10 02:05:42,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:42,998 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2019-09-10 02:05:42,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 02:05:42,998 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2019-09-10 02:05:42,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 02:05:42,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:42,999 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:42,999 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:42,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:43,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1709472552, now seen corresponding path program 14 times [2019-09-10 02:05:43,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:43,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:43,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:05:43,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:43,001 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:43,101 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 50 proven. 77 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-10 02:05:43,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:43,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:43,102 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:43,102 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:43,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:43,102 INFO L193 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 [2019-09-10 02:05:43,121 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:05:43,121 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:05:43,152 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-10 02:05:43,152 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:05:43,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 02:05:43,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:43,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:05:43,195 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 50 proven. 77 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-10 02:05:43,195 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:43,291 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 50 proven. 77 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-10 02:05:43,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:43,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 15 [2019-09-10 02:05:43,295 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:43,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 02:05:43,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 02:05:43,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-09-10 02:05:43,296 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand 15 states. [2019-09-10 02:05:43,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:43,451 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2019-09-10 02:05:43,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:05:43,452 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2019-09-10 02:05:43,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:43,453 INFO L225 Difference]: With dead ends: 103 [2019-09-10 02:05:43,453 INFO L226 Difference]: Without dead ends: 103 [2019-09-10 02:05:43,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 136 SyntacticMatches, 16 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:05:43,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-09-10 02:05:43,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2019-09-10 02:05:43,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-09-10 02:05:43,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2019-09-10 02:05:43,458 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 73 [2019-09-10 02:05:43,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:43,458 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2019-09-10 02:05:43,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 02:05:43,458 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2019-09-10 02:05:43,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 02:05:43,459 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:43,459 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:43,459 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:43,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:43,459 INFO L82 PathProgramCache]: Analyzing trace with hash 392060303, now seen corresponding path program 15 times [2019-09-10 02:05:43,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:43,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:43,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:05:43,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:43,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:43,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:43,672 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 116 proven. 36 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-10 02:05:43,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:43,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:43,673 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:43,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:43,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:43,673 INFO L193 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 [2019-09-10 02:05:43,685 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:05:43,685 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:05:43,714 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:05:43,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:05:43,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 02:05:43,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:44,082 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 116 proven. 36 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-10 02:05:44,082 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:44,274 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 116 proven. 36 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-10 02:05:44,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:44,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 42 [2019-09-10 02:05:44,277 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:44,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-10 02:05:44,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-10 02:05:44,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=1369, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 02:05:44,278 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 42 states. [2019-09-10 02:05:45,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:45,002 INFO L93 Difference]: Finished difference Result 161 states and 189 transitions. [2019-09-10 02:05:45,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 02:05:45,003 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2019-09-10 02:05:45,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:45,004 INFO L225 Difference]: With dead ends: 161 [2019-09-10 02:05:45,004 INFO L226 Difference]: Without dead ends: 135 [2019-09-10 02:05:45,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 122 SyntacticMatches, 20 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1688 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=763, Invalid=3019, Unknown=0, NotChecked=0, Total=3782 [2019-09-10 02:05:45,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-09-10 02:05:45,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 100. [2019-09-10 02:05:45,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-10 02:05:45,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2019-09-10 02:05:45,008 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 80 [2019-09-10 02:05:45,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:45,008 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2019-09-10 02:05:45,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-10 02:05:45,008 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2019-09-10 02:05:45,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 02:05:45,009 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:45,009 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:45,009 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:45,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:45,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1691574002, now seen corresponding path program 22 times [2019-09-10 02:05:45,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:45,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:45,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:05:45,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:45,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:45,207 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 116 proven. 29 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-10 02:05:45,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:45,208 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:45,208 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:45,208 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:45,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:45,208 INFO L193 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 [2019-09-10 02:05:45,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:05:45,217 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:05:45,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:45,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 02:05:45,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:45,737 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 116 proven. 29 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-10 02:05:45,738 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:45,949 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 116 proven. 29 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-10 02:05:45,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:45,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 41 [2019-09-10 02:05:45,954 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:45,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-10 02:05:45,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-10 02:05:45,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=1314, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 02:05:45,955 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 41 states. [2019-09-10 02:05:46,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:46,802 INFO L93 Difference]: Finished difference Result 196 states and 234 transitions. [2019-09-10 02:05:46,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 02:05:46,803 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2019-09-10 02:05:46,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:46,804 INFO L225 Difference]: With dead ends: 196 [2019-09-10 02:05:46,804 INFO L226 Difference]: Without dead ends: 170 [2019-09-10 02:05:46,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 123 SyntacticMatches, 20 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1944 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=903, Invalid=3789, Unknown=0, NotChecked=0, Total=4692 [2019-09-10 02:05:46,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-09-10 02:05:46,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 100. [2019-09-10 02:05:46,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-10 02:05:46,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2019-09-10 02:05:46,809 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 80 [2019-09-10 02:05:46,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:46,809 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2019-09-10 02:05:46,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-10 02:05:46,809 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2019-09-10 02:05:46,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 02:05:46,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:46,810 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:46,810 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:46,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:46,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1289253295, now seen corresponding path program 23 times [2019-09-10 02:05:46,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:46,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:46,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:05:46,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:46,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:46,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:47,027 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 116 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-10 02:05:47,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:47,028 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:47,028 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:47,028 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:47,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:47,028 INFO L193 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 [2019-09-10 02:05:47,038 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:05:47,038 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:05:47,086 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-10 02:05:47,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:05:47,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 02:05:47,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:47,425 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 116 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-10 02:05:47,425 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:47,638 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 116 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (46)] Exception during sending of exit command (exit): Stream closed [2019-09-10 02:05:47,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:47,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 40 [2019-09-10 02:05:47,642 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:47,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-10 02:05:47,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-10 02:05:47,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=1257, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 02:05:47,643 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 40 states. [2019-09-10 02:05:48,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:48,452 INFO L93 Difference]: Finished difference Result 230 states and 278 transitions. [2019-09-10 02:05:48,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-10 02:05:48,453 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 80 [2019-09-10 02:05:48,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:48,455 INFO L225 Difference]: With dead ends: 230 [2019-09-10 02:05:48,455 INFO L226 Difference]: Without dead ends: 204 [2019-09-10 02:05:48,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 124 SyntacticMatches, 20 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2151 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1018, Invalid=4384, Unknown=0, NotChecked=0, Total=5402 [2019-09-10 02:05:48,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-09-10 02:05:48,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 100. [2019-09-10 02:05:48,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-10 02:05:48,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2019-09-10 02:05:48,460 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 80 [2019-09-10 02:05:48,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:48,461 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2019-09-10 02:05:48,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-10 02:05:48,461 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2019-09-10 02:05:48,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 02:05:48,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:48,462 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:48,462 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:48,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:48,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1108314350, now seen corresponding path program 24 times [2019-09-10 02:05:48,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:48,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:48,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:05:48,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:48,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:48,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:48,695 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 116 proven. 21 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-10 02:05:48,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:48,695 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:48,695 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:48,695 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:48,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:48,696 INFO L193 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 [2019-09-10 02:05:48,708 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:05:48,709 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:05:48,734 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:05:48,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:05:48,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 02:05:48,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:49,043 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 116 proven. 21 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-10 02:05:49,043 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:49,195 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 116 proven. 21 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-10 02:05:49,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:49,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 39 [2019-09-10 02:05:49,198 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:49,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-10 02:05:49,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-10 02:05:49,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=1198, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 02:05:49,199 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 39 states. [2019-09-10 02:05:50,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:50,186 INFO L93 Difference]: Finished difference Result 263 states and 321 transitions. [2019-09-10 02:05:50,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-10 02:05:50,187 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 80 [2019-09-10 02:05:50,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:50,189 INFO L225 Difference]: With dead ends: 263 [2019-09-10 02:05:50,189 INFO L226 Difference]: Without dead ends: 237 [2019-09-10 02:05:50,190 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 125 SyntacticMatches, 20 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2277 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1093, Invalid=4759, Unknown=0, NotChecked=0, Total=5852 [2019-09-10 02:05:50,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-09-10 02:05:50,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 100. [2019-09-10 02:05:50,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-10 02:05:50,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2019-09-10 02:05:50,194 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 80 [2019-09-10 02:05:50,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:50,194 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2019-09-10 02:05:50,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-10 02:05:50,195 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2019-09-10 02:05:50,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 02:05:50,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:50,195 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:50,196 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:50,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:50,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1945563697, now seen corresponding path program 25 times [2019-09-10 02:05:50,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:50,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:50,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:05:50,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:50,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:50,419 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 116 proven. 20 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-10 02:05:50,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:50,420 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:50,420 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:50,420 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:50,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:50,420 INFO L193 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) [2019-09-10 02:05:50,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:05:50,433 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:05:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:50,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 02:05:50,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:50,766 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 116 proven. 20 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-10 02:05:50,766 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:50,917 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 116 proven. 20 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-10 02:05:50,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:50,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 38 [2019-09-10 02:05:50,920 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:50,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-10 02:05:50,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-10 02:05:50,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=1137, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 02:05:50,921 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 38 states. [2019-09-10 02:05:51,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:51,951 INFO L93 Difference]: Finished difference Result 295 states and 363 transitions. [2019-09-10 02:05:51,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-10 02:05:51,952 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 80 [2019-09-10 02:05:51,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:51,954 INFO L225 Difference]: With dead ends: 295 [2019-09-10 02:05:51,954 INFO L226 Difference]: Without dead ends: 269 [2019-09-10 02:05:51,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 126 SyntacticMatches, 20 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2302 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1119, Invalid=4887, Unknown=0, NotChecked=0, Total=6006 [2019-09-10 02:05:51,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-09-10 02:05:51,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 100. [2019-09-10 02:05:51,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-10 02:05:51,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2019-09-10 02:05:51,960 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 80 [2019-09-10 02:05:51,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:51,960 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2019-09-10 02:05:51,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-10 02:05:51,961 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2019-09-10 02:05:51,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 02:05:51,961 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:51,961 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:51,962 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:51,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:51,962 INFO L82 PathProgramCache]: Analyzing trace with hash 172681422, now seen corresponding path program 26 times [2019-09-10 02:05:51,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:51,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:51,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:05:51,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:51,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:51,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:52,194 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 116 proven. 21 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-10 02:05:52,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:52,195 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:52,195 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:52,195 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:52,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:52,195 INFO L193 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 [2019-09-10 02:05:52,212 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:05:52,213 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:05:52,245 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-10 02:05:52,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:05:52,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 02:05:52,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:52,700 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 116 proven. 21 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-10 02:05:52,700 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:52,969 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 116 proven. 21 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-10 02:05:52,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:52,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 37 [2019-09-10 02:05:52,972 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:52,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-10 02:05:52,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-10 02:05:52,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=1074, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 02:05:52,974 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 37 states. [2019-09-10 02:05:54,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:54,220 INFO L93 Difference]: Finished difference Result 326 states and 404 transitions. [2019-09-10 02:05:54,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-10 02:05:54,221 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 80 [2019-09-10 02:05:54,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:54,224 INFO L225 Difference]: With dead ends: 326 [2019-09-10 02:05:54,224 INFO L226 Difference]: Without dead ends: 300 [2019-09-10 02:05:54,225 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 127 SyntacticMatches, 20 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2217 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1093, Invalid=4759, Unknown=0, NotChecked=0, Total=5852 [2019-09-10 02:05:54,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-09-10 02:05:54,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 100. [2019-09-10 02:05:54,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-10 02:05:54,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2019-09-10 02:05:54,234 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 80 [2019-09-10 02:05:54,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:54,234 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2019-09-10 02:05:54,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-10 02:05:54,235 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2019-09-10 02:05:54,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 02:05:54,236 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:54,236 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:54,236 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:54,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:54,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1626485231, now seen corresponding path program 27 times [2019-09-10 02:05:54,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:54,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:54,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:05:54,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:54,239 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:54,473 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 116 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-10 02:05:54,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:54,474 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:54,474 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:54,474 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:54,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:54,474 INFO L193 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) [2019-09-10 02:05:54,488 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:05:54,488 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:05:54,514 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:05:54,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:05:54,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 02:05:54,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:54,823 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 116 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-10 02:05:54,823 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:54,983 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 116 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-10 02:05:54,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:54,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 36 [2019-09-10 02:05:54,985 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:54,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-10 02:05:54,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-10 02:05:54,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=1009, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 02:05:54,986 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 36 states. [2019-09-10 02:05:55,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:55,928 INFO L93 Difference]: Finished difference Result 356 states and 444 transitions. [2019-09-10 02:05:55,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-10 02:05:55,929 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 80 [2019-09-10 02:05:55,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:55,931 INFO L225 Difference]: With dead ends: 356 [2019-09-10 02:05:55,931 INFO L226 Difference]: Without dead ends: 330 [2019-09-10 02:05:55,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 128 SyntacticMatches, 20 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2019 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1018, Invalid=4384, Unknown=0, NotChecked=0, Total=5402 [2019-09-10 02:05:55,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-09-10 02:05:55,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 100. [2019-09-10 02:05:55,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-10 02:05:55,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2019-09-10 02:05:55,938 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 80 [2019-09-10 02:05:55,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:55,938 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2019-09-10 02:05:55,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-10 02:05:55,938 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2019-09-10 02:05:55,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 02:05:55,939 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:55,939 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:55,939 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:55,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:55,940 INFO L82 PathProgramCache]: Analyzing trace with hash -543375186, now seen corresponding path program 28 times [2019-09-10 02:05:55,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:55,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:55,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:05:55,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:55,941 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:55,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:56,193 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 116 proven. 29 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-10 02:05:56,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:56,193 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:56,194 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:56,194 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:56,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:56,194 INFO L193 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) [2019-09-10 02:05:56,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:05:56,216 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:05:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:56,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 02:05:56,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:56,568 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 116 proven. 29 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-10 02:05:56,568 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:56,765 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 116 proven. 29 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-10 02:05:56,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:56,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 35 [2019-09-10 02:05:56,769 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:56,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-10 02:05:56,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-10 02:05:56,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=942, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 02:05:56,770 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 35 states. [2019-09-10 02:05:57,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:57,510 INFO L93 Difference]: Finished difference Result 385 states and 483 transitions. [2019-09-10 02:05:57,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-10 02:05:57,512 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 80 [2019-09-10 02:05:57,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:57,514 INFO L225 Difference]: With dead ends: 385 [2019-09-10 02:05:57,515 INFO L226 Difference]: Without dead ends: 359 [2019-09-10 02:05:57,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 129 SyntacticMatches, 20 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1716 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=903, Invalid=3789, Unknown=0, NotChecked=0, Total=4692 [2019-09-10 02:05:57,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-09-10 02:05:57,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 100. [2019-09-10 02:05:57,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-10 02:05:57,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2019-09-10 02:05:57,522 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 80 [2019-09-10 02:05:57,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:57,523 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2019-09-10 02:05:57,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-10 02:05:57,523 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2019-09-10 02:05:57,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 02:05:57,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:57,524 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:57,524 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:57,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:57,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1880481295, now seen corresponding path program 8 times [2019-09-10 02:05:57,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:57,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:57,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:05:57,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:57,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:57,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:57,751 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 116 proven. 36 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-10 02:05:57,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:57,752 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:57,753 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:57,753 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:57,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:57,753 INFO L193 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) [2019-09-10 02:05:57,771 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:05:57,772 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:05:57,803 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-10 02:05:57,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:05:57,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 02:05:57,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:58,058 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 116 proven. 36 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-10 02:05:58,058 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:58,212 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 116 proven. 36 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-10 02:05:58,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:58,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 34 [2019-09-10 02:05:58,215 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:58,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-10 02:05:58,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-10 02:05:58,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=873, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 02:05:58,216 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 34 states. [2019-09-10 02:05:58,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:58,938 INFO L93 Difference]: Finished difference Result 416 states and 525 transitions. [2019-09-10 02:05:58,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-10 02:05:58,939 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 80 [2019-09-10 02:05:58,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:58,941 INFO L225 Difference]: With dead ends: 416 [2019-09-10 02:05:58,942 INFO L226 Difference]: Without dead ends: 390 [2019-09-10 02:05:58,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 130 SyntacticMatches, 20 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1328 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=763, Invalid=3019, Unknown=0, NotChecked=0, Total=3782 [2019-09-10 02:05:58,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-09-10 02:05:58,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 102. [2019-09-10 02:05:58,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-09-10 02:05:58,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 113 transitions. [2019-09-10 02:05:58,949 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 113 transitions. Word has length 80 [2019-09-10 02:05:58,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:58,949 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 113 transitions. [2019-09-10 02:05:58,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-10 02:05:58,949 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2019-09-10 02:05:58,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 02:05:58,950 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:58,950 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:58,950 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:58,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:58,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1754864345, now seen corresponding path program 16 times [2019-09-10 02:05:58,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:58,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:58,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:05:58,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:58,952 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:59,073 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 61 proven. 100 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-10 02:05:59,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:59,073 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:59,074 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:59,074 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:59,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:59,074 INFO L193 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) [2019-09-10 02:05:59,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:05:59,095 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:05:59,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:59,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 02:05:59,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:05:59,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:05:59,182 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 61 proven. 100 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-10 02:05:59,182 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:05:59,308 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 61 proven. 100 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-10 02:05:59,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:05:59,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 16 [2019-09-10 02:05:59,313 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:05:59,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 02:05:59,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 02:05:59,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:05:59,314 INFO L87 Difference]: Start difference. First operand 102 states and 113 transitions. Second operand 16 states. [2019-09-10 02:05:59,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:05:59,440 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2019-09-10 02:05:59,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 02:05:59,440 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 81 [2019-09-10 02:05:59,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:05:59,441 INFO L225 Difference]: With dead ends: 113 [2019-09-10 02:05:59,441 INFO L226 Difference]: Without dead ends: 113 [2019-09-10 02:05:59,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 151 SyntacticMatches, 18 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-09-10 02:05:59,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-09-10 02:05:59,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2019-09-10 02:05:59,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-09-10 02:05:59,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2019-09-10 02:05:59,444 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 81 [2019-09-10 02:05:59,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:05:59,444 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2019-09-10 02:05:59,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 02:05:59,445 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2019-09-10 02:05:59,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 02:05:59,445 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:05:59,445 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:05:59,446 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:05:59,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:05:59,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1682933424, now seen corresponding path program 17 times [2019-09-10 02:05:59,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:05:59,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:59,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:05:59,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:05:59,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:05:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:05:59,728 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 144 proven. 45 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 02:05:59,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:59,729 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:05:59,729 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:05:59,729 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:05:59,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:05:59,729 INFO L193 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 [2019-09-10 02:05:59,738 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:05:59,739 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:05:59,772 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-10 02:05:59,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:05:59,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 02:05:59,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:00,185 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 144 proven. 45 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 02:06:00,186 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:00,396 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 144 proven. 45 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 02:06:00,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:00,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 46 [2019-09-10 02:06:00,400 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:00,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-10 02:06:00,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-10 02:06:00,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=1649, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 02:06:00,401 INFO L87 Difference]: Start difference. First operand 109 states and 120 transitions. Second operand 46 states. [2019-09-10 02:06:01,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:01,086 INFO L93 Difference]: Finished difference Result 178 states and 209 transitions. [2019-09-10 02:06:01,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 02:06:01,086 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88 [2019-09-10 02:06:01,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:01,087 INFO L225 Difference]: With dead ends: 178 [2019-09-10 02:06:01,088 INFO L226 Difference]: Without dead ends: 149 [2019-09-10 02:06:01,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 134 SyntacticMatches, 22 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2081 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=905, Invalid=3651, Unknown=0, NotChecked=0, Total=4556 [2019-09-10 02:06:01,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-09-10 02:06:01,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 110. [2019-09-10 02:06:01,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-10 02:06:01,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2019-09-10 02:06:01,094 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 88 [2019-09-10 02:06:01,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:01,095 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2019-09-10 02:06:01,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-10 02:06:01,095 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2019-09-10 02:06:01,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 02:06:01,095 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:01,096 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:06:01,096 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:01,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:01,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1323443409, now seen corresponding path program 29 times [2019-09-10 02:06:01,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:01,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:01,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:06:01,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:01,097 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:01,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:01,418 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 144 proven. 37 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 02:06:01,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:01,419 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:01,419 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:01,419 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:01,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:01,419 INFO L193 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) [2019-09-10 02:06:01,432 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:06:01,432 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:01,468 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-10 02:06:01,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:06:01,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 02:06:01,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:01,909 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 144 proven. 37 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 02:06:01,909 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:02,110 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 144 proven. 37 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 02:06:02,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:02,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 45 [2019-09-10 02:06:02,113 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:02,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-10 02:06:02,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-10 02:06:02,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=1589, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 02:06:02,117 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 45 states. [2019-09-10 02:06:02,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:02,819 INFO L93 Difference]: Finished difference Result 217 states and 259 transitions. [2019-09-10 02:06:02,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-10 02:06:02,820 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2019-09-10 02:06:02,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:02,821 INFO L225 Difference]: With dead ends: 217 [2019-09-10 02:06:02,821 INFO L226 Difference]: Without dead ends: 188 [2019-09-10 02:06:02,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 135 SyntacticMatches, 22 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1081, Invalid=4619, Unknown=0, NotChecked=0, Total=5700 [2019-09-10 02:06:02,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-10 02:06:02,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 110. [2019-09-10 02:06:02,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-10 02:06:02,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2019-09-10 02:06:02,825 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 88 [2019-09-10 02:06:02,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:02,825 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2019-09-10 02:06:02,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-10 02:06:02,826 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2019-09-10 02:06:02,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 02:06:02,826 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:02,826 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:06:02,827 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:02,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:02,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1627618000, now seen corresponding path program 30 times [2019-09-10 02:06:02,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:02,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:02,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:06:02,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:02,828 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:02,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:03,090 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 144 proven. 31 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 02:06:03,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:03,091 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:03,091 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:03,091 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:03,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:03,091 INFO L193 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 [2019-09-10 02:06:03,101 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:06:03,102 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:06:03,132 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:06:03,132 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:06:03,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 02:06:03,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:03,504 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 144 proven. 31 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 02:06:03,505 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:03,711 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 144 proven. 31 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 02:06:03,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:03,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 44 [2019-09-10 02:06:03,715 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:03,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-10 02:06:03,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-10 02:06:03,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=365, Invalid=1527, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 02:06:03,717 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 44 states. [2019-09-10 02:06:04,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:04,521 INFO L93 Difference]: Finished difference Result 255 states and 308 transitions. [2019-09-10 02:06:04,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-10 02:06:04,522 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 88 [2019-09-10 02:06:04,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:04,524 INFO L225 Difference]: With dead ends: 255 [2019-09-10 02:06:04,524 INFO L226 Difference]: Without dead ends: 226 [2019-09-10 02:06:04,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 136 SyntacticMatches, 22 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2703 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1234, Invalid=5408, Unknown=0, NotChecked=0, Total=6642 [2019-09-10 02:06:04,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-09-10 02:06:04,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 110. [2019-09-10 02:06:04,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-10 02:06:04,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2019-09-10 02:06:04,529 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 88 [2019-09-10 02:06:04,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:04,529 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2019-09-10 02:06:04,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-10 02:06:04,529 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2019-09-10 02:06:04,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 02:06:04,530 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:04,530 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:06:04,530 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:04,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:04,530 INFO L82 PathProgramCache]: Analyzing trace with hash -771038449, now seen corresponding path program 31 times [2019-09-10 02:06:04,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:04,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:04,531 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:06:04,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:04,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:04,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:04,834 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 144 proven. 27 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 02:06:04,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:04,835 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:04,835 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:04,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:04,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:04,835 INFO L193 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) [2019-09-10 02:06:04,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:04,849 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:04,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:04,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 02:06:04,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:05,259 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 144 proven. 27 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 02:06:05,259 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:05,465 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 144 proven. 27 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 02:06:05,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:05,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 43 [2019-09-10 02:06:05,468 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:05,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-10 02:06:05,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-10 02:06:05,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=1463, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 02:06:05,469 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 43 states. [2019-09-10 02:06:06,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:06,579 INFO L93 Difference]: Finished difference Result 292 states and 356 transitions. [2019-09-10 02:06:06,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-10 02:06:06,580 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 88 [2019-09-10 02:06:06,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:06,582 INFO L225 Difference]: With dead ends: 292 [2019-09-10 02:06:06,582 INFO L226 Difference]: Without dead ends: 263 [2019-09-10 02:06:06,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 137 SyntacticMatches, 22 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2907 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1346, Invalid=5964, Unknown=0, NotChecked=0, Total=7310 [2019-09-10 02:06:06,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-09-10 02:06:06,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 110. [2019-09-10 02:06:06,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-10 02:06:06,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2019-09-10 02:06:06,588 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 88 [2019-09-10 02:06:06,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:06,589 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2019-09-10 02:06:06,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-10 02:06:06,589 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2019-09-10 02:06:06,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 02:06:06,590 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:06,590 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:06:06,590 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:06,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:06,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1402603792, now seen corresponding path program 32 times [2019-09-10 02:06:06,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:06,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:06,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:06,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:06,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:06,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:06,817 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 144 proven. 25 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 02:06:06,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:06,818 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:06,818 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:06,818 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:06,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:06,818 INFO L193 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 [2019-09-10 02:06:06,827 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:06:06,827 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:06:06,858 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-10 02:06:06,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:06:06,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 02:06:06,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:07,246 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 144 proven. 25 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 02:06:07,246 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:07,422 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 144 proven. 25 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 02:06:07,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:07,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 42 [2019-09-10 02:06:07,424 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:07,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-10 02:06:07,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-10 02:06:07,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=1397, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 02:06:07,428 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 42 states. [2019-09-10 02:06:08,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:08,558 INFO L93 Difference]: Finished difference Result 328 states and 403 transitions. [2019-09-10 02:06:08,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-10 02:06:08,559 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 88 [2019-09-10 02:06:08,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:08,561 INFO L225 Difference]: With dead ends: 328 [2019-09-10 02:06:08,561 INFO L226 Difference]: Without dead ends: 299 [2019-09-10 02:06:08,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 138 SyntacticMatches, 22 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3001 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1405, Invalid=6251, Unknown=0, NotChecked=0, Total=7656 [2019-09-10 02:06:08,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-09-10 02:06:08,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 110. [2019-09-10 02:06:08,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-10 02:06:08,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2019-09-10 02:06:08,566 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 88 [2019-09-10 02:06:08,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:08,566 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2019-09-10 02:06:08,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-10 02:06:08,566 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2019-09-10 02:06:08,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 02:06:08,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:08,567 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:06:08,567 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:08,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:08,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1347969775, now seen corresponding path program 33 times [2019-09-10 02:06:08,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:08,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:08,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:06:08,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:08,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:08,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:08,843 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 144 proven. 25 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 02:06:08,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:08,844 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:08,844 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:08,844 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:08,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:08,844 INFO L193 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) [2019-09-10 02:06:08,863 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:06:08,863 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:08,890 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:06:08,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:06:08,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 02:06:08,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:09,225 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 144 proven. 25 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 02:06:09,225 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:09,415 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 144 proven. 25 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 02:06:09,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:09,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 41 [2019-09-10 02:06:09,418 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:09,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-10 02:06:09,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-10 02:06:09,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=1329, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 02:06:09,420 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 41 states. [2019-09-10 02:06:10,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:10,552 INFO L93 Difference]: Finished difference Result 363 states and 449 transitions. [2019-09-10 02:06:10,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-10 02:06:10,553 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 88 [2019-09-10 02:06:10,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:10,555 INFO L225 Difference]: With dead ends: 363 [2019-09-10 02:06:10,555 INFO L226 Difference]: Without dead ends: 334 [2019-09-10 02:06:10,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 139 SyntacticMatches, 22 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2971 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1405, Invalid=6251, Unknown=0, NotChecked=0, Total=7656 [2019-09-10 02:06:10,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-09-10 02:06:10,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 110. [2019-09-10 02:06:10,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-10 02:06:10,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2019-09-10 02:06:10,560 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 88 [2019-09-10 02:06:10,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:10,561 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2019-09-10 02:06:10,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-10 02:06:10,561 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2019-09-10 02:06:10,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 02:06:10,561 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:10,562 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:06:10,562 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:10,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:10,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1334248688, now seen corresponding path program 34 times [2019-09-10 02:06:10,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:10,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:10,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:06:10,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:10,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:10,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:10,878 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 144 proven. 27 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 02:06:10,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:10,879 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:10,879 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:10,879 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:10,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:10,880 INFO L193 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 [2019-09-10 02:06:10,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:10,901 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:06:10,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:10,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 02:06:10,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:11,372 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 144 proven. 27 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 02:06:11,372 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:11,555 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 144 proven. 27 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 02:06:11,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:11,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 40 [2019-09-10 02:06:11,558 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:11,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-10 02:06:11,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-10 02:06:11,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=1259, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 02:06:11,559 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 40 states. [2019-09-10 02:06:12,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:12,646 INFO L93 Difference]: Finished difference Result 397 states and 494 transitions. [2019-09-10 02:06:12,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-10 02:06:12,647 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 88 [2019-09-10 02:06:12,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:12,649 INFO L225 Difference]: With dead ends: 397 [2019-09-10 02:06:12,650 INFO L226 Difference]: Without dead ends: 368 [2019-09-10 02:06:12,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 140 SyntacticMatches, 22 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2811 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1346, Invalid=5964, Unknown=0, NotChecked=0, Total=7310 [2019-09-10 02:06:12,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-09-10 02:06:12,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 110. [2019-09-10 02:06:12,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-10 02:06:12,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2019-09-10 02:06:12,657 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 88 [2019-09-10 02:06:12,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:12,657 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2019-09-10 02:06:12,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-10 02:06:12,657 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2019-09-10 02:06:12,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 02:06:12,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:12,658 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:06:12,658 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:12,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:12,658 INFO L82 PathProgramCache]: Analyzing trace with hash 2042911439, now seen corresponding path program 35 times [2019-09-10 02:06:12,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:12,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:12,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:12,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:12,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:12,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:12,903 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 144 proven. 31 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 02:06:12,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:12,903 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:12,903 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:12,903 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:12,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:12,903 INFO L193 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 [2019-09-10 02:06:12,914 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:06:12,914 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:06:12,947 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-10 02:06:12,947 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:06:12,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 02:06:12,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:13,277 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 144 proven. 31 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 02:06:13,277 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:13,455 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 144 proven. 31 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 02:06:13,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:13,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 39 [2019-09-10 02:06:13,458 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:13,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-10 02:06:13,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-10 02:06:13,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=1187, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 02:06:13,459 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 39 states. [2019-09-10 02:06:14,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:14,478 INFO L93 Difference]: Finished difference Result 430 states and 538 transitions. [2019-09-10 02:06:14,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-10 02:06:14,479 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 88 [2019-09-10 02:06:14,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:14,481 INFO L225 Difference]: With dead ends: 430 [2019-09-10 02:06:14,481 INFO L226 Difference]: Without dead ends: 401 [2019-09-10 02:06:14,482 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 141 SyntacticMatches, 22 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2523 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1234, Invalid=5408, Unknown=0, NotChecked=0, Total=6642 [2019-09-10 02:06:14,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2019-09-10 02:06:14,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 110. [2019-09-10 02:06:14,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-10 02:06:14,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2019-09-10 02:06:14,488 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 88 [2019-09-10 02:06:14,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:14,489 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2019-09-10 02:06:14,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-10 02:06:14,489 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2019-09-10 02:06:14,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 02:06:14,489 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:14,490 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:06:14,490 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:14,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:14,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1874757424, now seen corresponding path program 36 times [2019-09-10 02:06:14,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:14,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:14,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:06:14,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:14,491 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:14,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:14,729 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 144 proven. 37 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 02:06:14,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:14,729 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:14,729 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:14,729 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:14,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:14,729 INFO L193 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) [2019-09-10 02:06:14,743 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:06:14,743 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:14,768 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:06:14,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:06:14,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 02:06:14,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:15,062 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 144 proven. 37 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 02:06:15,062 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:15,246 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 144 proven. 37 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 02:06:15,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:15,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 38 [2019-09-10 02:06:15,249 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:15,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-10 02:06:15,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-10 02:06:15,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=1113, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 02:06:15,251 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 38 states. [2019-09-10 02:06:16,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:16,152 INFO L93 Difference]: Finished difference Result 462 states and 581 transitions. [2019-09-10 02:06:16,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-10 02:06:16,153 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 88 [2019-09-10 02:06:16,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:16,156 INFO L225 Difference]: With dead ends: 462 [2019-09-10 02:06:16,156 INFO L226 Difference]: Without dead ends: 433 [2019-09-10 02:06:16,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 142 SyntacticMatches, 22 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2121 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1081, Invalid=4619, Unknown=0, NotChecked=0, Total=5700 [2019-09-10 02:06:16,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-09-10 02:06:16,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 110. [2019-09-10 02:06:16,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-10 02:06:16,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2019-09-10 02:06:16,163 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 88 [2019-09-10 02:06:16,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:16,163 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2019-09-10 02:06:16,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-10 02:06:16,163 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2019-09-10 02:06:16,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 02:06:16,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:16,164 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:06:16,164 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:16,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:16,165 INFO L82 PathProgramCache]: Analyzing trace with hash -208876881, now seen corresponding path program 9 times [2019-09-10 02:06:16,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:16,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:16,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:06:16,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:16,166 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:16,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:16,395 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 144 proven. 45 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 02:06:16,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:16,395 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:16,395 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:16,396 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:16,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:16,396 INFO L193 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 [2019-09-10 02:06:16,406 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:06:16,406 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:06:16,432 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:06:16,433 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:06:16,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 02:06:16,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:16,731 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 144 proven. 45 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 02:06:16,732 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:16,951 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 144 proven. 45 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (63)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 02:06:16,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:16,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 37 [2019-09-10 02:06:16,955 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:16,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-10 02:06:16,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-10 02:06:16,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=1037, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 02:06:16,958 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 37 states. [2019-09-10 02:06:17,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:17,788 INFO L93 Difference]: Finished difference Result 496 states and 627 transitions. [2019-09-10 02:06:17,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-10 02:06:17,789 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 88 [2019-09-10 02:06:17,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:17,792 INFO L225 Difference]: With dead ends: 496 [2019-09-10 02:06:17,792 INFO L226 Difference]: Without dead ends: 467 [2019-09-10 02:06:17,793 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 143 SyntacticMatches, 22 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1631 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=905, Invalid=3651, Unknown=0, NotChecked=0, Total=4556 [2019-09-10 02:06:17,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-09-10 02:06:17,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 112. [2019-09-10 02:06:17,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-10 02:06:17,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2019-09-10 02:06:17,799 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 88 [2019-09-10 02:06:17,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:17,799 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2019-09-10 02:06:17,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-10 02:06:17,799 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2019-09-10 02:06:17,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 02:06:17,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:17,800 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:06:17,800 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:17,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:17,800 INFO L82 PathProgramCache]: Analyzing trace with hash 2072180296, now seen corresponding path program 18 times [2019-09-10 02:06:17,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:17,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:17,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:06:17,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:17,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:17,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:17,950 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 73 proven. 126 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 02:06:17,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:17,950 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:17,950 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:17,951 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:17,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:17,951 INFO L193 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) [2019-09-10 02:06:17,974 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:06:17,975 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:18,024 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:06:18,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:06:18,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-10 02:06:18,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:18,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:06:18,098 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 73 proven. 126 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 02:06:18,099 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:18,285 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 73 proven. 126 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (64)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 02:06:18,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:18,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 17 [2019-09-10 02:06:18,291 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:18,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 02:06:18,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 02:06:18,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-09-10 02:06:18,292 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand 17 states. [2019-09-10 02:06:18,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:18,476 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2019-09-10 02:06:18,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 02:06:18,476 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 89 [2019-09-10 02:06:18,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:18,477 INFO L225 Difference]: With dead ends: 123 [2019-09-10 02:06:18,477 INFO L226 Difference]: Without dead ends: 123 [2019-09-10 02:06:18,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 166 SyntacticMatches, 20 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2019-09-10 02:06:18,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-09-10 02:06:18,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2019-09-10 02:06:18,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-10 02:06:18,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2019-09-10 02:06:18,481 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 89 [2019-09-10 02:06:18,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:18,481 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2019-09-10 02:06:18,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 02:06:18,482 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2019-09-10 02:06:18,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 02:06:18,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:18,483 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:06:18,483 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:18,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:18,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1085611631, now seen corresponding path program 19 times [2019-09-10 02:06:18,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:18,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:18,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:06:18,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:18,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:18,868 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 175 proven. 55 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-10 02:06:18,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:18,868 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:18,868 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:18,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:18,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:18,869 INFO L193 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) [2019-09-10 02:06:18,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:18,881 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:18,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-10 02:06:18,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:19,402 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 175 proven. 55 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-10 02:06:19,402 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:19,627 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 175 proven. 55 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-10 02:06:19,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:19,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 50 [2019-09-10 02:06:19,629 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:19,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-10 02:06:19,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-10 02:06:19,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=495, Invalid=1955, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 02:06:19,632 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand 50 states. [2019-09-10 02:06:20,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:20,530 INFO L93 Difference]: Finished difference Result 195 states and 229 transitions. [2019-09-10 02:06:20,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 02:06:20,530 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2019-09-10 02:06:20,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:20,532 INFO L225 Difference]: With dead ends: 195 [2019-09-10 02:06:20,532 INFO L226 Difference]: Without dead ends: 163 [2019-09-10 02:06:20,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 146 SyntacticMatches, 24 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2515 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1059, Invalid=4343, Unknown=0, NotChecked=0, Total=5402 [2019-09-10 02:06:20,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-09-10 02:06:20,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 120. [2019-09-10 02:06:20,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-10 02:06:20,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2019-09-10 02:06:20,536 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 96 [2019-09-10 02:06:20,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:20,536 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2019-09-10 02:06:20,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-10 02:06:20,536 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2019-09-10 02:06:20,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 02:06:20,537 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:20,537 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:06:20,537 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:20,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:20,537 INFO L82 PathProgramCache]: Analyzing trace with hash -505248786, now seen corresponding path program 37 times [2019-09-10 02:06:20,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:20,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:20,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:20,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:20,538 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:20,977 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 175 proven. 46 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-10 02:06:20,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:20,978 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:20,978 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:20,978 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:20,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:20,978 INFO L193 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 [2019-09-10 02:06:20,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:20,993 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:06:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:21,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-10 02:06:21,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:21,589 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 175 proven. 46 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-10 02:06:21,589 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:21,807 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 175 proven. 46 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-10 02:06:21,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:21,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 49 [2019-09-10 02:06:21,811 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:21,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-10 02:06:21,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-10 02:06:21,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=462, Invalid=1890, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 02:06:21,811 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand 49 states. [2019-09-10 02:06:22,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:22,793 INFO L93 Difference]: Finished difference Result 238 states and 284 transitions. [2019-09-10 02:06:22,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-10 02:06:22,793 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2019-09-10 02:06:22,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:22,795 INFO L225 Difference]: With dead ends: 238 [2019-09-10 02:06:22,795 INFO L226 Difference]: Without dead ends: 206 [2019-09-10 02:06:22,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 147 SyntacticMatches, 24 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2937 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1275, Invalid=5531, Unknown=0, NotChecked=0, Total=6806 [2019-09-10 02:06:22,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-09-10 02:06:22,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 120. [2019-09-10 02:06:22,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-10 02:06:22,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2019-09-10 02:06:22,800 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 96 [2019-09-10 02:06:22,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:22,800 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2019-09-10 02:06:22,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-10 02:06:22,800 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2019-09-10 02:06:22,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 02:06:22,801 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:22,801 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:06:22,801 INFO L418 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:22,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:22,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1664945521, now seen corresponding path program 38 times [2019-09-10 02:06:22,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:22,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:22,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:22,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:22,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:23,259 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 175 proven. 39 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-10 02:06:23,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:23,259 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:23,260 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:23,260 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:23,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:23,260 INFO L193 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) [2019-09-10 02:06:23,274 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:06:23,275 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:23,337 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-10 02:06:23,338 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:06:23,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-10 02:06:23,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:24,177 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 175 proven. 39 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-10 02:06:24,177 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:24,436 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 175 proven. 39 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-10 02:06:24,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:24,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 48 [2019-09-10 02:06:24,439 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:24,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-10 02:06:24,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-10 02:06:24,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=433, Invalid=1823, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 02:06:24,440 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand 48 states. [2019-09-10 02:06:25,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:25,640 INFO L93 Difference]: Finished difference Result 280 states and 338 transitions. [2019-09-10 02:06:25,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-10 02:06:25,640 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 96 [2019-09-10 02:06:25,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:25,642 INFO L225 Difference]: With dead ends: 280 [2019-09-10 02:06:25,642 INFO L226 Difference]: Without dead ends: 248 [2019-09-10 02:06:25,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 148 SyntacticMatches, 24 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3318 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1471, Invalid=6539, Unknown=0, NotChecked=0, Total=8010 [2019-09-10 02:06:25,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-09-10 02:06:25,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 120. [2019-09-10 02:06:25,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-10 02:06:25,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2019-09-10 02:06:25,647 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 96 [2019-09-10 02:06:25,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:25,647 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2019-09-10 02:06:25,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-10 02:06:25,647 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2019-09-10 02:06:25,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 02:06:25,648 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:25,648 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:06:25,648 INFO L418 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:25,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:25,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1622780878, now seen corresponding path program 39 times [2019-09-10 02:06:25,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:25,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:25,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:06:25,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:25,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:25,988 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 175 proven. 34 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-10 02:06:25,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:25,989 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:25,989 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:25,989 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:25,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:25,989 INFO L193 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) [2019-09-10 02:06:26,001 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:06:26,002 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:26,032 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:06:26,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:06:26,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-10 02:06:26,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:26,481 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 175 proven. 34 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-10 02:06:26,481 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:26,716 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 175 proven. 34 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-10 02:06:26,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:26,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 47 [2019-09-10 02:06:26,719 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:26,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-10 02:06:26,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-10 02:06:26,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=1754, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 02:06:26,721 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand 47 states. [2019-09-10 02:06:28,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:28,001 INFO L93 Difference]: Finished difference Result 321 states and 391 transitions. [2019-09-10 02:06:28,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-10 02:06:28,001 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 96 [2019-09-10 02:06:28,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:28,003 INFO L225 Difference]: With dead ends: 321 [2019-09-10 02:06:28,003 INFO L226 Difference]: Without dead ends: 289 [2019-09-10 02:06:28,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 149 SyntacticMatches, 24 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3614 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1626, Invalid=7304, Unknown=0, NotChecked=0, Total=8930 [2019-09-10 02:06:28,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-09-10 02:06:28,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 120. [2019-09-10 02:06:28,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-10 02:06:28,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2019-09-10 02:06:28,009 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 96 [2019-09-10 02:06:28,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:28,009 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2019-09-10 02:06:28,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-10 02:06:28,009 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2019-09-10 02:06:28,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 02:06:28,010 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:28,010 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:06:28,010 INFO L418 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:28,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:28,010 INFO L82 PathProgramCache]: Analyzing trace with hash 343363247, now seen corresponding path program 40 times [2019-09-10 02:06:28,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:28,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:28,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:06:28,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:28,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:28,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:28,344 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 175 proven. 31 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-10 02:06:28,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:28,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:28,345 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:28,345 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:28,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:28,345 INFO L193 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 [2019-09-10 02:06:28,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:28,359 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:06:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:28,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-10 02:06:28,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:28,839 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 175 proven. 31 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-10 02:06:28,840 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:29,076 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 175 proven. 31 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-10 02:06:29,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:29,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 46 [2019-09-10 02:06:29,079 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:29,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-10 02:06:29,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-10 02:06:29,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=1683, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 02:06:29,080 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand 46 states. [2019-09-10 02:06:30,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:30,411 INFO L93 Difference]: Finished difference Result 361 states and 443 transitions. [2019-09-10 02:06:30,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-10 02:06:30,411 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 96 [2019-09-10 02:06:30,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:30,413 INFO L225 Difference]: With dead ends: 361 [2019-09-10 02:06:30,414 INFO L226 Difference]: Without dead ends: 329 [2019-09-10 02:06:30,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 150 SyntacticMatches, 24 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3793 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1725, Invalid=7781, Unknown=0, NotChecked=0, Total=9506 [2019-09-10 02:06:30,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-09-10 02:06:30,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 120. [2019-09-10 02:06:30,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-10 02:06:30,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2019-09-10 02:06:30,420 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 96 [2019-09-10 02:06:30,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:30,421 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2019-09-10 02:06:30,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-10 02:06:30,421 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2019-09-10 02:06:30,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 02:06:30,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:30,422 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:06:30,422 INFO L418 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:30,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:30,422 INFO L82 PathProgramCache]: Analyzing trace with hash -252097618, now seen corresponding path program 41 times [2019-09-10 02:06:30,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:30,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:30,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:30,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:30,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:30,742 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 175 proven. 30 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-10 02:06:30,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:30,742 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:30,743 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:30,743 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:30,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:30,743 INFO L193 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 [2019-09-10 02:06:30,761 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:06:30,761 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:06:30,796 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-10 02:06:30,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:06:30,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-10 02:06:30,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:31,208 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 175 proven. 30 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-10 02:06:31,208 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:31,494 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 175 proven. 30 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-10 02:06:31,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:31,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 45 [2019-09-10 02:06:31,498 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:31,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-10 02:06:31,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-10 02:06:31,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=1610, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 02:06:31,499 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand 45 states. [2019-09-10 02:06:32,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:32,837 INFO L93 Difference]: Finished difference Result 400 states and 494 transitions. [2019-09-10 02:06:32,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-10 02:06:32,837 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 96 [2019-09-10 02:06:32,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:32,839 INFO L225 Difference]: With dead ends: 400 [2019-09-10 02:06:32,839 INFO L226 Difference]: Without dead ends: 368 [2019-09-10 02:06:32,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 151 SyntacticMatches, 24 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3835 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1759, Invalid=7943, Unknown=0, NotChecked=0, Total=9702 [2019-09-10 02:06:32,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-09-10 02:06:32,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 120. [2019-09-10 02:06:32,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-10 02:06:32,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2019-09-10 02:06:32,845 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 96 [2019-09-10 02:06:32,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:32,845 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2019-09-10 02:06:32,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-10 02:06:32,845 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2019-09-10 02:06:32,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 02:06:32,846 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:32,846 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:06:32,846 INFO L418 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:32,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:32,847 INFO L82 PathProgramCache]: Analyzing trace with hash -271306033, now seen corresponding path program 42 times [2019-09-10 02:06:32,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:32,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:32,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:06:32,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:32,848 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:32,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:33,246 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 175 proven. 31 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-10 02:06:33,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:33,246 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:33,247 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:33,247 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:33,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:33,247 INFO L193 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 [2019-09-10 02:06:33,274 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:06:33,274 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:06:33,321 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:06:33,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:06:33,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-10 02:06:33,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:33,911 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 175 proven. 31 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-10 02:06:33,911 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:34,136 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 175 proven. 31 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-10 02:06:34,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:34,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 44 [2019-09-10 02:06:34,139 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:34,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-10 02:06:34,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-10 02:06:34,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=1535, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 02:06:34,140 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand 44 states. [2019-09-10 02:06:35,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:35,413 INFO L93 Difference]: Finished difference Result 438 states and 544 transitions. [2019-09-10 02:06:35,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-10 02:06:35,414 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 96 [2019-09-10 02:06:35,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:35,416 INFO L225 Difference]: With dead ends: 438 [2019-09-10 02:06:35,416 INFO L226 Difference]: Without dead ends: 406 [2019-09-10 02:06:35,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 152 SyntacticMatches, 24 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3731 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1725, Invalid=7781, Unknown=0, NotChecked=0, Total=9506 [2019-09-10 02:06:35,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-09-10 02:06:35,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 120. [2019-09-10 02:06:35,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-10 02:06:35,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2019-09-10 02:06:35,421 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 96 [2019-09-10 02:06:35,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:35,422 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2019-09-10 02:06:35,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-10 02:06:35,422 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2019-09-10 02:06:35,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 02:06:35,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:35,422 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:06:35,422 INFO L418 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:35,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:35,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1113547662, now seen corresponding path program 43 times [2019-09-10 02:06:35,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:35,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:35,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:06:35,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:35,424 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:35,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:35,711 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 175 proven. 34 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-10 02:06:35,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:35,711 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:35,711 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:35,711 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:35,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:35,711 INFO L193 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 [2019-09-10 02:06:35,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:35,721 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:06:35,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:35,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-10 02:06:35,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:36,106 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 175 proven. 34 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-10 02:06:36,106 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:36,332 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 175 proven. 34 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (72)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 02:06:36,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:36,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 43 [2019-09-10 02:06:36,337 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:36,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-10 02:06:36,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-10 02:06:36,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=1458, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 02:06:36,338 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand 43 states. [2019-09-10 02:06:37,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:37,582 INFO L93 Difference]: Finished difference Result 475 states and 593 transitions. [2019-09-10 02:06:37,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-10 02:06:37,583 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 96 [2019-09-10 02:06:37,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:37,586 INFO L225 Difference]: With dead ends: 475 [2019-09-10 02:06:37,586 INFO L226 Difference]: Without dead ends: 443 [2019-09-10 02:06:37,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 153 SyntacticMatches, 24 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3478 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1626, Invalid=7304, Unknown=0, NotChecked=0, Total=8930 [2019-09-10 02:06:37,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-09-10 02:06:37,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 120. [2019-09-10 02:06:37,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-10 02:06:37,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2019-09-10 02:06:37,594 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 96 [2019-09-10 02:06:37,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:37,594 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2019-09-10 02:06:37,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-10 02:06:37,594 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2019-09-10 02:06:37,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 02:06:37,595 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:37,595 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:06:37,595 INFO L418 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:37,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:37,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1889820945, now seen corresponding path program 44 times [2019-09-10 02:06:37,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:37,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:37,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:37,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:37,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:37,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:37,867 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 175 proven. 39 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-10 02:06:37,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:37,868 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:37,868 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:37,868 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:37,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:37,868 INFO L193 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 [2019-09-10 02:06:37,880 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:06:37,880 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:06:37,917 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-10 02:06:37,917 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:06:37,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-10 02:06:37,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:38,266 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 175 proven. 39 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-10 02:06:38,266 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:38,487 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 175 proven. 39 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-10 02:06:38,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:38,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 42 [2019-09-10 02:06:38,491 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:38,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-10 02:06:38,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-10 02:06:38,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=1379, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 02:06:38,492 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand 42 states. [2019-09-10 02:06:39,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:39,625 INFO L93 Difference]: Finished difference Result 511 states and 641 transitions. [2019-09-10 02:06:39,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-10 02:06:39,626 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 96 [2019-09-10 02:06:39,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:39,629 INFO L225 Difference]: With dead ends: 511 [2019-09-10 02:06:39,629 INFO L226 Difference]: Without dead ends: 479 [2019-09-10 02:06:39,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 154 SyntacticMatches, 24 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3084 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1471, Invalid=6539, Unknown=0, NotChecked=0, Total=8010 [2019-09-10 02:06:39,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-09-10 02:06:39,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 120. [2019-09-10 02:06:39,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-10 02:06:39,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2019-09-10 02:06:39,637 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 96 [2019-09-10 02:06:39,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:39,638 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2019-09-10 02:06:39,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-10 02:06:39,638 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2019-09-10 02:06:39,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 02:06:39,638 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:39,638 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:06:39,639 INFO L418 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:39,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:39,639 INFO L82 PathProgramCache]: Analyzing trace with hash -601230482, now seen corresponding path program 45 times [2019-09-10 02:06:39,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:39,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:39,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:06:39,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:39,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:39,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:39,896 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 175 proven. 46 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-10 02:06:39,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:39,896 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:39,896 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:39,896 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:39,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:39,897 INFO L193 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 [2019-09-10 02:06:39,907 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:06:39,907 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:06:39,947 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:06:39,947 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:06:39,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-10 02:06:39,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:40,383 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 175 proven. 46 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-10 02:06:40,383 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:40,627 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 175 proven. 46 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-10 02:06:40,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:40,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 41 [2019-09-10 02:06:40,630 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:40,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-10 02:06:40,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-10 02:06:40,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=1298, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 02:06:40,631 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand 41 states. [2019-09-10 02:06:41,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:41,662 INFO L93 Difference]: Finished difference Result 546 states and 688 transitions. [2019-09-10 02:06:41,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-10 02:06:41,663 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 96 [2019-09-10 02:06:41,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:41,666 INFO L225 Difference]: With dead ends: 546 [2019-09-10 02:06:41,666 INFO L226 Difference]: Without dead ends: 514 [2019-09-10 02:06:41,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 155 SyntacticMatches, 24 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2569 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1275, Invalid=5531, Unknown=0, NotChecked=0, Total=6806 [2019-09-10 02:06:41,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-09-10 02:06:41,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 120. [2019-09-10 02:06:41,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-10 02:06:41,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2019-09-10 02:06:41,675 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 96 [2019-09-10 02:06:41,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:41,675 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2019-09-10 02:06:41,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-10 02:06:41,676 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2019-09-10 02:06:41,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 02:06:41,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:41,676 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:06:41,677 INFO L418 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:41,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:41,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1945136369, now seen corresponding path program 10 times [2019-09-10 02:06:41,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:41,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:41,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:06:41,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:41,679 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:41,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:41,976 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 175 proven. 55 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-10 02:06:41,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:41,976 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:41,976 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:41,976 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:41,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:41,977 INFO L193 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 [2019-09-10 02:06:41,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:41,986 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:06:42,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:42,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-10 02:06:42,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:42,348 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 175 proven. 55 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-10 02:06:42,348 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:42,558 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 175 proven. 55 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-10 02:06:42,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:42,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 40 [2019-09-10 02:06:42,561 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:42,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-10 02:06:42,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-10 02:06:42,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=1215, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 02:06:42,562 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand 40 states. [2019-09-10 02:06:43,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:43,474 INFO L93 Difference]: Finished difference Result 583 states and 738 transitions. [2019-09-10 02:06:43,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-10 02:06:43,475 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 96 [2019-09-10 02:06:43,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:43,478 INFO L225 Difference]: With dead ends: 583 [2019-09-10 02:06:43,478 INFO L226 Difference]: Without dead ends: 551 [2019-09-10 02:06:43,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 156 SyntacticMatches, 24 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1965 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1059, Invalid=4343, Unknown=0, NotChecked=0, Total=5402 [2019-09-10 02:06:43,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-09-10 02:06:43,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 122. [2019-09-10 02:06:43,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-10 02:06:43,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 135 transitions. [2019-09-10 02:06:43,485 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 135 transitions. Word has length 96 [2019-09-10 02:06:43,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:43,486 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 135 transitions. [2019-09-10 02:06:43,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-10 02:06:43,486 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 135 transitions. [2019-09-10 02:06:43,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 02:06:43,487 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:43,487 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:06:43,487 INFO L418 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:43,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:43,487 INFO L82 PathProgramCache]: Analyzing trace with hash 699102727, now seen corresponding path program 20 times [2019-09-10 02:06:43,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:43,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:43,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:43,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:43,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:43,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:43,635 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 86 proven. 155 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-10 02:06:43,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:43,636 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:43,636 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:43,636 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:43,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:43,637 INFO L193 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) [2019-09-10 02:06:43,656 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:06:43,656 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:43,696 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-10 02:06:43,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:06:43,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-10 02:06:43,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:43,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:06:43,733 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 86 proven. 155 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-10 02:06:43,734 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:43,875 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 86 proven. 155 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-10 02:06:43,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:43,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 18 [2019-09-10 02:06:43,878 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:43,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 02:06:43,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 02:06:43,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2019-09-10 02:06:43,879 INFO L87 Difference]: Start difference. First operand 122 states and 135 transitions. Second operand 18 states. [2019-09-10 02:06:44,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:44,095 INFO L93 Difference]: Finished difference Result 133 states and 147 transitions. [2019-09-10 02:06:44,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 02:06:44,096 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 97 [2019-09-10 02:06:44,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:44,097 INFO L225 Difference]: With dead ends: 133 [2019-09-10 02:06:44,097 INFO L226 Difference]: Without dead ends: 133 [2019-09-10 02:06:44,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 181 SyntacticMatches, 22 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2019-09-10 02:06:44,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-10 02:06:44,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2019-09-10 02:06:44,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-09-10 02:06:44,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 142 transitions. [2019-09-10 02:06:44,100 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 142 transitions. Word has length 97 [2019-09-10 02:06:44,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:44,100 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 142 transitions. [2019-09-10 02:06:44,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 02:06:44,101 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 142 transitions. [2019-09-10 02:06:44,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 02:06:44,101 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:44,101 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:06:44,102 INFO L418 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:44,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:44,102 INFO L82 PathProgramCache]: Analyzing trace with hash 198195664, now seen corresponding path program 21 times [2019-09-10 02:06:44,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:44,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:44,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:06:44,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:44,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:44,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:44,446 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 209 proven. 66 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-10 02:06:44,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:44,447 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:44,447 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:44,447 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:44,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:44,447 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:44,458 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:06:44,458 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:06:44,489 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:06:44,489 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:06:44,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-10 02:06:44,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:45,024 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 209 proven. 66 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-10 02:06:45,024 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:45,309 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 209 proven. 66 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-10 02:06:45,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:45,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 54 [2019-09-10 02:06:45,312 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:45,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-10 02:06:45,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-10 02:06:45,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=2287, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 02:06:45,314 INFO L87 Difference]: Start difference. First operand 129 states and 142 transitions. Second operand 54 states. [2019-09-10 02:06:46,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:46,269 INFO L93 Difference]: Finished difference Result 212 states and 249 transitions. [2019-09-10 02:06:46,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 02:06:46,270 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 104 [2019-09-10 02:06:46,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:46,271 INFO L225 Difference]: With dead ends: 212 [2019-09-10 02:06:46,271 INFO L226 Difference]: Without dead ends: 177 [2019-09-10 02:06:46,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 158 SyntacticMatches, 26 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2990 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1225, Invalid=5095, Unknown=0, NotChecked=0, Total=6320 [2019-09-10 02:06:46,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-09-10 02:06:46,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 130. [2019-09-10 02:06:46,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-10 02:06:46,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2019-09-10 02:06:46,275 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 104 [2019-09-10 02:06:46,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:46,275 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2019-09-10 02:06:46,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-10 02:06:46,275 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2019-09-10 02:06:46,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 02:06:46,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:46,276 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:06:46,277 INFO L418 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:46,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:46,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1111773105, now seen corresponding path program 46 times [2019-09-10 02:06:46,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:46,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:46,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:06:46,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:46,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:46,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:46,574 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 209 proven. 56 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-10 02:06:46,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:46,575 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:46,575 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:46,575 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:46,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:46,575 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:46,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:46,585 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:06:46,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:46,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-10 02:06:46,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:47,121 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 209 proven. 56 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-10 02:06:47,121 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:47,374 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 209 proven. 56 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (78)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 02:06:47,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:47,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 53 [2019-09-10 02:06:47,377 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:47,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-10 02:06:47,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-10 02:06:47,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=539, Invalid=2217, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 02:06:47,379 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand 53 states. [2019-09-10 02:06:48,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:48,690 INFO L93 Difference]: Finished difference Result 259 states and 309 transitions. [2019-09-10 02:06:48,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-10 02:06:48,691 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2019-09-10 02:06:48,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:48,692 INFO L225 Difference]: With dead ends: 259 [2019-09-10 02:06:48,692 INFO L226 Difference]: Without dead ends: 224 [2019-09-10 02:06:48,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 159 SyntacticMatches, 26 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3510 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1485, Invalid=6525, Unknown=0, NotChecked=0, Total=8010 [2019-09-10 02:06:48,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-09-10 02:06:48,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 130. [2019-09-10 02:06:48,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-10 02:06:48,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2019-09-10 02:06:48,697 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 104 [2019-09-10 02:06:48,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:48,697 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2019-09-10 02:06:48,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-10 02:06:48,697 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2019-09-10 02:06:48,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 02:06:48,698 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:48,698 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:06:48,698 INFO L418 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:48,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:48,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1062727152, now seen corresponding path program 47 times [2019-09-10 02:06:48,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:48,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:48,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:48,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:48,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:49,017 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 209 proven. 48 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-10 02:06:49,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:49,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:49,018 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:49,018 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:49,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:49,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:49,028 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:06:49,028 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:06:49,066 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-10 02:06:49,066 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:06:49,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-10 02:06:49,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:49,681 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 209 proven. 48 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-10 02:06:49,681 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:49,929 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 209 proven. 48 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-10 02:06:49,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:49,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 52 [2019-09-10 02:06:49,932 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:49,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-10 02:06:49,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-10 02:06:49,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=507, Invalid=2145, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:06:49,934 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand 52 states. [2019-09-10 02:06:51,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:51,424 INFO L93 Difference]: Finished difference Result 305 states and 368 transitions. [2019-09-10 02:06:51,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-10 02:06:51,425 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 104 [2019-09-10 02:06:51,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:51,427 INFO L225 Difference]: With dead ends: 305 [2019-09-10 02:06:51,427 INFO L226 Difference]: Without dead ends: 270 [2019-09-10 02:06:51,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 160 SyntacticMatches, 26 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3996 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1729, Invalid=7777, Unknown=0, NotChecked=0, Total=9506 [2019-09-10 02:06:51,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-09-10 02:06:51,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 130. [2019-09-10 02:06:51,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-10 02:06:51,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2019-09-10 02:06:51,431 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 104 [2019-09-10 02:06:51,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:51,431 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2019-09-10 02:06:51,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-10 02:06:51,431 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2019-09-10 02:06:51,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 02:06:51,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:51,432 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:06:51,432 INFO L418 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:51,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:51,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1638074321, now seen corresponding path program 48 times [2019-09-10 02:06:51,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:51,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:51,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:06:51,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:51,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:51,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:51,751 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 209 proven. 42 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-10 02:06:51,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:51,752 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:51,752 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:51,752 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:51,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:51,752 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:51,762 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:06:51,762 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:06:51,795 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:06:51,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:06:51,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-10 02:06:51,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:52,276 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 209 proven. 42 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-10 02:06:52,277 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:52,611 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 209 proven. 42 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-10 02:06:52,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:52,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 51 [2019-09-10 02:06:52,617 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:52,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-10 02:06:52,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-10 02:06:52,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=2071, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 02:06:52,618 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand 51 states. [2019-09-10 02:06:53,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:53,945 INFO L93 Difference]: Finished difference Result 350 states and 426 transitions. [2019-09-10 02:06:53,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-10 02:06:53,945 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 104 [2019-09-10 02:06:53,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:53,947 INFO L225 Difference]: With dead ends: 350 [2019-09-10 02:06:53,948 INFO L226 Difference]: Without dead ends: 315 [2019-09-10 02:06:53,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 161 SyntacticMatches, 26 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4398 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1933, Invalid=8779, Unknown=0, NotChecked=0, Total=10712 [2019-09-10 02:06:53,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-09-10 02:06:53,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 130. [2019-09-10 02:06:53,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-10 02:06:53,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2019-09-10 02:06:53,952 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 104 [2019-09-10 02:06:53,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:53,952 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2019-09-10 02:06:53,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-10 02:06:53,952 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2019-09-10 02:06:53,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 02:06:53,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:53,953 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:06:53,953 INFO L418 AbstractCegarLoop]: === Iteration 82 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:53,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:53,954 INFO L82 PathProgramCache]: Analyzing trace with hash -478270960, now seen corresponding path program 49 times [2019-09-10 02:06:53,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:53,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:53,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:06:53,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:53,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:53,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:54,306 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 209 proven. 38 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-10 02:06:54,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:54,306 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:54,306 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:54,306 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:54,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:54,307 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:54,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:54,316 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:06:54,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:54,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-10 02:06:54,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:54,822 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 209 proven. 38 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-10 02:06:54,822 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:55,109 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 209 proven. 38 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-10 02:06:55,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:55,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 50 [2019-09-10 02:06:55,112 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:55,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-10 02:06:55,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-10 02:06:55,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=455, Invalid=1995, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 02:06:55,114 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand 50 states. [2019-09-10 02:06:56,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:56,585 INFO L93 Difference]: Finished difference Result 394 states and 483 transitions. [2019-09-10 02:06:56,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-10 02:06:56,585 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 104 [2019-09-10 02:06:56,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:56,588 INFO L225 Difference]: With dead ends: 394 [2019-09-10 02:06:56,588 INFO L226 Difference]: Without dead ends: 359 [2019-09-10 02:06:56,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 162 SyntacticMatches, 26 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4678 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2079, Invalid=9477, Unknown=0, NotChecked=0, Total=11556 [2019-09-10 02:06:56,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-09-10 02:06:56,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 130. [2019-09-10 02:06:56,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-10 02:06:56,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2019-09-10 02:06:56,594 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 104 [2019-09-10 02:06:56,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:56,594 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2019-09-10 02:06:56,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-10 02:06:56,594 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2019-09-10 02:06:56,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 02:06:56,595 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:56,595 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:06:56,595 INFO L418 AbstractCegarLoop]: === Iteration 83 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:56,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:56,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1133594609, now seen corresponding path program 50 times [2019-09-10 02:06:56,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:56,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:56,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:56,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:56,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:56,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:56,880 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 209 proven. 36 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-10 02:06:56,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:56,881 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:56,881 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:56,881 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:56,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:56,881 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:56,891 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:06:56,891 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:06:56,935 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-10 02:06:56,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:06:56,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-10 02:06:56,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:57,401 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 209 proven. 36 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-10 02:06:57,401 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:57,645 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 209 proven. 36 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-10 02:06:57,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:57,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 49 [2019-09-10 02:06:57,648 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:57,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-10 02:06:57,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-10 02:06:57,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1917, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 02:06:57,649 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand 49 states. [2019-09-10 02:06:59,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:59,077 INFO L93 Difference]: Finished difference Result 437 states and 539 transitions. [2019-09-10 02:06:59,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-10 02:06:59,078 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 104 [2019-09-10 02:06:59,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:59,080 INFO L225 Difference]: With dead ends: 437 [2019-09-10 02:06:59,080 INFO L226 Difference]: Without dead ends: 402 [2019-09-10 02:06:59,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 163 SyntacticMatches, 26 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4810 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2155, Invalid=9835, Unknown=0, NotChecked=0, Total=11990 [2019-09-10 02:06:59,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-09-10 02:06:59,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 130. [2019-09-10 02:06:59,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-10 02:06:59,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2019-09-10 02:06:59,086 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 104 [2019-09-10 02:06:59,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:59,086 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2019-09-10 02:06:59,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-10 02:06:59,086 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2019-09-10 02:06:59,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 02:06:59,087 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:59,087 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:06:59,087 INFO L418 AbstractCegarLoop]: === Iteration 84 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:59,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:59,087 INFO L82 PathProgramCache]: Analyzing trace with hash 507833904, now seen corresponding path program 51 times [2019-09-10 02:06:59,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:59,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:59,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:06:59,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:59,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:59,411 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 209 proven. 36 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-10 02:06:59,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:59,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:59,411 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:59,411 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:59,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:59,412 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:59,421 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:06:59,421 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:06:59,454 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:06:59,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:06:59,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-10 02:06:59,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:59,927 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 209 proven. 36 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-10 02:06:59,927 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:00,168 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 209 proven. 36 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-10 02:07:00,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:00,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 48 [2019-09-10 02:07:00,171 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:00,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-10 02:07:00,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-10 02:07:00,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1837, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 02:07:00,172 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand 48 states. [2019-09-10 02:07:01,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:01,628 INFO L93 Difference]: Finished difference Result 479 states and 594 transitions. [2019-09-10 02:07:01,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-10 02:07:01,628 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 104 [2019-09-10 02:07:01,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:01,631 INFO L225 Difference]: With dead ends: 479 [2019-09-10 02:07:01,631 INFO L226 Difference]: Without dead ends: 444 [2019-09-10 02:07:01,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 164 SyntacticMatches, 26 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4780 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2155, Invalid=9835, Unknown=0, NotChecked=0, Total=11990 [2019-09-10 02:07:01,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2019-09-10 02:07:01,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 130. [2019-09-10 02:07:01,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-10 02:07:01,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2019-09-10 02:07:01,637 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 104 [2019-09-10 02:07:01,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:01,638 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2019-09-10 02:07:01,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-10 02:07:01,638 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2019-09-10 02:07:01,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 02:07:01,639 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:01,639 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:01,639 INFO L418 AbstractCegarLoop]: === Iteration 85 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:01,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:01,639 INFO L82 PathProgramCache]: Analyzing trace with hash 699330543, now seen corresponding path program 52 times [2019-09-10 02:07:01,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:01,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:01,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:01,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:01,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:01,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:01,935 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 209 proven. 38 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-10 02:07:01,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:01,935 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:01,935 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:01,935 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:01,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:01,935 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:01,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:01,945 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:07:01,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:01,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-10 02:07:01,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:02,552 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 209 proven. 38 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-10 02:07:02,552 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:02,831 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 209 proven. 38 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-10 02:07:02,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:02,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 47 [2019-09-10 02:07:02,835 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:02,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-10 02:07:02,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-10 02:07:02,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=1755, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 02:07:02,836 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand 47 states. [2019-09-10 02:07:04,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:04,210 INFO L93 Difference]: Finished difference Result 520 states and 648 transitions. [2019-09-10 02:07:04,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-10 02:07:04,213 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 104 [2019-09-10 02:07:04,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:04,216 INFO L225 Difference]: With dead ends: 520 [2019-09-10 02:07:04,216 INFO L226 Difference]: Without dead ends: 485 [2019-09-10 02:07:04,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 165 SyntacticMatches, 26 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4582 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2079, Invalid=9477, Unknown=0, NotChecked=0, Total=11556 [2019-09-10 02:07:04,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2019-09-10 02:07:04,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 130. [2019-09-10 02:07:04,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-10 02:07:04,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2019-09-10 02:07:04,226 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 104 [2019-09-10 02:07:04,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:04,226 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2019-09-10 02:07:04,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-10 02:07:04,227 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2019-09-10 02:07:04,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 02:07:04,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:04,228 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:04,230 INFO L418 AbstractCegarLoop]: === Iteration 86 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:04,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:04,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1372702128, now seen corresponding path program 53 times [2019-09-10 02:07:04,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:04,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:04,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:04,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:04,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:04,641 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 209 proven. 42 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-10 02:07:04,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:04,642 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:04,644 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:04,644 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:04,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:04,645 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:04,659 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:07:04,660 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:07:04,718 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-10 02:07:04,719 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:04,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-10 02:07:04,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:05,228 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 209 proven. 42 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-10 02:07:05,228 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:05,480 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 209 proven. 42 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-10 02:07:05,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:05,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 46 [2019-09-10 02:07:05,484 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:05,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-10 02:07:05,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-10 02:07:05,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1671, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 02:07:05,485 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand 46 states. [2019-09-10 02:07:06,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:06,921 INFO L93 Difference]: Finished difference Result 560 states and 701 transitions. [2019-09-10 02:07:06,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-10 02:07:06,922 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 104 [2019-09-10 02:07:06,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:06,925 INFO L225 Difference]: With dead ends: 560 [2019-09-10 02:07:06,925 INFO L226 Difference]: Without dead ends: 525 [2019-09-10 02:07:06,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 166 SyntacticMatches, 26 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4218 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1933, Invalid=8779, Unknown=0, NotChecked=0, Total=10712 [2019-09-10 02:07:06,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2019-09-10 02:07:06,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 130. [2019-09-10 02:07:06,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-10 02:07:06,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2019-09-10 02:07:06,934 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 104 [2019-09-10 02:07:06,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:06,934 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2019-09-10 02:07:06,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-10 02:07:06,934 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2019-09-10 02:07:06,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 02:07:06,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:06,935 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:06,935 INFO L418 AbstractCegarLoop]: === Iteration 87 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:06,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:06,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1331404751, now seen corresponding path program 54 times [2019-09-10 02:07:06,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:06,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:06,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:06,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:06,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:06,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:07,245 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 209 proven. 48 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-10 02:07:07,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:07,245 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:07,245 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:07,245 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:07,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:07,246 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:07,258 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:07:07,258 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:07:07,289 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:07:07,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:07,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-10 02:07:07,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:07,691 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 209 proven. 48 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-10 02:07:07,692 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:07,953 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 209 proven. 48 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-10 02:07:07,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:07,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 45 [2019-09-10 02:07:07,956 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:07,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-10 02:07:07,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-10 02:07:07,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=1585, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 02:07:07,957 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand 45 states. [2019-09-10 02:07:09,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:09,287 INFO L93 Difference]: Finished difference Result 599 states and 753 transitions. [2019-09-10 02:07:09,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-10 02:07:09,287 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 104 [2019-09-10 02:07:09,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:09,291 INFO L225 Difference]: With dead ends: 599 [2019-09-10 02:07:09,291 INFO L226 Difference]: Without dead ends: 564 [2019-09-10 02:07:09,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 167 SyntacticMatches, 26 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3702 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1729, Invalid=7777, Unknown=0, NotChecked=0, Total=9506 [2019-09-10 02:07:09,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-09-10 02:07:09,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 130. [2019-09-10 02:07:09,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-10 02:07:09,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2019-09-10 02:07:09,298 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 104 [2019-09-10 02:07:09,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:09,298 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2019-09-10 02:07:09,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-10 02:07:09,298 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2019-09-10 02:07:09,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 02:07:09,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:09,299 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:09,299 INFO L418 AbstractCegarLoop]: === Iteration 88 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:09,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:09,300 INFO L82 PathProgramCache]: Analyzing trace with hash 171708016, now seen corresponding path program 55 times [2019-09-10 02:07:09,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:09,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:09,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:09,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:09,301 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:09,610 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 209 proven. 56 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-10 02:07:09,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:09,611 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:09,611 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:09,611 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:09,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:09,611 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:09,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:09,622 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:07:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:09,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-10 02:07:09,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:10,011 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 209 proven. 56 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-10 02:07:10,011 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:10,282 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 209 proven. 56 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (87)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 02:07:10,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:10,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 44 [2019-09-10 02:07:10,285 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:10,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-10 02:07:10,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-10 02:07:10,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=1497, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 02:07:10,286 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand 44 states. [2019-09-10 02:07:11,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:11,399 INFO L93 Difference]: Finished difference Result 637 states and 804 transitions. [2019-09-10 02:07:11,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-10 02:07:11,399 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 104 [2019-09-10 02:07:11,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:11,403 INFO L225 Difference]: With dead ends: 637 [2019-09-10 02:07:11,403 INFO L226 Difference]: Without dead ends: 602 [2019-09-10 02:07:11,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 168 SyntacticMatches, 26 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3060 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1485, Invalid=6525, Unknown=0, NotChecked=0, Total=8010 [2019-09-10 02:07:11,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-09-10 02:07:11,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 130. [2019-09-10 02:07:11,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-10 02:07:11,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2019-09-10 02:07:11,412 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 104 [2019-09-10 02:07:11,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:11,413 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2019-09-10 02:07:11,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-10 02:07:11,413 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2019-09-10 02:07:11,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 02:07:11,413 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:11,414 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:11,414 INFO L418 AbstractCegarLoop]: === Iteration 89 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:11,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:11,414 INFO L82 PathProgramCache]: Analyzing trace with hash -835532881, now seen corresponding path program 11 times [2019-09-10 02:07:11,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:11,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:11,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:11,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:11,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:11,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:11,698 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 209 proven. 66 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-10 02:07:11,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:11,698 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:11,698 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:11,698 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:11,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:11,698 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:11,708 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:07:11,708 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:07:11,753 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-10 02:07:11,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:11,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-10 02:07:11,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:12,139 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 209 proven. 66 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-10 02:07:12,139 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:12,384 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 209 proven. 66 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-10 02:07:12,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:12,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 43 [2019-09-10 02:07:12,388 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:12,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-10 02:07:12,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-10 02:07:12,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1407, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 02:07:12,389 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand 43 states. [2019-09-10 02:07:13,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:13,314 INFO L93 Difference]: Finished difference Result 677 states and 858 transitions. [2019-09-10 02:07:13,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-10 02:07:13,314 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 104 [2019-09-10 02:07:13,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:13,317 INFO L225 Difference]: With dead ends: 677 [2019-09-10 02:07:13,317 INFO L226 Difference]: Without dead ends: 642 [2019-09-10 02:07:13,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 169 SyntacticMatches, 26 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2330 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1225, Invalid=5095, Unknown=0, NotChecked=0, Total=6320 [2019-09-10 02:07:13,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-09-10 02:07:13,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 132. [2019-09-10 02:07:13,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-09-10 02:07:13,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 146 transitions. [2019-09-10 02:07:13,324 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 146 transitions. Word has length 104 [2019-09-10 02:07:13,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:13,325 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 146 transitions. [2019-09-10 02:07:13,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-10 02:07:13,325 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 146 transitions. [2019-09-10 02:07:13,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 02:07:13,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:13,325 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:13,325 INFO L418 AbstractCegarLoop]: === Iteration 90 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:13,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:13,326 INFO L82 PathProgramCache]: Analyzing trace with hash -383682200, now seen corresponding path program 22 times [2019-09-10 02:07:13,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:13,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:13,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:13,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:13,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:13,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:13,454 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 100 proven. 187 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-10 02:07:13,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:13,454 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:13,454 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:13,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:13,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:13,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:13,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:13,465 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:07:13,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:13,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-10 02:07:13,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:13,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:07:13,523 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 100 proven. 187 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-10 02:07:13,523 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:13,669 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 100 proven. 187 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-10 02:07:13,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:13,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 19 [2019-09-10 02:07:13,672 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:13,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 02:07:13,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 02:07:13,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-09-10 02:07:13,673 INFO L87 Difference]: Start difference. First operand 132 states and 146 transitions. Second operand 19 states. [2019-09-10 02:07:13,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:13,898 INFO L93 Difference]: Finished difference Result 143 states and 158 transitions. [2019-09-10 02:07:13,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 02:07:13,899 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 105 [2019-09-10 02:07:13,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:13,900 INFO L225 Difference]: With dead ends: 143 [2019-09-10 02:07:13,900 INFO L226 Difference]: Without dead ends: 143 [2019-09-10 02:07:13,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 196 SyntacticMatches, 24 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2019-09-10 02:07:13,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-09-10 02:07:13,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 139. [2019-09-10 02:07:13,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-09-10 02:07:13,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 153 transitions. [2019-09-10 02:07:13,903 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 153 transitions. Word has length 105 [2019-09-10 02:07:13,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:13,904 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 153 transitions. [2019-09-10 02:07:13,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 02:07:13,904 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 153 transitions. [2019-09-10 02:07:13,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 02:07:13,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:13,905 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:13,905 INFO L418 AbstractCegarLoop]: === Iteration 91 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:13,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:13,905 INFO L82 PathProgramCache]: Analyzing trace with hash 460511055, now seen corresponding path program 23 times [2019-09-10 02:07:13,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:13,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:13,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:13,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:13,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:14,254 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 246 proven. 78 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 02:07:14,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:14,255 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:14,255 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:14,255 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:14,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:14,255 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:14,265 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:07:14,265 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:07:14,309 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-10 02:07:14,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:14,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-10 02:07:14,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:14,911 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 246 proven. 78 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 02:07:14,911 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:15,205 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 246 proven. 78 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 02:07:15,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:15,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 58 [2019-09-10 02:07:15,208 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:15,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-10 02:07:15,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-10 02:07:15,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=661, Invalid=2645, Unknown=0, NotChecked=0, Total=3306 [2019-09-10 02:07:15,210 INFO L87 Difference]: Start difference. First operand 139 states and 153 transitions. Second operand 58 states. [2019-09-10 02:07:16,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:16,499 INFO L93 Difference]: Finished difference Result 229 states and 269 transitions. [2019-09-10 02:07:16,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 02:07:16,500 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2019-09-10 02:07:16,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:16,501 INFO L225 Difference]: With dead ends: 229 [2019-09-10 02:07:16,502 INFO L226 Difference]: Without dead ends: 191 [2019-09-10 02:07:16,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 170 SyntacticMatches, 28 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3506 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1403, Invalid=5907, Unknown=0, NotChecked=0, Total=7310 [2019-09-10 02:07:16,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-09-10 02:07:16,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 140. [2019-09-10 02:07:16,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-10 02:07:16,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2019-09-10 02:07:16,508 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 112 [2019-09-10 02:07:16,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:16,508 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2019-09-10 02:07:16,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-10 02:07:16,509 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2019-09-10 02:07:16,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 02:07:16,510 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:16,510 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:16,510 INFO L418 AbstractCegarLoop]: === Iteration 92 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:16,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:16,511 INFO L82 PathProgramCache]: Analyzing trace with hash -881107250, now seen corresponding path program 56 times [2019-09-10 02:07:16,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:16,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:16,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:16,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:16,512 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:16,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:17,167 INFO L134 CoverageAnalysis]: Checked inductivity of 577 backedges. 246 proven. 67 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 02:07:17,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:17,168 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:17,168 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:17,168 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:17,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:17,169 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:17,192 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:07:17,193 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:07:17,266 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-10 02:07:17,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:17,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-10 02:07:17,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:18,431 INFO L134 CoverageAnalysis]: Checked inductivity of 577 backedges. 246 proven. 67 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 02:07:18,432 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:18,990 INFO L134 CoverageAnalysis]: Checked inductivity of 577 backedges. 246 proven. 67 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 02:07:18,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:18,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 57 [2019-09-10 02:07:18,996 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:18,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-10 02:07:18,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-10 02:07:18,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=2570, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 02:07:18,999 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand 57 states. [2019-09-10 02:07:20,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:20,672 INFO L93 Difference]: Finished difference Result 280 states and 334 transitions. [2019-09-10 02:07:20,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-10 02:07:20,672 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2019-09-10 02:07:20,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:20,674 INFO L225 Difference]: With dead ends: 280 [2019-09-10 02:07:20,674 INFO L226 Difference]: Without dead ends: 242 [2019-09-10 02:07:20,675 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 171 SyntacticMatches, 28 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4134 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1711, Invalid=7601, Unknown=0, NotChecked=0, Total=9312 [2019-09-10 02:07:20,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-09-10 02:07:20,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 140. [2019-09-10 02:07:20,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-10 02:07:20,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2019-09-10 02:07:20,679 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 112 [2019-09-10 02:07:20,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:20,680 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2019-09-10 02:07:20,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-10 02:07:20,680 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2019-09-10 02:07:20,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 02:07:20,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:20,681 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:20,681 INFO L418 AbstractCegarLoop]: === Iteration 93 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:20,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:20,681 INFO L82 PathProgramCache]: Analyzing trace with hash 2123656047, now seen corresponding path program 57 times [2019-09-10 02:07:20,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:20,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:20,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:20,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:20,683 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:20,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:21,037 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 246 proven. 58 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 02:07:21,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:21,038 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:21,038 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:21,038 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:21,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:21,038 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:21,047 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:07:21,047 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:07:21,081 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:07:21,081 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:21,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-10 02:07:21,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:21,674 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 246 proven. 58 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 02:07:21,674 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:21,974 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 246 proven. 58 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 02:07:21,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:21,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 56 [2019-09-10 02:07:21,977 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:21,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-10 02:07:21,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-10 02:07:21,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=587, Invalid=2493, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 02:07:21,978 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand 56 states. [2019-09-10 02:07:23,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:23,042 INFO L93 Difference]: Finished difference Result 330 states and 398 transitions. [2019-09-10 02:07:23,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-10 02:07:23,042 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 112 [2019-09-10 02:07:23,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:23,044 INFO L225 Difference]: With dead ends: 330 [2019-09-10 02:07:23,044 INFO L226 Difference]: Without dead ends: 292 [2019-09-10 02:07:23,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 172 SyntacticMatches, 28 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4737 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2008, Invalid=9122, Unknown=0, NotChecked=0, Total=11130 [2019-09-10 02:07:23,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-09-10 02:07:23,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 140. [2019-09-10 02:07:23,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-10 02:07:23,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2019-09-10 02:07:23,048 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 112 [2019-09-10 02:07:23,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:23,049 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2019-09-10 02:07:23,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-10 02:07:23,049 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2019-09-10 02:07:23,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 02:07:23,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:23,050 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:23,050 INFO L418 AbstractCegarLoop]: === Iteration 94 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:23,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:23,050 INFO L82 PathProgramCache]: Analyzing trace with hash 835110574, now seen corresponding path program 58 times [2019-09-10 02:07:23,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:23,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:23,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:23,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:23,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:23,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:23,377 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 246 proven. 51 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 02:07:23,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:23,378 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:23,378 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:23,378 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:23,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:23,378 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:23,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:23,388 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:07:23,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:23,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-10 02:07:23,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:24,036 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 246 proven. 51 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 02:07:24,037 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:24,323 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 246 proven. 51 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 02:07:24,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:24,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 55 [2019-09-10 02:07:24,325 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:24,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-10 02:07:24,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-10 02:07:24,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=2414, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 02:07:24,327 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand 55 states. [2019-09-10 02:07:25,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:25,714 INFO L93 Difference]: Finished difference Result 379 states and 461 transitions. [2019-09-10 02:07:25,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-10 02:07:25,715 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 112 [2019-09-10 02:07:25,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:25,717 INFO L225 Difference]: With dead ends: 379 [2019-09-10 02:07:25,717 INFO L226 Difference]: Without dead ends: 341 [2019-09-10 02:07:25,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 173 SyntacticMatches, 28 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5259 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2267, Invalid=10389, Unknown=0, NotChecked=0, Total=12656 [2019-09-10 02:07:25,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-09-10 02:07:25,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 140. [2019-09-10 02:07:25,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-10 02:07:25,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2019-09-10 02:07:25,722 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 112 [2019-09-10 02:07:25,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:25,722 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2019-09-10 02:07:25,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-10 02:07:25,722 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2019-09-10 02:07:25,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 02:07:25,723 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:25,723 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 8, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:25,723 INFO L418 AbstractCegarLoop]: === Iteration 95 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:25,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:25,723 INFO L82 PathProgramCache]: Analyzing trace with hash 793544591, now seen corresponding path program 59 times [2019-09-10 02:07:25,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:25,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:25,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:25,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:25,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:25,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:26,046 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 246 proven. 46 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 02:07:26,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:26,047 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:26,047 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:26,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:26,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:26,047 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:26,057 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:07:26,057 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:07:26,097 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-10 02:07:26,098 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:26,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-10 02:07:26,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:26,664 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 246 proven. 46 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 02:07:26,664 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:26,982 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 246 proven. 46 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (94)] Exception during sending of exit command (exit): Stream closed [2019-09-10 02:07:26,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:26,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 54 [2019-09-10 02:07:26,985 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:26,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-10 02:07:26,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-10 02:07:26,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=529, Invalid=2333, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 02:07:26,987 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand 54 states. [2019-09-10 02:07:28,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:28,796 INFO L93 Difference]: Finished difference Result 427 states and 523 transitions. [2019-09-10 02:07:28,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-10 02:07:28,797 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 112 [2019-09-10 02:07:28,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:28,800 INFO L225 Difference]: With dead ends: 427 [2019-09-10 02:07:28,800 INFO L226 Difference]: Without dead ends: 389 [2019-09-10 02:07:28,801 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 174 SyntacticMatches, 28 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5656 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2467, Invalid=11339, Unknown=0, NotChecked=0, Total=13806 [2019-09-10 02:07:28,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-09-10 02:07:28,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 140. [2019-09-10 02:07:28,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-10 02:07:28,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2019-09-10 02:07:28,805 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 112 [2019-09-10 02:07:28,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:28,805 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2019-09-10 02:07:28,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-10 02:07:28,805 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2019-09-10 02:07:28,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 02:07:28,805 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:28,806 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:28,806 INFO L418 AbstractCegarLoop]: === Iteration 96 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:28,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:28,806 INFO L82 PathProgramCache]: Analyzing trace with hash 2039129742, now seen corresponding path program 60 times [2019-09-10 02:07:28,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:28,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:28,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:28,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:28,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:28,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:29,121 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 246 proven. 43 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 02:07:29,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:29,121 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:29,121 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:29,121 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:29,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:29,122 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:29,132 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:07:29,132 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:07:29,168 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:07:29,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:29,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-10 02:07:29,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:29,722 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 246 proven. 43 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 02:07:29,723 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:30,000 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 246 proven. 43 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 02:07:30,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:30,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 53 [2019-09-10 02:07:30,003 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:30,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-10 02:07:30,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-10 02:07:30,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=506, Invalid=2250, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 02:07:30,004 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand 53 states. [2019-09-10 02:07:31,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:31,889 INFO L93 Difference]: Finished difference Result 474 states and 584 transitions. [2019-09-10 02:07:31,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-10 02:07:31,890 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 112 [2019-09-10 02:07:31,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:31,892 INFO L225 Difference]: With dead ends: 474 [2019-09-10 02:07:31,893 INFO L226 Difference]: Without dead ends: 436 [2019-09-10 02:07:31,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 175 SyntacticMatches, 28 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5896 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2593, Invalid=11927, Unknown=0, NotChecked=0, Total=14520 [2019-09-10 02:07:31,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-09-10 02:07:31,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 140. [2019-09-10 02:07:31,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-10 02:07:31,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2019-09-10 02:07:31,898 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 112 [2019-09-10 02:07:31,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:31,898 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2019-09-10 02:07:31,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-10 02:07:31,898 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2019-09-10 02:07:31,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 02:07:31,899 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:31,899 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:31,900 INFO L418 AbstractCegarLoop]: === Iteration 97 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:31,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:31,900 INFO L82 PathProgramCache]: Analyzing trace with hash 832383919, now seen corresponding path program 61 times [2019-09-10 02:07:31,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:31,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:31,901 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:31,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:31,901 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:31,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:32,235 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 246 proven. 42 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 02:07:32,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:32,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:32,235 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:32,235 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:32,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:32,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:32,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:32,246 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:07:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:32,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-10 02:07:32,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:32,779 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 246 proven. 42 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 02:07:32,779 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:33,082 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 246 proven. 42 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 02:07:33,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:33,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 52 [2019-09-10 02:07:33,085 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:33,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-10 02:07:33,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-10 02:07:33,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=487, Invalid=2165, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:07:33,086 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand 52 states. [2019-09-10 02:07:34,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:34,740 INFO L93 Difference]: Finished difference Result 520 states and 644 transitions. [2019-09-10 02:07:34,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-10 02:07:34,741 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 112 [2019-09-10 02:07:34,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:34,743 INFO L225 Difference]: With dead ends: 520 [2019-09-10 02:07:34,743 INFO L226 Difference]: Without dead ends: 482 [2019-09-10 02:07:34,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 176 SyntacticMatches, 28 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5959 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2636, Invalid=12126, Unknown=0, NotChecked=0, Total=14762 [2019-09-10 02:07:34,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-09-10 02:07:34,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 140. [2019-09-10 02:07:34,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-10 02:07:34,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2019-09-10 02:07:34,750 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 112 [2019-09-10 02:07:34,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:34,751 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2019-09-10 02:07:34,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-10 02:07:34,751 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2019-09-10 02:07:34,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 02:07:34,751 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:34,752 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:34,752 INFO L418 AbstractCegarLoop]: === Iteration 98 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:34,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:34,752 INFO L82 PathProgramCache]: Analyzing trace with hash 377814638, now seen corresponding path program 62 times [2019-09-10 02:07:34,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:34,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:34,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:34,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:34,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:35,091 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 246 proven. 43 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 02:07:35,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:35,091 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:35,091 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:35,092 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:35,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:35,092 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:35,102 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:07:35,102 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:07:35,141 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-10 02:07:35,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:35,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-10 02:07:35,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:35,642 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 246 proven. 43 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 02:07:35,643 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:35,935 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 246 proven. 43 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 02:07:35,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:35,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 51 [2019-09-10 02:07:35,938 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:35,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-10 02:07:35,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-10 02:07:35,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=2078, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 02:07:35,939 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand 51 states. [2019-09-10 02:07:37,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:37,636 INFO L93 Difference]: Finished difference Result 565 states and 703 transitions. [2019-09-10 02:07:37,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-09-10 02:07:37,636 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 112 [2019-09-10 02:07:37,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:37,639 INFO L225 Difference]: With dead ends: 565 [2019-09-10 02:07:37,640 INFO L226 Difference]: Without dead ends: 527 [2019-09-10 02:07:37,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 177 SyntacticMatches, 28 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5836 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2593, Invalid=11927, Unknown=0, NotChecked=0, Total=14520 [2019-09-10 02:07:37,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-09-10 02:07:37,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 140. [2019-09-10 02:07:37,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-10 02:07:37,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2019-09-10 02:07:37,648 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 112 [2019-09-10 02:07:37,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:37,649 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2019-09-10 02:07:37,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-10 02:07:37,649 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2019-09-10 02:07:37,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 02:07:37,650 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:37,650 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 8, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:37,650 INFO L418 AbstractCegarLoop]: === Iteration 99 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:37,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:37,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1576511537, now seen corresponding path program 63 times [2019-09-10 02:07:37,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:37,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:37,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:37,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:37,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:37,949 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 246 proven. 46 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 02:07:37,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:37,949 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:37,949 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:37,949 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:37,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:37,950 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:37,961 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:07:37,961 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:07:37,996 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:07:37,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:37,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-10 02:07:37,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:38,485 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 246 proven. 46 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 02:07:38,485 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:38,759 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 246 proven. 46 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 02:07:38,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:38,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 50 [2019-09-10 02:07:38,762 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:38,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-10 02:07:38,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-10 02:07:38,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=1989, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 02:07:38,763 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand 50 states. [2019-09-10 02:07:40,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:40,409 INFO L93 Difference]: Finished difference Result 609 states and 761 transitions. [2019-09-10 02:07:40,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-10 02:07:40,410 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 112 [2019-09-10 02:07:40,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:40,413 INFO L225 Difference]: With dead ends: 609 [2019-09-10 02:07:40,413 INFO L226 Difference]: Without dead ends: 571 [2019-09-10 02:07:40,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 178 SyntacticMatches, 28 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5524 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2467, Invalid=11339, Unknown=0, NotChecked=0, Total=13806 [2019-09-10 02:07:40,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-09-10 02:07:40,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 140. [2019-09-10 02:07:40,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-10 02:07:40,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2019-09-10 02:07:40,420 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 112 [2019-09-10 02:07:40,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:40,420 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2019-09-10 02:07:40,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-10 02:07:40,420 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2019-09-10 02:07:40,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 02:07:40,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:40,421 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:40,421 INFO L418 AbstractCegarLoop]: === Iteration 100 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:40,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:40,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1408486990, now seen corresponding path program 64 times [2019-09-10 02:07:40,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:40,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:40,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:40,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:40,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:40,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:40,746 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 246 proven. 51 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 02:07:40,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:40,747 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:40,747 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:40,747 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:40,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:40,747 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:40,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:40,756 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:07:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:40,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-10 02:07:40,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:41,240 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 246 proven. 51 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 02:07:41,240 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:41,521 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 246 proven. 51 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 02:07:41,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:41,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 49 [2019-09-10 02:07:41,524 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:41,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-10 02:07:41,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-10 02:07:41,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=454, Invalid=1898, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 02:07:41,526 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand 49 states. [2019-09-10 02:07:43,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:43,148 INFO L93 Difference]: Finished difference Result 652 states and 818 transitions. [2019-09-10 02:07:43,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-10 02:07:43,149 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 112 [2019-09-10 02:07:43,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:43,152 INFO L225 Difference]: With dead ends: 652 [2019-09-10 02:07:43,152 INFO L226 Difference]: Without dead ends: 614 [2019-09-10 02:07:43,167 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 179 SyntacticMatches, 28 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5031 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2267, Invalid=10389, Unknown=0, NotChecked=0, Total=12656 [2019-09-10 02:07:43,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-09-10 02:07:43,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 140. [2019-09-10 02:07:43,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-10 02:07:43,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2019-09-10 02:07:43,173 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 112 [2019-09-10 02:07:43,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:43,173 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2019-09-10 02:07:43,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-10 02:07:43,174 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2019-09-10 02:07:43,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 02:07:43,174 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:43,174 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:43,174 INFO L418 AbstractCegarLoop]: === Iteration 101 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:43,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:43,175 INFO L82 PathProgramCache]: Analyzing trace with hash -711980049, now seen corresponding path program 65 times [2019-09-10 02:07:43,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:43,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:43,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:43,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:43,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:43,482 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 246 proven. 58 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 02:07:43,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:43,482 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:43,482 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:43,482 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:43,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:43,483 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:43,492 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:07:43,493 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:07:43,531 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-10 02:07:43,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:43,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-10 02:07:43,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:43,967 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 246 proven. 58 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 02:07:43,968 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:44,247 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 246 proven. 58 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 02:07:44,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:44,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 48 [2019-09-10 02:07:44,250 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:44,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-10 02:07:44,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-10 02:07:44,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=1805, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 02:07:44,252 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand 48 states. [2019-09-10 02:07:45,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:45,690 INFO L93 Difference]: Finished difference Result 694 states and 874 transitions. [2019-09-10 02:07:45,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-10 02:07:45,691 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 112 [2019-09-10 02:07:45,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:45,695 INFO L225 Difference]: With dead ends: 694 [2019-09-10 02:07:45,695 INFO L226 Difference]: Without dead ends: 656 [2019-09-10 02:07:45,696 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 180 SyntacticMatches, 28 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4377 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2008, Invalid=9122, Unknown=0, NotChecked=0, Total=11130 [2019-09-10 02:07:45,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2019-09-10 02:07:45,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 140. [2019-09-10 02:07:45,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-10 02:07:45,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2019-09-10 02:07:45,705 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 112 [2019-09-10 02:07:45,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:45,705 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2019-09-10 02:07:45,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-10 02:07:45,705 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2019-09-10 02:07:45,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 02:07:45,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:45,706 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:45,707 INFO L418 AbstractCegarLoop]: === Iteration 102 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:45,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:45,707 INFO L82 PathProgramCache]: Analyzing trace with hash 882185774, now seen corresponding path program 66 times [2019-09-10 02:07:45,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:45,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:45,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:45,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:45,708 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:46,011 INFO L134 CoverageAnalysis]: Checked inductivity of 577 backedges. 246 proven. 67 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 02:07:46,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:46,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:46,011 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:46,011 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:46,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:46,012 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:46,021 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:07:46,021 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:07:46,057 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:07:46,057 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:46,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-10 02:07:46,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:46,482 INFO L134 CoverageAnalysis]: Checked inductivity of 577 backedges. 246 proven. 67 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 02:07:46,482 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:46,758 INFO L134 CoverageAnalysis]: Checked inductivity of 577 backedges. 246 proven. 67 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 02:07:46,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:46,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 47 [2019-09-10 02:07:46,762 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:46,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-10 02:07:46,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-10 02:07:46,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=452, Invalid=1710, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 02:07:46,763 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand 47 states. [2019-09-10 02:07:48,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:48,003 INFO L93 Difference]: Finished difference Result 735 states and 929 transitions. [2019-09-10 02:07:48,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-10 02:07:48,003 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 112 [2019-09-10 02:07:48,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:48,006 INFO L225 Difference]: With dead ends: 735 [2019-09-10 02:07:48,007 INFO L226 Difference]: Without dead ends: 697 [2019-09-10 02:07:48,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 181 SyntacticMatches, 28 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3594 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1711, Invalid=7601, Unknown=0, NotChecked=0, Total=9312 [2019-09-10 02:07:48,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2019-09-10 02:07:48,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 140. [2019-09-10 02:07:48,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-10 02:07:48,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2019-09-10 02:07:48,031 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 112 [2019-09-10 02:07:48,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:48,031 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2019-09-10 02:07:48,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-10 02:07:48,031 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2019-09-10 02:07:48,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 02:07:48,032 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:48,032 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:48,032 INFO L418 AbstractCegarLoop]: === Iteration 103 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:48,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:48,033 INFO L82 PathProgramCache]: Analyzing trace with hash 2041989135, now seen corresponding path program 12 times [2019-09-10 02:07:48,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:48,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:48,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:48,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:48,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:48,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:48,463 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 246 proven. 78 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 02:07:48,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:48,464 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:48,464 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:48,464 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:48,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:48,464 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:48,473 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:07:48,473 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:07:48,506 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:07:48,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:48,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-10 02:07:48,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:48,910 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 246 proven. 78 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 02:07:48,910 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:49,202 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 246 proven. 78 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 02:07:49,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:49,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 46 [2019-09-10 02:07:49,205 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:49,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-10 02:07:49,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-10 02:07:49,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=1613, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 02:07:49,206 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand 46 states. [2019-09-10 02:07:50,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:50,252 INFO L93 Difference]: Finished difference Result 778 states and 987 transitions. [2019-09-10 02:07:50,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-10 02:07:50,253 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 112 [2019-09-10 02:07:50,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:50,255 INFO L225 Difference]: With dead ends: 778 [2019-09-10 02:07:50,255 INFO L226 Difference]: Without dead ends: 740 [2019-09-10 02:07:50,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 182 SyntacticMatches, 28 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2726 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1403, Invalid=5907, Unknown=0, NotChecked=0, Total=7310 [2019-09-10 02:07:50,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2019-09-10 02:07:50,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 142. [2019-09-10 02:07:50,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-09-10 02:07:50,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 157 transitions. [2019-09-10 02:07:50,265 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 157 transitions. Word has length 112 [2019-09-10 02:07:50,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:50,266 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 157 transitions. [2019-09-10 02:07:50,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-10 02:07:50,266 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 157 transitions. [2019-09-10 02:07:50,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 02:07:50,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:50,267 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:50,267 INFO L418 AbstractCegarLoop]: === Iteration 104 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:50,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:50,267 INFO L82 PathProgramCache]: Analyzing trace with hash -139002137, now seen corresponding path program 24 times [2019-09-10 02:07:50,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:50,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:50,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:50,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:50,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:50,392 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 115 proven. 222 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 02:07:50,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:50,393 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:50,393 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:50,393 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:50,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:50,393 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:50,404 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:07:50,404 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:07:50,451 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:07:50,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:50,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-10 02:07:50,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:50,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:07:50,495 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 115 proven. 222 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 02:07:50,495 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:50,662 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 115 proven. 222 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 02:07:50,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:50,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 20 [2019-09-10 02:07:50,665 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:50,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 02:07:50,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 02:07:50,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2019-09-10 02:07:50,666 INFO L87 Difference]: Start difference. First operand 142 states and 157 transitions. Second operand 20 states. [2019-09-10 02:07:50,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:50,926 INFO L93 Difference]: Finished difference Result 153 states and 169 transitions. [2019-09-10 02:07:50,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 02:07:50,927 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 113 [2019-09-10 02:07:50,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:50,928 INFO L225 Difference]: With dead ends: 153 [2019-09-10 02:07:50,928 INFO L226 Difference]: Without dead ends: 153 [2019-09-10 02:07:50,928 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 211 SyntacticMatches, 26 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2019-09-10 02:07:50,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-09-10 02:07:50,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 149. [2019-09-10 02:07:50,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-09-10 02:07:50,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 164 transitions. [2019-09-10 02:07:50,931 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 164 transitions. Word has length 113 [2019-09-10 02:07:50,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:50,932 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 164 transitions. [2019-09-10 02:07:50,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 02:07:50,932 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 164 transitions. [2019-09-10 02:07:50,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 02:07:50,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:50,933 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:50,933 INFO L418 AbstractCegarLoop]: === Iteration 105 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:50,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:50,933 INFO L82 PathProgramCache]: Analyzing trace with hash -264047376, now seen corresponding path program 25 times [2019-09-10 02:07:50,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:50,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:50,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:50,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:50,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:50,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:51,301 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 286 proven. 91 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:07:51,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:51,302 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:51,302 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:51,302 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:51,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:51,302 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:51,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:51,313 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:07:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:51,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-10 02:07:51,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:52,039 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 286 proven. 91 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:07:52,039 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:52,396 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 286 proven. 91 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:07:52,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:52,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 62 [2019-09-10 02:07:52,399 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:52,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-10 02:07:52,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-10 02:07:52,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=753, Invalid=3029, Unknown=0, NotChecked=0, Total=3782 [2019-09-10 02:07:52,401 INFO L87 Difference]: Start difference. First operand 149 states and 164 transitions. Second operand 62 states. [2019-09-10 02:07:53,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:53,337 INFO L93 Difference]: Finished difference Result 246 states and 289 transitions. [2019-09-10 02:07:53,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 02:07:53,337 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 120 [2019-09-10 02:07:53,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:53,338 INFO L225 Difference]: With dead ends: 246 [2019-09-10 02:07:53,338 INFO L226 Difference]: Without dead ends: 205 [2019-09-10 02:07:53,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 182 SyntacticMatches, 30 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4063 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1593, Invalid=6779, Unknown=0, NotChecked=0, Total=8372 [2019-09-10 02:07:53,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-09-10 02:07:53,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 150. [2019-09-10 02:07:53,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-10 02:07:53,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2019-09-10 02:07:53,343 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 120 [2019-09-10 02:07:53,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:53,343 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2019-09-10 02:07:53,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-10 02:07:53,343 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2019-09-10 02:07:53,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 02:07:53,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:53,344 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:53,344 INFO L418 AbstractCegarLoop]: === Iteration 106 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:53,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:53,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1127772817, now seen corresponding path program 67 times [2019-09-10 02:07:53,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:53,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:53,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:53,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:53,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:53,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:53,727 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 286 proven. 79 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:07:53,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:53,727 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:53,727 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:53,727 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:53,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:53,728 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:53,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:53,738 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:07:53,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:53,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-10 02:07:53,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:54,456 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 286 proven. 79 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:07:54,457 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:54,808 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 286 proven. 79 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:07:54,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:54,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 61 [2019-09-10 02:07:54,811 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:54,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-10 02:07:54,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-10 02:07:54,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=711, Invalid=2949, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 02:07:54,812 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 61 states. [2019-09-10 02:07:56,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:56,321 INFO L93 Difference]: Finished difference Result 301 states and 359 transitions. [2019-09-10 02:07:56,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-10 02:07:56,321 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2019-09-10 02:07:56,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:56,322 INFO L225 Difference]: With dead ends: 301 [2019-09-10 02:07:56,322 INFO L226 Difference]: Without dead ends: 260 [2019-09-10 02:07:56,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 183 SyntacticMatches, 30 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4809 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1953, Invalid=8759, Unknown=0, NotChecked=0, Total=10712 [2019-09-10 02:07:56,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-09-10 02:07:56,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 150. [2019-09-10 02:07:56,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-10 02:07:56,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2019-09-10 02:07:56,326 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 120 [2019-09-10 02:07:56,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:56,326 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2019-09-10 02:07:56,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-10 02:07:56,326 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2019-09-10 02:07:56,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 02:07:56,327 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:56,327 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 11, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:56,327 INFO L418 AbstractCegarLoop]: === Iteration 107 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:56,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:56,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1155634928, now seen corresponding path program 68 times [2019-09-10 02:07:56,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:56,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:56,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:56,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:56,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:56,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:56,754 INFO L134 CoverageAnalysis]: Checked inductivity of 667 backedges. 286 proven. 69 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:07:56,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:56,754 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:56,754 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:56,754 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:56,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:56,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:56,764 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:07:56,765 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:07:56,818 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-10 02:07:56,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:56,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-10 02:07:56,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:57,498 INFO L134 CoverageAnalysis]: Checked inductivity of 667 backedges. 286 proven. 69 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:07:57,498 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:57,823 INFO L134 CoverageAnalysis]: Checked inductivity of 667 backedges. 286 proven. 69 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:07:57,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:57,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 60 [2019-09-10 02:07:57,826 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:57,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-10 02:07:57,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-10 02:07:57,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=2867, Unknown=0, NotChecked=0, Total=3540 [2019-09-10 02:07:57,827 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 60 states. [2019-09-10 02:07:59,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:59,223 INFO L93 Difference]: Finished difference Result 355 states and 428 transitions. [2019-09-10 02:07:59,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-10 02:07:59,223 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 120 [2019-09-10 02:07:59,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:59,225 INFO L225 Difference]: With dead ends: 355 [2019-09-10 02:07:59,225 INFO L226 Difference]: Without dead ends: 314 [2019-09-10 02:07:59,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 184 SyntacticMatches, 30 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5541 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2308, Invalid=10574, Unknown=0, NotChecked=0, Total=12882 [2019-09-10 02:07:59,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-10 02:07:59,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 150. [2019-09-10 02:07:59,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-10 02:07:59,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2019-09-10 02:07:59,230 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 120 [2019-09-10 02:07:59,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:59,230 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2019-09-10 02:07:59,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-10 02:07:59,230 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2019-09-10 02:07:59,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 02:07:59,231 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:59,231 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:59,231 INFO L418 AbstractCegarLoop]: === Iteration 108 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:59,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:59,231 INFO L82 PathProgramCache]: Analyzing trace with hash -325249713, now seen corresponding path program 69 times [2019-09-10 02:07:59,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:59,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:59,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:59,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:59,232 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:59,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:59,629 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 286 proven. 61 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:07:59,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:59,630 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:59,630 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:59,630 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:59,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:59,630 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:59,640 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:07:59,640 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:07:59,678 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:07:59,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:59,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-10 02:07:59,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:00,322 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 286 proven. 61 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:08:00,322 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:00,654 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 286 proven. 61 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:08:00,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:00,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 59 [2019-09-10 02:08:00,657 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:00,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-10 02:08:00,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-10 02:08:00,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=639, Invalid=2783, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 02:08:00,659 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 59 states. [2019-09-10 02:08:02,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:02,101 INFO L93 Difference]: Finished difference Result 408 states and 496 transitions. [2019-09-10 02:08:02,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-10 02:08:02,101 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 120 [2019-09-10 02:08:02,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:02,103 INFO L225 Difference]: With dead ends: 408 [2019-09-10 02:08:02,103 INFO L226 Difference]: Without dead ends: 367 [2019-09-10 02:08:02,104 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 185 SyntacticMatches, 30 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6197 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2628, Invalid=12134, Unknown=0, NotChecked=0, Total=14762 [2019-09-10 02:08:02,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2019-09-10 02:08:02,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 150. [2019-09-10 02:08:02,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-10 02:08:02,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2019-09-10 02:08:02,108 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 120 [2019-09-10 02:08:02,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:02,108 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2019-09-10 02:08:02,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-10 02:08:02,108 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2019-09-10 02:08:02,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 02:08:02,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:02,109 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 9, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:02,109 INFO L418 AbstractCegarLoop]: === Iteration 109 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:02,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:02,109 INFO L82 PathProgramCache]: Analyzing trace with hash 948462896, now seen corresponding path program 70 times [2019-09-10 02:08:02,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:02,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:02,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:02,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:02,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:02,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:02,488 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 286 proven. 55 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:08:02,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:02,488 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:02,488 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:02,488 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:02,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:02,488 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:02,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:02,498 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:08:02,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:02,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-10 02:08:02,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:03,185 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 286 proven. 55 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:08:03,185 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:03,504 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 286 proven. 55 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:08:03,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:03,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 58 [2019-09-10 02:08:03,507 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:03,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-10 02:08:03,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-10 02:08:03,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=609, Invalid=2697, Unknown=0, NotChecked=0, Total=3306 [2019-09-10 02:08:03,510 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 58 states. [2019-09-10 02:08:05,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:05,361 INFO L93 Difference]: Finished difference Result 460 states and 563 transitions. [2019-09-10 02:08:05,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-10 02:08:05,361 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 120 [2019-09-10 02:08:05,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:05,363 INFO L225 Difference]: With dead ends: 460 [2019-09-10 02:08:05,363 INFO L226 Difference]: Without dead ends: 419 [2019-09-10 02:08:05,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 186 SyntacticMatches, 30 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6727 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2889, Invalid=13367, Unknown=0, NotChecked=0, Total=16256 [2019-09-10 02:08:05,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-09-10 02:08:05,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 150. [2019-09-10 02:08:05,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-10 02:08:05,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2019-09-10 02:08:05,367 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 120 [2019-09-10 02:08:05,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:05,367 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2019-09-10 02:08:05,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-10 02:08:05,367 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2019-09-10 02:08:05,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 02:08:05,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:05,368 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:05,368 INFO L418 AbstractCegarLoop]: === Iteration 110 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:05,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:05,368 INFO L82 PathProgramCache]: Analyzing trace with hash 435361071, now seen corresponding path program 71 times [2019-09-10 02:08:05,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:05,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:05,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:05,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:05,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:05,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:05,729 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 286 proven. 51 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:08:05,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:05,729 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:05,729 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:05,729 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:05,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:05,730 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:05,739 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:08:05,739 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:08:05,783 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-10 02:08:05,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:05,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-10 02:08:05,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:06,397 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 286 proven. 51 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:08:06,397 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:06,722 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 286 proven. 51 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:08:06,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:06,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 57 [2019-09-10 02:08:06,726 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:06,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-10 02:08:06,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-10 02:08:06,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=583, Invalid=2609, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 02:08:06,727 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 57 states. [2019-09-10 02:08:08,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:08,620 INFO L93 Difference]: Finished difference Result 511 states and 629 transitions. [2019-09-10 02:08:08,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-10 02:08:08,621 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 120 [2019-09-10 02:08:08,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:08,622 INFO L225 Difference]: With dead ends: 511 [2019-09-10 02:08:08,622 INFO L226 Difference]: Without dead ends: 470 [2019-09-10 02:08:08,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 187 SyntacticMatches, 30 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7093 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3073, Invalid=14219, Unknown=0, NotChecked=0, Total=17292 [2019-09-10 02:08:08,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-09-10 02:08:08,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 150. [2019-09-10 02:08:08,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-10 02:08:08,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2019-09-10 02:08:08,627 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 120 [2019-09-10 02:08:08,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:08,628 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2019-09-10 02:08:08,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-10 02:08:08,628 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2019-09-10 02:08:08,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 02:08:08,628 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:08,628 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:08,628 INFO L418 AbstractCegarLoop]: === Iteration 111 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:08,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:08,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1250093392, now seen corresponding path program 72 times [2019-09-10 02:08:08,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:08,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:08,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:08,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:08,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:08,974 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 286 proven. 49 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:08:08,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:08,975 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:08,975 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:08,975 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:08,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:08,975 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:08,986 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:08:08,986 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:08:09,025 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:08:09,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:09,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-10 02:08:09,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:09,616 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 286 proven. 49 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:08:09,616 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:09,927 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 286 proven. 49 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:08:09,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:09,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 56 [2019-09-10 02:08:09,931 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:09,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-10 02:08:09,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-10 02:08:09,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=2519, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 02:08:09,932 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 56 states. [2019-09-10 02:08:12,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:12,016 INFO L93 Difference]: Finished difference Result 561 states and 694 transitions. [2019-09-10 02:08:12,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-10 02:08:12,016 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 120 [2019-09-10 02:08:12,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:12,018 INFO L225 Difference]: With dead ends: 561 [2019-09-10 02:08:12,018 INFO L226 Difference]: Without dead ends: 520 [2019-09-10 02:08:12,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 188 SyntacticMatches, 30 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7269 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3168, Invalid=14654, Unknown=0, NotChecked=0, Total=17822 [2019-09-10 02:08:12,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2019-09-10 02:08:12,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 150. [2019-09-10 02:08:12,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-10 02:08:12,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2019-09-10 02:08:12,024 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 120 [2019-09-10 02:08:12,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:12,025 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2019-09-10 02:08:12,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-10 02:08:12,025 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2019-09-10 02:08:12,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 02:08:12,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:12,025 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:12,026 INFO L418 AbstractCegarLoop]: === Iteration 112 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:12,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:12,026 INFO L82 PathProgramCache]: Analyzing trace with hash 445091087, now seen corresponding path program 73 times [2019-09-10 02:08:12,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:12,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:12,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:12,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:12,027 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:12,396 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 286 proven. 49 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:08:12,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:12,396 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:12,396 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:12,396 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:12,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:12,396 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:12,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:12,406 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:08:12,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:12,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-10 02:08:12,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:13,018 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 286 proven. 49 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:08:13,018 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:13,348 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 286 proven. 49 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:08:13,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:13,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 55 [2019-09-10 02:08:13,351 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:13,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-10 02:08:13,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-10 02:08:13,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=543, Invalid=2427, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 02:08:13,352 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 55 states. [2019-09-10 02:08:15,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:15,518 INFO L93 Difference]: Finished difference Result 610 states and 758 transitions. [2019-09-10 02:08:15,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-10 02:08:15,518 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 120 [2019-09-10 02:08:15,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:15,520 INFO L225 Difference]: With dead ends: 610 [2019-09-10 02:08:15,520 INFO L226 Difference]: Without dead ends: 569 [2019-09-10 02:08:15,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 189 SyntacticMatches, 30 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7241 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3168, Invalid=14654, Unknown=0, NotChecked=0, Total=17822 [2019-09-10 02:08:15,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-09-10 02:08:15,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 150. [2019-09-10 02:08:15,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-10 02:08:15,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2019-09-10 02:08:15,527 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 120 [2019-09-10 02:08:15,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:15,527 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2019-09-10 02:08:15,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-10 02:08:15,527 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2019-09-10 02:08:15,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 02:08:15,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:15,528 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:15,528 INFO L418 AbstractCegarLoop]: === Iteration 113 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:15,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:15,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1804596592, now seen corresponding path program 74 times [2019-09-10 02:08:15,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:15,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:15,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:15,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:15,529 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:15,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:15,906 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 286 proven. 51 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:08:15,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:15,906 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:15,907 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:15,907 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:15,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:15,907 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:15,917 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:08:15,917 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:08:15,961 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-10 02:08:15,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:15,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-10 02:08:15,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:16,507 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 286 proven. 51 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:08:16,507 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:16,824 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 286 proven. 51 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:08:16,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:16,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 54 [2019-09-10 02:08:16,827 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:16,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-10 02:08:16,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-10 02:08:16,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=529, Invalid=2333, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 02:08:16,829 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 54 states. [2019-09-10 02:08:18,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:18,889 INFO L93 Difference]: Finished difference Result 658 states and 821 transitions. [2019-09-10 02:08:18,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-10 02:08:18,890 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 120 [2019-09-10 02:08:18,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:18,892 INFO L225 Difference]: With dead ends: 658 [2019-09-10 02:08:18,892 INFO L226 Difference]: Without dead ends: 617 [2019-09-10 02:08:18,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 190 SyntacticMatches, 30 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7003 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3073, Invalid=14219, Unknown=0, NotChecked=0, Total=17292 [2019-09-10 02:08:18,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-09-10 02:08:18,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 150. [2019-09-10 02:08:18,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-10 02:08:18,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2019-09-10 02:08:18,901 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 120 [2019-09-10 02:08:18,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:18,901 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2019-09-10 02:08:18,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-10 02:08:18,901 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2019-09-10 02:08:18,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 02:08:18,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:18,902 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 9, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:18,902 INFO L418 AbstractCegarLoop]: === Iteration 114 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:18,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:18,902 INFO L82 PathProgramCache]: Analyzing trace with hash 462978287, now seen corresponding path program 75 times [2019-09-10 02:08:18,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:18,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:18,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:18,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:18,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:19,250 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 286 proven. 55 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:08:19,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:19,250 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:19,251 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:19,251 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:19,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:19,251 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:19,261 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:08:19,261 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:08:19,297 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:08:19,297 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:19,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-10 02:08:19,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:19,843 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 286 proven. 55 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:08:19,843 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:20,155 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 286 proven. 55 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:08:20,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:20,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 53 [2019-09-10 02:08:20,158 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:20,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-10 02:08:20,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-10 02:08:20,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=519, Invalid=2237, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 02:08:20,159 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 53 states. [2019-09-10 02:08:22,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:22,004 INFO L93 Difference]: Finished difference Result 705 states and 883 transitions. [2019-09-10 02:08:22,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-10 02:08:22,005 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 120 [2019-09-10 02:08:22,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:22,007 INFO L225 Difference]: With dead ends: 705 [2019-09-10 02:08:22,007 INFO L226 Difference]: Without dead ends: 664 [2019-09-10 02:08:22,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 191 SyntacticMatches, 30 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6557 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2889, Invalid=13367, Unknown=0, NotChecked=0, Total=16256 [2019-09-10 02:08:22,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2019-09-10 02:08:22,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 150. [2019-09-10 02:08:22,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-10 02:08:22,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2019-09-10 02:08:22,014 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 120 [2019-09-10 02:08:22,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:22,014 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2019-09-10 02:08:22,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-10 02:08:22,014 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2019-09-10 02:08:22,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 02:08:22,015 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:22,015 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:22,015 INFO L418 AbstractCegarLoop]: === Iteration 115 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:22,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:22,015 INFO L82 PathProgramCache]: Analyzing trace with hash -827225712, now seen corresponding path program 76 times [2019-09-10 02:08:22,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:22,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:22,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:22,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:22,016 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:22,366 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 286 proven. 61 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:08:22,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:22,366 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:22,367 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:22,367 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:22,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:22,367 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:22,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:22,377 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:08:22,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:22,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-10 02:08:22,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:22,936 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 286 proven. 61 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:08:22,936 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:23,254 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 286 proven. 61 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:08:23,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:23,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 52 [2019-09-10 02:08:23,257 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:23,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-10 02:08:23,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-10 02:08:23,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=513, Invalid=2139, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:08:23,258 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 52 states. [2019-09-10 02:08:24,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:24,957 INFO L93 Difference]: Finished difference Result 751 states and 944 transitions. [2019-09-10 02:08:24,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-10 02:08:24,958 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 120 [2019-09-10 02:08:24,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:24,960 INFO L225 Difference]: With dead ends: 751 [2019-09-10 02:08:24,960 INFO L226 Difference]: Without dead ends: 710 [2019-09-10 02:08:24,961 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 192 SyntacticMatches, 30 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5917 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2628, Invalid=12134, Unknown=0, NotChecked=0, Total=14762 [2019-09-10 02:08:24,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2019-09-10 02:08:24,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 150. [2019-09-10 02:08:24,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-10 02:08:24,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2019-09-10 02:08:24,968 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 120 [2019-09-10 02:08:24,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:24,968 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2019-09-10 02:08:24,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-10 02:08:24,968 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2019-09-10 02:08:24,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 02:08:24,969 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:24,969 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 11, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:24,969 INFO L418 AbstractCegarLoop]: === Iteration 116 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:24,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:24,969 INFO L82 PathProgramCache]: Analyzing trace with hash -2115771185, now seen corresponding path program 77 times [2019-09-10 02:08:24,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:24,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:24,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:24,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:24,970 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:24,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:25,342 INFO L134 CoverageAnalysis]: Checked inductivity of 667 backedges. 286 proven. 69 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:08:25,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:25,343 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:25,343 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:25,343 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:25,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:25,343 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:25,354 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:08:25,354 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:08:25,397 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-10 02:08:25,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:25,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-10 02:08:25,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:25,890 INFO L134 CoverageAnalysis]: Checked inductivity of 667 backedges. 286 proven. 69 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:08:25,890 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:26,200 INFO L134 CoverageAnalysis]: Checked inductivity of 667 backedges. 286 proven. 69 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:08:26,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:26,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 51 [2019-09-10 02:08:26,203 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:26,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-10 02:08:26,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-10 02:08:26,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=511, Invalid=2039, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 02:08:26,205 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 51 states. [2019-09-10 02:08:27,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:27,750 INFO L93 Difference]: Finished difference Result 796 states and 1004 transitions. [2019-09-10 02:08:27,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-10 02:08:27,751 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 120 [2019-09-10 02:08:27,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:27,753 INFO L225 Difference]: With dead ends: 796 [2019-09-10 02:08:27,753 INFO L226 Difference]: Without dead ends: 755 [2019-09-10 02:08:27,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 193 SyntacticMatches, 30 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5109 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2308, Invalid=10574, Unknown=0, NotChecked=0, Total=12882 [2019-09-10 02:08:27,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-09-10 02:08:27,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 150. [2019-09-10 02:08:27,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-10 02:08:27,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2019-09-10 02:08:27,761 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 120 [2019-09-10 02:08:27,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:27,761 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2019-09-10 02:08:27,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-10 02:08:27,761 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2019-09-10 02:08:27,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 02:08:27,762 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:27,762 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:27,762 INFO L418 AbstractCegarLoop]: === Iteration 117 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:27,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:27,762 INFO L82 PathProgramCache]: Analyzing trace with hash 2137630128, now seen corresponding path program 78 times [2019-09-10 02:08:27,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:27,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:27,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:27,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:27,763 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:28,130 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 286 proven. 79 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:08:28,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:28,130 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:28,130 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:28,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:28,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:28,131 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:28,140 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:08:28,140 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:08:28,177 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:08:28,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:28,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-10 02:08:28,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:28,662 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 286 proven. 79 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:08:28,662 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:28,998 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 286 proven. 79 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:08:29,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:29,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 50 [2019-09-10 02:08:29,001 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:29,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-10 02:08:29,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-10 02:08:29,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=513, Invalid=1937, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 02:08:29,002 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 50 states. [2019-09-10 02:08:30,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:30,382 INFO L93 Difference]: Finished difference Result 840 states and 1063 transitions. [2019-09-10 02:08:30,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-10 02:08:30,382 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 120 [2019-09-10 02:08:30,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:30,385 INFO L225 Difference]: With dead ends: 840 [2019-09-10 02:08:30,385 INFO L226 Difference]: Without dead ends: 799 [2019-09-10 02:08:30,386 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 194 SyntacticMatches, 30 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4171 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1953, Invalid=8759, Unknown=0, NotChecked=0, Total=10712 [2019-09-10 02:08:30,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-09-10 02:08:30,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 150. [2019-09-10 02:08:30,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-10 02:08:30,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2019-09-10 02:08:30,410 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 120 [2019-09-10 02:08:30,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:30,410 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2019-09-10 02:08:30,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-10 02:08:30,410 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2019-09-10 02:08:30,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 02:08:30,411 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:30,411 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:30,411 INFO L418 AbstractCegarLoop]: === Iteration 118 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:30,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:30,412 INFO L82 PathProgramCache]: Analyzing trace with hash -911752017, now seen corresponding path program 13 times [2019-09-10 02:08:30,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:30,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:30,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:30,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:30,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:30,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:30,904 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 286 proven. 91 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:08:30,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:30,904 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:30,904 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:30,904 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:30,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:30,905 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:08:30,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:30,920 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:30,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:30,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-10 02:08:30,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:31,490 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 286 proven. 91 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:08:31,491 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:31,819 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 286 proven. 91 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:08:31,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:31,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 49 [2019-09-10 02:08:31,822 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:31,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-10 02:08:31,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-10 02:08:31,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=519, Invalid=1833, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 02:08:31,823 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 49 states. [2019-09-10 02:08:33,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:33,050 INFO L93 Difference]: Finished difference Result 886 states and 1125 transitions. [2019-09-10 02:08:33,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-10 02:08:33,050 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 120 [2019-09-10 02:08:33,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:33,053 INFO L225 Difference]: With dead ends: 886 [2019-09-10 02:08:33,053 INFO L226 Difference]: Without dead ends: 845 [2019-09-10 02:08:33,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 195 SyntacticMatches, 30 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3153 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1593, Invalid=6779, Unknown=0, NotChecked=0, Total=8372 [2019-09-10 02:08:33,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2019-09-10 02:08:33,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 152. [2019-09-10 02:08:33,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-10 02:08:33,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 168 transitions. [2019-09-10 02:08:33,066 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 168 transitions. Word has length 120 [2019-09-10 02:08:33,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:33,066 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 168 transitions. [2019-09-10 02:08:33,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-10 02:08:33,067 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 168 transitions. [2019-09-10 02:08:33,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 02:08:33,067 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:33,068 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:33,068 INFO L418 AbstractCegarLoop]: === Iteration 119 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:33,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:33,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1106115448, now seen corresponding path program 26 times [2019-09-10 02:08:33,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:33,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:33,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:33,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:33,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:33,271 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 131 proven. 260 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:08:33,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:33,271 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:33,272 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:33,272 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:33,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:33,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:08:33,290 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:08:33,290 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:33,338 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-10 02:08:33,339 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:33,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-10 02:08:33,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:33,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:08:33,371 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 131 proven. 260 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:08:33,371 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:33,562 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 131 proven. 260 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:08:33,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:33,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 21 [2019-09-10 02:08:33,565 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:33,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 02:08:33,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 02:08:33,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2019-09-10 02:08:33,566 INFO L87 Difference]: Start difference. First operand 152 states and 168 transitions. Second operand 21 states. [2019-09-10 02:08:33,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:33,779 INFO L93 Difference]: Finished difference Result 163 states and 180 transitions. [2019-09-10 02:08:33,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 02:08:33,780 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 121 [2019-09-10 02:08:33,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:33,781 INFO L225 Difference]: With dead ends: 163 [2019-09-10 02:08:33,781 INFO L226 Difference]: Without dead ends: 163 [2019-09-10 02:08:33,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 226 SyntacticMatches, 28 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=310, Unknown=0, NotChecked=0, Total=462 [2019-09-10 02:08:33,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-09-10 02:08:33,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2019-09-10 02:08:33,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-09-10 02:08:33,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 175 transitions. [2019-09-10 02:08:33,785 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 175 transitions. Word has length 121 [2019-09-10 02:08:33,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:33,785 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 175 transitions. [2019-09-10 02:08:33,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 02:08:33,786 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 175 transitions. [2019-09-10 02:08:33,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 02:08:33,786 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:33,786 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:33,787 INFO L418 AbstractCegarLoop]: === Iteration 120 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:33,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:33,787 INFO L82 PathProgramCache]: Analyzing trace with hash 403015727, now seen corresponding path program 27 times [2019-09-10 02:08:33,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:33,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:33,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:33,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:33,788 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:33,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:34,474 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 329 proven. 105 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:08:34,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:34,475 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:34,475 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:34,475 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:34,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:34,475 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:34,485 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:08:34,485 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:08:34,525 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:08:34,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:34,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-10 02:08:34,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:35,303 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 329 proven. 105 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:08:35,303 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:35,687 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 329 proven. 105 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:08:35,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:35,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 66 [2019-09-10 02:08:35,697 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:35,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-10 02:08:35,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-10 02:08:35,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=851, Invalid=3439, Unknown=0, NotChecked=0, Total=4290 [2019-09-10 02:08:35,698 INFO L87 Difference]: Start difference. First operand 159 states and 175 transitions. Second operand 66 states. [2019-09-10 02:08:36,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:36,859 INFO L93 Difference]: Finished difference Result 263 states and 309 transitions. [2019-09-10 02:08:36,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-10 02:08:36,860 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 128 [2019-09-10 02:08:36,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:36,861 INFO L225 Difference]: With dead ends: 263 [2019-09-10 02:08:36,861 INFO L226 Difference]: Without dead ends: 219 [2019-09-10 02:08:36,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 194 SyntacticMatches, 32 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4661 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1795, Invalid=7711, Unknown=0, NotChecked=0, Total=9506 [2019-09-10 02:08:36,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-10 02:08:36,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 160. [2019-09-10 02:08:36,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-10 02:08:36,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2019-09-10 02:08:36,865 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 128 [2019-09-10 02:08:36,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:36,865 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2019-09-10 02:08:36,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-10 02:08:36,866 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2019-09-10 02:08:36,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 02:08:36,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:36,866 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:36,866 INFO L418 AbstractCegarLoop]: === Iteration 121 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:36,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:36,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1348809134, now seen corresponding path program 79 times [2019-09-10 02:08:36,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:36,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:36,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:36,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:36,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:36,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:37,290 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 329 proven. 92 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:08:37,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:37,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:37,290 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:37,291 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:37,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:37,291 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:37,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:37,301 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:08:37,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:37,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-10 02:08:37,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:38,114 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 329 proven. 92 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:08:38,114 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:38,501 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 329 proven. 92 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:08:38,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:38,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 65 [2019-09-10 02:08:38,505 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:38,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-10 02:08:38,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-10 02:08:38,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=806, Invalid=3354, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 02:08:38,507 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 65 states. [2019-09-10 02:08:40,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:40,263 INFO L93 Difference]: Finished difference Result 322 states and 384 transitions. [2019-09-10 02:08:40,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-10 02:08:40,263 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2019-09-10 02:08:40,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:40,264 INFO L225 Difference]: With dead ends: 322 [2019-09-10 02:08:40,264 INFO L226 Difference]: Without dead ends: 278 [2019-09-10 02:08:40,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 195 SyntacticMatches, 32 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5535 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2211, Invalid=9999, Unknown=0, NotChecked=0, Total=12210 [2019-09-10 02:08:40,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-09-10 02:08:40,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 160. [2019-09-10 02:08:40,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-10 02:08:40,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2019-09-10 02:08:40,269 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 128 [2019-09-10 02:08:40,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:40,269 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2019-09-10 02:08:40,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-10 02:08:40,269 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2019-09-10 02:08:40,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 02:08:40,270 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:40,270 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:40,270 INFO L418 AbstractCegarLoop]: === Iteration 122 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:40,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:40,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1656413263, now seen corresponding path program 80 times [2019-09-10 02:08:40,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:40,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:40,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:40,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:40,271 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:40,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:40,694 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 329 proven. 81 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:08:40,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:40,695 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:40,695 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:40,695 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:40,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:40,695 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:40,706 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:08:40,706 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:08:40,750 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-10 02:08:40,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:40,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-10 02:08:40,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:41,500 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 329 proven. 81 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:08:41,500 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:41,877 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 329 proven. 81 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:08:41,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:41,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 64 [2019-09-10 02:08:41,880 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:41,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-10 02:08:41,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-10 02:08:41,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=765, Invalid=3267, Unknown=0, NotChecked=0, Total=4032 [2019-09-10 02:08:41,882 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 64 states. [2019-09-10 02:08:43,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:43,806 INFO L93 Difference]: Finished difference Result 380 states and 458 transitions. [2019-09-10 02:08:43,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-10 02:08:43,806 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 128 [2019-09-10 02:08:43,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:43,807 INFO L225 Difference]: With dead ends: 380 [2019-09-10 02:08:43,807 INFO L226 Difference]: Without dead ends: 336 [2019-09-10 02:08:43,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 196 SyntacticMatches, 32 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6408 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2629, Invalid=12133, Unknown=0, NotChecked=0, Total=14762 [2019-09-10 02:08:43,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-09-10 02:08:43,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 160. [2019-09-10 02:08:43,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-10 02:08:43,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2019-09-10 02:08:43,812 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 128 [2019-09-10 02:08:43,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:43,812 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2019-09-10 02:08:43,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-10 02:08:43,813 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2019-09-10 02:08:43,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 02:08:43,813 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:43,813 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 11, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:43,813 INFO L418 AbstractCegarLoop]: === Iteration 123 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:43,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:43,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1381705330, now seen corresponding path program 81 times [2019-09-10 02:08:43,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:43,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:43,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:43,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:43,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:43,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:44,246 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 329 proven. 72 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:08:44,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:44,246 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:44,246 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:44,246 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:44,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:44,246 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:44,256 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:08:44,257 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:08:44,295 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:08:44,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:44,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-10 02:08:44,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:45,005 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 329 proven. 72 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:08:45,005 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:45,381 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 329 proven. 72 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:08:45,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:45,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 63 [2019-09-10 02:08:45,385 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:45,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-10 02:08:45,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-10 02:08:45,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=3178, Unknown=0, NotChecked=0, Total=3906 [2019-09-10 02:08:45,386 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 63 states. [2019-09-10 02:08:47,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:47,169 INFO L93 Difference]: Finished difference Result 437 states and 531 transitions. [2019-09-10 02:08:47,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-10 02:08:47,170 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 128 [2019-09-10 02:08:47,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:47,171 INFO L225 Difference]: With dead ends: 437 [2019-09-10 02:08:47,171 INFO L226 Difference]: Without dead ends: 393 [2019-09-10 02:08:47,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 197 SyntacticMatches, 32 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7212 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3016, Invalid=14014, Unknown=0, NotChecked=0, Total=17030 [2019-09-10 02:08:47,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-09-10 02:08:47,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 160. [2019-09-10 02:08:47,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-10 02:08:47,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2019-09-10 02:08:47,177 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 128 [2019-09-10 02:08:47,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:47,177 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2019-09-10 02:08:47,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-10 02:08:47,177 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2019-09-10 02:08:47,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 02:08:47,178 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:47,178 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:47,178 INFO L418 AbstractCegarLoop]: === Iteration 124 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:47,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:47,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1291237487, now seen corresponding path program 82 times [2019-09-10 02:08:47,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:47,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:47,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:47,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:47,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:47,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:47,585 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 329 proven. 65 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:08:47,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:47,586 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:47,586 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:47,586 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:47,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:47,586 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:47,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:47,596 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:08:47,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:47,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-10 02:08:47,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:48,343 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 329 proven. 65 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:08:48,344 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:48,725 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 329 proven. 65 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:08:48,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:48,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 62 [2019-09-10 02:08:48,728 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:48,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-10 02:08:48,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-10 02:08:48,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=695, Invalid=3087, Unknown=0, NotChecked=0, Total=3782 [2019-09-10 02:08:48,729 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 62 states. [2019-09-10 02:08:50,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:50,895 INFO L93 Difference]: Finished difference Result 493 states and 603 transitions. [2019-09-10 02:08:50,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-10 02:08:50,900 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 128 [2019-09-10 02:08:50,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:50,901 INFO L225 Difference]: With dead ends: 493 [2019-09-10 02:08:50,901 INFO L226 Difference]: Without dead ends: 449 [2019-09-10 02:08:50,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 198 SyntacticMatches, 32 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7891 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3345, Invalid=15561, Unknown=0, NotChecked=0, Total=18906 [2019-09-10 02:08:50,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-09-10 02:08:50,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 160. [2019-09-10 02:08:50,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-10 02:08:50,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2019-09-10 02:08:50,907 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 128 [2019-09-10 02:08:50,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:50,907 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2019-09-10 02:08:50,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-10 02:08:50,908 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2019-09-10 02:08:50,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 02:08:50,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:50,908 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 9, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:50,908 INFO L418 AbstractCegarLoop]: === Iteration 125 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:50,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:50,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1670579858, now seen corresponding path program 83 times [2019-09-10 02:08:50,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:50,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:50,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:50,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:50,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:50,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:51,427 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 329 proven. 60 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:08:51,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:51,428 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:51,428 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:51,428 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:51,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:51,429 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:51,442 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:08:51,442 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:08:51,481 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-10 02:08:51,482 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:51,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-10 02:08:51,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:52,164 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 329 proven. 60 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:08:52,164 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:52,528 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 329 proven. 60 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:08:52,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:52,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 61 [2019-09-10 02:08:52,531 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:52,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-10 02:08:52,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-10 02:08:52,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=2994, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 02:08:52,532 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 61 states. [2019-09-10 02:08:54,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:54,630 INFO L93 Difference]: Finished difference Result 548 states and 674 transitions. [2019-09-10 02:08:54,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-10 02:08:54,630 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 128 [2019-09-10 02:08:54,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:54,632 INFO L225 Difference]: With dead ends: 548 [2019-09-10 02:08:54,632 INFO L226 Difference]: Without dead ends: 504 [2019-09-10 02:08:54,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 199 SyntacticMatches, 32 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8401 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3595, Invalid=16711, Unknown=0, NotChecked=0, Total=20306 [2019-09-10 02:08:54,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-09-10 02:08:54,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 160. [2019-09-10 02:08:54,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-10 02:08:54,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2019-09-10 02:08:54,638 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 128 [2019-09-10 02:08:54,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:54,638 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2019-09-10 02:08:54,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-10 02:08:54,639 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2019-09-10 02:08:54,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 02:08:54,639 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:54,639 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:54,639 INFO L418 AbstractCegarLoop]: === Iteration 126 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:54,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:54,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1766122353, now seen corresponding path program 84 times [2019-09-10 02:08:54,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:54,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:54,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:54,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:54,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:54,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:55,041 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 329 proven. 57 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:08:55,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:55,042 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:55,042 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:55,042 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:55,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:55,042 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:55,053 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:08:55,053 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:08:55,094 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:08:55,095 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:55,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-10 02:08:55,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:55,777 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 329 proven. 57 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:08:55,777 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:56,135 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 329 proven. 57 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:08:56,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:56,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 60 [2019-09-10 02:08:56,138 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:56,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-10 02:08:56,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-10 02:08:56,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=641, Invalid=2899, Unknown=0, NotChecked=0, Total=3540 [2019-09-10 02:08:56,140 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 60 states. [2019-09-10 02:08:58,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:58,560 INFO L93 Difference]: Finished difference Result 602 states and 744 transitions. [2019-09-10 02:08:58,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-10 02:08:58,560 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 128 [2019-09-10 02:08:58,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:58,561 INFO L225 Difference]: With dead ends: 602 [2019-09-10 02:08:58,562 INFO L226 Difference]: Without dead ends: 558 [2019-09-10 02:08:58,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 200 SyntacticMatches, 32 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8710 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3751, Invalid=17419, Unknown=0, NotChecked=0, Total=21170 [2019-09-10 02:08:58,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-09-10 02:08:58,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 160. [2019-09-10 02:08:58,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-10 02:08:58,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2019-09-10 02:08:58,568 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 128 [2019-09-10 02:08:58,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:58,568 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2019-09-10 02:08:58,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-10 02:08:58,568 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2019-09-10 02:08:58,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 02:08:58,568 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:58,568 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:08:58,569 INFO L418 AbstractCegarLoop]: === Iteration 127 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:58,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:58,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1417384270, now seen corresponding path program 85 times [2019-09-10 02:08:58,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:58,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:58,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:58,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:58,570 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:58,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:58,956 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 329 proven. 56 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:08:58,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:58,956 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:58,956 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:58,956 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:58,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:58,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:58,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:58,967 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:08:59,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:59,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-10 02:08:59,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:59,660 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 329 proven. 56 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:08:59,660 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:00,009 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 329 proven. 56 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:09:00,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:00,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 59 [2019-09-10 02:09:00,012 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:00,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-10 02:09:00,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-10 02:09:00,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=620, Invalid=2802, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 02:09:00,013 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 59 states. [2019-09-10 02:09:02,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:02,277 INFO L93 Difference]: Finished difference Result 655 states and 813 transitions. [2019-09-10 02:09:02,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-09-10 02:09:02,278 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 128 [2019-09-10 02:09:02,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:02,279 INFO L225 Difference]: With dead ends: 655 [2019-09-10 02:09:02,279 INFO L226 Difference]: Without dead ends: 611 [2019-09-10 02:09:02,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 201 SyntacticMatches, 32 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8798 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3804, Invalid=17658, Unknown=0, NotChecked=0, Total=21462 [2019-09-10 02:09:02,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-09-10 02:09:02,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 160. [2019-09-10 02:09:02,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-10 02:09:02,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2019-09-10 02:09:02,286 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 128 [2019-09-10 02:09:02,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:02,286 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2019-09-10 02:09:02,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-10 02:09:02,286 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2019-09-10 02:09:02,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 02:09:02,287 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:02,287 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:09:02,288 INFO L418 AbstractCegarLoop]: === Iteration 128 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:02,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:02,288 INFO L82 PathProgramCache]: Analyzing trace with hash 411699375, now seen corresponding path program 86 times [2019-09-10 02:09:02,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:02,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:02,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:09:02,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:02,289 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:02,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:02,687 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 329 proven. 57 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:09:02,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:02,688 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:02,688 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:02,688 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:02,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:02,688 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:09:02,712 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:09:02,712 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:09:02,762 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-10 02:09:02,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:09:02,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-10 02:09:02,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:03,394 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 329 proven. 57 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:09:03,394 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:03,758 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 329 proven. 57 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:09:03,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:03,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 58 [2019-09-10 02:09:03,761 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:03,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-10 02:09:03,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-10 02:09:03,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=603, Invalid=2703, Unknown=0, NotChecked=0, Total=3306 [2019-09-10 02:09:03,763 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 58 states. [2019-09-10 02:09:06,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:06,139 INFO L93 Difference]: Finished difference Result 707 states and 881 transitions. [2019-09-10 02:09:06,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-10 02:09:06,140 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 128 [2019-09-10 02:09:06,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:06,142 INFO L225 Difference]: With dead ends: 707 [2019-09-10 02:09:06,142 INFO L226 Difference]: Without dead ends: 663 [2019-09-10 02:09:06,144 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 202 SyntacticMatches, 32 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8656 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3751, Invalid=17419, Unknown=0, NotChecked=0, Total=21170 [2019-09-10 02:09:06,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-09-10 02:09:06,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 160. [2019-09-10 02:09:06,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-10 02:09:06,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2019-09-10 02:09:06,152 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 128 [2019-09-10 02:09:06,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:06,152 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2019-09-10 02:09:06,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-10 02:09:06,153 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2019-09-10 02:09:06,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 02:09:06,153 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:06,153 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 9, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:09:06,154 INFO L418 AbstractCegarLoop]: === Iteration 129 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:06,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:06,154 INFO L82 PathProgramCache]: Analyzing trace with hash -452026066, now seen corresponding path program 87 times [2019-09-10 02:09:06,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:06,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:06,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:09:06,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:06,155 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:06,569 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 329 proven. 60 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:09:06,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:06,570 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:06,570 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:06,570 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:06,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:06,570 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:09:06,583 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:09:06,583 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:09:06,621 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:09:06,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:09:06,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-10 02:09:06,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:07,292 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 329 proven. 60 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:09:07,292 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:07,655 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 329 proven. 60 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:09:07,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:07,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 57 [2019-09-10 02:09:07,658 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:07,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-10 02:09:07,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-10 02:09:07,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=590, Invalid=2602, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 02:09:07,660 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 57 states. [2019-09-10 02:09:10,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:10,046 INFO L93 Difference]: Finished difference Result 758 states and 948 transitions. [2019-09-10 02:09:10,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-09-10 02:09:10,046 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 128 [2019-09-10 02:09:10,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:10,048 INFO L225 Difference]: With dead ends: 758 [2019-09-10 02:09:10,048 INFO L226 Difference]: Without dead ends: 714 [2019-09-10 02:09:10,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 203 SyntacticMatches, 32 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8281 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3595, Invalid=16711, Unknown=0, NotChecked=0, Total=20306 [2019-09-10 02:09:10,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-09-10 02:09:10,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 160. [2019-09-10 02:09:10,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-10 02:09:10,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2019-09-10 02:09:10,056 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 128 [2019-09-10 02:09:10,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:10,056 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2019-09-10 02:09:10,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-10 02:09:10,056 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2019-09-10 02:09:10,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 02:09:10,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:10,057 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:09:10,057 INFO L418 AbstractCegarLoop]: === Iteration 130 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:10,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:10,057 INFO L82 PathProgramCache]: Analyzing trace with hash -479888177, now seen corresponding path program 88 times [2019-09-10 02:09:10,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:10,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:10,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:09:10,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:10,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:10,473 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 329 proven. 65 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:09:10,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:10,473 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:10,473 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:10,474 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:10,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:10,474 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:09:10,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:09:10,489 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:09:10,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:10,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-10 02:09:10,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:11,114 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 329 proven. 65 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:09:11,115 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:11,464 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 329 proven. 65 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:09:11,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:11,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 56 [2019-09-10 02:09:11,467 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:11,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-10 02:09:11,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-10 02:09:11,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=581, Invalid=2499, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 02:09:11,468 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 56 states. [2019-09-10 02:09:13,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:13,761 INFO L93 Difference]: Finished difference Result 808 states and 1014 transitions. [2019-09-10 02:09:13,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-10 02:09:13,762 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 128 [2019-09-10 02:09:13,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:13,764 INFO L225 Difference]: With dead ends: 808 [2019-09-10 02:09:13,764 INFO L226 Difference]: Without dead ends: 764 [2019-09-10 02:09:13,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 204 SyntacticMatches, 32 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7681 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3345, Invalid=15561, Unknown=0, NotChecked=0, Total=18906 [2019-09-10 02:09:13,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-09-10 02:09:13,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 160. [2019-09-10 02:09:13,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-10 02:09:13,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2019-09-10 02:09:13,774 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 128 [2019-09-10 02:09:13,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:13,775 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2019-09-10 02:09:13,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-10 02:09:13,775 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2019-09-10 02:09:13,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 02:09:13,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:13,776 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 11, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:09:13,776 INFO L418 AbstractCegarLoop]: === Iteration 131 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:13,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:13,776 INFO L82 PathProgramCache]: Analyzing trace with hash 350497038, now seen corresponding path program 89 times [2019-09-10 02:09:13,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:13,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:13,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:09:13,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:13,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:13,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:14,180 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 329 proven. 72 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:09:14,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:14,180 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:14,180 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:14,180 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:14,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:14,181 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:09:14,190 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:09:14,190 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:09:14,239 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-10 02:09:14,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:09:14,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-10 02:09:14,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:14,808 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 329 proven. 72 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:09:14,808 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:15,171 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 329 proven. 72 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:09:15,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:15,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 55 [2019-09-10 02:09:15,174 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:15,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-10 02:09:15,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-10 02:09:15,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=576, Invalid=2394, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 02:09:15,175 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 55 states. [2019-09-10 02:09:17,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:17,010 INFO L93 Difference]: Finished difference Result 857 states and 1079 transitions. [2019-09-10 02:09:17,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-10 02:09:17,011 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 128 [2019-09-10 02:09:17,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:17,012 INFO L225 Difference]: With dead ends: 857 [2019-09-10 02:09:17,013 INFO L226 Difference]: Without dead ends: 813 [2019-09-10 02:09:17,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 205 SyntacticMatches, 32 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6876 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3016, Invalid=14014, Unknown=0, NotChecked=0, Total=17030 [2019-09-10 02:09:17,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2019-09-10 02:09:17,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 160. [2019-09-10 02:09:17,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-10 02:09:17,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2019-09-10 02:09:17,022 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 128 [2019-09-10 02:09:17,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:17,022 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2019-09-10 02:09:17,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-10 02:09:17,022 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2019-09-10 02:09:17,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 02:09:17,023 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:17,023 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:09:17,023 INFO L418 AbstractCegarLoop]: === Iteration 132 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:17,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:17,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1624209647, now seen corresponding path program 90 times [2019-09-10 02:09:17,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:17,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:17,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:09:17,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:17,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:17,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:17,415 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 329 proven. 81 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:09:17,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:17,416 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:17,416 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:17,416 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:17,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:17,416 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:09:17,426 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:09:17,426 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:09:17,468 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:09:17,468 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:09:17,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-10 02:09:17,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:18,025 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 329 proven. 81 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:09:18,025 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:18,385 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 329 proven. 81 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:09:18,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:18,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 54 [2019-09-10 02:09:18,389 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:18,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-10 02:09:18,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-10 02:09:18,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=2287, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 02:09:18,389 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 54 states. [2019-09-10 02:09:20,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:20,294 INFO L93 Difference]: Finished difference Result 905 states and 1143 transitions. [2019-09-10 02:09:20,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-10 02:09:20,295 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 128 [2019-09-10 02:09:20,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:20,296 INFO L225 Difference]: With dead ends: 905 [2019-09-10 02:09:20,297 INFO L226 Difference]: Without dead ends: 861 [2019-09-10 02:09:20,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 206 SyntacticMatches, 32 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5898 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2629, Invalid=12133, Unknown=0, NotChecked=0, Total=14762 [2019-09-10 02:09:20,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2019-09-10 02:09:20,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 160. [2019-09-10 02:09:20,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-10 02:09:20,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2019-09-10 02:09:20,307 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 128 [2019-09-10 02:09:20,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:20,308 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2019-09-10 02:09:20,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-10 02:09:20,308 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2019-09-10 02:09:20,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 02:09:20,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:20,309 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:09:20,309 INFO L418 AbstractCegarLoop]: === Iteration 133 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:20,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:20,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1111107822, now seen corresponding path program 91 times [2019-09-10 02:09:20,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:20,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:20,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:09:20,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:20,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:20,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:20,803 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 329 proven. 92 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:09:20,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:20,804 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:20,804 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:20,804 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:20,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:20,804 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:09:20,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:09:20,814 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:09:20,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:20,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-10 02:09:20,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:21,376 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 329 proven. 92 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:09:21,376 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:21,739 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 329 proven. 92 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:09:21,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:21,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 53 [2019-09-10 02:09:21,759 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:21,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-10 02:09:21,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-10 02:09:21,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=578, Invalid=2178, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 02:09:21,760 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 53 states. [2019-09-10 02:09:23,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:23,367 INFO L93 Difference]: Finished difference Result 952 states and 1206 transitions. [2019-09-10 02:09:23,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-10 02:09:23,367 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 128 [2019-09-10 02:09:23,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:23,369 INFO L225 Difference]: With dead ends: 952 [2019-09-10 02:09:23,370 INFO L226 Difference]: Without dead ends: 908 [2019-09-10 02:09:23,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 207 SyntacticMatches, 32 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4791 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2211, Invalid=9999, Unknown=0, NotChecked=0, Total=12210 [2019-09-10 02:09:23,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2019-09-10 02:09:23,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 160. [2019-09-10 02:09:23,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-10 02:09:23,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2019-09-10 02:09:23,380 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 128 [2019-09-10 02:09:23,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:23,380 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2019-09-10 02:09:23,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-10 02:09:23,380 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2019-09-10 02:09:23,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 02:09:23,380 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:23,380 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:09:23,381 INFO L418 AbstractCegarLoop]: === Iteration 134 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:23,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:23,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1925840143, now seen corresponding path program 14 times [2019-09-10 02:09:23,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:23,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:23,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:09:23,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:23,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:23,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:23,788 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 329 proven. 105 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:09:23,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:23,788 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:23,789 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:23,789 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:23,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:23,789 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:09:23,799 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:09:23,799 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:09:23,846 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-10 02:09:23,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:09:23,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-10 02:09:23,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:24,386 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 329 proven. 105 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:09:24,387 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:24,741 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 329 proven. 105 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:09:24,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:24,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 52 [2019-09-10 02:09:24,744 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:24,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-10 02:09:24,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-10 02:09:24,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=585, Invalid=2067, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:09:24,746 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 52 states. [2019-09-10 02:09:26,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:26,076 INFO L93 Difference]: Finished difference Result 1001 states and 1272 transitions. [2019-09-10 02:09:26,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-10 02:09:26,077 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 128 [2019-09-10 02:09:26,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:26,079 INFO L225 Difference]: With dead ends: 1001 [2019-09-10 02:09:26,079 INFO L226 Difference]: Without dead ends: 957 [2019-09-10 02:09:26,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 208 SyntacticMatches, 32 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3611 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1795, Invalid=7711, Unknown=0, NotChecked=0, Total=9506 [2019-09-10 02:09:26,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2019-09-10 02:09:26,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 162. [2019-09-10 02:09:26,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-09-10 02:09:26,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 179 transitions. [2019-09-10 02:09:26,090 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 179 transitions. Word has length 128 [2019-09-10 02:09:26,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:26,090 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 179 transitions. [2019-09-10 02:09:26,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-10 02:09:26,090 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 179 transitions. [2019-09-10 02:09:26,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 02:09:26,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:26,091 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:09:26,091 INFO L418 AbstractCegarLoop]: === Iteration 135 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:26,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:26,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1309179961, now seen corresponding path program 28 times [2019-09-10 02:09:26,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:26,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:26,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:09:26,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:26,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:26,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:26,258 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 148 proven. 301 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:09:26,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:26,258 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:26,259 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:26,259 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:26,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:26,259 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:09:26,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:09:26,270 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:09:26,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:26,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-10 02:09:26,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:26,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:09:26,344 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 148 proven. 301 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:09:26,344 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:26,551 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 148 proven. 301 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-10 02:09:26,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:26,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 22 [2019-09-10 02:09:26,554 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:26,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 02:09:26,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 02:09:26,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=299, Unknown=0, NotChecked=0, Total=462 [2019-09-10 02:09:26,555 INFO L87 Difference]: Start difference. First operand 162 states and 179 transitions. Second operand 22 states. [2019-09-10 02:09:26,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:26,849 INFO L93 Difference]: Finished difference Result 173 states and 191 transitions. [2019-09-10 02:09:26,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 02:09:26,850 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 129 [2019-09-10 02:09:26,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:26,851 INFO L225 Difference]: With dead ends: 173 [2019-09-10 02:09:26,851 INFO L226 Difference]: Without dead ends: 173 [2019-09-10 02:09:26,851 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 241 SyntacticMatches, 30 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=337, Unknown=0, NotChecked=0, Total=506 [2019-09-10 02:09:26,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-09-10 02:09:26,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 169. [2019-09-10 02:09:26,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-09-10 02:09:26,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 186 transitions. [2019-09-10 02:09:26,854 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 186 transitions. Word has length 129 [2019-09-10 02:09:26,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:26,854 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 186 transitions. [2019-09-10 02:09:26,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 02:09:26,854 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 186 transitions. [2019-09-10 02:09:26,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 02:09:26,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:26,855 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:09:26,855 INFO L418 AbstractCegarLoop]: === Iteration 136 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:26,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:26,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1451640816, now seen corresponding path program 29 times [2019-09-10 02:09:26,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:26,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:26,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:09:26,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:26,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:27,310 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 375 proven. 120 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:09:27,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:27,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:27,310 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:27,311 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:27,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:27,311 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:09:27,320 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:09:27,321 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:09:27,368 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-10 02:09:27,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:09:27,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-10 02:09:27,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:28,260 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 375 proven. 120 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:09:28,260 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:28,691 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 375 proven. 120 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:09:28,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:28,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 70 [2019-09-10 02:09:28,694 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:28,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-10 02:09:28,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-10 02:09:28,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=955, Invalid=3875, Unknown=0, NotChecked=0, Total=4830 [2019-09-10 02:09:28,697 INFO L87 Difference]: Start difference. First operand 169 states and 186 transitions. Second operand 70 states. [2019-09-10 02:09:30,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:30,231 INFO L93 Difference]: Finished difference Result 280 states and 329 transitions. [2019-09-10 02:09:30,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 02:09:30,231 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 136 [2019-09-10 02:09:30,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:30,232 INFO L225 Difference]: With dead ends: 280 [2019-09-10 02:09:30,232 INFO L226 Difference]: Without dead ends: 233 [2019-09-10 02:09:30,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 206 SyntacticMatches, 34 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5300 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2009, Invalid=8703, Unknown=0, NotChecked=0, Total=10712 [2019-09-10 02:09:30,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-09-10 02:09:30,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 170. [2019-09-10 02:09:30,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-10 02:09:30,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2019-09-10 02:09:30,238 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 136 [2019-09-10 02:09:30,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:30,238 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2019-09-10 02:09:30,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-10 02:09:30,238 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2019-09-10 02:09:30,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 02:09:30,239 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:30,239 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:09:30,239 INFO L418 AbstractCegarLoop]: === Iteration 137 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:30,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:30,239 INFO L82 PathProgramCache]: Analyzing trace with hash -837586289, now seen corresponding path program 92 times [2019-09-10 02:09:30,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:30,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:30,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:09:30,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:30,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:30,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:30,713 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 375 proven. 106 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:09:30,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:30,713 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:30,713 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:30,713 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:30,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:30,713 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:09:30,722 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:09:30,723 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:09:30,774 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-10 02:09:30,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:09:30,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-10 02:09:30,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:31,622 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 375 proven. 106 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:09:31,622 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:32,049 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 375 proven. 106 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:09:32,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:32,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 69 [2019-09-10 02:09:32,053 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:32,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-10 02:09:32,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-10 02:09:32,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=907, Invalid=3785, Unknown=0, NotChecked=0, Total=4692 [2019-09-10 02:09:32,054 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 69 states. [2019-09-10 02:09:33,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:33,760 INFO L93 Difference]: Finished difference Result 343 states and 409 transitions. [2019-09-10 02:09:33,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-10 02:09:33,761 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2019-09-10 02:09:33,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:33,761 INFO L225 Difference]: With dead ends: 343 [2019-09-10 02:09:33,762 INFO L226 Difference]: Without dead ends: 296 [2019-09-10 02:09:33,763 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 207 SyntacticMatches, 34 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6312 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2485, Invalid=11321, Unknown=0, NotChecked=0, Total=13806 [2019-09-10 02:09:33,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-10 02:09:33,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 170. [2019-09-10 02:09:33,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-10 02:09:33,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2019-09-10 02:09:33,765 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 136 [2019-09-10 02:09:33,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:33,765 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2019-09-10 02:09:33,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-10 02:09:33,765 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2019-09-10 02:09:33,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 02:09:33,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:33,766 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 13, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:09:33,766 INFO L418 AbstractCegarLoop]: === Iteration 138 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:33,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:33,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1814621232, now seen corresponding path program 93 times [2019-09-10 02:09:33,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:33,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:33,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:09:33,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:33,767 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:33,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:34,225 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 375 proven. 94 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:09:34,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:34,226 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:34,226 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:34,226 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:34,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:34,226 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:09:34,236 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:09:34,236 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:09:34,277 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:09:34,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:09:34,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-10 02:09:34,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:35,133 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 375 proven. 94 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:09:35,134 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:35,548 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 375 proven. 94 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:09:35,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:35,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 68 [2019-09-10 02:09:35,551 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:35,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-10 02:09:35,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-10 02:09:35,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=863, Invalid=3693, Unknown=0, NotChecked=0, Total=4556 [2019-09-10 02:09:35,552 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 68 states. [2019-09-10 02:09:37,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:37,321 INFO L93 Difference]: Finished difference Result 405 states and 488 transitions. [2019-09-10 02:09:37,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-10 02:09:37,322 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 136 [2019-09-10 02:09:37,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:37,323 INFO L225 Difference]: With dead ends: 405 [2019-09-10 02:09:37,323 INFO L226 Difference]: Without dead ends: 358 [2019-09-10 02:09:37,324 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 208 SyntacticMatches, 34 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7338 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2971, Invalid=13799, Unknown=0, NotChecked=0, Total=16770 [2019-09-10 02:09:37,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-09-10 02:09:37,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 170. [2019-09-10 02:09:37,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-10 02:09:37,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2019-09-10 02:09:37,327 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 136 [2019-09-10 02:09:37,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:37,327 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2019-09-10 02:09:37,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-10 02:09:37,327 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2019-09-10 02:09:37,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 02:09:37,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:37,328 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 12, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:09:37,328 INFO L418 AbstractCegarLoop]: === Iteration 139 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:37,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:37,328 INFO L82 PathProgramCache]: Analyzing trace with hash -593675665, now seen corresponding path program 94 times [2019-09-10 02:09:37,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:37,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:37,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:09:37,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:37,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:37,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:37,863 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 375 proven. 84 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:09:37,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:37,864 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:37,864 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:37,864 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:37,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:37,864 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:09:37,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:09:37,874 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:09:37,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:37,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-10 02:09:37,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:38,736 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 375 proven. 84 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:09:38,736 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:39,177 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 375 proven. 84 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:09:39,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:39,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 67 [2019-09-10 02:09:39,180 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:39,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-10 02:09:39,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-10 02:09:39,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=823, Invalid=3599, Unknown=0, NotChecked=0, Total=4422 [2019-09-10 02:09:39,181 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 67 states. [2019-09-10 02:09:41,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:41,414 INFO L93 Difference]: Finished difference Result 466 states and 566 transitions. [2019-09-10 02:09:41,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-10 02:09:41,418 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 136 [2019-09-10 02:09:41,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:41,419 INFO L225 Difference]: With dead ends: 466 [2019-09-10 02:09:41,419 INFO L226 Difference]: Without dead ends: 419 [2019-09-10 02:09:41,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 209 SyntacticMatches, 34 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8304 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3431, Invalid=16029, Unknown=0, NotChecked=0, Total=19460 [2019-09-10 02:09:41,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-09-10 02:09:41,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 170. [2019-09-10 02:09:41,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-10 02:09:41,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2019-09-10 02:09:41,424 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 136 [2019-09-10 02:09:41,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:41,424 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2019-09-10 02:09:41,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-10 02:09:41,424 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2019-09-10 02:09:41,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 02:09:41,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:41,424 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 11, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:09:41,425 INFO L418 AbstractCegarLoop]: === Iteration 140 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:41,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:41,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1129752656, now seen corresponding path program 95 times [2019-09-10 02:09:41,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:41,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:41,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:09:41,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:41,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:41,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:41,894 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 375 proven. 76 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:09:41,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:41,895 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:41,895 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:41,895 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:41,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:41,895 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:09:41,904 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:09:41,904 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:09:41,959 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-10 02:09:41,959 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:09:41,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-10 02:09:41,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:42,760 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 375 proven. 76 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:09:42,761 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:43,177 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 375 proven. 76 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:09:43,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:43,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 66 [2019-09-10 02:09:43,180 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:43,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-10 02:09:43,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-10 02:09:43,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=787, Invalid=3503, Unknown=0, NotChecked=0, Total=4290 [2019-09-10 02:09:43,181 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 66 states. [2019-09-10 02:09:45,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:45,689 INFO L93 Difference]: Finished difference Result 526 states and 643 transitions. [2019-09-10 02:09:45,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-10 02:09:45,689 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 136 [2019-09-10 02:09:45,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:45,691 INFO L225 Difference]: With dead ends: 526 [2019-09-10 02:09:45,691 INFO L226 Difference]: Without dead ends: 479 [2019-09-10 02:09:45,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 210 SyntacticMatches, 34 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9148 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3835, Invalid=17921, Unknown=0, NotChecked=0, Total=21756 [2019-09-10 02:09:45,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-09-10 02:09:45,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 170. [2019-09-10 02:09:45,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-10 02:09:45,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2019-09-10 02:09:45,695 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 136 [2019-09-10 02:09:45,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:45,695 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2019-09-10 02:09:45,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-10 02:09:45,696 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2019-09-10 02:09:45,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 02:09:45,696 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:45,696 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 10, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:09:45,696 INFO L418 AbstractCegarLoop]: === Iteration 141 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:45,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:45,696 INFO L82 PathProgramCache]: Analyzing trace with hash -2001241521, now seen corresponding path program 96 times [2019-09-10 02:09:45,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:45,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:45,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:09:45,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:45,697 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:46,157 INFO L134 CoverageAnalysis]: Checked inductivity of 865 backedges. 375 proven. 70 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:09:46,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:46,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:46,157 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:46,157 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:46,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:46,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:09:46,166 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:09:46,167 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:09:46,210 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:09:46,211 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:09:46,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-10 02:09:46,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:47,003 INFO L134 CoverageAnalysis]: Checked inductivity of 865 backedges. 375 proven. 70 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:09:47,004 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:47,408 INFO L134 CoverageAnalysis]: Checked inductivity of 865 backedges. 375 proven. 70 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:09:47,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:47,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 65 [2019-09-10 02:09:47,411 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:47,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-10 02:09:47,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-10 02:09:47,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=755, Invalid=3405, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 02:09:47,413 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 65 states. [2019-09-10 02:09:49,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:49,536 INFO L93 Difference]: Finished difference Result 585 states and 719 transitions. [2019-09-10 02:09:49,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-09-10 02:09:49,537 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 136 [2019-09-10 02:09:49,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:49,538 INFO L225 Difference]: With dead ends: 585 [2019-09-10 02:09:49,538 INFO L226 Difference]: Without dead ends: 538 [2019-09-10 02:09:49,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 211 SyntacticMatches, 34 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9820 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4159, Invalid=19403, Unknown=0, NotChecked=0, Total=23562 [2019-09-10 02:09:49,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-09-10 02:09:49,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 170. [2019-09-10 02:09:49,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-10 02:09:49,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2019-09-10 02:09:49,544 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 136 [2019-09-10 02:09:49,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:49,544 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2019-09-10 02:09:49,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-10 02:09:49,544 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2019-09-10 02:09:49,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 02:09:49,545 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:49,545 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 9, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:09:49,545 INFO L418 AbstractCegarLoop]: === Iteration 142 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:49,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:49,545 INFO L82 PathProgramCache]: Analyzing trace with hash -855315344, now seen corresponding path program 97 times [2019-09-10 02:09:49,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:49,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:49,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:09:49,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:49,546 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:49,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:49,984 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 375 proven. 66 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:09:49,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:49,984 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:49,984 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:49,984 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:49,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:49,984 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:09:49,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:09:49,996 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:09:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:50,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-10 02:09:50,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:50,801 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 375 proven. 66 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:09:50,801 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:51,195 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 375 proven. 66 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:09:51,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:51,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 64 [2019-09-10 02:09:51,198 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:51,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-10 02:09:51,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-10 02:09:51,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=727, Invalid=3305, Unknown=0, NotChecked=0, Total=4032 [2019-09-10 02:09:51,199 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 64 states. [2019-09-10 02:09:53,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:53,690 INFO L93 Difference]: Finished difference Result 643 states and 794 transitions. [2019-09-10 02:09:53,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-09-10 02:09:53,691 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 136 [2019-09-10 02:09:53,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:53,692 INFO L225 Difference]: With dead ends: 643 [2019-09-10 02:09:53,692 INFO L226 Difference]: Without dead ends: 596 [2019-09-10 02:09:53,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 212 SyntacticMatches, 34 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10282 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4385, Invalid=20421, Unknown=0, NotChecked=0, Total=24806 [2019-09-10 02:09:53,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-09-10 02:09:53,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 170. [2019-09-10 02:09:53,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-10 02:09:53,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2019-09-10 02:09:53,698 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 136 [2019-09-10 02:09:53,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:53,698 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2019-09-10 02:09:53,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-10 02:09:53,698 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2019-09-10 02:09:53,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 02:09:53,699 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:53,699 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:09:53,699 INFO L418 AbstractCegarLoop]: === Iteration 143 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:53,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:53,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1814049327, now seen corresponding path program 98 times [2019-09-10 02:09:53,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:53,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:53,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:09:53,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:53,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:53,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:54,139 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 375 proven. 64 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:09:54,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:54,140 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:54,140 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:54,140 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:54,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:54,140 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:09:54,150 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:09:54,150 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:09:54,203 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-10 02:09:54,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:09:54,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-10 02:09:54,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:55,036 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 375 proven. 64 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:09:55,036 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:55,440 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 375 proven. 64 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:09:55,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:55,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 63 [2019-09-10 02:09:55,443 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:55,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-10 02:09:55,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-10 02:09:55,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=3203, Unknown=0, NotChecked=0, Total=3906 [2019-09-10 02:09:55,444 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 63 states. [2019-09-10 02:09:58,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:58,266 INFO L93 Difference]: Finished difference Result 700 states and 868 transitions. [2019-09-10 02:09:58,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-09-10 02:09:58,267 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 136 [2019-09-10 02:09:58,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:58,268 INFO L225 Difference]: With dead ends: 700 [2019-09-10 02:09:58,268 INFO L226 Difference]: Without dead ends: 653 [2019-09-10 02:09:58,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 213 SyntacticMatches, 34 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10508 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4501, Invalid=20939, Unknown=0, NotChecked=0, Total=25440 [2019-09-10 02:09:58,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-09-10 02:09:58,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 170. [2019-09-10 02:09:58,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-10 02:09:58,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2019-09-10 02:09:58,276 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 136 [2019-09-10 02:09:58,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:58,276 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2019-09-10 02:09:58,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-10 02:09:58,276 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2019-09-10 02:09:58,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 02:09:58,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:58,276 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:09:58,277 INFO L418 AbstractCegarLoop]: === Iteration 144 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:58,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:58,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1068873872, now seen corresponding path program 99 times [2019-09-10 02:09:58,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:58,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:58,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:09:58,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:58,277 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:58,750 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 375 proven. 64 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:09:58,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:58,751 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:58,751 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:58,751 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:58,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:58,751 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:09:58,760 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:09:58,760 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:09:58,804 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:09:58,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:09:58,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-10 02:09:58,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:59,515 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 375 proven. 64 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:09:59,515 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:59,925 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 375 proven. 64 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:09:59,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:59,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 62 [2019-09-10 02:09:59,928 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:59,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-10 02:09:59,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-10 02:09:59,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=683, Invalid=3099, Unknown=0, NotChecked=0, Total=3782 [2019-09-10 02:09:59,929 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 62 states. [2019-09-10 02:10:02,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:10:02,355 INFO L93 Difference]: Finished difference Result 756 states and 941 transitions. [2019-09-10 02:10:02,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-09-10 02:10:02,356 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 136 [2019-09-10 02:10:02,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:10:02,357 INFO L225 Difference]: With dead ends: 756 [2019-09-10 02:10:02,357 INFO L226 Difference]: Without dead ends: 709 [2019-09-10 02:10:02,359 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 214 SyntacticMatches, 34 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10484 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4501, Invalid=20939, Unknown=0, NotChecked=0, Total=25440 [2019-09-10 02:10:02,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2019-09-10 02:10:02,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 170. [2019-09-10 02:10:02,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-10 02:10:02,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2019-09-10 02:10:02,365 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 136 [2019-09-10 02:10:02,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:10:02,365 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2019-09-10 02:10:02,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-10 02:10:02,365 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2019-09-10 02:10:02,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 02:10:02,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:10:02,366 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 9, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:10:02,366 INFO L418 AbstractCegarLoop]: === Iteration 145 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:10:02,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:10:02,367 INFO L82 PathProgramCache]: Analyzing trace with hash 2014667279, now seen corresponding path program 100 times [2019-09-10 02:10:02,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:10:02,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:02,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:10:02,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:02,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:10:02,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:02,860 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 375 proven. 66 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:10:02,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:02,860 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:10:02,860 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:10:02,860 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:10:02,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:02,860 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:10:02,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:10:02,870 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:10:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:02,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-10 02:10:02,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:10:03,618 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 375 proven. 66 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:10:03,618 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:10:04,004 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 375 proven. 66 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:10:04,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:10:04,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 61 [2019-09-10 02:10:04,007 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:10:04,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-10 02:10:04,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-10 02:10:04,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=667, Invalid=2993, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 02:10:04,009 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 61 states. [2019-09-10 02:10:06,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:10:06,832 INFO L93 Difference]: Finished difference Result 811 states and 1013 transitions. [2019-09-10 02:10:06,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-09-10 02:10:06,832 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 136 [2019-09-10 02:10:06,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:10:06,834 INFO L225 Difference]: With dead ends: 811 [2019-09-10 02:10:06,834 INFO L226 Difference]: Without dead ends: 764 [2019-09-10 02:10:06,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 215 SyntacticMatches, 34 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10204 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4385, Invalid=20421, Unknown=0, NotChecked=0, Total=24806 [2019-09-10 02:10:06,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-09-10 02:10:06,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 170. [2019-09-10 02:10:06,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-10 02:10:06,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2019-09-10 02:10:06,842 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 136 [2019-09-10 02:10:06,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:10:06,843 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2019-09-10 02:10:06,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-10 02:10:06,843 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2019-09-10 02:10:06,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 02:10:06,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:10:06,844 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 10, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:10:06,844 INFO L418 AbstractCegarLoop]: === Iteration 146 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:10:06,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:10:06,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1972695888, now seen corresponding path program 101 times [2019-09-10 02:10:06,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:10:06,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:06,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:10:06,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:06,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:10:06,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:07,285 INFO L134 CoverageAnalysis]: Checked inductivity of 865 backedges. 375 proven. 70 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:10:07,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:07,286 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:10:07,286 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:10:07,286 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:10:07,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:07,286 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:10:07,296 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:10:07,296 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:10:07,347 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-10 02:10:07,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:10:07,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-10 02:10:07,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:10:08,031 INFO L134 CoverageAnalysis]: Checked inductivity of 865 backedges. 375 proven. 70 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:10:08,031 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:10:08,443 INFO L134 CoverageAnalysis]: Checked inductivity of 865 backedges. 375 proven. 70 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:10:08,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:10:08,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 60 [2019-09-10 02:10:08,446 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:10:08,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-10 02:10:08,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-10 02:10:08,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=655, Invalid=2885, Unknown=0, NotChecked=0, Total=3540 [2019-09-10 02:10:08,447 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 60 states. [2019-09-10 02:10:11,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:10:11,202 INFO L93 Difference]: Finished difference Result 865 states and 1084 transitions. [2019-09-10 02:10:11,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-09-10 02:10:11,202 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 136 [2019-09-10 02:10:11,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:10:11,204 INFO L225 Difference]: With dead ends: 865 [2019-09-10 02:10:11,204 INFO L226 Difference]: Without dead ends: 818 [2019-09-10 02:10:11,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 216 SyntacticMatches, 34 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9670 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4159, Invalid=19403, Unknown=0, NotChecked=0, Total=23562 [2019-09-10 02:10:11,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-09-10 02:10:11,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 170. [2019-09-10 02:10:11,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-10 02:10:11,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2019-09-10 02:10:11,212 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 136 [2019-09-10 02:10:11,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:10:11,212 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2019-09-10 02:10:11,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-10 02:10:11,212 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2019-09-10 02:10:11,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 02:10:11,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:10:11,213 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 11, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:10:11,213 INFO L418 AbstractCegarLoop]: === Iteration 147 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:10:11,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:10:11,213 INFO L82 PathProgramCache]: Analyzing trace with hash -715847185, now seen corresponding path program 102 times [2019-09-10 02:10:11,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:10:11,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:11,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:10:11,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:11,214 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:10:11,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:11,695 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 375 proven. 76 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:10:11,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:11,696 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:10:11,696 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:10:11,696 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:10:11,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:11,696 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:10:11,706 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:10:11,706 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:10:11,750 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:10:11,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:10:11,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-10 02:10:11,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:10:12,418 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 375 proven. 76 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:10:12,418 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:10:12,807 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 375 proven. 76 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:10:12,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:10:12,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 59 [2019-09-10 02:10:12,810 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:10:12,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-10 02:10:12,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-10 02:10:12,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=647, Invalid=2775, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 02:10:12,811 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 59 states. [2019-09-10 02:10:15,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:10:15,186 INFO L93 Difference]: Finished difference Result 918 states and 1154 transitions. [2019-09-10 02:10:15,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-09-10 02:10:15,187 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 136 [2019-09-10 02:10:15,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:10:15,189 INFO L225 Difference]: With dead ends: 918 [2019-09-10 02:10:15,189 INFO L226 Difference]: Without dead ends: 871 [2019-09-10 02:10:15,190 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 217 SyntacticMatches, 34 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8896 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3835, Invalid=17921, Unknown=0, NotChecked=0, Total=21756 [2019-09-10 02:10:15,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2019-09-10 02:10:15,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 170. [2019-09-10 02:10:15,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-10 02:10:15,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2019-09-10 02:10:15,197 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 136 [2019-09-10 02:10:15,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:10:15,197 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2019-09-10 02:10:15,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-10 02:10:15,198 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2019-09-10 02:10:15,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 02:10:15,198 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:10:15,198 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 12, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:10:15,198 INFO L418 AbstractCegarLoop]: === Iteration 148 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:10:15,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:10:15,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1957095632, now seen corresponding path program 103 times [2019-09-10 02:10:15,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:10:15,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:15,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:10:15,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:15,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:10:15,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:15,625 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 375 proven. 84 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:10:15,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:15,625 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:10:15,625 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:10:15,625 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:10:15,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:15,626 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:10:15,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:10:15,636 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:10:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:15,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-10 02:10:15,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:10:16,306 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 375 proven. 84 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:10:16,306 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:10:16,689 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 375 proven. 84 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:10:16,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:10:16,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 58 [2019-09-10 02:10:16,692 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:10:16,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-10 02:10:16,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-10 02:10:16,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=643, Invalid=2663, Unknown=0, NotChecked=0, Total=3306 [2019-09-10 02:10:16,693 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 58 states. [2019-09-10 02:10:19,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:10:19,045 INFO L93 Difference]: Finished difference Result 970 states and 1223 transitions. [2019-09-10 02:10:19,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-09-10 02:10:19,046 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 136 [2019-09-10 02:10:19,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:10:19,047 INFO L225 Difference]: With dead ends: 970 [2019-09-10 02:10:19,047 INFO L226 Difference]: Without dead ends: 923 [2019-09-10 02:10:19,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 218 SyntacticMatches, 34 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7908 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3431, Invalid=16029, Unknown=0, NotChecked=0, Total=19460 [2019-09-10 02:10:19,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2019-09-10 02:10:19,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 170. [2019-09-10 02:10:19,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-10 02:10:19,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2019-09-10 02:10:19,056 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 136 [2019-09-10 02:10:19,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:10:19,056 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2019-09-10 02:10:19,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-10 02:10:19,056 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2019-09-10 02:10:19,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 02:10:19,056 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:10:19,056 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 13, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:10:19,057 INFO L418 AbstractCegarLoop]: === Iteration 149 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:10:19,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:10:19,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1004721713, now seen corresponding path program 104 times [2019-09-10 02:10:19,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:10:19,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:19,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:10:19,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:19,057 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:10:19,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:19,531 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 375 proven. 94 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:10:19,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:19,531 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:10:19,531 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:10:19,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:10:19,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:19,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:10:19,541 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:10:19,542 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:10:19,590 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-10 02:10:19,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:10:19,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-10 02:10:19,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:10:20,215 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 375 proven. 94 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:10:20,215 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:10:20,611 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 375 proven. 94 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:10:20,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:10:20,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 57 [2019-09-10 02:10:20,614 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:10:20,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-10 02:10:20,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-10 02:10:20,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=643, Invalid=2549, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 02:10:20,616 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 57 states. [2019-09-10 02:10:22,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:10:22,698 INFO L93 Difference]: Finished difference Result 1021 states and 1291 transitions. [2019-09-10 02:10:22,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-10 02:10:22,698 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 136 [2019-09-10 02:10:22,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:10:22,700 INFO L225 Difference]: With dead ends: 1021 [2019-09-10 02:10:22,700 INFO L226 Difference]: Without dead ends: 974 [2019-09-10 02:10:22,701 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 219 SyntacticMatches, 34 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6744 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2971, Invalid=13799, Unknown=0, NotChecked=0, Total=16770 [2019-09-10 02:10:22,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-09-10 02:10:22,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 170. [2019-09-10 02:10:22,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-10 02:10:22,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2019-09-10 02:10:22,712 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 136 [2019-09-10 02:10:22,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:10:22,712 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2019-09-10 02:10:22,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-10 02:10:22,712 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2019-09-10 02:10:22,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 02:10:22,713 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:10:22,713 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:10:22,713 INFO L418 AbstractCegarLoop]: === Iteration 150 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:10:22,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:10:22,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1100264208, now seen corresponding path program 105 times [2019-09-10 02:10:22,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:10:22,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:22,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:10:22,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:22,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:10:22,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:23,146 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 375 proven. 106 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:10:23,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:23,147 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:10:23,147 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:10:23,147 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:10:23,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:23,147 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:10:23,157 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:10:23,158 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:10:23,200 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:10:23,200 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:10:23,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-10 02:10:23,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:10:23,802 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 375 proven. 106 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:10:23,802 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:10:24,210 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 375 proven. 106 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:10:24,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:10:24,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 56 [2019-09-10 02:10:24,213 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:10:24,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-10 02:10:24,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-10 02:10:24,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=647, Invalid=2433, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 02:10:24,214 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 56 states. [2019-09-10 02:10:26,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:10:26,027 INFO L93 Difference]: Finished difference Result 1071 states and 1358 transitions. [2019-09-10 02:10:26,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-10 02:10:26,028 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 136 [2019-09-10 02:10:26,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:10:26,030 INFO L225 Difference]: With dead ends: 1071 [2019-09-10 02:10:26,030 INFO L226 Difference]: Without dead ends: 1024 [2019-09-10 02:10:26,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 220 SyntacticMatches, 34 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5454 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2485, Invalid=11321, Unknown=0, NotChecked=0, Total=13806 [2019-09-10 02:10:26,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2019-09-10 02:10:26,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 170. [2019-09-10 02:10:26,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-10 02:10:26,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2019-09-10 02:10:26,042 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 136 [2019-09-10 02:10:26,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:10:26,042 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2019-09-10 02:10:26,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-10 02:10:26,042 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2019-09-10 02:10:26,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 02:10:26,043 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:10:26,043 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:10:26,043 INFO L418 AbstractCegarLoop]: === Iteration 151 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:10:26,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:10:26,043 INFO L82 PathProgramCache]: Analyzing trace with hash 2083242415, now seen corresponding path program 15 times [2019-09-10 02:10:26,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:10:26,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:26,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:10:26,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:26,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:10:26,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:26,475 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 375 proven. 120 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:10:26,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:26,476 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:10:26,476 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:10:26,476 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:10:26,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:26,476 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:10:26,486 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:10:26,486 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:10:26,537 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:10:26,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:10:26,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-10 02:10:26,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:10:27,104 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 375 proven. 120 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:10:27,105 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:10:27,514 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 375 proven. 120 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:10:27,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:10:27,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 55 [2019-09-10 02:10:27,517 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:10:27,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-10 02:10:27,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-10 02:10:27,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=655, Invalid=2315, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 02:10:27,518 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 55 states. [2019-09-10 02:10:28,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:10:28,954 INFO L93 Difference]: Finished difference Result 1123 states and 1428 transitions. [2019-09-10 02:10:28,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-10 02:10:28,955 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 136 [2019-09-10 02:10:28,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:10:28,957 INFO L225 Difference]: With dead ends: 1123 [2019-09-10 02:10:28,957 INFO L226 Difference]: Without dead ends: 1076 [2019-09-10 02:10:28,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 221 SyntacticMatches, 34 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4100 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2009, Invalid=8703, Unknown=0, NotChecked=0, Total=10712 [2019-09-10 02:10:28,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2019-09-10 02:10:28,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 172. [2019-09-10 02:10:28,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-10 02:10:28,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 190 transitions. [2019-09-10 02:10:28,968 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 190 transitions. Word has length 136 [2019-09-10 02:10:28,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:10:28,969 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 190 transitions. [2019-09-10 02:10:28,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-10 02:10:28,969 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 190 transitions. [2019-09-10 02:10:28,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 02:10:28,969 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:10:28,969 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:10:28,970 INFO L418 AbstractCegarLoop]: === Iteration 152 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:10:28,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:10:28,970 INFO L82 PathProgramCache]: Analyzing trace with hash -769222744, now seen corresponding path program 30 times [2019-09-10 02:10:28,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:10:28,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:28,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:10:28,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:28,971 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:10:28,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:29,138 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 166 proven. 345 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:10:29,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:29,139 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:10:29,139 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:10:29,139 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:10:29,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:29,139 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:10:29,150 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:10:29,150 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:10:29,194 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:10:29,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:10:29,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-10 02:10:29,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:10:29,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:10:29,231 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 166 proven. 345 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:10:29,232 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:10:29,470 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 166 proven. 345 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:10:29,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:10:29,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 23 [2019-09-10 02:10:29,473 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:10:29,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 02:10:29,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 02:10:29,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=325, Unknown=0, NotChecked=0, Total=506 [2019-09-10 02:10:29,474 INFO L87 Difference]: Start difference. First operand 172 states and 190 transitions. Second operand 23 states. [2019-09-10 02:10:29,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:10:29,757 INFO L93 Difference]: Finished difference Result 183 states and 202 transitions. [2019-09-10 02:10:29,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 02:10:29,757 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 137 [2019-09-10 02:10:29,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:10:29,758 INFO L225 Difference]: With dead ends: 183 [2019-09-10 02:10:29,758 INFO L226 Difference]: Without dead ends: 183 [2019-09-10 02:10:29,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 256 SyntacticMatches, 32 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=187, Invalid=365, Unknown=0, NotChecked=0, Total=552 [2019-09-10 02:10:29,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-09-10 02:10:29,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 179. [2019-09-10 02:10:29,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-09-10 02:10:29,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 197 transitions. [2019-09-10 02:10:29,761 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 197 transitions. Word has length 137 [2019-09-10 02:10:29,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:10:29,761 INFO L475 AbstractCegarLoop]: Abstraction has 179 states and 197 transitions. [2019-09-10 02:10:29,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 02:10:29,761 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 197 transitions. [2019-09-10 02:10:29,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 02:10:29,762 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:10:29,762 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:10:29,762 INFO L418 AbstractCegarLoop]: === Iteration 153 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:10:29,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:10:29,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1314599183, now seen corresponding path program 31 times [2019-09-10 02:10:29,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:10:29,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:29,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:10:29,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:29,763 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:10:29,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:30,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1040 backedges. 424 proven. 136 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:10:30,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:30,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:10:30,277 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:10:30,277 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:10:30,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:30,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:10:30,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:10:30,286 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:10:30,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:30,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-10 02:10:30,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:10:31,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1040 backedges. 424 proven. 136 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:10:31,310 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:10:31,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1040 backedges. 424 proven. 136 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:10:31,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:10:31,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 74 [2019-09-10 02:10:31,786 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:10:31,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-10 02:10:31,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-10 02:10:31,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1065, Invalid=4337, Unknown=0, NotChecked=0, Total=5402 [2019-09-10 02:10:31,787 INFO L87 Difference]: Start difference. First operand 179 states and 197 transitions. Second operand 74 states. [2019-09-10 02:10:33,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:10:33,360 INFO L93 Difference]: Finished difference Result 297 states and 349 transitions. [2019-09-10 02:10:33,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-10 02:10:33,361 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 144 [2019-09-10 02:10:33,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:10:33,361 INFO L225 Difference]: With dead ends: 297 [2019-09-10 02:10:33,362 INFO L226 Difference]: Without dead ends: 247 [2019-09-10 02:10:33,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 218 SyntacticMatches, 36 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5980 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2235, Invalid=9755, Unknown=0, NotChecked=0, Total=11990 [2019-09-10 02:10:33,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-09-10 02:10:33,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 180. [2019-09-10 02:10:33,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-10 02:10:33,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-10 02:10:33,366 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-10 02:10:33,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:10:33,366 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-10 02:10:33,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-10 02:10:33,366 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-10 02:10:33,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 02:10:33,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:10:33,366 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:10:33,367 INFO L418 AbstractCegarLoop]: === Iteration 154 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:10:33,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:10:33,367 INFO L82 PathProgramCache]: Analyzing trace with hash 277740686, now seen corresponding path program 106 times [2019-09-10 02:10:33,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:10:33,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:33,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:10:33,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:33,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:10:33,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:33,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1025 backedges. 424 proven. 121 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:10:33,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:33,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:10:33,875 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:10:33,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:10:33,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:33,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:10:33,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:10:33,885 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:10:33,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:33,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-10 02:10:33,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:10:34,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1025 backedges. 424 proven. 121 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:10:34,869 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:10:35,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1025 backedges. 424 proven. 121 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:10:35,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:10:35,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 73 [2019-09-10 02:10:35,358 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:10:35,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-10 02:10:35,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-10 02:10:35,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1014, Invalid=4242, Unknown=0, NotChecked=0, Total=5256 [2019-09-10 02:10:35,359 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 73 states. [2019-09-10 02:10:36,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:10:36,812 INFO L93 Difference]: Finished difference Result 364 states and 434 transitions. [2019-09-10 02:10:36,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-10 02:10:36,812 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2019-09-10 02:10:36,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:10:36,813 INFO L225 Difference]: With dead ends: 364 [2019-09-10 02:10:36,813 INFO L226 Difference]: Without dead ends: 314 [2019-09-10 02:10:36,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 219 SyntacticMatches, 36 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7140 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2775, Invalid=12725, Unknown=0, NotChecked=0, Total=15500 [2019-09-10 02:10:36,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-10 02:10:36,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 180. [2019-09-10 02:10:36,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-10 02:10:36,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-10 02:10:36,817 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-10 02:10:36,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:10:36,817 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-10 02:10:36,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-10 02:10:36,817 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-10 02:10:36,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 02:10:36,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:10:36,818 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:10:36,818 INFO L418 AbstractCegarLoop]: === Iteration 155 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:10:36,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:10:36,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1629766959, now seen corresponding path program 107 times [2019-09-10 02:10:36,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:10:36,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:36,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:10:36,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:36,819 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:10:36,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:37,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 424 proven. 108 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:10:37,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:37,319 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:10:37,319 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:10:37,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:10:37,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:37,319 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:10:37,329 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:10:37,329 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:10:37,381 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-10 02:10:37,381 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:10:37,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-10 02:10:37,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:10:38,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 424 proven. 108 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:10:38,310 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:10:38,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 424 proven. 108 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:10:38,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:10:38,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 72 [2019-09-10 02:10:38,771 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:10:38,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-10 02:10:38,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-10 02:10:38,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=967, Invalid=4145, Unknown=0, NotChecked=0, Total=5112 [2019-09-10 02:10:38,772 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 72 states. [2019-09-10 02:10:40,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:10:40,882 INFO L93 Difference]: Finished difference Result 430 states and 518 transitions. [2019-09-10 02:10:40,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-10 02:10:40,882 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 144 [2019-09-10 02:10:40,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:10:40,883 INFO L225 Difference]: With dead ends: 430 [2019-09-10 02:10:40,883 INFO L226 Difference]: Without dead ends: 380 [2019-09-10 02:10:40,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 220 SyntacticMatches, 36 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8331 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3334, Invalid=15572, Unknown=0, NotChecked=0, Total=18906 [2019-09-10 02:10:40,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-09-10 02:10:40,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 180. [2019-09-10 02:10:40,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-10 02:10:40,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-10 02:10:40,887 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-10 02:10:40,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:10:40,887 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-10 02:10:40,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-10 02:10:40,887 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-10 02:10:40,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 02:10:40,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:10:40,888 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 13, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:10:40,888 INFO L418 AbstractCegarLoop]: === Iteration 156 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:10:40,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:10:40,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1950475374, now seen corresponding path program 108 times [2019-09-10 02:10:40,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:10:40,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:40,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:10:40,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:40,889 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:10:40,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:41,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 424 proven. 97 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:10:41,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:41,384 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:10:41,384 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:10:41,384 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:10:41,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:41,384 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:10:41,393 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:10:41,394 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:10:41,437 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:10:41,437 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:10:41,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-10 02:10:41,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:10:42,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 424 proven. 97 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:10:42,342 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:10:42,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 424 proven. 97 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:10:42,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:10:42,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 71 [2019-09-10 02:10:42,804 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:10:42,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-10 02:10:42,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-10 02:10:42,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=924, Invalid=4046, Unknown=0, NotChecked=0, Total=4970 [2019-09-10 02:10:42,806 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 71 states. [2019-09-10 02:10:45,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:10:45,435 INFO L93 Difference]: Finished difference Result 495 states and 601 transitions. [2019-09-10 02:10:45,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-10 02:10:45,435 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 144 [2019-09-10 02:10:45,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:10:45,436 INFO L225 Difference]: With dead ends: 495 [2019-09-10 02:10:45,436 INFO L226 Difference]: Without dead ends: 445 [2019-09-10 02:10:45,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 221 SyntacticMatches, 36 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9473 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3873, Invalid=18179, Unknown=0, NotChecked=0, Total=22052 [2019-09-10 02:10:45,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2019-09-10 02:10:45,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 180. [2019-09-10 02:10:45,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-10 02:10:45,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-10 02:10:45,441 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-10 02:10:45,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:10:45,441 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-10 02:10:45,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-10 02:10:45,442 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-10 02:10:45,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 02:10:45,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:10:45,442 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 12, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:10:45,442 INFO L418 AbstractCegarLoop]: === Iteration 157 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:10:45,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:10:45,443 INFO L82 PathProgramCache]: Analyzing trace with hash -2057051825, now seen corresponding path program 109 times [2019-09-10 02:10:45,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:10:45,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:45,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:10:45,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:45,443 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:10:45,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:45,948 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 424 proven. 88 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:10:45,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:45,948 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:10:45,948 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:10:45,949 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:10:45,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:45,949 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:10:45,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:10:45,959 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:10:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:46,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-10 02:10:46,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:10:46,913 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 424 proven. 88 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:10:46,913 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:10:47,364 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 424 proven. 88 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:10:47,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:10:47,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 70 [2019-09-10 02:10:47,367 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:10:47,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-10 02:10:47,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-10 02:10:47,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=885, Invalid=3945, Unknown=0, NotChecked=0, Total=4830 [2019-09-10 02:10:47,368 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 70 states. [2019-09-10 02:10:49,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:10:49,862 INFO L93 Difference]: Finished difference Result 559 states and 683 transitions. [2019-09-10 02:10:49,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-10 02:10:49,863 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 144 [2019-09-10 02:10:49,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:10:49,864 INFO L225 Difference]: With dead ends: 559 [2019-09-10 02:10:49,864 INFO L226 Difference]: Without dead ends: 509 [2019-09-10 02:10:49,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 222 SyntacticMatches, 36 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10498 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4359, Invalid=20447, Unknown=0, NotChecked=0, Total=24806 [2019-09-10 02:10:49,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2019-09-10 02:10:49,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 180. [2019-09-10 02:10:49,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-10 02:10:49,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-10 02:10:49,869 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-10 02:10:49,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:10:49,869 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-10 02:10:49,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-10 02:10:49,869 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-10 02:10:49,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 02:10:49,869 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:10:49,869 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 11, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:10:49,870 INFO L418 AbstractCegarLoop]: === Iteration 158 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:10:49,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:10:49,870 INFO L82 PathProgramCache]: Analyzing trace with hash -108116914, now seen corresponding path program 110 times [2019-09-10 02:10:49,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:10:49,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:49,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:10:49,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:49,871 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:10:49,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:50,352 INFO L134 CoverageAnalysis]: Checked inductivity of 985 backedges. 424 proven. 81 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:10:50,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:50,353 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:10:50,353 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:10:50,353 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:10:50,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:50,353 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:10:50,364 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:10:50,365 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:10:50,417 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-10 02:10:50,417 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:10:50,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-10 02:10:50,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:10:51,283 INFO L134 CoverageAnalysis]: Checked inductivity of 985 backedges. 424 proven. 81 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:10:51,283 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:10:51,742 INFO L134 CoverageAnalysis]: Checked inductivity of 985 backedges. 424 proven. 81 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:10:51,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:10:51,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 69 [2019-09-10 02:10:51,745 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:10:51,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-10 02:10:51,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-10 02:10:51,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=850, Invalid=3842, Unknown=0, NotChecked=0, Total=4692 [2019-09-10 02:10:51,746 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 69 states. [2019-09-10 02:10:54,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:10:54,881 INFO L93 Difference]: Finished difference Result 622 states and 764 transitions. [2019-09-10 02:10:54,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-09-10 02:10:54,882 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 144 [2019-09-10 02:10:54,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:10:54,883 INFO L225 Difference]: With dead ends: 622 [2019-09-10 02:10:54,883 INFO L226 Difference]: Without dead ends: 572 [2019-09-10 02:10:54,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 223 SyntacticMatches, 36 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11350 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4765, Invalid=22295, Unknown=0, NotChecked=0, Total=27060 [2019-09-10 02:10:54,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-09-10 02:10:54,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 180. [2019-09-10 02:10:54,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-10 02:10:54,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-10 02:10:54,889 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-10 02:10:54,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:10:54,890 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-10 02:10:54,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-10 02:10:54,890 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-10 02:10:54,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 02:10:54,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:10:54,890 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 10, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:10:54,890 INFO L418 AbstractCegarLoop]: === Iteration 159 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:10:54,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:10:54,891 INFO L82 PathProgramCache]: Analyzing trace with hash 924583279, now seen corresponding path program 111 times [2019-09-10 02:10:54,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:10:54,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:54,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:10:54,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:54,891 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:10:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:55,395 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 424 proven. 76 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:10:55,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:55,395 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:10:55,395 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:10:55,395 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:10:55,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:55,395 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:10:55,411 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:10:55,411 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:10:55,451 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:10:55,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:10:55,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-10 02:10:55,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:10:56,304 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 424 proven. 76 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:10:56,304 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:10:56,763 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 424 proven. 76 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:10:56,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:10:56,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 68 [2019-09-10 02:10:56,766 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:10:56,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-10 02:10:56,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-10 02:10:56,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=819, Invalid=3737, Unknown=0, NotChecked=0, Total=4556 [2019-09-10 02:10:56,767 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 68 states. [2019-09-10 02:10:59,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:10:59,942 INFO L93 Difference]: Finished difference Result 684 states and 844 transitions. [2019-09-10 02:10:59,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-09-10 02:10:59,942 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 144 [2019-09-10 02:10:59,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:10:59,944 INFO L225 Difference]: With dead ends: 684 [2019-09-10 02:10:59,944 INFO L226 Difference]: Without dead ends: 634 [2019-09-10 02:10:59,946 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 224 SyntacticMatches, 36 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11985 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5070, Invalid=23660, Unknown=0, NotChecked=0, Total=28730 [2019-09-10 02:10:59,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-09-10 02:10:59,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 180. [2019-09-10 02:10:59,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-10 02:10:59,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-10 02:10:59,950 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-10 02:10:59,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:10:59,950 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-10 02:10:59,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-10 02:10:59,950 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-10 02:10:59,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 02:10:59,951 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:10:59,951 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 9, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:10:59,951 INFO L418 AbstractCegarLoop]: === Iteration 160 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:10:59,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:10:59,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1674503122, now seen corresponding path program 112 times [2019-09-10 02:10:59,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:10:59,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:59,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:10:59,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:59,973 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:10:59,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:11:00,450 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 424 proven. 73 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:11:00,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:00,450 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:11:00,450 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:11:00,450 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:11:00,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:00,451 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:11:00,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:11:00,460 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:11:00,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:11:00,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-10 02:11:00,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:11:01,334 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 424 proven. 73 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:11:01,334 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:11:01,773 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 424 proven. 73 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:11:01,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:11:01,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 67 [2019-09-10 02:11:01,777 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:11:01,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-10 02:11:01,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-10 02:11:01,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=792, Invalid=3630, Unknown=0, NotChecked=0, Total=4422 [2019-09-10 02:11:01,778 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 67 states. [2019-09-10 02:11:04,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:11:04,891 INFO L93 Difference]: Finished difference Result 745 states and 923 transitions. [2019-09-10 02:11:04,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-09-10 02:11:04,892 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 144 [2019-09-10 02:11:04,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:11:04,893 INFO L225 Difference]: With dead ends: 745 [2019-09-10 02:11:04,893 INFO L226 Difference]: Without dead ends: 695 [2019-09-10 02:11:04,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 225 SyntacticMatches, 36 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12371 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5259, Invalid=24497, Unknown=0, NotChecked=0, Total=29756 [2019-09-10 02:11:04,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2019-09-10 02:11:04,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 180. [2019-09-10 02:11:04,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-10 02:11:04,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-10 02:11:04,900 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-10 02:11:04,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:11:04,900 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-10 02:11:04,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-10 02:11:04,900 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-10 02:11:04,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 02:11:04,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:11:04,901 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:11:04,901 INFO L418 AbstractCegarLoop]: === Iteration 161 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:11:04,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:11:04,901 INFO L82 PathProgramCache]: Analyzing trace with hash 181318031, now seen corresponding path program 113 times [2019-09-10 02:11:04,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:11:04,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:04,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:11:04,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:04,902 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:11:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:11:05,379 INFO L134 CoverageAnalysis]: Checked inductivity of 976 backedges. 424 proven. 72 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:11:05,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:05,379 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:11:05,379 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:11:05,379 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:11:05,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:05,380 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:11:05,390 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:11:05,390 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:11:05,442 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-10 02:11:05,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:11:05,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-10 02:11:05,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:11:06,281 INFO L134 CoverageAnalysis]: Checked inductivity of 976 backedges. 424 proven. 72 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:11:06,281 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:11:06,727 INFO L134 CoverageAnalysis]: Checked inductivity of 976 backedges. 424 proven. 72 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:11:06,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:11:06,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 66 [2019-09-10 02:11:06,730 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:11:06,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-10 02:11:06,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-10 02:11:06,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=769, Invalid=3521, Unknown=0, NotChecked=0, Total=4290 [2019-09-10 02:11:06,731 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 66 states. [2019-09-10 02:11:09,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:11:09,964 INFO L93 Difference]: Finished difference Result 805 states and 1001 transitions. [2019-09-10 02:11:09,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-09-10 02:11:09,964 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 144 [2019-09-10 02:11:09,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:11:09,965 INFO L225 Difference]: With dead ends: 805 [2019-09-10 02:11:09,966 INFO L226 Difference]: Without dead ends: 755 [2019-09-10 02:11:09,967 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 226 SyntacticMatches, 36 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12488 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5323, Invalid=24779, Unknown=0, NotChecked=0, Total=30102 [2019-09-10 02:11:09,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-09-10 02:11:09,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 180. [2019-09-10 02:11:09,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-10 02:11:09,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-10 02:11:09,973 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-10 02:11:09,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:11:09,973 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-10 02:11:09,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-10 02:11:09,973 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-10 02:11:09,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 02:11:09,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:11:09,974 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 9, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:11:09,974 INFO L418 AbstractCegarLoop]: === Iteration 162 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:11:09,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:11:09,974 INFO L82 PathProgramCache]: Analyzing trace with hash 795372558, now seen corresponding path program 114 times [2019-09-10 02:11:09,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:11:09,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:09,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:11:09,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:09,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:11:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:11:10,456 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 424 proven. 73 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:11:10,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:10,456 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:11:10,456 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:11:10,456 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:11:10,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:10,456 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:11:10,465 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:11:10,465 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:11:10,509 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:11:10,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:11:10,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-10 02:11:10,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:11:11,299 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 424 proven. 73 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:11:11,299 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:11:11,760 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 424 proven. 73 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:11:11,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:11:11,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 65 [2019-09-10 02:11:11,763 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:11:11,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-10 02:11:11,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-10 02:11:11,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=750, Invalid=3410, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 02:11:11,764 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 65 states. [2019-09-10 02:11:14,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:11:14,847 INFO L93 Difference]: Finished difference Result 864 states and 1078 transitions. [2019-09-10 02:11:14,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-09-10 02:11:14,848 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 144 [2019-09-10 02:11:14,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:11:14,849 INFO L225 Difference]: With dead ends: 864 [2019-09-10 02:11:14,849 INFO L226 Difference]: Without dead ends: 814 [2019-09-10 02:11:14,851 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 227 SyntacticMatches, 36 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12327 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5259, Invalid=24497, Unknown=0, NotChecked=0, Total=29756 [2019-09-10 02:11:14,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2019-09-10 02:11:14,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 180. [2019-09-10 02:11:14,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-10 02:11:14,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-10 02:11:14,857 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-10 02:11:14,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:11:14,857 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-10 02:11:14,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-10 02:11:14,857 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-10 02:11:14,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 02:11:14,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:11:14,858 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 10, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:11:14,858 INFO L418 AbstractCegarLoop]: === Iteration 163 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:11:14,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:11:14,858 INFO L82 PathProgramCache]: Analyzing trace with hash -847387217, now seen corresponding path program 115 times [2019-09-10 02:11:14,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:11:14,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:14,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:11:14,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:14,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:11:14,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:11:15,381 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 424 proven. 76 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:11:15,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:15,381 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:11:15,381 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:11:15,381 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:11:15,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:15,381 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:11:15,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:11:15,391 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:11:15,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:11:15,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-10 02:11:15,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:11:16,195 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 424 proven. 76 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:11:16,196 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:11:16,644 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 424 proven. 76 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:11:16,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:11:16,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 64 [2019-09-10 02:11:16,647 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:11:16,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-10 02:11:16,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-10 02:11:16,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=735, Invalid=3297, Unknown=0, NotChecked=0, Total=4032 [2019-09-10 02:11:16,648 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 64 states. [2019-09-10 02:11:19,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:11:19,389 INFO L93 Difference]: Finished difference Result 922 states and 1154 transitions. [2019-09-10 02:11:19,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-09-10 02:11:19,389 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 144 [2019-09-10 02:11:19,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:11:19,391 INFO L225 Difference]: With dead ends: 922 [2019-09-10 02:11:19,391 INFO L226 Difference]: Without dead ends: 872 [2019-09-10 02:11:19,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 228 SyntacticMatches, 36 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11885 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5070, Invalid=23660, Unknown=0, NotChecked=0, Total=28730 [2019-09-10 02:11:19,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2019-09-10 02:11:19,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 180. [2019-09-10 02:11:19,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-10 02:11:19,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-10 02:11:19,399 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-10 02:11:19,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:11:19,399 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-10 02:11:19,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-10 02:11:19,399 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-10 02:11:19,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 02:11:19,400 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:11:19,400 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 11, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:11:19,400 INFO L418 AbstractCegarLoop]: === Iteration 164 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:11:19,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:11:19,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1039283182, now seen corresponding path program 116 times [2019-09-10 02:11:19,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:11:19,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:19,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:11:19,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:19,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:11:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:11:19,878 INFO L134 CoverageAnalysis]: Checked inductivity of 985 backedges. 424 proven. 81 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:11:19,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:19,878 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:11:19,878 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:11:19,878 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:11:19,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:19,878 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 163 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 163 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:11:19,891 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:11:19,891 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:11:19,946 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-10 02:11:19,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:11:19,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-10 02:11:19,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:11:20,675 INFO L134 CoverageAnalysis]: Checked inductivity of 985 backedges. 424 proven. 81 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:11:20,675 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:11:21,139 INFO L134 CoverageAnalysis]: Checked inductivity of 985 backedges. 424 proven. 81 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:11:21,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:11:21,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 63 [2019-09-10 02:11:21,142 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:11:21,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-10 02:11:21,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-10 02:11:21,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=724, Invalid=3182, Unknown=0, NotChecked=0, Total=3906 [2019-09-10 02:11:21,143 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 63 states. [2019-09-10 02:11:24,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:11:24,085 INFO L93 Difference]: Finished difference Result 979 states and 1229 transitions. [2019-09-10 02:11:24,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-09-10 02:11:24,085 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 144 [2019-09-10 02:11:24,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:11:24,087 INFO L225 Difference]: With dead ends: 979 [2019-09-10 02:11:24,087 INFO L226 Difference]: Without dead ends: 929 [2019-09-10 02:11:24,089 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 229 SyntacticMatches, 36 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11170 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4765, Invalid=22295, Unknown=0, NotChecked=0, Total=27060 [2019-09-10 02:11:24,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2019-09-10 02:11:24,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 180. [2019-09-10 02:11:24,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-10 02:11:24,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-10 02:11:24,097 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-10 02:11:24,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:11:24,097 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-10 02:11:24,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-10 02:11:24,097 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-10 02:11:24,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 02:11:24,097 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:11:24,097 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 12, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:11:24,098 INFO L418 AbstractCegarLoop]: === Iteration 165 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:11:24,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:11:24,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1532255793, now seen corresponding path program 117 times [2019-09-10 02:11:24,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:11:24,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:24,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:11:24,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:24,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:11:24,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:11:24,569 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 424 proven. 88 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:11:24,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:24,569 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:11:24,569 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:11:24,569 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:11:24,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:24,570 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 164 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 164 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:11:24,580 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:11:24,580 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:11:24,624 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:11:24,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:11:24,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-10 02:11:24,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:11:25,354 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 424 proven. 88 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:11:25,354 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:11:25,798 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 424 proven. 88 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:11:25,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:11:25,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 62 [2019-09-10 02:11:25,801 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:11:25,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-10 02:11:25,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-10 02:11:25,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=717, Invalid=3065, Unknown=0, NotChecked=0, Total=3782 [2019-09-10 02:11:25,802 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 62 states. [2019-09-10 02:11:28,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:11:28,501 INFO L93 Difference]: Finished difference Result 1035 states and 1303 transitions. [2019-09-10 02:11:28,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-09-10 02:11:28,502 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 144 [2019-09-10 02:11:28,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:11:28,503 INFO L225 Difference]: With dead ends: 1035 [2019-09-10 02:11:28,503 INFO L226 Difference]: Without dead ends: 985 [2019-09-10 02:11:28,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 230 SyntacticMatches, 36 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10202 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4359, Invalid=20447, Unknown=0, NotChecked=0, Total=24806 [2019-09-10 02:11:28,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2019-09-10 02:11:28,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 180. [2019-09-10 02:11:28,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-10 02:11:28,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-10 02:11:28,513 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-10 02:11:28,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:11:28,514 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-10 02:11:28,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-10 02:11:28,514 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-10 02:11:28,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 02:11:28,514 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:11:28,514 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 13, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:11:28,514 INFO L418 AbstractCegarLoop]: === Iteration 166 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:11:28,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:11:28,515 INFO L82 PathProgramCache]: Analyzing trace with hash -368282674, now seen corresponding path program 118 times [2019-09-10 02:11:28,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:11:28,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:28,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:11:28,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:28,515 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:11:28,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:11:28,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 424 proven. 97 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:11:28,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:28,994 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:11:28,994 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:11:28,994 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:11:28,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:28,994 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 165 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 165 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:11:29,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:11:29,003 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:11:29,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:11:29,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-10 02:11:29,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:11:29,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 424 proven. 97 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:11:29,743 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:11:30,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 424 proven. 97 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:11:30,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:11:30,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 61 [2019-09-10 02:11:30,200 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:11:30,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-10 02:11:30,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-10 02:11:30,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=714, Invalid=2946, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 02:11:30,201 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 61 states. [2019-09-10 02:11:32,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:11:32,697 INFO L93 Difference]: Finished difference Result 1090 states and 1376 transitions. [2019-09-10 02:11:32,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-09-10 02:11:32,698 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 144 [2019-09-10 02:11:32,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:11:32,700 INFO L225 Difference]: With dead ends: 1090 [2019-09-10 02:11:32,700 INFO L226 Difference]: Without dead ends: 1040 [2019-09-10 02:11:32,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 231 SyntacticMatches, 36 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9013 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3873, Invalid=18179, Unknown=0, NotChecked=0, Total=22052 [2019-09-10 02:11:32,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2019-09-10 02:11:32,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 180. [2019-09-10 02:11:32,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-10 02:11:32,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-10 02:11:32,711 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-10 02:11:32,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:11:32,711 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-10 02:11:32,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-10 02:11:32,711 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-10 02:11:32,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 02:11:32,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:11:32,712 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:11:32,712 INFO L418 AbstractCegarLoop]: === Iteration 167 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:11:32,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:11:32,712 INFO L82 PathProgramCache]: Analyzing trace with hash 777643503, now seen corresponding path program 119 times [2019-09-10 02:11:32,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:11:32,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:32,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:11:32,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:32,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:11:32,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:11:33,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 424 proven. 108 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:11:33,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:33,182 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:11:33,183 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:11:33,183 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:11:33,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:33,183 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 166 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 166 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:11:33,192 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:11:33,192 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:11:33,247 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-10 02:11:33,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:11:33,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-10 02:11:33,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:11:33,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 424 proven. 108 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:11:33,927 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:11:34,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 424 proven. 108 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:11:34,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:11:34,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 60 [2019-09-10 02:11:34,372 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:11:34,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-10 02:11:34,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-10 02:11:34,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=715, Invalid=2825, Unknown=0, NotChecked=0, Total=3540 [2019-09-10 02:11:34,373 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 60 states. [2019-09-10 02:11:36,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:11:36,454 INFO L93 Difference]: Finished difference Result 1144 states and 1448 transitions. [2019-09-10 02:11:36,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-10 02:11:36,454 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 144 [2019-09-10 02:11:36,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:11:36,456 INFO L225 Difference]: With dead ends: 1144 [2019-09-10 02:11:36,456 INFO L226 Difference]: Without dead ends: 1094 [2019-09-10 02:11:36,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 232 SyntacticMatches, 36 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7647 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3334, Invalid=15572, Unknown=0, NotChecked=0, Total=18906 [2019-09-10 02:11:36,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2019-09-10 02:11:36,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 180. [2019-09-10 02:11:36,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-10 02:11:36,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-10 02:11:36,467 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-10 02:11:36,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:11:36,467 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-10 02:11:36,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-10 02:11:36,468 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-10 02:11:36,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 02:11:36,468 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:11:36,468 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:11:36,468 INFO L418 AbstractCegarLoop]: === Iteration 168 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:11:36,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:11:36,468 INFO L82 PathProgramCache]: Analyzing trace with hash -847959122, now seen corresponding path program 120 times [2019-09-10 02:11:36,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:11:36,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:36,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:11:36,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:36,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:11:36,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:11:36,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1025 backedges. 424 proven. 121 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:11:36,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:36,929 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:11:36,929 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:11:36,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:11:36,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:36,930 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 167 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 167 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:11:36,939 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:11:36,939 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:11:36,983 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:11:36,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:11:36,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-10 02:11:36,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:11:37,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1025 backedges. 424 proven. 121 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:11:37,639 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:11:38,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1025 backedges. 424 proven. 121 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:11:38,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:11:38,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 59 [2019-09-10 02:11:38,081 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:11:38,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-10 02:11:38,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-10 02:11:38,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=720, Invalid=2702, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 02:11:38,082 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 59 states. [2019-09-10 02:11:39,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:11:39,848 INFO L93 Difference]: Finished difference Result 1197 states and 1519 transitions. [2019-09-10 02:11:39,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-10 02:11:39,850 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 144 [2019-09-10 02:11:39,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:11:39,852 INFO L225 Difference]: With dead ends: 1197 [2019-09-10 02:11:39,852 INFO L226 Difference]: Without dead ends: 1147 [2019-09-10 02:11:39,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 233 SyntacticMatches, 36 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6160 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2775, Invalid=12725, Unknown=0, NotChecked=0, Total=15500 [2019-09-10 02:11:39,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2019-09-10 02:11:39,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 180. [2019-09-10 02:11:39,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-10 02:11:39,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2019-09-10 02:11:39,868 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 144 [2019-09-10 02:11:39,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:11:39,869 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2019-09-10 02:11:39,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-10 02:11:39,869 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2019-09-10 02:11:39,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 02:11:39,869 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:11:39,869 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:11:39,870 INFO L418 AbstractCegarLoop]: === Iteration 169 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:11:39,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:11:39,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1593134577, now seen corresponding path program 16 times [2019-09-10 02:11:39,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:11:39,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:39,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:11:39,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:39,871 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:11:39,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:11:40,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1040 backedges. 424 proven. 136 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:11:40,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:40,354 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:11:40,354 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:11:40,354 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:11:40,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:40,354 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 168 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 168 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:11:40,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:11:40,364 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:11:40,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:11:40,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-10 02:11:40,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:11:41,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1040 backedges. 424 proven. 136 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:11:41,058 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:11:41,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1040 backedges. 424 proven. 136 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:11:41,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:11:41,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 58 [2019-09-10 02:11:41,499 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:11:41,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-10 02:11:41,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-10 02:11:41,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=729, Invalid=2577, Unknown=0, NotChecked=0, Total=3306 [2019-09-10 02:11:41,499 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand 58 states. [2019-09-10 02:11:43,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:11:43,050 INFO L93 Difference]: Finished difference Result 1252 states and 1593 transitions. [2019-09-10 02:11:43,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-10 02:11:43,050 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 144 [2019-09-10 02:11:43,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:11:43,052 INFO L225 Difference]: With dead ends: 1252 [2019-09-10 02:11:43,052 INFO L226 Difference]: Without dead ends: 1202 [2019-09-10 02:11:43,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 234 SyntacticMatches, 36 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4620 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2235, Invalid=9755, Unknown=0, NotChecked=0, Total=11990 [2019-09-10 02:11:43,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2019-09-10 02:11:43,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 182. [2019-09-10 02:11:43,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-09-10 02:11:43,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 201 transitions. [2019-09-10 02:11:43,066 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 201 transitions. Word has length 144 [2019-09-10 02:11:43,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:11:43,066 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 201 transitions. [2019-09-10 02:11:43,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-10 02:11:43,066 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 201 transitions. [2019-09-10 02:11:43,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 02:11:43,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:11:43,066 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:11:43,067 INFO L418 AbstractCegarLoop]: === Iteration 170 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:11:43,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:11:43,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1336215385, now seen corresponding path program 32 times [2019-09-10 02:11:43,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:11:43,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:43,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:11:43,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:43,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:11:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:11:43,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 185 proven. 392 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:11:43,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:43,271 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:11:43,271 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:11:43,271 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:11:43,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:43,271 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 169 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 169 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:11:43,283 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:11:43,283 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:11:43,341 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-10 02:11:43,341 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:11:43,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-10 02:11:43,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:11:43,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:11:43,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 185 proven. 392 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:11:43,378 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:11:43,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 185 proven. 392 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-10 02:11:43,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:11:43,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 24 [2019-09-10 02:11:43,642 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:11:43,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 02:11:43,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 02:11:43,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2019-09-10 02:11:43,642 INFO L87 Difference]: Start difference. First operand 182 states and 201 transitions. Second operand 24 states. [2019-09-10 02:11:43,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:11:43,998 INFO L93 Difference]: Finished difference Result 193 states and 213 transitions. [2019-09-10 02:11:43,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 02:11:43,998 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 145 [2019-09-10 02:11:43,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:11:43,999 INFO L225 Difference]: With dead ends: 193 [2019-09-10 02:11:43,999 INFO L226 Difference]: Without dead ends: 193 [2019-09-10 02:11:43,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 271 SyntacticMatches, 34 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=206, Invalid=394, Unknown=0, NotChecked=0, Total=600 [2019-09-10 02:11:44,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-09-10 02:11:44,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 189. [2019-09-10 02:11:44,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-10 02:11:44,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 208 transitions. [2019-09-10 02:11:44,002 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 208 transitions. Word has length 145 [2019-09-10 02:11:44,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:11:44,003 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 208 transitions. [2019-09-10 02:11:44,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 02:11:44,003 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 208 transitions. [2019-09-10 02:11:44,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 02:11:44,003 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:11:44,003 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:11:44,003 INFO L418 AbstractCegarLoop]: === Iteration 171 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:11:44,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:11:44,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1211727056, now seen corresponding path program 33 times [2019-09-10 02:11:44,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:11:44,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:44,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:11:44,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:44,004 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:11:44,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:11:44,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 476 proven. 153 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:11:44,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:44,552 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:11:44,552 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:11:44,552 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:11:44,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:44,553 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 170 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 170 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:11:44,562 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:11:44,563 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:11:44,611 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:11:44,612 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:11:44,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-10 02:11:44,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:11:45,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 476 proven. 153 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:11:45,717 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:11:46,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 476 proven. 153 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:11:46,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:11:46,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 78 [2019-09-10 02:11:46,253 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:11:46,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-10 02:11:46,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-10 02:11:46,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1181, Invalid=4825, Unknown=0, NotChecked=0, Total=6006 [2019-09-10 02:11:46,254 INFO L87 Difference]: Start difference. First operand 189 states and 208 transitions. Second operand 78 states. [2019-09-10 02:11:47,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:11:47,500 INFO L93 Difference]: Finished difference Result 314 states and 369 transitions. [2019-09-10 02:11:47,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-10 02:11:47,501 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 152 [2019-09-10 02:11:47,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:11:47,502 INFO L225 Difference]: With dead ends: 314 [2019-09-10 02:11:47,502 INFO L226 Difference]: Without dead ends: 261 [2019-09-10 02:11:47,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 230 SyntacticMatches, 38 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6701 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2473, Invalid=10867, Unknown=0, NotChecked=0, Total=13340 [2019-09-10 02:11:47,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-09-10 02:11:47,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 190. [2019-09-10 02:11:47,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-10 02:11:47,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-10 02:11:47,507 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-10 02:11:47,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:11:47,507 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-10 02:11:47,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-10 02:11:47,507 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-10 02:11:47,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 02:11:47,507 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:11:47,508 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:11:47,508 INFO L418 AbstractCegarLoop]: === Iteration 172 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:11:47,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:11:47,508 INFO L82 PathProgramCache]: Analyzing trace with hash -101621841, now seen corresponding path program 121 times [2019-09-10 02:11:47,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:11:47,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:47,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:11:47,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:47,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:11:47,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:11:48,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1157 backedges. 476 proven. 137 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:11:48,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:48,090 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:11:48,090 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:11:48,090 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:11:48,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:48,090 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 171 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 171 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:11:48,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:11:48,099 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:11:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:11:48,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-10 02:11:48,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:11:49,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1157 backedges. 476 proven. 137 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:11:49,156 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:11:49,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1157 backedges. 476 proven. 137 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:11:49,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:11:49,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 77 [2019-09-10 02:11:49,672 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:11:49,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-10 02:11:49,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-10 02:11:49,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1127, Invalid=4725, Unknown=0, NotChecked=0, Total=5852 [2019-09-10 02:11:49,673 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 77 states. [2019-09-10 02:11:51,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:11:51,612 INFO L93 Difference]: Finished difference Result 385 states and 459 transitions. [2019-09-10 02:11:51,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-10 02:11:51,612 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2019-09-10 02:11:51,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:11:51,613 INFO L225 Difference]: With dead ends: 385 [2019-09-10 02:11:51,614 INFO L226 Difference]: Without dead ends: 332 [2019-09-10 02:11:51,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 231 SyntacticMatches, 38 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8019 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3081, Invalid=14211, Unknown=0, NotChecked=0, Total=17292 [2019-09-10 02:11:51,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-09-10 02:11:51,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 190. [2019-09-10 02:11:51,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-10 02:11:51,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-10 02:11:51,618 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-10 02:11:51,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:11:51,618 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-10 02:11:51,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-10 02:11:51,618 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-10 02:11:51,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 02:11:51,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:11:51,619 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:11:51,619 INFO L418 AbstractCegarLoop]: === Iteration 173 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:11:51,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:11:51,619 INFO L82 PathProgramCache]: Analyzing trace with hash -758548656, now seen corresponding path program 122 times [2019-09-10 02:11:51,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:11:51,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:51,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:11:51,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:51,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:11:51,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:11:52,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 476 proven. 123 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:11:52,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:52,171 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:11:52,171 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:11:52,171 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:11:52,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:52,171 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 172 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 172 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:11:52,180 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:11:52,181 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:11:52,239 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-10 02:11:52,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:11:52,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-10 02:11:52,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:11:53,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 476 proven. 123 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:11:53,253 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:11:53,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 476 proven. 123 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:11:53,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:11:53,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 76 [2019-09-10 02:11:53,771 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:11:53,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-10 02:11:53,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-10 02:11:53,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1077, Invalid=4623, Unknown=0, NotChecked=0, Total=5700 [2019-09-10 02:11:53,773 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 76 states. [2019-09-10 02:11:56,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:11:56,144 INFO L93 Difference]: Finished difference Result 455 states and 548 transitions. [2019-09-10 02:11:56,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-10 02:11:56,145 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 152 [2019-09-10 02:11:56,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:11:56,146 INFO L225 Difference]: With dead ends: 455 [2019-09-10 02:11:56,146 INFO L226 Difference]: Without dead ends: 402 [2019-09-10 02:11:56,148 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 232 SyntacticMatches, 38 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9387 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3718, Invalid=17452, Unknown=0, NotChecked=0, Total=21170 [2019-09-10 02:11:56,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-09-10 02:11:56,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 190. [2019-09-10 02:11:56,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-10 02:11:56,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-10 02:11:56,151 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-10 02:11:56,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:11:56,151 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-10 02:11:56,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-10 02:11:56,151 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-10 02:11:56,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 02:11:56,152 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:11:56,152 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 14, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:11:56,152 INFO L418 AbstractCegarLoop]: === Iteration 174 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:11:56,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:11:56,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1991206799, now seen corresponding path program 123 times [2019-09-10 02:11:56,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:11:56,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:56,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:11:56,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:11:56,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:11:56,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:11:56,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1131 backedges. 476 proven. 111 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:11:56,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:56,737 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:11:56,737 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:11:56,737 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:11:56,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:11:56,738 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 173 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 173 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:11:56,747 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:11:56,747 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:11:56,794 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:11:56,794 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:11:56,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-10 02:11:56,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:11:57,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1131 backedges. 476 proven. 111 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:11:57,782 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:11:58,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1131 backedges. 476 proven. 111 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:11:58,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:11:58,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 75 [2019-09-10 02:11:58,303 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:11:58,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-10 02:11:58,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-10 02:11:58,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1031, Invalid=4519, Unknown=0, NotChecked=0, Total=5550 [2019-09-10 02:11:58,304 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 75 states. [2019-09-10 02:12:00,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:12:00,745 INFO L93 Difference]: Finished difference Result 524 states and 636 transitions. [2019-09-10 02:12:00,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-10 02:12:00,746 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 152 [2019-09-10 02:12:00,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:12:00,747 INFO L225 Difference]: With dead ends: 524 [2019-09-10 02:12:00,747 INFO L226 Difference]: Without dead ends: 471 [2019-09-10 02:12:00,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 233 SyntacticMatches, 38 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10719 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4342, Invalid=20464, Unknown=0, NotChecked=0, Total=24806 [2019-09-10 02:12:00,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-09-10 02:12:00,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 190. [2019-09-10 02:12:00,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-10 02:12:00,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-10 02:12:00,754 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-10 02:12:00,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:12:00,754 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-10 02:12:00,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-10 02:12:00,754 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-10 02:12:00,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 02:12:00,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:12:00,755 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 13, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:12:00,755 INFO L418 AbstractCegarLoop]: === Iteration 175 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:12:00,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:12:00,755 INFO L82 PathProgramCache]: Analyzing trace with hash -2076511376, now seen corresponding path program 124 times [2019-09-10 02:12:00,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:12:00,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:12:00,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:12:00,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:12:00,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:12:00,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:12:01,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1121 backedges. 476 proven. 101 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:12:01,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:12:01,315 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:12:01,315 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:12:01,315 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:12:01,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:12:01,315 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 174 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 174 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:12:01,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:12:01,326 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:12:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:12:01,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-10 02:12:01,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:12:02,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1121 backedges. 476 proven. 101 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:12:02,349 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:12:02,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1121 backedges. 476 proven. 101 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:12:02,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:12:02,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 74 [2019-09-10 02:12:02,880 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:12:02,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-10 02:12:02,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-10 02:12:02,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=989, Invalid=4413, Unknown=0, NotChecked=0, Total=5402 [2019-09-10 02:12:02,881 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 74 states. [2019-09-10 02:12:06,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:12:06,023 INFO L93 Difference]: Finished difference Result 592 states and 723 transitions. [2019-09-10 02:12:06,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-10 02:12:06,024 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 152 [2019-09-10 02:12:06,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:12:06,025 INFO L225 Difference]: With dead ends: 592 [2019-09-10 02:12:06,025 INFO L226 Difference]: Without dead ends: 539 [2019-09-10 02:12:06,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 234 SyntacticMatches, 38 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11941 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4917, Invalid=23139, Unknown=0, NotChecked=0, Total=28056 [2019-09-10 02:12:06,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2019-09-10 02:12:06,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 190. [2019-09-10 02:12:06,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-10 02:12:06,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-10 02:12:06,031 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-10 02:12:06,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:12:06,032 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-10 02:12:06,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-10 02:12:06,032 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-10 02:12:06,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 02:12:06,032 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:12:06,032 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 12, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:12:06,032 INFO L418 AbstractCegarLoop]: === Iteration 176 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:12:06,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:12:06,033 INFO L82 PathProgramCache]: Analyzing trace with hash 286123887, now seen corresponding path program 125 times [2019-09-10 02:12:06,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:12:06,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:12:06,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:12:06,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:12:06,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:12:06,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:12:06,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 476 proven. 93 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:12:06,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:12:06,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:12:06,579 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:12:06,579 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:12:06,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:12:06,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 175 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 175 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:12:06,589 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:12:06,589 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:12:06,645 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-10 02:12:06,645 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:12:06,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-10 02:12:06,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:12:07,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 476 proven. 93 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:12:07,645 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:12:08,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 476 proven. 93 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:12:08,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:12:08,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 73 [2019-09-10 02:12:08,156 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:12:08,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-10 02:12:08,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-10 02:12:08,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=951, Invalid=4305, Unknown=0, NotChecked=0, Total=5256 [2019-09-10 02:12:08,158 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 73 states. [2019-09-10 02:12:11,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:12:11,013 INFO L93 Difference]: Finished difference Result 659 states and 809 transitions. [2019-09-10 02:12:11,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-09-10 02:12:11,014 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 152 [2019-09-10 02:12:11,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:12:11,016 INFO L225 Difference]: With dead ends: 659 [2019-09-10 02:12:11,016 INFO L226 Difference]: Without dead ends: 606 [2019-09-10 02:12:11,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 235 SyntacticMatches, 38 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12991 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5413, Invalid=25387, Unknown=0, NotChecked=0, Total=30800 [2019-09-10 02:12:11,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-09-10 02:12:11,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 190. [2019-09-10 02:12:11,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-10 02:12:11,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-10 02:12:11,025 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-10 02:12:11,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:12:11,025 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-10 02:12:11,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-10 02:12:11,025 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-10 02:12:11,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 02:12:11,026 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:12:11,026 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 11, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:12:11,026 INFO L418 AbstractCegarLoop]: === Iteration 177 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:12:11,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:12:11,027 INFO L82 PathProgramCache]: Analyzing trace with hash 639432592, now seen corresponding path program 126 times [2019-09-10 02:12:11,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:12:11,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:12:11,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:12:11,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:12:11,028 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:12:11,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:12:11,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 476 proven. 87 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:12:11,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:12:11,567 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:12:11,568 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:12:11,568 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:12:11,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:12:11,568 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 176 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 176 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:12:11,579 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:12:11,579 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:12:11,628 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:12:11,628 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:12:11,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-10 02:12:11,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:12:12,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 476 proven. 87 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:12:12,594 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:12:13,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 476 proven. 87 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:12:13,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:12:13,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 72 [2019-09-10 02:12:13,091 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:12:13,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-10 02:12:13,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-10 02:12:13,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=917, Invalid=4195, Unknown=0, NotChecked=0, Total=5112 [2019-09-10 02:12:13,092 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 72 states. [2019-09-10 02:12:16,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:12:16,392 INFO L93 Difference]: Finished difference Result 725 states and 894 transitions. [2019-09-10 02:12:16,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-09-10 02:12:16,392 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 152 [2019-09-10 02:12:16,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:12:16,394 INFO L225 Difference]: With dead ends: 725 [2019-09-10 02:12:16,394 INFO L226 Difference]: Without dead ends: 672 [2019-09-10 02:12:16,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 236 SyntacticMatches, 38 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13819 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5806, Invalid=27136, Unknown=0, NotChecked=0, Total=32942 [2019-09-10 02:12:16,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-09-10 02:12:16,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 190. [2019-09-10 02:12:16,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-10 02:12:16,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-10 02:12:16,400 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-10 02:12:16,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:12:16,400 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-10 02:12:16,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-10 02:12:16,400 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-10 02:12:16,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 02:12:16,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:12:16,401 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 10, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:12:16,401 INFO L418 AbstractCegarLoop]: === Iteration 178 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:12:16,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:12:16,401 INFO L82 PathProgramCache]: Analyzing trace with hash 650829647, now seen corresponding path program 127 times [2019-09-10 02:12:16,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:12:16,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:12:16,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:12:16,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:12:16,402 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:12:16,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:12:16,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 476 proven. 83 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:12:16,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:12:16,931 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:12:16,931 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:12:16,931 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:12:16,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:12:16,931 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 177 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 177 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:12:16,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:12:16,941 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:12:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:12:16,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-10 02:12:16,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:12:17,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 476 proven. 83 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:12:17,888 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:12:18,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 476 proven. 83 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:12:18,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:12:18,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 71 [2019-09-10 02:12:18,405 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:12:18,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-10 02:12:18,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-10 02:12:18,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=887, Invalid=4083, Unknown=0, NotChecked=0, Total=4970 [2019-09-10 02:12:18,406 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 71 states. [2019-09-10 02:12:22,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:12:22,040 INFO L93 Difference]: Finished difference Result 790 states and 978 transitions. [2019-09-10 02:12:22,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-09-10 02:12:22,041 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 152 [2019-09-10 02:12:22,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:12:22,043 INFO L225 Difference]: With dead ends: 790 [2019-09-10 02:12:22,043 INFO L226 Difference]: Without dead ends: 737 [2019-09-10 02:12:22,062 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 237 SyntacticMatches, 38 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14387 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6078, Invalid=28332, Unknown=0, NotChecked=0, Total=34410 [2019-09-10 02:12:22,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2019-09-10 02:12:22,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 190. [2019-09-10 02:12:22,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-10 02:12:22,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-10 02:12:22,067 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-10 02:12:22,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:12:22,068 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-10 02:12:22,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-10 02:12:22,068 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-10 02:12:22,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 02:12:22,068 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:12:22,068 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:12:22,068 INFO L418 AbstractCegarLoop]: === Iteration 179 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:12:22,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:12:22,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1427012688, now seen corresponding path program 128 times [2019-09-10 02:12:22,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:12:22,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:12:22,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:12:22,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:12:22,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:12:22,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:12:22,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1101 backedges. 476 proven. 81 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:12:22,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:12:22,610 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:12:22,610 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:12:22,610 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:12:22,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:12:22,610 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 178 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 178 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:12:22,620 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:12:22,620 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:12:22,680 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-10 02:12:22,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:12:22,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-10 02:12:22,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:12:23,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1101 backedges. 476 proven. 81 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:12:23,608 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:12:24,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1101 backedges. 476 proven. 81 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (178)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 02:12:24,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:12:24,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 70 [2019-09-10 02:12:24,114 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:12:24,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-10 02:12:24,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-10 02:12:24,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=3969, Unknown=0, NotChecked=0, Total=4830 [2019-09-10 02:12:24,116 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 70 states. [2019-09-10 02:12:27,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:12:27,900 INFO L93 Difference]: Finished difference Result 854 states and 1061 transitions. [2019-09-10 02:12:27,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2019-09-10 02:12:27,901 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 152 [2019-09-10 02:12:27,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:12:27,903 INFO L225 Difference]: With dead ends: 854 [2019-09-10 02:12:27,903 INFO L226 Difference]: Without dead ends: 801 [2019-09-10 02:12:27,905 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 238 SyntacticMatches, 38 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14669 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6217, Invalid=28939, Unknown=0, NotChecked=0, Total=35156 [2019-09-10 02:12:27,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2019-09-10 02:12:27,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 190. [2019-09-10 02:12:27,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-10 02:12:27,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-10 02:12:27,911 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-10 02:12:27,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:12:27,911 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-10 02:12:27,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-10 02:12:27,911 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-10 02:12:27,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 02:12:27,912 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:12:27,912 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:12:27,912 INFO L418 AbstractCegarLoop]: === Iteration 180 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:12:27,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:12:27,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1831096111, now seen corresponding path program 129 times [2019-09-10 02:12:27,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:12:27,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:12:27,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:12:27,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:12:27,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:12:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:12:28,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1101 backedges. 476 proven. 81 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:12:28,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:12:28,464 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:12:28,464 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:12:28,464 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:12:28,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:12:28,464 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 179 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 179 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:12:28,473 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:12:28,473 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:12:28,522 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:12:28,522 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:12:28,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-10 02:12:28,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:12:29,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1101 backedges. 476 proven. 81 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:12:29,387 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:12:29,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1101 backedges. 476 proven. 81 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:12:29,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:12:29,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 69 [2019-09-10 02:12:29,871 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:12:29,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-10 02:12:29,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-10 02:12:29,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=839, Invalid=3853, Unknown=0, NotChecked=0, Total=4692 [2019-09-10 02:12:29,872 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 69 states. [2019-09-10 02:12:33,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:12:33,309 INFO L93 Difference]: Finished difference Result 917 states and 1143 transitions. [2019-09-10 02:12:33,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-09-10 02:12:33,310 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 152 [2019-09-10 02:12:33,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:12:33,312 INFO L225 Difference]: With dead ends: 917 [2019-09-10 02:12:33,312 INFO L226 Difference]: Without dead ends: 864 [2019-09-10 02:12:33,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 239 SyntacticMatches, 38 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14651 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6217, Invalid=28939, Unknown=0, NotChecked=0, Total=35156 [2019-09-10 02:12:33,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2019-09-10 02:12:33,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 190. [2019-09-10 02:12:33,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-10 02:12:33,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-10 02:12:33,320 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-10 02:12:33,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:12:33,320 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-10 02:12:33,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-10 02:12:33,320 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-10 02:12:33,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 02:12:33,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:12:33,321 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 10, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:12:33,321 INFO L418 AbstractCegarLoop]: === Iteration 181 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:12:33,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:12:33,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1111844912, now seen corresponding path program 130 times [2019-09-10 02:12:33,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:12:33,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:12:33,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:12:33,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:12:33,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:12:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:12:33,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 476 proven. 83 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:12:33,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:12:33,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:12:33,845 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:12:33,845 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:12:33,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:12:33,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 180 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 180 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:12:33,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:12:33,855 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:12:33,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:12:33,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-10 02:12:33,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:12:34,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 476 proven. 83 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:12:34,759 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:12:35,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 476 proven. 83 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:12:35,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:12:35,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 68 [2019-09-10 02:12:35,237 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:12:35,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-10 02:12:35,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-10 02:12:35,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=821, Invalid=3735, Unknown=0, NotChecked=0, Total=4556 [2019-09-10 02:12:35,239 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 68 states. [2019-09-10 02:12:38,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:12:38,854 INFO L93 Difference]: Finished difference Result 979 states and 1224 transitions. [2019-09-10 02:12:38,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-09-10 02:12:38,855 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 152 [2019-09-10 02:12:38,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:12:38,857 INFO L225 Difference]: With dead ends: 979 [2019-09-10 02:12:38,857 INFO L226 Difference]: Without dead ends: 926 [2019-09-10 02:12:38,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 240 SyntacticMatches, 38 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14327 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6078, Invalid=28332, Unknown=0, NotChecked=0, Total=34410 [2019-09-10 02:12:38,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-09-10 02:12:38,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 190. [2019-09-10 02:12:38,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-10 02:12:38,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-10 02:12:38,869 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-10 02:12:38,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:12:38,869 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-10 02:12:38,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-10 02:12:38,869 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-10 02:12:38,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 02:12:38,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:12:38,870 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 11, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:12:38,870 INFO L418 AbstractCegarLoop]: === Iteration 182 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:12:38,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:12:38,871 INFO L82 PathProgramCache]: Analyzing trace with hash -791136497, now seen corresponding path program 131 times [2019-09-10 02:12:38,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:12:38,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:12:38,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:12:38,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:12:38,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:12:38,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:12:39,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 476 proven. 87 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:12:39,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:12:39,426 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:12:39,426 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:12:39,426 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:12:39,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:12:39,426 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 181 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 181 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:12:39,435 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:12:39,435 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:12:39,493 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-10 02:12:39,493 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:12:39,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-10 02:12:39,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:12:40,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 476 proven. 87 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:12:40,335 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:12:40,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 476 proven. 87 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:12:40,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:12:40,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 67 [2019-09-10 02:12:40,844 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:12:40,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-10 02:12:40,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-10 02:12:40,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=807, Invalid=3615, Unknown=0, NotChecked=0, Total=4422 [2019-09-10 02:12:40,846 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 67 states. [2019-09-10 02:12:44,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:12:44,104 INFO L93 Difference]: Finished difference Result 1040 states and 1304 transitions. [2019-09-10 02:12:44,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2019-09-10 02:12:44,104 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 152 [2019-09-10 02:12:44,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:12:44,106 INFO L225 Difference]: With dead ends: 1040 [2019-09-10 02:12:44,106 INFO L226 Difference]: Without dead ends: 987 [2019-09-10 02:12:44,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 241 SyntacticMatches, 38 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13699 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5806, Invalid=27136, Unknown=0, NotChecked=0, Total=32942 [2019-09-10 02:12:44,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2019-09-10 02:12:44,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 190. [2019-09-10 02:12:44,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-10 02:12:44,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-10 02:12:44,118 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-10 02:12:44,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:12:44,118 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-10 02:12:44,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-10 02:12:44,118 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-10 02:12:44,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 02:12:44,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:12:44,119 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 12, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:12:44,119 INFO L418 AbstractCegarLoop]: === Iteration 183 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:12:44,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:12:44,119 INFO L82 PathProgramCache]: Analyzing trace with hash -503696400, now seen corresponding path program 132 times [2019-09-10 02:12:44,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:12:44,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:12:44,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:12:44,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:12:44,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:12:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:12:44,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 476 proven. 93 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:12:44,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:12:44,659 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:12:44,659 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:12:44,659 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:12:44,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:12:44,659 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 182 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 182 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:12:44,670 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:12:44,671 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:12:44,721 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:12:44,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:12:44,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-10 02:12:44,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:12:45,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 476 proven. 93 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:12:45,557 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:12:46,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 476 proven. 93 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:12:46,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:12:46,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 66 [2019-09-10 02:12:46,056 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:12:46,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-10 02:12:46,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-10 02:12:46,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=797, Invalid=3493, Unknown=0, NotChecked=0, Total=4290 [2019-09-10 02:12:46,058 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 66 states. [2019-09-10 02:12:49,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:12:49,184 INFO L93 Difference]: Finished difference Result 1100 states and 1383 transitions. [2019-09-10 02:12:49,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-09-10 02:12:49,185 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 152 [2019-09-10 02:12:49,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:12:49,187 INFO L225 Difference]: With dead ends: 1100 [2019-09-10 02:12:49,187 INFO L226 Difference]: Without dead ends: 1047 [2019-09-10 02:12:49,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 242 SyntacticMatches, 38 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12781 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5413, Invalid=25387, Unknown=0, NotChecked=0, Total=30800 [2019-09-10 02:12:49,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2019-09-10 02:12:49,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 190. [2019-09-10 02:12:49,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-10 02:12:49,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-10 02:12:49,197 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-10 02:12:49,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:12:49,198 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-10 02:12:49,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-10 02:12:49,198 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-10 02:12:49,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 02:12:49,198 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:12:49,198 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 13, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:12:49,198 INFO L418 AbstractCegarLoop]: === Iteration 184 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:12:49,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:12:49,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1445238511, now seen corresponding path program 133 times [2019-09-10 02:12:49,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:12:49,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:12:49,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:12:49,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:12:49,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:12:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:12:49,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1121 backedges. 476 proven. 101 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:12:49,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:12:49,728 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:12:49,728 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:12:49,728 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:12:49,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:12:49,728 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 183 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 183 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:12:49,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:12:49,740 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:12:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:12:49,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-10 02:12:49,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:12:50,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1121 backedges. 476 proven. 101 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:12:50,576 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:12:51,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1121 backedges. 476 proven. 101 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:12:51,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:12:51,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 65 [2019-09-10 02:12:51,075 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:12:51,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-10 02:12:51,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-10 02:12:51,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=791, Invalid=3369, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 02:12:51,076 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 65 states. [2019-09-10 02:12:54,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:12:54,153 INFO L93 Difference]: Finished difference Result 1159 states and 1461 transitions. [2019-09-10 02:12:54,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-09-10 02:12:54,153 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 152 [2019-09-10 02:12:54,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:12:54,155 INFO L225 Difference]: With dead ends: 1159 [2019-09-10 02:12:54,156 INFO L226 Difference]: Without dead ends: 1106 [2019-09-10 02:12:54,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 243 SyntacticMatches, 38 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11599 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4917, Invalid=23139, Unknown=0, NotChecked=0, Total=28056 [2019-09-10 02:12:54,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-09-10 02:12:54,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 190. [2019-09-10 02:12:54,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-10 02:12:54,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-10 02:12:54,168 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-10 02:12:54,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:12:54,168 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-10 02:12:54,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-10 02:12:54,168 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-10 02:12:54,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 02:12:54,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:12:54,169 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 14, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:12:54,169 INFO L418 AbstractCegarLoop]: === Iteration 185 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:12:54,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:12:54,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1817028592, now seen corresponding path program 134 times [2019-09-10 02:12:54,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:12:54,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:12:54,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:12:54,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:12:54,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:12:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:12:54,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1131 backedges. 476 proven. 111 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:12:54,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:12:54,696 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:12:54,696 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:12:54,696 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:12:54,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:12:54,696 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 184 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 184 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:12:54,706 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:12:54,706 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:12:54,766 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-10 02:12:54,766 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:12:54,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-10 02:12:54,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:12:55,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1131 backedges. 476 proven. 111 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:12:55,560 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:12:56,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1131 backedges. 476 proven. 111 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:12:56,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:12:56,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 64 [2019-09-10 02:12:56,050 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:12:56,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-10 02:12:56,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-10 02:12:56,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=789, Invalid=3243, Unknown=0, NotChecked=0, Total=4032 [2019-09-10 02:12:56,051 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 64 states. [2019-09-10 02:12:58,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:12:58,726 INFO L93 Difference]: Finished difference Result 1217 states and 1538 transitions. [2019-09-10 02:12:58,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-09-10 02:12:58,727 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 152 [2019-09-10 02:12:58,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:12:58,729 INFO L225 Difference]: With dead ends: 1217 [2019-09-10 02:12:58,729 INFO L226 Difference]: Without dead ends: 1164 [2019-09-10 02:12:58,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 244 SyntacticMatches, 38 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10191 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4342, Invalid=20464, Unknown=0, NotChecked=0, Total=24806 [2019-09-10 02:12:58,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2019-09-10 02:12:58,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 190. [2019-09-10 02:12:58,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-10 02:12:58,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-10 02:12:58,741 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-10 02:12:58,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:12:58,741 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-10 02:12:58,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-10 02:12:58,741 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-10 02:12:58,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 02:12:58,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:12:58,742 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:12:58,742 INFO L418 AbstractCegarLoop]: === Iteration 186 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:12:58,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:12:58,743 INFO L82 PathProgramCache]: Analyzing trace with hash -121147697, now seen corresponding path program 135 times [2019-09-10 02:12:58,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:12:58,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:12:58,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:12:58,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:12:58,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:12:58,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:12:59,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 476 proven. 123 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:12:59,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:12:59,312 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:12:59,312 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:12:59,312 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:12:59,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:12:59,313 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 185 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 185 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:12:59,322 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:12:59,323 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:12:59,372 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:12:59,373 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:12:59,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-10 02:12:59,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:13:00,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 476 proven. 123 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:13:00,113 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:13:00,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 476 proven. 123 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:13:00,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:13:00,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 63 [2019-09-10 02:13:00,606 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:13:00,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-10 02:13:00,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-10 02:13:00,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=791, Invalid=3115, Unknown=0, NotChecked=0, Total=3906 [2019-09-10 02:13:00,608 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 63 states. [2019-09-10 02:13:02,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:13:02,959 INFO L93 Difference]: Finished difference Result 1274 states and 1614 transitions. [2019-09-10 02:13:02,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-10 02:13:02,960 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 152 [2019-09-10 02:13:02,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:13:02,962 INFO L225 Difference]: With dead ends: 1274 [2019-09-10 02:13:02,962 INFO L226 Difference]: Without dead ends: 1221 [2019-09-10 02:13:02,964 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 245 SyntacticMatches, 38 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8607 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3718, Invalid=17452, Unknown=0, NotChecked=0, Total=21170 [2019-09-10 02:13:02,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2019-09-10 02:13:02,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 190. [2019-09-10 02:13:02,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-10 02:13:02,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-10 02:13:02,990 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-10 02:13:02,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:13:02,990 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-10 02:13:02,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-10 02:13:02,990 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-10 02:13:02,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 02:13:02,991 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:13:02,991 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:13:02,991 INFO L418 AbstractCegarLoop]: === Iteration 187 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:13:02,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:13:02,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1734673456, now seen corresponding path program 136 times [2019-09-10 02:13:02,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:13:02,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:13:02,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:13:02,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:13:02,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:13:03,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:13:03,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1157 backedges. 476 proven. 137 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:13:03,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:13:03,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:13:03,534 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:13:03,534 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:13:03,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:13:03,535 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 186 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 186 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:13:03,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:13:03,544 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:13:03,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:13:03,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-10 02:13:03,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:13:04,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1157 backedges. 476 proven. 137 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:13:04,321 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:13:04,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1157 backedges. 476 proven. 137 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:13:04,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:13:04,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 62 [2019-09-10 02:13:04,831 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:13:04,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-10 02:13:04,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-10 02:13:04,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=797, Invalid=2985, Unknown=0, NotChecked=0, Total=3782 [2019-09-10 02:13:04,832 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 62 states. [2019-09-10 02:13:07,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:13:07,006 INFO L93 Difference]: Finished difference Result 1330 states and 1689 transitions. [2019-09-10 02:13:07,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-10 02:13:07,007 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 152 [2019-09-10 02:13:07,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:13:07,009 INFO L225 Difference]: With dead ends: 1330 [2019-09-10 02:13:07,009 INFO L226 Difference]: Without dead ends: 1277 [2019-09-10 02:13:07,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 246 SyntacticMatches, 38 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6909 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3081, Invalid=14211, Unknown=0, NotChecked=0, Total=17292 [2019-09-10 02:13:07,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2019-09-10 02:13:07,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 190. [2019-09-10 02:13:07,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-10 02:13:07,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2019-09-10 02:13:07,023 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 152 [2019-09-10 02:13:07,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:13:07,024 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2019-09-10 02:13:07,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-10 02:13:07,024 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2019-09-10 02:13:07,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 02:13:07,024 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:13:07,024 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:13:07,024 INFO L418 AbstractCegarLoop]: === Iteration 188 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:13:07,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:13:07,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1946239313, now seen corresponding path program 17 times [2019-09-10 02:13:07,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:13:07,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:13:07,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:13:07,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:13:07,026 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:13:07,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:13:07,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 476 proven. 153 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:13:07,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:13:07,572 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:13:07,572 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:13:07,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:13:07,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:13:07,572 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 187 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 187 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:13:07,581 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:13:07,582 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:13:07,643 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-10 02:13:07,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:13:07,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-10 02:13:07,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:13:08,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 476 proven. 153 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:13:08,357 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:13:08,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 476 proven. 153 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:13:08,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:13:08,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 61 [2019-09-10 02:13:08,861 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:13:08,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-10 02:13:08,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-10 02:13:08,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=807, Invalid=2853, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 02:13:08,862 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 61 states. [2019-09-10 02:13:10,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:13:10,516 INFO L93 Difference]: Finished difference Result 1388 states and 1767 transitions. [2019-09-10 02:13:10,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-10 02:13:10,517 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 152 [2019-09-10 02:13:10,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:13:10,519 INFO L225 Difference]: With dead ends: 1388 [2019-09-10 02:13:10,519 INFO L226 Difference]: Without dead ends: 1335 [2019-09-10 02:13:10,520 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 247 SyntacticMatches, 38 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5171 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2473, Invalid=10867, Unknown=0, NotChecked=0, Total=13340 [2019-09-10 02:13:10,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2019-09-10 02:13:10,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 192. [2019-09-10 02:13:10,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-10 02:13:10,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 212 transitions. [2019-09-10 02:13:10,533 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 212 transitions. Word has length 152 [2019-09-10 02:13:10,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:13:10,533 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 212 transitions. [2019-09-10 02:13:10,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-10 02:13:10,533 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 212 transitions. [2019-09-10 02:13:10,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 02:13:10,534 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:13:10,534 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:13:10,534 INFO L418 AbstractCegarLoop]: === Iteration 189 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:13:10,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:13:10,534 INFO L82 PathProgramCache]: Analyzing trace with hash -441371960, now seen corresponding path program 34 times [2019-09-10 02:13:10,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:13:10,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:13:10,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:13:10,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:13:10,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:13:10,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:13:10,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 205 proven. 442 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:13:10,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:13:10,729 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:13:10,729 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:13:10,729 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:13:10,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:13:10,730 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 188 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 188 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:13:10,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:13:10,740 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:13:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:13:10,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-10 02:13:10,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:13:10,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:13:10,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 205 proven. 442 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:13:10,830 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:13:11,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 205 proven. 442 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-10 02:13:11,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:13:11,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 25 [2019-09-10 02:13:11,130 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:13:11,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 02:13:11,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 02:13:11,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=380, Unknown=0, NotChecked=0, Total=600 [2019-09-10 02:13:11,131 INFO L87 Difference]: Start difference. First operand 192 states and 212 transitions. Second operand 25 states. [2019-09-10 02:13:11,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:13:11,523 INFO L93 Difference]: Finished difference Result 203 states and 224 transitions. [2019-09-10 02:13:11,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 02:13:11,524 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 153 [2019-09-10 02:13:11,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:13:11,524 INFO L225 Difference]: With dead ends: 203 [2019-09-10 02:13:11,525 INFO L226 Difference]: Without dead ends: 203 [2019-09-10 02:13:11,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 286 SyntacticMatches, 36 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=226, Invalid=424, Unknown=0, NotChecked=0, Total=650 [2019-09-10 02:13:11,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-09-10 02:13:11,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 199. [2019-09-10 02:13:11,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-10 02:13:11,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 219 transitions. [2019-09-10 02:13:11,528 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 219 transitions. Word has length 153 [2019-09-10 02:13:11,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:13:11,528 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 219 transitions. [2019-09-10 02:13:11,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 02:13:11,528 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 219 transitions. [2019-09-10 02:13:11,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-10 02:13:11,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:13:11,529 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:13:11,529 INFO L418 AbstractCegarLoop]: === Iteration 190 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:13:11,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:13:11,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1575080431, now seen corresponding path program 35 times [2019-09-10 02:13:11,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:13:11,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:13:11,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:13:11,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:13:11,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:13:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:13:12,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1314 backedges. 531 proven. 171 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:13:12,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:13:12,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:13:12,158 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:13:12,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:13:12,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:13:12,158 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 189 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 189 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:13:12,168 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:13:12,168 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:13:12,233 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-09-10 02:13:12,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:13:12,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-10 02:13:12,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:13:13,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1314 backedges. 531 proven. 171 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:13:13,435 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:13:14,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1314 backedges. 531 proven. 171 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:13:14,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:13:14,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 82 [2019-09-10 02:13:14,022 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:13:14,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-10 02:13:14,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-10 02:13:14,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1303, Invalid=5339, Unknown=0, NotChecked=0, Total=6642 [2019-09-10 02:13:14,023 INFO L87 Difference]: Start difference. First operand 199 states and 219 transitions. Second operand 82 states. [2019-09-10 02:13:15,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:13:15,917 INFO L93 Difference]: Finished difference Result 331 states and 389 transitions. [2019-09-10 02:13:15,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-10 02:13:15,917 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 160 [2019-09-10 02:13:15,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:13:15,918 INFO L225 Difference]: With dead ends: 331 [2019-09-10 02:13:15,918 INFO L226 Difference]: Without dead ends: 275 [2019-09-10 02:13:15,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 242 SyntacticMatches, 40 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7463 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2723, Invalid=12039, Unknown=0, NotChecked=0, Total=14762 [2019-09-10 02:13:15,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-09-10 02:13:15,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 200. [2019-09-10 02:13:15,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-10 02:13:15,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2019-09-10 02:13:15,924 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 160 [2019-09-10 02:13:15,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:13:15,924 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2019-09-10 02:13:15,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-10 02:13:15,924 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2019-09-10 02:13:15,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-10 02:13:15,924 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:13:15,924 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:13:15,925 INFO L418 AbstractCegarLoop]: === Iteration 191 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:13:15,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:13:15,925 INFO L82 PathProgramCache]: Analyzing trace with hash 862175086, now seen corresponding path program 137 times [2019-09-10 02:13:15,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:13:15,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:13:15,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:13:15,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:13:15,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:13:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:13:16,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1297 backedges. 531 proven. 154 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:13:16,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:13:16,539 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:13:16,539 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:13:16,540 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:13:16,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:13:16,540 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 190 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 190 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:13:16,550 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:13:16,550 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:13:16,638 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-09-10 02:13:16,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:13:16,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-10 02:13:16,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:13:17,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1297 backedges. 531 proven. 154 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:13:17,828 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:13:18,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1297 backedges. 531 proven. 154 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:13:18,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:13:18,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 81 [2019-09-10 02:13:18,430 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:13:18,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-10 02:13:18,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-10 02:13:18,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1246, Invalid=5234, Unknown=0, NotChecked=0, Total=6480 [2019-09-10 02:13:18,432 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 81 states. [2019-09-10 02:13:20,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:13:20,636 INFO L93 Difference]: Finished difference Result 406 states and 484 transitions. [2019-09-10 02:13:20,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-10 02:13:20,636 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2019-09-10 02:13:20,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:13:20,637 INFO L225 Difference]: With dead ends: 406 [2019-09-10 02:13:20,637 INFO L226 Difference]: Without dead ends: 350 [2019-09-10 02:13:20,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 243 SyntacticMatches, 40 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8949 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3403, Invalid=15779, Unknown=0, NotChecked=0, Total=19182 [2019-09-10 02:13:20,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-09-10 02:13:20,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 200. [2019-09-10 02:13:20,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-10 02:13:20,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2019-09-10 02:13:20,642 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 160 [2019-09-10 02:13:20,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:13:20,643 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2019-09-10 02:13:20,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-10 02:13:20,643 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2019-09-10 02:13:20,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-10 02:13:20,643 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:13:20,643 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 16, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:13:20,644 INFO L418 AbstractCegarLoop]: === Iteration 192 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:13:20,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:13:20,644 INFO L82 PathProgramCache]: Analyzing trace with hash 423536143, now seen corresponding path program 138 times [2019-09-10 02:13:20,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:13:20,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:13:20,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:13:20,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:13:20,645 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:13:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:13:21,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1282 backedges. 531 proven. 139 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:13:21,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:13:21,247 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:13:21,248 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:13:21,248 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:13:21,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:13:21,248 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 191 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 191 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:13:21,259 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:13:21,260 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:13:21,311 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:13:21,312 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:13:21,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-10 02:13:21,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:13:22,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1282 backedges. 531 proven. 139 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:13:22,483 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:13:23,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1282 backedges. 531 proven. 139 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:13:23,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:13:23,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 80 [2019-09-10 02:13:23,066 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:13:23,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-09-10 02:13:23,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-09-10 02:13:23,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1193, Invalid=5127, Unknown=0, NotChecked=0, Total=6320 [2019-09-10 02:13:23,069 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 80 states. [2019-09-10 02:13:25,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:13:25,407 INFO L93 Difference]: Finished difference Result 480 states and 578 transitions. [2019-09-10 02:13:25,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-10 02:13:25,408 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 160 [2019-09-10 02:13:25,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:13:25,409 INFO L225 Difference]: With dead ends: 480 [2019-09-10 02:13:25,409 INFO L226 Difference]: Without dead ends: 424 [2019-09-10 02:13:25,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 244 SyntacticMatches, 40 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10506 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4123, Invalid=19439, Unknown=0, NotChecked=0, Total=23562 [2019-09-10 02:13:25,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-09-10 02:13:25,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 200. [2019-09-10 02:13:25,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-10 02:13:25,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2019-09-10 02:13:25,433 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 160 [2019-09-10 02:13:25,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:13:25,433 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2019-09-10 02:13:25,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-09-10 02:13:25,434 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2019-09-10 02:13:25,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-10 02:13:25,434 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:13:25,434 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 15, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:13:25,435 INFO L418 AbstractCegarLoop]: === Iteration 193 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:13:25,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:13:25,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1391728818, now seen corresponding path program 139 times [2019-09-10 02:13:25,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:13:25,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:13:25,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:13:25,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:13:25,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:13:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:13:26,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1269 backedges. 531 proven. 126 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:13:26,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:13:26,042 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:13:26,042 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:13:26,042 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:13:26,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:13:26,042 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 192 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 192 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:13:26,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:13:26,056 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:13:26,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:13:26,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-10 02:13:26,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:13:27,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1269 backedges. 531 proven. 126 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:13:27,230 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:13:27,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1269 backedges. 531 proven. 126 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:13:27,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:13:27,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 79 [2019-09-10 02:13:27,808 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:13:27,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-10 02:13:27,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-10 02:13:27,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1144, Invalid=5018, Unknown=0, NotChecked=0, Total=6162 [2019-09-10 02:13:27,810 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 79 states. [2019-09-10 02:13:30,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:13:30,930 INFO L93 Difference]: Finished difference Result 553 states and 671 transitions. [2019-09-10 02:13:30,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-09-10 02:13:30,930 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 160 [2019-09-10 02:13:30,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:13:30,931 INFO L225 Difference]: With dead ends: 553 [2019-09-10 02:13:30,931 INFO L226 Difference]: Without dead ends: 497 [2019-09-10 02:13:30,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 245 SyntacticMatches, 40 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12042 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4838, Invalid=22884, Unknown=0, NotChecked=0, Total=27722 [2019-09-10 02:13:30,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2019-09-10 02:13:30,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 200. [2019-09-10 02:13:30,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-10 02:13:30,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2019-09-10 02:13:30,937 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 160 [2019-09-10 02:13:30,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:13:30,937 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2019-09-10 02:13:30,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-10 02:13:30,937 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2019-09-10 02:13:30,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-10 02:13:30,938 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:13:30,938 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 14, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:13:30,938 INFO L418 AbstractCegarLoop]: === Iteration 194 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:13:30,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:13:30,938 INFO L82 PathProgramCache]: Analyzing trace with hash 2013397551, now seen corresponding path program 140 times [2019-09-10 02:13:30,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:13:30,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:13:30,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:13:30,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:13:30,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:13:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:13:31,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1258 backedges. 531 proven. 115 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:13:31,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:13:31,537 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:13:31,537 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:13:31,537 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:13:31,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:13:31,537 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 193 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 193 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:13:31,549 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:13:31,549 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:13:31,613 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-09-10 02:13:31,613 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:13:31,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-10 02:13:31,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:13:32,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1258 backedges. 531 proven. 115 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:13:32,712 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:13:33,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1258 backedges. 531 proven. 115 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:13:33,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:13:33,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 78 [2019-09-10 02:13:33,286 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:13:33,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-10 02:13:33,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-10 02:13:33,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1099, Invalid=4907, Unknown=0, NotChecked=0, Total=6006 [2019-09-10 02:13:33,287 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 78 states. [2019-09-10 02:13:36,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:13:36,014 INFO L93 Difference]: Finished difference Result 625 states and 763 transitions. [2019-09-10 02:13:36,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-09-10 02:13:36,015 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 160 [2019-09-10 02:13:36,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:13:36,016 INFO L225 Difference]: With dead ends: 625 [2019-09-10 02:13:36,016 INFO L226 Difference]: Without dead ends: 569 [2019-09-10 02:13:36,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 246 SyntacticMatches, 40 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13477 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5509, Invalid=25997, Unknown=0, NotChecked=0, Total=31506 [2019-09-10 02:13:36,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-09-10 02:13:36,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 200. [2019-09-10 02:13:36,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-10 02:13:36,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2019-09-10 02:13:36,023 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 160 [2019-09-10 02:13:36,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:13:36,023 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2019-09-10 02:13:36,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-10 02:13:36,023 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2019-09-10 02:13:36,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-10 02:13:36,024 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:13:36,024 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 13, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:13:36,024 INFO L418 AbstractCegarLoop]: === Iteration 195 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:13:36,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:13:36,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1201895634, now seen corresponding path program 141 times [2019-09-10 02:13:36,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:13:36,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:13:36,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:13:36,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:13:36,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:13:36,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:13:36,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1249 backedges. 531 proven. 106 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:13:36,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:13:36,602 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:13:36,602 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:13:36,602 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:13:36,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:13:36,602 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 194 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 194 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:13:36,612 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:13:36,612 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:13:36,658 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:13:36,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:13:36,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-10 02:13:36,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:13:37,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1249 backedges. 531 proven. 106 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:13:37,755 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:13:38,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1249 backedges. 531 proven. 106 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:13:38,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:13:38,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 77 [2019-09-10 02:13:38,303 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:13:38,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-10 02:13:38,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-10 02:13:38,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1058, Invalid=4794, Unknown=0, NotChecked=0, Total=5852 [2019-09-10 02:13:38,304 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 77 states. [2019-09-10 02:13:41,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:13:41,703 INFO L93 Difference]: Finished difference Result 696 states and 854 transitions. [2019-09-10 02:13:41,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-09-10 02:13:41,704 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 160 [2019-09-10 02:13:41,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:13:41,705 INFO L225 Difference]: With dead ends: 696 [2019-09-10 02:13:41,705 INFO L226 Difference]: Without dead ends: 640 [2019-09-10 02:13:41,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 247 SyntacticMatches, 40 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14743 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6103, Invalid=28679, Unknown=0, NotChecked=0, Total=34782 [2019-09-10 02:13:41,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-09-10 02:13:41,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 200. [2019-09-10 02:13:41,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-10 02:13:41,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2019-09-10 02:13:41,714 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 160 [2019-09-10 02:13:41,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:13:41,715 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2019-09-10 02:13:41,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-10 02:13:41,715 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2019-09-10 02:13:41,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-10 02:13:41,716 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:13:41,716 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 12, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:13:41,716 INFO L418 AbstractCegarLoop]: === Iteration 196 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:13:41,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:13:41,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1305614769, now seen corresponding path program 142 times [2019-09-10 02:13:41,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:13:41,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:13:41,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:13:41,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:13:41,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:13:41,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:13:42,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 531 proven. 99 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:13:42,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:13:42,335 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:13:42,335 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:13:42,335 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:13:42,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:13:42,335 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 195 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 195 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:13:42,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:13:42,344 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:13:42,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:13:42,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-10 02:13:42,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:13:43,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 531 proven. 99 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:13:43,453 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:13:44,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 531 proven. 99 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:13:44,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:13:44,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 76 [2019-09-10 02:13:44,013 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:13:44,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-10 02:13:44,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-10 02:13:44,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1021, Invalid=4679, Unknown=0, NotChecked=0, Total=5700 [2019-09-10 02:13:44,014 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 76 states. [2019-09-10 02:13:47,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:13:47,999 INFO L93 Difference]: Finished difference Result 766 states and 944 transitions. [2019-09-10 02:13:47,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2019-09-10 02:13:47,999 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 160 [2019-09-10 02:13:47,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:13:48,001 INFO L225 Difference]: With dead ends: 766 [2019-09-10 02:13:48,001 INFO L226 Difference]: Without dead ends: 710 [2019-09-10 02:13:48,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 248 SyntacticMatches, 40 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15784 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6593, Invalid=30849, Unknown=0, NotChecked=0, Total=37442 [2019-09-10 02:13:48,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2019-09-10 02:13:48,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 200. [2019-09-10 02:13:48,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-10 02:13:48,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2019-09-10 02:13:48,009 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 160 [2019-09-10 02:13:48,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:13:48,009 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2019-09-10 02:13:48,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-10 02:13:48,009 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2019-09-10 02:13:48,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-10 02:13:48,010 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:13:48,010 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 11, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:13:48,010 INFO L418 AbstractCegarLoop]: === Iteration 197 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:13:48,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:13:48,010 INFO L82 PathProgramCache]: Analyzing trace with hash 353607438, now seen corresponding path program 143 times [2019-09-10 02:13:48,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:13:48,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:13:48,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:13:48,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:13:48,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:13:48,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:13:48,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1237 backedges. 531 proven. 94 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:13:48,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:13:48,601 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:13:48,601 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:13:48,602 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:13:48,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:13:48,602 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 196 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 196 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:13:48,612 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:13:48,612 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:13:48,677 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-09-10 02:13:48,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:13:48,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-10 02:13:48,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:13:49,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1237 backedges. 531 proven. 94 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:13:49,699 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:13:50,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1237 backedges. 531 proven. 94 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:13:50,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:13:50,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 75 [2019-09-10 02:13:50,268 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:13:50,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-10 02:13:50,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-10 02:13:50,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=988, Invalid=4562, Unknown=0, NotChecked=0, Total=5550 [2019-09-10 02:13:50,269 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 75 states. [2019-09-10 02:13:54,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:13:54,150 INFO L93 Difference]: Finished difference Result 835 states and 1033 transitions. [2019-09-10 02:13:54,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2019-09-10 02:13:54,151 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 160 [2019-09-10 02:13:54,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:13:54,152 INFO L225 Difference]: With dead ends: 835 [2019-09-10 02:13:54,152 INFO L226 Difference]: Without dead ends: 779 [2019-09-10 02:13:54,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 249 SyntacticMatches, 40 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16556 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6958, Invalid=32444, Unknown=0, NotChecked=0, Total=39402 [2019-09-10 02:13:54,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-09-10 02:13:54,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 200. [2019-09-10 02:13:54,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-10 02:13:54,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2019-09-10 02:13:54,161 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 160 [2019-09-10 02:13:54,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:13:54,162 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2019-09-10 02:13:54,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-10 02:13:54,162 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2019-09-10 02:13:54,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-10 02:13:54,162 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:13:54,162 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 10, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:13:54,162 INFO L418 AbstractCegarLoop]: === Iteration 198 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:13:54,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:13:54,163 INFO L82 PathProgramCache]: Analyzing trace with hash 407130735, now seen corresponding path program 144 times [2019-09-10 02:13:54,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:13:54,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:13:54,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:13:54,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:13:54,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:13:54,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:13:54,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1234 backedges. 531 proven. 91 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:13:54,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:13:54,754 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:13:54,755 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:13:54,755 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:13:54,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:13:54,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 197 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 197 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:13:54,764 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:13:54,764 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:13:54,816 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:13:54,816 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:13:54,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-10 02:13:54,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:13:55,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1234 backedges. 531 proven. 91 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:13:55,803 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:13:56,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1234 backedges. 531 proven. 91 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:13:56,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:13:56,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 74 [2019-09-10 02:13:56,359 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:13:56,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-10 02:13:56,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-10 02:13:56,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=959, Invalid=4443, Unknown=0, NotChecked=0, Total=5402 [2019-09-10 02:13:56,360 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 74 states. [2019-09-10 02:14:00,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:14:00,570 INFO L93 Difference]: Finished difference Result 903 states and 1121 transitions. [2019-09-10 02:14:00,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-09-10 02:14:00,570 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 160 [2019-09-10 02:14:00,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:14:00,572 INFO L225 Difference]: With dead ends: 903 [2019-09-10 02:14:00,572 INFO L226 Difference]: Without dead ends: 847 [2019-09-10 02:14:00,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 250 SyntacticMatches, 40 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17027 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7183, Invalid=33419, Unknown=0, NotChecked=0, Total=40602 [2019-09-10 02:14:00,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2019-09-10 02:14:00,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 200. [2019-09-10 02:14:00,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-10 02:14:00,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2019-09-10 02:14:00,581 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 160 [2019-09-10 02:14:00,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:14:00,581 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2019-09-10 02:14:00,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-10 02:14:00,581 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2019-09-10 02:14:00,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-10 02:14:00,582 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:14:00,582 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:14:00,582 INFO L418 AbstractCegarLoop]: === Iteration 199 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:14:00,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:14:00,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1517235950, now seen corresponding path program 145 times [2019-09-10 02:14:00,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:14:00,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:00,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:14:00,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:00,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:14:00,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:14:01,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1233 backedges. 531 proven. 90 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:14:01,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:14:01,159 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:14:01,159 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:14:01,159 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:14:01,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:14:01,159 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 198 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 198 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:14:01,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:14:01,169 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:14:01,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:14:01,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-10 02:14:01,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:14:02,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1233 backedges. 531 proven. 90 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:14:02,225 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:14:02,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1233 backedges. 531 proven. 90 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:14:02,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:14:02,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 73 [2019-09-10 02:14:02,770 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:14:02,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-10 02:14:02,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-10 02:14:02,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=934, Invalid=4322, Unknown=0, NotChecked=0, Total=5256 [2019-09-10 02:14:02,771 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 73 states. [2019-09-10 02:14:06,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:14:06,755 INFO L93 Difference]: Finished difference Result 970 states and 1208 transitions. [2019-09-10 02:14:06,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2019-09-10 02:14:06,755 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 160 [2019-09-10 02:14:06,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:14:06,757 INFO L225 Difference]: With dead ends: 970 [2019-09-10 02:14:06,757 INFO L226 Difference]: Without dead ends: 914 [2019-09-10 02:14:06,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 251 SyntacticMatches, 40 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17177 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7259, Invalid=33747, Unknown=0, NotChecked=0, Total=41006 [2019-09-10 02:14:06,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2019-09-10 02:14:06,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 200. [2019-09-10 02:14:06,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-10 02:14:06,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2019-09-10 02:14:06,768 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 160 [2019-09-10 02:14:06,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:14:06,768 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2019-09-10 02:14:06,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-10 02:14:06,768 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2019-09-10 02:14:06,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-10 02:14:06,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:14:06,769 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 10, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:14:06,769 INFO L418 AbstractCegarLoop]: === Iteration 200 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:14:06,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:14:06,769 INFO L82 PathProgramCache]: Analyzing trace with hash 860309135, now seen corresponding path program 146 times [2019-09-10 02:14:06,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:14:06,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:06,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:14:06,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:06,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:14:06,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:14:07,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1234 backedges. 531 proven. 91 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:14:07,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:14:07,355 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:14:07,355 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:14:07,355 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:14:07,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:14:07,355 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 199 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 199 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:14:07,366 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:14:07,366 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:14:07,429 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-09-10 02:14:07,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:14:07,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-10 02:14:07,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:14:08,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1234 backedges. 531 proven. 91 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:14:08,411 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:14:08,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1234 backedges. 531 proven. 91 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:14:08,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:14:08,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 72 [2019-09-10 02:14:08,955 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:14:08,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-10 02:14:08,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-10 02:14:08,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=913, Invalid=4199, Unknown=0, NotChecked=0, Total=5112 [2019-09-10 02:14:08,956 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 72 states. [2019-09-10 02:14:13,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:14:13,117 INFO L93 Difference]: Finished difference Result 1036 states and 1294 transitions. [2019-09-10 02:14:13,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2019-09-10 02:14:13,118 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 160 [2019-09-10 02:14:13,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:14:13,120 INFO L225 Difference]: With dead ends: 1036 [2019-09-10 02:14:13,120 INFO L226 Difference]: Without dead ends: 980 [2019-09-10 02:14:13,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 252 SyntacticMatches, 40 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16997 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7183, Invalid=33419, Unknown=0, NotChecked=0, Total=40602 [2019-09-10 02:14:13,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2019-09-10 02:14:13,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 200. [2019-09-10 02:14:13,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-10 02:14:13,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2019-09-10 02:14:13,128 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 160 [2019-09-10 02:14:13,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:14:13,129 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2019-09-10 02:14:13,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-10 02:14:13,129 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2019-09-10 02:14:13,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-10 02:14:13,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:14:13,129 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 11, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:14:13,130 INFO L418 AbstractCegarLoop]: === Iteration 201 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:14:13,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:14:13,130 INFO L82 PathProgramCache]: Analyzing trace with hash -684902706, now seen corresponding path program 147 times [2019-09-10 02:14:13,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:14:13,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:13,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:14:13,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:13,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:14:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:14:13,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1237 backedges. 531 proven. 94 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:14:13,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:14:13,694 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:14:13,694 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:14:13,694 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:14:13,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:14:13,694 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 200 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 200 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:14:13,705 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:14:13,705 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:14:13,757 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:14:13,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:14:13,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-10 02:14:13,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:14:14,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1237 backedges. 531 proven. 94 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:14:14,687 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:14:15,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1237 backedges. 531 proven. 94 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:14:15,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:14:15,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 71 [2019-09-10 02:14:15,236 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:14:15,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-10 02:14:15,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-10 02:14:15,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=896, Invalid=4074, Unknown=0, NotChecked=0, Total=4970 [2019-09-10 02:14:15,237 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 71 states. [2019-09-10 02:14:18,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:14:18,979 INFO L93 Difference]: Finished difference Result 1101 states and 1379 transitions. [2019-09-10 02:14:18,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2019-09-10 02:14:18,980 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 160 [2019-09-10 02:14:18,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:14:18,981 INFO L225 Difference]: With dead ends: 1101 [2019-09-10 02:14:18,982 INFO L226 Difference]: Without dead ends: 1045 [2019-09-10 02:14:18,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 253 SyntacticMatches, 40 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16484 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6958, Invalid=32444, Unknown=0, NotChecked=0, Total=39402 [2019-09-10 02:14:18,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2019-09-10 02:14:18,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 200. [2019-09-10 02:14:18,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-10 02:14:18,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2019-09-10 02:14:18,993 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 160 [2019-09-10 02:14:18,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:14:18,993 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2019-09-10 02:14:18,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-10 02:14:18,993 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2019-09-10 02:14:18,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-10 02:14:18,994 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:14:18,994 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 12, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:14:18,994 INFO L418 AbstractCegarLoop]: === Iteration 202 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:14:18,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:14:18,994 INFO L82 PathProgramCache]: Analyzing trace with hash -457653585, now seen corresponding path program 148 times [2019-09-10 02:14:18,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:14:18,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:18,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:14:18,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:18,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:14:19,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:14:19,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 531 proven. 99 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:14:19,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:14:19,549 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:14:19,549 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:14:19,549 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:14:19,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:14:19,549 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 201 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 201 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:14:19,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:14:19,559 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:14:19,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:14:19,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-10 02:14:19,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:14:20,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 531 proven. 99 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:14:20,524 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:14:21,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 531 proven. 99 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:14:21,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:14:21,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 70 [2019-09-10 02:14:21,065 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:14:21,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-10 02:14:21,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-10 02:14:21,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=883, Invalid=3947, Unknown=0, NotChecked=0, Total=4830 [2019-09-10 02:14:21,067 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 70 states. [2019-09-10 02:14:24,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:14:24,799 INFO L93 Difference]: Finished difference Result 1165 states and 1463 transitions. [2019-09-10 02:14:24,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-09-10 02:14:24,799 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 160 [2019-09-10 02:14:24,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:14:24,801 INFO L225 Difference]: With dead ends: 1165 [2019-09-10 02:14:24,801 INFO L226 Difference]: Without dead ends: 1109 [2019-09-10 02:14:24,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 254 SyntacticMatches, 40 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15646 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6593, Invalid=30849, Unknown=0, NotChecked=0, Total=37442 [2019-09-10 02:14:24,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2019-09-10 02:14:24,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 200. [2019-09-10 02:14:24,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-10 02:14:24,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2019-09-10 02:14:24,815 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 160 [2019-09-10 02:14:24,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:14:24,816 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2019-09-10 02:14:24,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-10 02:14:24,816 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2019-09-10 02:14:24,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-10 02:14:24,816 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:14:24,816 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 13, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:14:24,816 INFO L418 AbstractCegarLoop]: === Iteration 203 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:14:24,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:14:24,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1904981678, now seen corresponding path program 149 times [2019-09-10 02:14:24,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:14:24,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:24,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:14:24,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:24,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:14:24,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:14:25,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1249 backedges. 531 proven. 106 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:14:25,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:14:25,423 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:14:25,423 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:14:25,423 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:14:25,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:14:25,423 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 202 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 202 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:14:25,433 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:14:25,434 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:14:25,502 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-09-10 02:14:25,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:14:25,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-10 02:14:25,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:14:26,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1249 backedges. 531 proven. 106 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:14:26,406 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:14:26,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1249 backedges. 531 proven. 106 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:14:26,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:14:26,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 69 [2019-09-10 02:14:26,937 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:14:26,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-10 02:14:26,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-10 02:14:26,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=874, Invalid=3818, Unknown=0, NotChecked=0, Total=4692 [2019-09-10 02:14:26,938 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 69 states. [2019-09-10 02:14:30,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:14:30,569 INFO L93 Difference]: Finished difference Result 1228 states and 1546 transitions. [2019-09-10 02:14:30,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2019-09-10 02:14:30,570 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 160 [2019-09-10 02:14:30,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:14:30,572 INFO L225 Difference]: With dead ends: 1228 [2019-09-10 02:14:30,572 INFO L226 Difference]: Without dead ends: 1172 [2019-09-10 02:14:30,575 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 255 SyntacticMatches, 40 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14503 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6103, Invalid=28679, Unknown=0, NotChecked=0, Total=34782 [2019-09-10 02:14:30,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2019-09-10 02:14:30,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 200. [2019-09-10 02:14:30,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-10 02:14:30,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2019-09-10 02:14:30,584 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 160 [2019-09-10 02:14:30,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:14:30,585 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2019-09-10 02:14:30,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-10 02:14:30,585 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2019-09-10 02:14:30,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-10 02:14:30,585 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:14:30,585 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 14, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:14:30,585 INFO L418 AbstractCegarLoop]: === Iteration 204 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:14:30,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:14:30,586 INFO L82 PathProgramCache]: Analyzing trace with hash -2036676913, now seen corresponding path program 150 times [2019-09-10 02:14:30,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:14:30,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:30,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:14:30,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:30,586 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:14:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:14:31,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1258 backedges. 531 proven. 115 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:14:31,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:14:31,163 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:14:31,163 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:14:31,163 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:14:31,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:14:31,164 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 203 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 203 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:14:31,173 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:14:31,174 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:14:31,225 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:14:31,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:14:31,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-10 02:14:31,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:14:32,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1258 backedges. 531 proven. 115 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:14:32,100 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:14:32,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1258 backedges. 531 proven. 115 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:14:32,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:14:32,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 68 [2019-09-10 02:14:32,635 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:14:32,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-10 02:14:32,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-10 02:14:32,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=869, Invalid=3687, Unknown=0, NotChecked=0, Total=4556 [2019-09-10 02:14:32,637 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 68 states. [2019-09-10 02:14:36,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:14:36,165 INFO L93 Difference]: Finished difference Result 1290 states and 1628 transitions. [2019-09-10 02:14:36,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2019-09-10 02:14:36,165 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 160 [2019-09-10 02:14:36,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:14:36,167 INFO L225 Difference]: With dead ends: 1290 [2019-09-10 02:14:36,168 INFO L226 Difference]: Without dead ends: 1234 [2019-09-10 02:14:36,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 256 SyntacticMatches, 40 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13087 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5509, Invalid=25997, Unknown=0, NotChecked=0, Total=31506 [2019-09-10 02:14:36,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2019-09-10 02:14:36,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 200. [2019-09-10 02:14:36,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-10 02:14:36,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2019-09-10 02:14:36,181 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 160 [2019-09-10 02:14:36,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:14:36,181 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2019-09-10 02:14:36,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-10 02:14:36,181 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2019-09-10 02:14:36,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-10 02:14:36,181 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:14:36,181 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 15, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:14:36,182 INFO L418 AbstractCegarLoop]: === Iteration 205 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:14:36,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:14:36,182 INFO L82 PathProgramCache]: Analyzing trace with hash -2025279858, now seen corresponding path program 151 times [2019-09-10 02:14:36,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:14:36,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:36,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:14:36,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:36,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:14:36,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:14:36,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1269 backedges. 531 proven. 126 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:14:36,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:14:36,766 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:14:36,766 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:14:36,766 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:14:36,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:14:36,766 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 204 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 204 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:14:36,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:14:36,775 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:14:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:14:36,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-10 02:14:36,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:14:37,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1269 backedges. 531 proven. 126 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:14:37,637 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:14:38,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1269 backedges. 531 proven. 126 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:14:38,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:14:38,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 67 [2019-09-10 02:14:38,160 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:14:38,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-10 02:14:38,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-10 02:14:38,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=868, Invalid=3554, Unknown=0, NotChecked=0, Total=4422 [2019-09-10 02:14:38,162 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 67 states. [2019-09-10 02:14:41,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:14:41,317 INFO L93 Difference]: Finished difference Result 1351 states and 1709 transitions. [2019-09-10 02:14:41,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-09-10 02:14:41,317 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 160 [2019-09-10 02:14:41,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:14:41,319 INFO L225 Difference]: With dead ends: 1351 [2019-09-10 02:14:41,319 INFO L226 Difference]: Without dead ends: 1295 [2019-09-10 02:14:41,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 257 SyntacticMatches, 40 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11442 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4838, Invalid=22884, Unknown=0, NotChecked=0, Total=27722 [2019-09-10 02:14:41,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2019-09-10 02:14:41,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 200. [2019-09-10 02:14:41,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-10 02:14:41,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2019-09-10 02:14:41,329 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 160 [2019-09-10 02:14:41,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:14:41,329 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2019-09-10 02:14:41,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-10 02:14:41,330 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2019-09-10 02:14:41,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-10 02:14:41,330 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:14:41,330 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 16, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:14:41,330 INFO L418 AbstractCegarLoop]: === Iteration 206 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:14:41,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:14:41,331 INFO L82 PathProgramCache]: Analyzing trace with hash 191845103, now seen corresponding path program 152 times [2019-09-10 02:14:41,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:14:41,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:41,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:14:41,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:41,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:14:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:14:41,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1282 backedges. 531 proven. 139 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:14:41,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:14:41,914 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:14:41,914 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:14:41,914 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:14:41,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:14:41,915 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 205 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 205 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:14:41,924 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:14:41,924 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:14:41,986 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-09-10 02:14:41,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:14:41,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-10 02:14:41,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:14:42,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1282 backedges. 531 proven. 139 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:14:42,782 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:14:43,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1282 backedges. 531 proven. 139 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:14:43,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:14:43,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 66 [2019-09-10 02:14:43,336 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:14:43,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-10 02:14:43,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-10 02:14:43,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=871, Invalid=3419, Unknown=0, NotChecked=0, Total=4290 [2019-09-10 02:14:43,338 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 66 states. [2019-09-10 02:14:46,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:14:46,071 INFO L93 Difference]: Finished difference Result 1411 states and 1789 transitions. [2019-09-10 02:14:46,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-09-10 02:14:46,072 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 160 [2019-09-10 02:14:46,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:14:46,074 INFO L225 Difference]: With dead ends: 1411 [2019-09-10 02:14:46,074 INFO L226 Difference]: Without dead ends: 1355 [2019-09-10 02:14:46,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 258 SyntacticMatches, 40 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9624 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4123, Invalid=19439, Unknown=0, NotChecked=0, Total=23562 [2019-09-10 02:14:46,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2019-09-10 02:14:46,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 200. [2019-09-10 02:14:46,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-10 02:14:46,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2019-09-10 02:14:46,088 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 160 [2019-09-10 02:14:46,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:14:46,088 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2019-09-10 02:14:46,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-10 02:14:46,088 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2019-09-10 02:14:46,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-10 02:14:46,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:14:46,089 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:14:46,089 INFO L418 AbstractCegarLoop]: === Iteration 207 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:14:46,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:14:46,089 INFO L82 PathProgramCache]: Analyzing trace with hash -845013394, now seen corresponding path program 153 times [2019-09-10 02:14:46,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:14:46,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:46,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:14:46,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:46,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:14:46,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:14:46,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1297 backedges. 531 proven. 154 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:14:46,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:14:46,683 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:14:46,683 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:14:46,684 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:14:46,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:14:46,684 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 206 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 206 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:14:46,693 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:14:46,694 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:14:46,744 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:14:46,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:14:46,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-10 02:14:46,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:14:47,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1297 backedges. 531 proven. 154 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:14:47,527 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:14:48,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1297 backedges. 531 proven. 154 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:14:48,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:14:48,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 65 [2019-09-10 02:14:48,087 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:14:48,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-10 02:14:48,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-10 02:14:48,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=878, Invalid=3282, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 02:14:48,088 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 65 states. [2019-09-10 02:14:50,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:14:50,489 INFO L93 Difference]: Finished difference Result 1470 states and 1868 transitions. [2019-09-10 02:14:50,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-09-10 02:14:50,490 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 160 [2019-09-10 02:14:50,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:14:50,492 INFO L225 Difference]: With dead ends: 1470 [2019-09-10 02:14:50,492 INFO L226 Difference]: Without dead ends: 1414 [2019-09-10 02:14:50,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 259 SyntacticMatches, 40 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7701 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3403, Invalid=15779, Unknown=0, NotChecked=0, Total=19182 [2019-09-10 02:14:50,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2019-09-10 02:14:50,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 200. [2019-09-10 02:14:50,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-10 02:14:50,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2019-09-10 02:14:50,506 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 160 [2019-09-10 02:14:50,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:14:50,507 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2019-09-10 02:14:50,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-10 02:14:50,507 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2019-09-10 02:14:50,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-10 02:14:50,507 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:14:50,507 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:14:50,507 INFO L418 AbstractCegarLoop]: === Iteration 208 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:14:50,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:14:50,508 INFO L82 PathProgramCache]: Analyzing trace with hash 507012879, now seen corresponding path program 18 times [2019-09-10 02:14:50,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:14:50,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:50,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:14:50,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:50,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:14:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:14:51,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1314 backedges. 531 proven. 171 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:14:51,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:14:51,144 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:14:51,144 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:14:51,145 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:14:51,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:14:51,145 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 207 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 207 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:14:51,154 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:14:51,154 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:14:51,204 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:14:51,205 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:14:51,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-10 02:14:51,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:14:51,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1314 backedges. 531 proven. 171 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:14:51,957 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:14:52,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1314 backedges. 531 proven. 171 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:14:52,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:14:52,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 64 [2019-09-10 02:14:52,511 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:14:52,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-10 02:14:52,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-10 02:14:52,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=889, Invalid=3143, Unknown=0, NotChecked=0, Total=4032 [2019-09-10 02:14:52,512 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 64 states. [2019-09-10 02:14:54,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:14:54,352 INFO L93 Difference]: Finished difference Result 1531 states and 1950 transitions. [2019-09-10 02:14:54,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-10 02:14:54,353 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 160 [2019-09-10 02:14:54,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:14:54,355 INFO L225 Difference]: With dead ends: 1531 [2019-09-10 02:14:54,355 INFO L226 Difference]: Without dead ends: 1475 [2019-09-10 02:14:54,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 260 SyntacticMatches, 40 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5753 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2723, Invalid=12039, Unknown=0, NotChecked=0, Total=14762 [2019-09-10 02:14:54,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2019-09-10 02:14:54,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 202. [2019-09-10 02:14:54,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-10 02:14:54,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 223 transitions. [2019-09-10 02:14:54,370 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 223 transitions. Word has length 160 [2019-09-10 02:14:54,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:14:54,370 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 223 transitions. [2019-09-10 02:14:54,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-10 02:14:54,370 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 223 transitions. [2019-09-10 02:14:54,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 02:14:54,370 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:14:54,371 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:14:54,371 INFO L418 AbstractCegarLoop]: === Iteration 209 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:14:54,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:14:54,371 INFO L82 PathProgramCache]: Analyzing trace with hash -766547577, now seen corresponding path program 36 times [2019-09-10 02:14:54,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:14:54,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:54,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:14:54,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:54,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:14:54,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:14:54,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 226 proven. 495 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:14:54,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:14:54,591 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:14:54,591 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:14:54,591 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:14:54,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:14:54,591 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 208 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 208 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:14:54,601 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:14:54,602 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:14:54,654 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:14:54,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:14:54,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-10 02:14:54,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:14:54,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:14:54,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 226 proven. 495 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:14:54,696 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:14:55,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 226 proven. 495 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-10 02:14:55,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:14:55,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 26 [2019-09-10 02:14:55,022 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:14:55,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 02:14:55,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 02:14:55,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=409, Unknown=0, NotChecked=0, Total=650 [2019-09-10 02:14:55,023 INFO L87 Difference]: Start difference. First operand 202 states and 223 transitions. Second operand 26 states. [2019-09-10 02:14:55,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:14:55,410 INFO L93 Difference]: Finished difference Result 213 states and 235 transitions. [2019-09-10 02:14:55,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 02:14:55,410 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 161 [2019-09-10 02:14:55,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:14:55,411 INFO L225 Difference]: With dead ends: 213 [2019-09-10 02:14:55,411 INFO L226 Difference]: Without dead ends: 213 [2019-09-10 02:14:55,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 301 SyntacticMatches, 38 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=247, Invalid=455, Unknown=0, NotChecked=0, Total=702 [2019-09-10 02:14:55,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-10 02:14:55,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 209. [2019-09-10 02:14:55,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-09-10 02:14:55,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 230 transitions. [2019-09-10 02:14:55,415 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 230 transitions. Word has length 161 [2019-09-10 02:14:55,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:14:55,415 INFO L475 AbstractCegarLoop]: Abstraction has 209 states and 230 transitions. [2019-09-10 02:14:55,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 02:14:55,415 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 230 transitions. [2019-09-10 02:14:55,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 02:14:55,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:14:55,416 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:14:55,416 INFO L418 AbstractCegarLoop]: === Iteration 210 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:14:55,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:14:55,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1543809456, now seen corresponding path program 37 times [2019-09-10 02:14:55,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:14:55,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:55,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:14:55,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:55,417 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:14:55,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:14:56,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1463 backedges. 589 proven. 190 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:14:56,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:14:56,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:14:56,102 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:14:56,102 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:14:56,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:14:56,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 209 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 209 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:14:56,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:14:56,112 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:14:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:14:56,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-10 02:14:56,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:14:57,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1463 backedges. 589 proven. 190 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:14:57,433 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:14:58,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1463 backedges. 589 proven. 190 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:14:58,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:14:58,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 86 [2019-09-10 02:14:58,064 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:14:58,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-09-10 02:14:58,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-09-10 02:14:58,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=5879, Unknown=0, NotChecked=0, Total=7310 [2019-09-10 02:14:58,065 INFO L87 Difference]: Start difference. First operand 209 states and 230 transitions. Second operand 86 states. [2019-09-10 02:15:00,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:15:00,171 INFO L93 Difference]: Finished difference Result 348 states and 409 transitions. [2019-09-10 02:15:00,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-10 02:15:00,171 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 168 [2019-09-10 02:15:00,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:15:00,172 INFO L225 Difference]: With dead ends: 348 [2019-09-10 02:15:00,172 INFO L226 Difference]: Without dead ends: 289 [2019-09-10 02:15:00,174 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 254 SyntacticMatches, 42 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8266 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2985, Invalid=13271, Unknown=0, NotChecked=0, Total=16256 [2019-09-10 02:15:00,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-09-10 02:15:00,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 210. [2019-09-10 02:15:00,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-10 02:15:00,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2019-09-10 02:15:00,177 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 168 [2019-09-10 02:15:00,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:15:00,177 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2019-09-10 02:15:00,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-09-10 02:15:00,177 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2019-09-10 02:15:00,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 02:15:00,178 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:15:00,178 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:15:00,178 INFO L418 AbstractCegarLoop]: === Iteration 211 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:15:00,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:15:00,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1362318543, now seen corresponding path program 154 times [2019-09-10 02:15:00,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:15:00,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:15:00,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:15:00,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:15:00,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:15:00,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:15:00,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 589 proven. 172 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:15:00,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:15:00,869 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:15:00,869 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:15:00,870 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:15:00,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:15:00,870 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 210 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 210 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:15:00,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:15:00,880 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:15:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:15:00,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-10 02:15:00,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:15:02,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 589 proven. 172 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:15:02,289 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:15:02,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 589 proven. 172 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:15:02,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:15:02,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 85 [2019-09-10 02:15:02,919 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:15:02,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-09-10 02:15:02,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-09-10 02:15:02,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1371, Invalid=5769, Unknown=0, NotChecked=0, Total=7140 [2019-09-10 02:15:02,920 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand 85 states. [2019-09-10 02:15:05,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:15:05,029 INFO L93 Difference]: Finished difference Result 427 states and 509 transitions. [2019-09-10 02:15:05,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-10 02:15:05,029 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2019-09-10 02:15:05,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:15:05,030 INFO L225 Difference]: With dead ends: 427 [2019-09-10 02:15:05,031 INFO L226 Difference]: Without dead ends: 368 [2019-09-10 02:15:05,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 255 SyntacticMatches, 42 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9930 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3741, Invalid=17429, Unknown=0, NotChecked=0, Total=21170 [2019-09-10 02:15:05,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-09-10 02:15:05,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 210. [2019-09-10 02:15:05,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-10 02:15:05,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2019-09-10 02:15:05,036 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 168 [2019-09-10 02:15:05,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:15:05,036 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2019-09-10 02:15:05,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-09-10 02:15:05,036 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2019-09-10 02:15:05,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 02:15:05,037 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:15:05,037 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 17, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:15:05,037 INFO L418 AbstractCegarLoop]: === Iteration 212 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:15:05,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:15:05,037 INFO L82 PathProgramCache]: Analyzing trace with hash 2010253936, now seen corresponding path program 155 times [2019-09-10 02:15:05,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:15:05,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:15:05,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:15:05,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:15:05,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:15:05,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:15:05,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1429 backedges. 589 proven. 156 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:15:05,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:15:05,726 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:15:05,727 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:15:05,727 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:15:05,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:15:05,727 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 211 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 211 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:15:05,737 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:15:05,737 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:15:05,802 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-09-10 02:15:05,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:15:05,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-10 02:15:05,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:15:07,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1429 backedges. 589 proven. 156 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:15:07,024 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:15:07,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1429 backedges. 589 proven. 156 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:15:07,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:15:07,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 84 [2019-09-10 02:15:07,637 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:15:07,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-09-10 02:15:07,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-09-10 02:15:07,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1315, Invalid=5657, Unknown=0, NotChecked=0, Total=6972 [2019-09-10 02:15:07,639 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand 84 states. [2019-09-10 02:15:10,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:15:10,579 INFO L93 Difference]: Finished difference Result 505 states and 608 transitions. [2019-09-10 02:15:10,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-10 02:15:10,579 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 168 [2019-09-10 02:15:10,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:15:10,580 INFO L225 Difference]: With dead ends: 505 [2019-09-10 02:15:10,581 INFO L226 Difference]: Without dead ends: 446 [2019-09-10 02:15:10,583 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 256 SyntacticMatches, 42 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11688 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4549, Invalid=21533, Unknown=0, NotChecked=0, Total=26082 [2019-09-10 02:15:10,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-09-10 02:15:10,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 210. [2019-09-10 02:15:10,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-10 02:15:10,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2019-09-10 02:15:10,586 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 168 [2019-09-10 02:15:10,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:15:10,586 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2019-09-10 02:15:10,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-09-10 02:15:10,586 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2019-09-10 02:15:10,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 02:15:10,587 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:15:10,587 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 16, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:15:10,587 INFO L418 AbstractCegarLoop]: === Iteration 213 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:15:10,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:15:10,587 INFO L82 PathProgramCache]: Analyzing trace with hash -878338897, now seen corresponding path program 156 times [2019-09-10 02:15:10,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:15:10,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:15:10,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:15:10,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:15:10,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:15:10,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:15:11,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 589 proven. 142 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:15:11,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:15:11,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:15:11,263 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:15:11,263 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:15:11,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:15:11,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 212 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 212 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:15:11,273 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:15:11,273 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:15:11,326 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:15:11,327 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:15:11,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-10 02:15:11,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:15:12,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 589 proven. 142 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:15:12,530 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:15:13,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 589 proven. 142 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:15:13,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:15:13,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 83 [2019-09-10 02:15:13,132 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:15:13,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-09-10 02:15:13,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-09-10 02:15:13,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1263, Invalid=5543, Unknown=0, NotChecked=0, Total=6806 [2019-09-10 02:15:13,135 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand 83 states. [2019-09-10 02:15:16,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:15:16,557 INFO L93 Difference]: Finished difference Result 582 states and 706 transitions. [2019-09-10 02:15:16,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-10 02:15:16,557 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 168 [2019-09-10 02:15:16,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:15:16,558 INFO L225 Difference]: With dead ends: 582 [2019-09-10 02:15:16,558 INFO L226 Difference]: Without dead ends: 523 [2019-09-10 02:15:16,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 257 SyntacticMatches, 42 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13442 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5361, Invalid=25439, Unknown=0, NotChecked=0, Total=30800 [2019-09-10 02:15:16,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2019-09-10 02:15:16,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 210. [2019-09-10 02:15:16,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-10 02:15:16,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2019-09-10 02:15:16,564 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 168 [2019-09-10 02:15:16,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:15:16,564 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2019-09-10 02:15:16,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-09-10 02:15:16,564 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2019-09-10 02:15:16,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 02:15:16,565 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:15:16,565 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 15, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:15:16,565 INFO L418 AbstractCegarLoop]: === Iteration 214 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:15:16,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:15:16,565 INFO L82 PathProgramCache]: Analyzing trace with hash -2079897968, now seen corresponding path program 157 times [2019-09-10 02:15:16,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:15:16,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:15:16,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:15:16,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:15:16,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:15:16,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:15:17,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 589 proven. 130 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:15:17,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:15:17,208 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:15:17,208 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:15:17,208 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:15:17,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:15:17,208 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 213 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 213 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:15:17,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:15:17,218 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:15:17,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:15:17,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-10 02:15:17,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:15:18,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 589 proven. 130 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:15:18,452 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:15:19,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 589 proven. 130 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:15:19,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:15:19,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 82 [2019-09-10 02:15:19,059 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:15:19,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-10 02:15:19,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-10 02:15:19,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1215, Invalid=5427, Unknown=0, NotChecked=0, Total=6642 [2019-09-10 02:15:19,060 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand 82 states. [2019-09-10 02:15:22,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:15:22,033 INFO L93 Difference]: Finished difference Result 658 states and 803 transitions. [2019-09-10 02:15:22,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-09-10 02:15:22,034 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 168 [2019-09-10 02:15:22,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:15:22,035 INFO L225 Difference]: With dead ends: 658 [2019-09-10 02:15:22,035 INFO L226 Difference]: Without dead ends: 599 [2019-09-10 02:15:22,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 258 SyntacticMatches, 42 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15106 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6135, Invalid=29021, Unknown=0, NotChecked=0, Total=35156 [2019-09-10 02:15:22,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-09-10 02:15:22,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 210. [2019-09-10 02:15:22,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-10 02:15:22,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2019-09-10 02:15:22,042 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 168 [2019-09-10 02:15:22,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:15:22,042 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2019-09-10 02:15:22,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-10 02:15:22,042 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2019-09-10 02:15:22,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 02:15:22,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:15:22,043 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 14, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:15:22,043 INFO L418 AbstractCegarLoop]: === Iteration 215 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:15:22,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:15:22,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1010279281, now seen corresponding path program 158 times [2019-09-10 02:15:22,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:15:22,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:15:22,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:15:22,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:15:22,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:15:22,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:15:22,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1393 backedges. 589 proven. 120 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:15:22,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:15:22,674 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:15:22,675 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:15:22,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:15:22,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:15:22,675 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 214 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 214 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:15:22,684 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:15:22,684 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:15:22,749 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-09-10 02:15:22,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:15:22,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-10 02:15:22,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:15:23,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1393 backedges. 589 proven. 120 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:15:23,892 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:15:24,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1393 backedges. 589 proven. 120 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:15:24,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:15:24,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 81 [2019-09-10 02:15:24,496 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:15:24,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-10 02:15:24,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-10 02:15:24,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1171, Invalid=5309, Unknown=0, NotChecked=0, Total=6480 [2019-09-10 02:15:24,498 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand 81 states. [2019-09-10 02:15:28,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:15:28,519 INFO L93 Difference]: Finished difference Result 733 states and 899 transitions. [2019-09-10 02:15:28,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-09-10 02:15:28,520 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 168 [2019-09-10 02:15:28,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:15:28,521 INFO L225 Difference]: With dead ends: 733 [2019-09-10 02:15:28,521 INFO L226 Difference]: Without dead ends: 674 [2019-09-10 02:15:28,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 259 SyntacticMatches, 42 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16606 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6835, Invalid=32171, Unknown=0, NotChecked=0, Total=39006 [2019-09-10 02:15:28,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2019-09-10 02:15:28,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 210. [2019-09-10 02:15:28,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-10 02:15:28,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2019-09-10 02:15:28,530 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 168 [2019-09-10 02:15:28,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:15:28,531 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2019-09-10 02:15:28,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-10 02:15:28,531 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2019-09-10 02:15:28,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 02:15:28,532 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:15:28,532 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 13, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:15:28,532 INFO L418 AbstractCegarLoop]: === Iteration 216 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:15:28,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:15:28,532 INFO L82 PathProgramCache]: Analyzing trace with hash -560133456, now seen corresponding path program 159 times [2019-09-10 02:15:28,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:15:28,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:15:28,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:15:28,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:15:28,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:15:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:15:29,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1385 backedges. 589 proven. 112 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:15:29,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:15:29,167 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:15:29,167 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:15:29,167 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:15:29,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:15:29,167 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 215 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 215 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:15:29,183 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:15:29,183 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:15:29,252 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:15:29,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:15:29,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-10 02:15:29,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:15:30,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1385 backedges. 589 proven. 112 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:15:30,356 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:15:30,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1385 backedges. 589 proven. 112 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:15:30,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:15:30,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 80 [2019-09-10 02:15:30,956 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:15:30,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-09-10 02:15:30,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-09-10 02:15:30,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1131, Invalid=5189, Unknown=0, NotChecked=0, Total=6320 [2019-09-10 02:15:30,958 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand 80 states. [2019-09-10 02:15:35,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:15:35,313 INFO L93 Difference]: Finished difference Result 807 states and 994 transitions. [2019-09-10 02:15:35,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-09-10 02:15:35,314 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 168 [2019-09-10 02:15:35,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:15:35,316 INFO L225 Difference]: With dead ends: 807 [2019-09-10 02:15:35,316 INFO L226 Difference]: Without dead ends: 748 [2019-09-10 02:15:35,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 260 SyntacticMatches, 42 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17880 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7431, Invalid=34799, Unknown=0, NotChecked=0, Total=42230 [2019-09-10 02:15:35,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2019-09-10 02:15:35,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 210. [2019-09-10 02:15:35,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-10 02:15:35,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2019-09-10 02:15:35,324 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 168 [2019-09-10 02:15:35,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:15:35,324 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2019-09-10 02:15:35,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-09-10 02:15:35,324 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2019-09-10 02:15:35,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 02:15:35,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:15:35,325 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 12, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:15:35,325 INFO L418 AbstractCegarLoop]: === Iteration 217 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:15:35,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:15:35,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1532597359, now seen corresponding path program 160 times [2019-09-10 02:15:35,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:15:35,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:15:35,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:15:35,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:15:35,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:15:35,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:15:35,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1379 backedges. 589 proven. 106 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:15:35,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:15:35,968 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:15:35,969 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:15:35,969 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:15:35,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:15:35,969 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 216 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 216 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:15:35,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:15:35,979 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:15:36,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:15:36,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-10 02:15:36,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:15:37,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1379 backedges. 589 proven. 106 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:15:37,145 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:15:37,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1379 backedges. 589 proven. 106 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:15:37,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:15:37,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 79 [2019-09-10 02:15:37,766 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:15:37,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-10 02:15:37,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-10 02:15:37,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1095, Invalid=5067, Unknown=0, NotChecked=0, Total=6162 [2019-09-10 02:15:37,768 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand 79 states. [2019-09-10 02:15:41,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:15:41,554 INFO L93 Difference]: Finished difference Result 880 states and 1088 transitions. [2019-09-10 02:15:41,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2019-09-10 02:15:41,554 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 168 [2019-09-10 02:15:41,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:15:41,556 INFO L225 Difference]: With dead ends: 880 [2019-09-10 02:15:41,556 INFO L226 Difference]: Without dead ends: 821 [2019-09-10 02:15:41,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 261 SyntacticMatches, 42 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18878 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7899, Invalid=36833, Unknown=0, NotChecked=0, Total=44732 [2019-09-10 02:15:41,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2019-09-10 02:15:41,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 210. [2019-09-10 02:15:41,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-10 02:15:41,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2019-09-10 02:15:41,566 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 168 [2019-09-10 02:15:41,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:15:41,566 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2019-09-10 02:15:41,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-10 02:15:41,566 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2019-09-10 02:15:41,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 02:15:41,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:15:41,567 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 11, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:15:41,567 INFO L418 AbstractCegarLoop]: === Iteration 218 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:15:41,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:15:41,567 INFO L82 PathProgramCache]: Analyzing trace with hash 907368144, now seen corresponding path program 161 times [2019-09-10 02:15:41,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:15:41,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:15:41,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:15:41,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:15:41,568 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:15:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:15:42,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1375 backedges. 589 proven. 102 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:15:42,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:15:42,180 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:15:42,180 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:15:42,180 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:15:42,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:15:42,180 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 217 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 217 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:15:42,190 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:15:42,191 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:15:42,256 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-09-10 02:15:42,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:15:42,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-10 02:15:42,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:15:43,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1375 backedges. 589 proven. 102 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:15:43,373 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:15:43,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1375 backedges. 589 proven. 102 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:15:43,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:15:43,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 78 [2019-09-10 02:15:43,946 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:15:43,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-10 02:15:43,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-10 02:15:43,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1063, Invalid=4943, Unknown=0, NotChecked=0, Total=6006 [2019-09-10 02:15:43,947 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand 78 states. [2019-09-10 02:15:48,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:15:48,171 INFO L93 Difference]: Finished difference Result 952 states and 1181 transitions. [2019-09-10 02:15:48,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-09-10 02:15:48,172 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 168 [2019-09-10 02:15:48,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:15:48,174 INFO L225 Difference]: With dead ends: 952 [2019-09-10 02:15:48,174 INFO L226 Difference]: Without dead ends: 893 [2019-09-10 02:15:48,179 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 262 SyntacticMatches, 42 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19562 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=8221, Invalid=38219, Unknown=0, NotChecked=0, Total=46440 [2019-09-10 02:15:48,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2019-09-10 02:15:48,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 210. [2019-09-10 02:15:48,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-10 02:15:48,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2019-09-10 02:15:48,185 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 168 [2019-09-10 02:15:48,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:15:48,185 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2019-09-10 02:15:48,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-10 02:15:48,185 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2019-09-10 02:15:48,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 02:15:48,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:15:48,186 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:15:48,186 INFO L418 AbstractCegarLoop]: === Iteration 219 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:15:48,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:15:48,186 INFO L82 PathProgramCache]: Analyzing trace with hash 194462799, now seen corresponding path program 162 times [2019-09-10 02:15:48,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:15:48,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:15:48,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:15:48,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:15:48,187 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:15:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:15:48,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1373 backedges. 589 proven. 100 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:15:48,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:15:48,858 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:15:48,858 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:15:48,858 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:15:48,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:15:48,858 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 218 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 218 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:15:48,867 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:15:48,868 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:15:48,921 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:15:48,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:15:48,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-10 02:15:48,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:15:49,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1373 backedges. 589 proven. 100 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:15:49,974 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:15:50,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1373 backedges. 589 proven. 100 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:15:50,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:15:50,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 77 [2019-09-10 02:15:50,562 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:15:50,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-10 02:15:50,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-10 02:15:50,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=4817, Unknown=0, NotChecked=0, Total=5852 [2019-09-10 02:15:50,563 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand 77 states. [2019-09-10 02:15:55,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:15:55,173 INFO L93 Difference]: Finished difference Result 1023 states and 1273 transitions. [2019-09-10 02:15:55,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2019-09-10 02:15:55,173 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 168 [2019-09-10 02:15:55,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:15:55,175 INFO L225 Difference]: With dead ends: 1023 [2019-09-10 02:15:55,175 INFO L226 Difference]: Without dead ends: 964 [2019-09-10 02:15:55,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 263 SyntacticMatches, 42 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19906 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8385, Invalid=38921, Unknown=0, NotChecked=0, Total=47306 [2019-09-10 02:15:55,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2019-09-10 02:15:55,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 210. [2019-09-10 02:15:55,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-10 02:15:55,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2019-09-10 02:15:55,184 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 168 [2019-09-10 02:15:55,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:15:55,184 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2019-09-10 02:15:55,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-10 02:15:55,184 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2019-09-10 02:15:55,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 02:15:55,184 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:15:55,185 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:15:55,185 INFO L418 AbstractCegarLoop]: === Iteration 220 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:15:55,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:15:55,185 INFO L82 PathProgramCache]: Analyzing trace with hash -244176144, now seen corresponding path program 163 times [2019-09-10 02:15:55,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:15:55,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:15:55,185 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:15:55,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:15:55,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:15:55,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:15:55,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1373 backedges. 589 proven. 100 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:15:55,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:15:55,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:15:55,802 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:15:55,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:15:55,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:15:55,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 219 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 219 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:15:55,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:15:55,813 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:15:55,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:15:55,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-10 02:15:55,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:15:56,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1373 backedges. 589 proven. 100 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:15:56,890 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:15:57,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1373 backedges. 589 proven. 100 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:15:57,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:15:57,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 76 [2019-09-10 02:15:57,482 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:15:57,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-10 02:15:57,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-10 02:15:57,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1011, Invalid=4689, Unknown=0, NotChecked=0, Total=5700 [2019-09-10 02:15:57,483 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand 76 states. [2019-09-10 02:16:01,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:16:01,732 INFO L93 Difference]: Finished difference Result 1093 states and 1364 transitions. [2019-09-10 02:16:01,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-09-10 02:16:01,733 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 168 [2019-09-10 02:16:01,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:16:01,735 INFO L225 Difference]: With dead ends: 1093 [2019-09-10 02:16:01,735 INFO L226 Difference]: Without dead ends: 1034 [2019-09-10 02:16:01,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 264 SyntacticMatches, 42 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19896 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=8385, Invalid=38921, Unknown=0, NotChecked=0, Total=47306 [2019-09-10 02:16:01,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2019-09-10 02:16:01,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 210. [2019-09-10 02:16:01,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-10 02:16:01,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2019-09-10 02:16:01,748 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 168 [2019-09-10 02:16:01,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:16:01,748 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2019-09-10 02:16:01,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-10 02:16:01,748 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2019-09-10 02:16:01,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 02:16:01,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:16:01,749 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 11, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:16:01,749 INFO L418 AbstractCegarLoop]: === Iteration 221 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:16:01,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:16:01,749 INFO L82 PathProgramCache]: Analyzing trace with hash -2059441105, now seen corresponding path program 164 times [2019-09-10 02:16:01,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:16:01,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:01,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:16:01,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:01,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:16:01,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:16:02,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1375 backedges. 589 proven. 102 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:16:02,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:02,375 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:16:02,375 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:16:02,375 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:16:02,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:02,375 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 220 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 220 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:16:02,384 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:16:02,384 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:16:02,468 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-09-10 02:16:02,468 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:16:02,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-10 02:16:02,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:16:03,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1375 backedges. 589 proven. 102 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:16:03,537 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:16:04,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1375 backedges. 589 proven. 102 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:16:04,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:16:04,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 75 [2019-09-10 02:16:04,118 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:16:04,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-10 02:16:04,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-10 02:16:04,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=991, Invalid=4559, Unknown=0, NotChecked=0, Total=5550 [2019-09-10 02:16:04,120 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand 75 states. [2019-09-10 02:16:08,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:16:08,651 INFO L93 Difference]: Finished difference Result 1162 states and 1454 transitions. [2019-09-10 02:16:08,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-09-10 02:16:08,652 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 168 [2019-09-10 02:16:08,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:16:08,654 INFO L225 Difference]: With dead ends: 1162 [2019-09-10 02:16:08,654 INFO L226 Difference]: Without dead ends: 1103 [2019-09-10 02:16:08,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 265 SyntacticMatches, 42 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19526 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=8221, Invalid=38219, Unknown=0, NotChecked=0, Total=46440 [2019-09-10 02:16:08,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2019-09-10 02:16:08,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 210. [2019-09-10 02:16:08,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-10 02:16:08,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2019-09-10 02:16:08,666 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 168 [2019-09-10 02:16:08,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:16:08,666 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2019-09-10 02:16:08,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-10 02:16:08,666 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2019-09-10 02:16:08,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 02:16:08,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:16:08,667 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 12, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:16:08,667 INFO L418 AbstractCegarLoop]: === Iteration 222 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:16:08,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:16:08,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1345685264, now seen corresponding path program 165 times [2019-09-10 02:16:08,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:16:08,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:08,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:16:08,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:08,668 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:16:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:16:09,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1379 backedges. 589 proven. 106 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:16:09,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:09,287 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:16:09,287 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:16:09,287 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:16:09,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:09,287 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 221 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 221 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:16:09,297 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:16:09,297 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:16:09,351 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:16:09,351 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:16:09,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-10 02:16:09,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:16:10,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1379 backedges. 589 proven. 106 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:16:10,332 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:16:10,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1379 backedges. 589 proven. 106 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:16:10,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:16:10,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 74 [2019-09-10 02:16:10,931 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:16:10,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-10 02:16:10,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-10 02:16:10,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=975, Invalid=4427, Unknown=0, NotChecked=0, Total=5402 [2019-09-10 02:16:10,933 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand 74 states. [2019-09-10 02:16:15,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:16:15,247 INFO L93 Difference]: Finished difference Result 1230 states and 1543 transitions. [2019-09-10 02:16:15,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2019-09-10 02:16:15,248 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 168 [2019-09-10 02:16:15,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:16:15,250 INFO L225 Difference]: With dead ends: 1230 [2019-09-10 02:16:15,250 INFO L226 Difference]: Without dead ends: 1171 [2019-09-10 02:16:15,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 266 SyntacticMatches, 42 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18798 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7899, Invalid=36833, Unknown=0, NotChecked=0, Total=44732 [2019-09-10 02:16:15,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2019-09-10 02:16:15,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 210. [2019-09-10 02:16:15,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-10 02:16:15,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2019-09-10 02:16:15,262 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 168 [2019-09-10 02:16:15,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:16:15,262 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2019-09-10 02:16:15,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-10 02:16:15,262 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2019-09-10 02:16:15,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 02:16:15,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:16:15,263 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 13, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:16:15,263 INFO L418 AbstractCegarLoop]: === Iteration 223 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:16:15,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:16:15,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1869607921, now seen corresponding path program 166 times [2019-09-10 02:16:15,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:16:15,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:15,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:16:15,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:15,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:16:15,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:16:15,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1385 backedges. 589 proven. 112 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:16:15,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:15,893 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:16:15,893 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:16:15,893 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:16:15,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:15,893 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 222 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 222 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:16:15,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:16:15,906 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:16:15,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:16:15,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-10 02:16:15,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:16:16,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1385 backedges. 589 proven. 112 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:16:16,956 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:16:17,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1385 backedges. 589 proven. 112 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:16:17,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:16:17,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 73 [2019-09-10 02:16:17,533 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:16:17,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-10 02:16:17,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-10 02:16:17,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=963, Invalid=4293, Unknown=0, NotChecked=0, Total=5256 [2019-09-10 02:16:17,534 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand 73 states. [2019-09-10 02:16:21,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:16:21,444 INFO L93 Difference]: Finished difference Result 1297 states and 1631 transitions. [2019-09-10 02:16:21,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-09-10 02:16:21,445 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 168 [2019-09-10 02:16:21,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:16:21,447 INFO L225 Difference]: With dead ends: 1297 [2019-09-10 02:16:21,447 INFO L226 Difference]: Without dead ends: 1238 [2019-09-10 02:16:21,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 267 SyntacticMatches, 42 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17726 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7431, Invalid=34799, Unknown=0, NotChecked=0, Total=42230 [2019-09-10 02:16:21,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2019-09-10 02:16:21,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 210. [2019-09-10 02:16:21,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-10 02:16:21,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2019-09-10 02:16:21,461 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 168 [2019-09-10 02:16:21,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:16:21,461 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2019-09-10 02:16:21,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-10 02:16:21,462 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2019-09-10 02:16:21,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 02:16:21,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:16:21,462 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 14, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:16:21,462 INFO L418 AbstractCegarLoop]: === Iteration 224 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:16:21,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:16:21,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1973327056, now seen corresponding path program 167 times [2019-09-10 02:16:21,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:16:21,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:21,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:16:21,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:21,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:16:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:16:22,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1393 backedges. 589 proven. 120 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:16:22,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:22,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:16:22,087 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:16:22,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:16:22,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:22,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 223 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 223 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:16:22,097 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:16:22,097 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:16:22,160 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-09-10 02:16:22,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:16:22,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-10 02:16:22,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:16:23,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1393 backedges. 589 proven. 120 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:16:23,137 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:16:23,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1393 backedges. 589 proven. 120 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:16:23,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:16:23,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 72 [2019-09-10 02:16:23,715 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:16:23,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-10 02:16:23,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-10 02:16:23,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=955, Invalid=4157, Unknown=0, NotChecked=0, Total=5112 [2019-09-10 02:16:23,717 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand 72 states. [2019-09-10 02:16:27,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:16:27,633 INFO L93 Difference]: Finished difference Result 1363 states and 1718 transitions. [2019-09-10 02:16:27,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2019-09-10 02:16:27,633 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 168 [2019-09-10 02:16:27,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:16:27,636 INFO L225 Difference]: With dead ends: 1363 [2019-09-10 02:16:27,636 INFO L226 Difference]: Without dead ends: 1304 [2019-09-10 02:16:27,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 268 SyntacticMatches, 42 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16336 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6835, Invalid=32171, Unknown=0, NotChecked=0, Total=39006 [2019-09-10 02:16:27,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2019-09-10 02:16:27,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 210. [2019-09-10 02:16:27,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-10 02:16:27,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2019-09-10 02:16:27,648 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 168 [2019-09-10 02:16:27,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:16:27,648 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2019-09-10 02:16:27,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-10 02:16:27,649 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2019-09-10 02:16:27,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 02:16:27,649 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:16:27,649 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 15, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:16:27,649 INFO L418 AbstractCegarLoop]: === Iteration 225 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:16:27,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:16:27,649 INFO L82 PathProgramCache]: Analyzing trace with hash -314104849, now seen corresponding path program 168 times [2019-09-10 02:16:27,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:16:27,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:27,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:16:27,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:27,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:16:27,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:16:28,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 589 proven. 130 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:16:28,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:28,339 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:16:28,339 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:16:28,339 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:16:28,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:28,340 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 224 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 224 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:16:28,348 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:16:28,349 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:16:28,402 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:16:28,403 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:16:28,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-10 02:16:28,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:16:29,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 589 proven. 130 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:16:29,333 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:16:29,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 589 proven. 130 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:16:29,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:16:29,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 71 [2019-09-10 02:16:29,920 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:16:29,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-10 02:16:29,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-10 02:16:29,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=951, Invalid=4019, Unknown=0, NotChecked=0, Total=4970 [2019-09-10 02:16:29,922 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand 71 states. [2019-09-10 02:16:33,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:16:33,296 INFO L93 Difference]: Finished difference Result 1428 states and 1804 transitions. [2019-09-10 02:16:33,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-09-10 02:16:33,297 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 168 [2019-09-10 02:16:33,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:16:33,299 INFO L225 Difference]: With dead ends: 1428 [2019-09-10 02:16:33,299 INFO L226 Difference]: Without dead ends: 1369 [2019-09-10 02:16:33,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 269 SyntacticMatches, 42 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14666 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6135, Invalid=29021, Unknown=0, NotChecked=0, Total=35156 [2019-09-10 02:16:33,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2019-09-10 02:16:33,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 210. [2019-09-10 02:16:33,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-10 02:16:33,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2019-09-10 02:16:33,314 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 168 [2019-09-10 02:16:33,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:16:33,314 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2019-09-10 02:16:33,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-10 02:16:33,314 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2019-09-10 02:16:33,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 02:16:33,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:16:33,315 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 16, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:16:33,315 INFO L418 AbstractCegarLoop]: === Iteration 226 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:16:33,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:16:33,315 INFO L82 PathProgramCache]: Analyzing trace with hash -260581552, now seen corresponding path program 169 times [2019-09-10 02:16:33,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:16:33,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:33,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:16:33,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:33,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:16:33,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:16:33,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 589 proven. 142 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:16:33,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:33,928 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:16:33,928 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:16:33,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:16:33,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:33,928 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 225 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 225 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:16:33,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:16:33,938 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:16:33,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:16:33,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-10 02:16:33,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:16:34,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 589 proven. 142 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:16:34,931 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:16:35,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 589 proven. 142 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:16:35,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:16:35,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 70 [2019-09-10 02:16:35,516 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:16:35,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-10 02:16:35,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-10 02:16:35,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=951, Invalid=3879, Unknown=0, NotChecked=0, Total=4830 [2019-09-10 02:16:35,517 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand 70 states. [2019-09-10 02:16:38,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:16:38,585 INFO L93 Difference]: Finished difference Result 1492 states and 1889 transitions. [2019-09-10 02:16:38,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-09-10 02:16:38,585 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 168 [2019-09-10 02:16:38,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:16:38,588 INFO L225 Difference]: With dead ends: 1492 [2019-09-10 02:16:38,588 INFO L226 Difference]: Without dead ends: 1433 [2019-09-10 02:16:38,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 270 SyntacticMatches, 42 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12766 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5361, Invalid=25439, Unknown=0, NotChecked=0, Total=30800 [2019-09-10 02:16:38,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2019-09-10 02:16:38,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 210. [2019-09-10 02:16:38,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-10 02:16:38,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2019-09-10 02:16:38,603 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 168 [2019-09-10 02:16:38,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:16:38,603 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2019-09-10 02:16:38,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-10 02:16:38,603 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2019-09-10 02:16:38,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 02:16:38,604 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:16:38,604 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 17, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:16:38,604 INFO L418 AbstractCegarLoop]: === Iteration 227 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:16:38,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:16:38,604 INFO L82 PathProgramCache]: Analyzing trace with hash 849523663, now seen corresponding path program 170 times [2019-09-10 02:16:38,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:16:38,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:38,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:16:38,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:38,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:16:38,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:16:39,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1429 backedges. 589 proven. 156 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:16:39,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:39,267 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:16:39,267 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:16:39,267 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:16:39,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:39,267 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 226 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 226 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:16:39,277 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:16:39,277 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:16:39,342 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-09-10 02:16:39,342 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:16:39,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-10 02:16:39,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:16:40,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1429 backedges. 589 proven. 156 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:16:40,268 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:16:40,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1429 backedges. 589 proven. 156 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:16:40,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:16:40,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 69 [2019-09-10 02:16:40,841 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:16:40,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-10 02:16:40,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-10 02:16:40,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=955, Invalid=3737, Unknown=0, NotChecked=0, Total=4692 [2019-09-10 02:16:40,842 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand 69 states. [2019-09-10 02:16:43,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:16:43,756 INFO L93 Difference]: Finished difference Result 1555 states and 1973 transitions. [2019-09-10 02:16:43,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-09-10 02:16:43,756 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 168 [2019-09-10 02:16:43,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:16:43,758 INFO L225 Difference]: With dead ends: 1555 [2019-09-10 02:16:43,759 INFO L226 Difference]: Without dead ends: 1496 [2019-09-10 02:16:43,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 271 SyntacticMatches, 42 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10698 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4549, Invalid=21533, Unknown=0, NotChecked=0, Total=26082 [2019-09-10 02:16:43,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2019-09-10 02:16:43,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 210. [2019-09-10 02:16:43,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-10 02:16:43,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2019-09-10 02:16:43,775 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 168 [2019-09-10 02:16:43,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:16:43,775 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2019-09-10 02:16:43,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-10 02:16:43,775 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2019-09-10 02:16:43,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 02:16:43,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:16:43,776 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:16:43,776 INFO L418 AbstractCegarLoop]: === Iteration 228 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:16:43,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:16:43,776 INFO L82 PathProgramCache]: Analyzing trace with hash 192596848, now seen corresponding path program 171 times [2019-09-10 02:16:43,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:16:43,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:43,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:16:43,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:43,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:16:43,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:16:44,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 589 proven. 172 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:16:44,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:44,395 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:16:44,395 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:16:44,395 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:16:44,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:44,395 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 227 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 227 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:16:44,407 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:16:44,407 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:16:44,462 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:16:44,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:16:44,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-10 02:16:44,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:16:45,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 589 proven. 172 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:16:45,313 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:16:45,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 589 proven. 172 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:16:45,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:16:45,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 68 [2019-09-10 02:16:45,921 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:16:45,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-10 02:16:45,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-10 02:16:45,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=963, Invalid=3593, Unknown=0, NotChecked=0, Total=4556 [2019-09-10 02:16:45,922 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand 68 states. [2019-09-10 02:16:48,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:16:48,239 INFO L93 Difference]: Finished difference Result 1617 states and 2056 transitions. [2019-09-10 02:16:48,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-10 02:16:48,240 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 168 [2019-09-10 02:16:48,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:16:48,243 INFO L225 Difference]: With dead ends: 1617 [2019-09-10 02:16:48,243 INFO L226 Difference]: Without dead ends: 1558 [2019-09-10 02:16:48,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 272 SyntacticMatches, 42 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8536 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3741, Invalid=17429, Unknown=0, NotChecked=0, Total=21170 [2019-09-10 02:16:48,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2019-09-10 02:16:48,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 210. [2019-09-10 02:16:48,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-10 02:16:48,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2019-09-10 02:16:48,258 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 168 [2019-09-10 02:16:48,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:16:48,258 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2019-09-10 02:16:48,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-10 02:16:48,259 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2019-09-10 02:16:48,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 02:16:48,259 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:16:48,259 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:16:48,259 INFO L418 AbstractCegarLoop]: === Iteration 229 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:16:48,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:16:48,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1352614993, now seen corresponding path program 19 times [2019-09-10 02:16:48,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:16:48,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:48,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:16:48,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:48,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:16:48,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:16:48,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1463 backedges. 589 proven. 190 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:16:48,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:48,911 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:16:48,911 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:16:48,911 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:16:48,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:48,912 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 228 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 228 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:16:48,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:16:48,923 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:16:48,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:16:48,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-10 02:16:48,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:16:49,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1463 backedges. 589 proven. 190 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:16:49,810 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:16:50,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1463 backedges. 589 proven. 190 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:16:50,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:16:50,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 67 [2019-09-10 02:16:50,416 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:16:50,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-10 02:16:50,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-10 02:16:50,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=975, Invalid=3447, Unknown=0, NotChecked=0, Total=4422 [2019-09-10 02:16:50,417 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand 67 states. [2019-09-10 02:16:52,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:16:52,539 INFO L93 Difference]: Finished difference Result 1681 states and 2142 transitions. [2019-09-10 02:16:52,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-10 02:16:52,540 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 168 [2019-09-10 02:16:52,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:16:52,542 INFO L225 Difference]: With dead ends: 1681 [2019-09-10 02:16:52,542 INFO L226 Difference]: Without dead ends: 1622 [2019-09-10 02:16:52,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 273 SyntacticMatches, 42 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6366 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2985, Invalid=13271, Unknown=0, NotChecked=0, Total=16256 [2019-09-10 02:16:52,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2019-09-10 02:16:52,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 212. [2019-09-10 02:16:52,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-09-10 02:16:52,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 234 transitions. [2019-09-10 02:16:52,557 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 234 transitions. Word has length 168 [2019-09-10 02:16:52,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:16:52,557 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 234 transitions. [2019-09-10 02:16:52,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-10 02:16:52,558 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 234 transitions. [2019-09-10 02:16:52,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-10 02:16:52,558 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:16:52,558 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:16:52,558 INFO L418 AbstractCegarLoop]: === Iteration 230 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:16:52,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:16:52,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1048324632, now seen corresponding path program 38 times [2019-09-10 02:16:52,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:16:52,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:52,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:16:52,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:52,559 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:16:52,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:16:52,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 248 proven. 551 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:16:52,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:52,786 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:16:52,786 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:16:52,786 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:16:52,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:52,786 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 229 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 229 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:16:52,796 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:16:52,796 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:16:52,866 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-09-10 02:16:52,866 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:16:52,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-10 02:16:52,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:16:52,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:16:52,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 248 proven. 551 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:16:52,909 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:16:53,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 248 proven. 551 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-10 02:16:53,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:16:53,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 27 [2019-09-10 02:16:53,270 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:16:53,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-10 02:16:53,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-10 02:16:53,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=439, Unknown=0, NotChecked=0, Total=702 [2019-09-10 02:16:53,270 INFO L87 Difference]: Start difference. First operand 212 states and 234 transitions. Second operand 27 states. [2019-09-10 02:16:53,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:16:53,723 INFO L93 Difference]: Finished difference Result 223 states and 246 transitions. [2019-09-10 02:16:53,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 02:16:53,723 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 169 [2019-09-10 02:16:53,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:16:53,724 INFO L225 Difference]: With dead ends: 223 [2019-09-10 02:16:53,724 INFO L226 Difference]: Without dead ends: 223 [2019-09-10 02:16:53,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 316 SyntacticMatches, 40 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=269, Invalid=487, Unknown=0, NotChecked=0, Total=756 [2019-09-10 02:16:53,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-09-10 02:16:53,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 219. [2019-09-10 02:16:53,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-09-10 02:16:53,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 241 transitions. [2019-09-10 02:16:53,728 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 241 transitions. Word has length 169 [2019-09-10 02:16:53,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:16:53,728 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 241 transitions. [2019-09-10 02:16:53,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-10 02:16:53,728 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 241 transitions. [2019-09-10 02:16:53,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 02:16:53,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:16:53,729 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:16:53,729 INFO L418 AbstractCegarLoop]: === Iteration 231 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:16:53,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:16:53,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1300720335, now seen corresponding path program 39 times [2019-09-10 02:16:53,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:16:53,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:53,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:16:53,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:53,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:16:53,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:16:54,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1620 backedges. 650 proven. 210 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-10 02:16:54,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:54,462 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:16:54,462 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:16:54,462 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:16:54,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:54,463 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 230 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 230 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:16:54,472 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:16:54,472 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:16:54,529 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:16:54,530 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:16:54,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-10 02:16:54,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:16:55,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1620 backedges. 650 proven. 210 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-10 02:16:55,934 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:16:56,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1620 backedges. 650 proven. 210 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-10 02:16:56,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:16:56,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 90 [2019-09-10 02:16:56,631 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:16:56,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-09-10 02:16:56,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-09-10 02:16:56,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1565, Invalid=6445, Unknown=0, NotChecked=0, Total=8010 [2019-09-10 02:16:56,633 INFO L87 Difference]: Start difference. First operand 219 states and 241 transitions. Second operand 90 states. [2019-09-10 02:16:58,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:16:58,707 INFO L93 Difference]: Finished difference Result 365 states and 429 transitions. [2019-09-10 02:16:58,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-10 02:16:58,707 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 176 [2019-09-10 02:16:58,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:16:58,708 INFO L225 Difference]: With dead ends: 365 [2019-09-10 02:16:58,708 INFO L226 Difference]: Without dead ends: 303 [2019-09-10 02:16:58,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 266 SyntacticMatches, 44 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9110 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3259, Invalid=14563, Unknown=0, NotChecked=0, Total=17822 [2019-09-10 02:16:58,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-09-10 02:16:58,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 220. [2019-09-10 02:16:58,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-09-10 02:16:58,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 242 transitions. [2019-09-10 02:16:58,714 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 242 transitions. Word has length 176 [2019-09-10 02:16:58,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:16:58,714 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 242 transitions. [2019-09-10 02:16:58,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-09-10 02:16:58,714 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 242 transitions. [2019-09-10 02:16:58,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 02:16:58,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:16:58,715 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:16:58,715 INFO L418 AbstractCegarLoop]: === Iteration 232 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:16:58,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:16:58,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1205107278, now seen corresponding path program 172 times [2019-09-10 02:16:58,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:16:58,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:58,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:16:58,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:58,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:16:58,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:16:59,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1601 backedges. 650 proven. 191 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-10 02:16:59,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:59,437 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:16:59,438 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:16:59,438 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:16:59,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:59,438 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 231 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 231 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:16:59,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:16:59,448 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:16:59,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:16:59,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-10 02:16:59,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:00,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1601 backedges. 650 proven. 191 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-10 02:17:00,865 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:01,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1601 backedges. 650 proven. 191 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-10 02:17:01,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:01,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 89 [2019-09-10 02:17:01,541 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:01,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-09-10 02:17:01,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-09-10 02:17:01,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1502, Invalid=6330, Unknown=0, NotChecked=0, Total=7832 [2019-09-10 02:17:01,543 INFO L87 Difference]: Start difference. First operand 220 states and 242 transitions. Second operand 89 states. [2019-09-10 02:17:04,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:04,216 INFO L93 Difference]: Finished difference Result 448 states and 534 transitions. [2019-09-10 02:17:04,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-10 02:17:04,217 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2019-09-10 02:17:04,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:04,218 INFO L225 Difference]: With dead ends: 448 [2019-09-10 02:17:04,218 INFO L226 Difference]: Without dead ends: 386 [2019-09-10 02:17:04,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 267 SyntacticMatches, 44 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10962 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4095, Invalid=19161, Unknown=0, NotChecked=0, Total=23256 [2019-09-10 02:17:04,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-09-10 02:17:04,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 220. [2019-09-10 02:17:04,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-09-10 02:17:04,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 242 transitions. [2019-09-10 02:17:04,224 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 242 transitions. Word has length 176 [2019-09-10 02:17:04,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:04,224 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 242 transitions. [2019-09-10 02:17:04,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-09-10 02:17:04,224 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 242 transitions. [2019-09-10 02:17:04,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 02:17:04,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:04,225 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 18, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:04,225 INFO L418 AbstractCegarLoop]: === Iteration 233 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:04,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:04,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1846018321, now seen corresponding path program 173 times [2019-09-10 02:17:04,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:04,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:04,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:04,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:04,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:04,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:04,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 650 proven. 174 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-10 02:17:04,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:04,968 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:04,968 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:04,968 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:04,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:04,969 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 232 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 232 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:17:04,978 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:17:04,978 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:17:05,047 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-10 02:17:05,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:17:05,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-10 02:17:05,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:06,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 650 proven. 174 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-10 02:17:06,377 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:07,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 650 proven. 174 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-10 02:17:07,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:07,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 88 [2019-09-10 02:17:07,051 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:07,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-09-10 02:17:07,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-09-10 02:17:07,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1443, Invalid=6213, Unknown=0, NotChecked=0, Total=7656 [2019-09-10 02:17:07,052 INFO L87 Difference]: Start difference. First operand 220 states and 242 transitions. Second operand 88 states. [2019-09-10 02:17:09,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:09,889 INFO L93 Difference]: Finished difference Result 530 states and 638 transitions. [2019-09-10 02:17:09,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-10 02:17:09,890 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 176 [2019-09-10 02:17:09,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:09,891 INFO L225 Difference]: With dead ends: 530 [2019-09-10 02:17:09,891 INFO L226 Difference]: Without dead ends: 468 [2019-09-10 02:17:09,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 268 SyntacticMatches, 44 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12933 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4996, Invalid=23734, Unknown=0, NotChecked=0, Total=28730 [2019-09-10 02:17:09,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2019-09-10 02:17:09,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 220. [2019-09-10 02:17:09,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-09-10 02:17:09,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 242 transitions. [2019-09-10 02:17:09,898 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 242 transitions. Word has length 176 [2019-09-10 02:17:09,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:09,898 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 242 transitions. [2019-09-10 02:17:09,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-09-10 02:17:09,898 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 242 transitions. [2019-09-10 02:17:09,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 02:17:09,899 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:09,899 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 17, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:09,899 INFO L418 AbstractCegarLoop]: === Iteration 234 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:09,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:09,899 INFO L82 PathProgramCache]: Analyzing trace with hash -420421074, now seen corresponding path program 174 times [2019-09-10 02:17:09,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:09,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:09,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:17:09,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:09,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:09,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:10,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 650 proven. 159 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-10 02:17:10,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:10,607 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:10,607 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:10,607 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:10,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:10,607 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 233 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 233 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:17:10,635 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:17:10,635 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:17:10,690 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:17:10,690 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:17:10,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-10 02:17:10,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:11,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 650 proven. 159 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-10 02:17:11,990 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:12,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 650 proven. 159 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-10 02:17:12,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:12,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 87 [2019-09-10 02:17:12,646 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:12,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-09-10 02:17:12,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-09-10 02:17:12,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1388, Invalid=6094, Unknown=0, NotChecked=0, Total=7482 [2019-09-10 02:17:12,648 INFO L87 Difference]: Start difference. First operand 220 states and 242 transitions. Second operand 87 states. [2019-09-10 02:17:15,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:15,338 INFO L93 Difference]: Finished difference Result 611 states and 741 transitions. [2019-09-10 02:17:15,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-09-10 02:17:15,339 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 176 [2019-09-10 02:17:15,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:15,340 INFO L225 Difference]: With dead ends: 611 [2019-09-10 02:17:15,340 INFO L226 Difference]: Without dead ends: 549 [2019-09-10 02:17:15,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 269 SyntacticMatches, 44 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14919 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5911, Invalid=28129, Unknown=0, NotChecked=0, Total=34040 [2019-09-10 02:17:15,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2019-09-10 02:17:15,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 220. [2019-09-10 02:17:15,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-09-10 02:17:15,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 242 transitions. [2019-09-10 02:17:15,347 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 242 transitions. Word has length 176 [2019-09-10 02:17:15,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:15,347 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 242 transitions. [2019-09-10 02:17:15,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-09-10 02:17:15,347 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 242 transitions. [2019-09-10 02:17:15,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 02:17:15,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:15,348 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 16, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:15,348 INFO L418 AbstractCegarLoop]: === Iteration 235 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:15,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:15,348 INFO L82 PathProgramCache]: Analyzing trace with hash 733944591, now seen corresponding path program 175 times [2019-09-10 02:17:15,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:15,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:15,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:17:15,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:15,349 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:15,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:16,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1556 backedges. 650 proven. 146 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-10 02:17:16,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:16,043 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:16,043 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:16,043 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:16,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:16,043 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 234 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 234 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:17:16,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:16,052 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:17:16,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:16,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-10 02:17:16,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:17,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1556 backedges. 650 proven. 146 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-10 02:17:17,725 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:18,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1556 backedges. 650 proven. 146 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-10 02:17:18,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:18,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 86 [2019-09-10 02:17:18,384 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:18,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-09-10 02:17:18,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-09-10 02:17:18,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1337, Invalid=5973, Unknown=0, NotChecked=0, Total=7310 [2019-09-10 02:17:18,385 INFO L87 Difference]: Start difference. First operand 220 states and 242 transitions. Second operand 86 states.