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/loops-crafted-1/Mono5_1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 21:04:30,701 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 21:04:30,704 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 21:04:30,722 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 21:04:30,723 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 21:04:30,724 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 21:04:30,726 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 21:04:30,736 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 21:04:30,739 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 21:04:30,740 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 21:04:30,741 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 21:04:30,744 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 21:04:30,744 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 21:04:30,748 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 21:04:30,750 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 21:04:30,752 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 21:04:30,753 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 21:04:30,756 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 21:04:30,758 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 21:04:30,761 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 21:04:30,764 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 21:04:30,767 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 21:04:30,770 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 21:04:30,771 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 21:04:30,774 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 21:04:30,774 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 21:04:30,774 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 21:04:30,777 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 21:04:30,778 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 21:04:30,779 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 21:04:30,780 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 21:04:30,780 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 21:04:30,781 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 21:04:30,782 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 21:04:30,786 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 21:04:30,786 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 21:04:30,787 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 21:04:30,787 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 21:04:30,788 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 21:04:30,788 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 21:04:30,789 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 21:04:30,790 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-03 21:04:30,815 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 21:04:30,816 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 21:04:30,818 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 21:04:30,819 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 21:04:30,819 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 21:04:30,819 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 21:04:30,820 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 21:04:30,820 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 21:04:30,820 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 21:04:30,820 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 21:04:30,822 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 21:04:30,822 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 21:04:30,822 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 21:04:30,822 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 21:04:30,822 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 21:04:30,823 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 21:04:30,823 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 21:04:30,823 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 21:04:30,823 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 21:04:30,823 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 21:04:30,824 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 21:04:30,824 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 21:04:30,824 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 21:04:30,824 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 21:04:30,825 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 21:04:30,825 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 21:04:30,825 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 21:04:30,825 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 21:04:30,825 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 21:04:30,826 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 21:04:30,859 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 21:04:30,869 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 21:04:30,872 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 21:04:30,874 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 21:04:30,874 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 21:04:30,875 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono5_1.c [2019-09-03 21:04:30,936 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5ba17aa7/0ef88111778047aa8f4c1b1d8bc61e1a/FLAGb1f47eb9e [2019-09-03 21:04:31,338 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 21:04:31,339 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono5_1.c [2019-09-03 21:04:31,345 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5ba17aa7/0ef88111778047aa8f4c1b1d8bc61e1a/FLAGb1f47eb9e [2019-09-03 21:04:31,720 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5ba17aa7/0ef88111778047aa8f4c1b1d8bc61e1a [2019-09-03 21:04:31,737 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 21:04:31,739 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 21:04:31,739 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 21:04:31,740 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 21:04:31,749 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 21:04:31,750 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 09:04:31" (1/1) ... [2019-09-03 21:04:31,752 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@695cd166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:31, skipping insertion in model container [2019-09-03 21:04:31,753 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 09:04:31" (1/1) ... [2019-09-03 21:04:31,760 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 21:04:31,780 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 21:04:31,993 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 21:04:31,997 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 21:04:32,010 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 21:04:32,021 INFO L192 MainTranslator]: Completed translation [2019-09-03 21:04:32,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:32 WrapperNode [2019-09-03 21:04:32,022 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 21:04:32,022 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 21:04:32,022 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 21:04:32,023 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 21:04:32,119 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:32" (1/1) ... [2019-09-03 21:04:32,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:32" (1/1) ... [2019-09-03 21:04:32,125 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:32" (1/1) ... [2019-09-03 21:04:32,125 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:32" (1/1) ... [2019-09-03 21:04:32,131 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:32" (1/1) ... [2019-09-03 21:04:32,138 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:32" (1/1) ... [2019-09-03 21:04:32,139 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:32" (1/1) ... [2019-09-03 21:04:32,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 21:04:32,141 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 21:04:32,141 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 21:04:32,141 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 21:04:32,142 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:32" (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-03 21:04:32,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 21:04:32,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 21:04:32,187 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 21:04:32,188 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 21:04:32,188 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 21:04:32,188 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 21:04:32,188 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 21:04:32,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 21:04:32,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 21:04:32,352 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 21:04:32,352 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-03 21:04:32,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 09:04:32 BoogieIcfgContainer [2019-09-03 21:04:32,357 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 21:04:32,358 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 21:04:32,358 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 21:04:32,364 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 21:04:32,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 09:04:31" (1/3) ... [2019-09-03 21:04:32,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39fccb1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 09:04:32, skipping insertion in model container [2019-09-03 21:04:32,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:32" (2/3) ... [2019-09-03 21:04:32,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39fccb1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 09:04:32, skipping insertion in model container [2019-09-03 21:04:32,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 09:04:32" (3/3) ... [2019-09-03 21:04:32,375 INFO L109 eAbstractionObserver]: Analyzing ICFG Mono5_1.c [2019-09-03 21:04:32,396 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 21:04:32,415 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 21:04:32,451 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 21:04:32,481 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 21:04:32,481 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 21:04:32,481 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 21:04:32,482 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 21:04:32,482 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 21:04:32,482 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 21:04:32,482 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 21:04:32,483 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 21:04:32,499 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-09-03 21:04:32,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 21:04:32,508 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:32,511 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:32,513 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:32,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:32,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1713253442, now seen corresponding path program 1 times [2019-09-03 21:04:32,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:32,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:32,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:32,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:32,559 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:32,633 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-03 21:04:32,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 21:04:32,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 21:04:32,636 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 21:04:32,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 21:04:32,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 21:04:32,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 21:04:32,660 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-09-03 21:04:32,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:32,676 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-09-03 21:04:32,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 21:04:32,677 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-03 21:04:32,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:32,686 INFO L225 Difference]: With dead ends: 19 [2019-09-03 21:04:32,687 INFO L226 Difference]: Without dead ends: 13 [2019-09-03 21:04:32,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 21:04:32,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-09-03 21:04:32,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-09-03 21:04:32,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-03 21:04:32,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-09-03 21:04:32,724 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-09-03 21:04:32,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:32,724 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-09-03 21:04:32,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 21:04:32,724 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-09-03 21:04:32,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 21:04:32,725 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:32,725 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:32,726 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:32,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:32,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1703094711, now seen corresponding path program 1 times [2019-09-03 21:04:32,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:32,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:32,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:32,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:32,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:32,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:32,873 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-03 21:04:32,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 21:04:32,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 21:04:32,874 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 21:04:32,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 21:04:32,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 21:04:32,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 21:04:32,877 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 5 states. [2019-09-03 21:04:32,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:32,938 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2019-09-03 21:04:32,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 21:04:32,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-09-03 21:04:32,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:32,940 INFO L225 Difference]: With dead ends: 19 [2019-09-03 21:04:32,940 INFO L226 Difference]: Without dead ends: 16 [2019-09-03 21:04:32,941 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 21:04:32,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-03 21:04:32,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-03 21:04:32,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-03 21:04:32,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-09-03 21:04:32,946 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 10 [2019-09-03 21:04:32,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:32,946 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-09-03 21:04:32,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 21:04:32,947 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2019-09-03 21:04:32,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-03 21:04:32,947 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:32,947 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:32,948 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:32,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:32,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1264308876, now seen corresponding path program 1 times [2019-09-03 21:04:32,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:32,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:32,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:32,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:32,950 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:33,038 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-03 21:04:33,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 21:04:33,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 21:04:33,039 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 21:04:33,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 21:04:33,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 21:04:33,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 21:04:33,042 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 3 states. [2019-09-03 21:04:33,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:33,060 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2019-09-03 21:04:33,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 21:04:33,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-09-03 21:04:33,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:33,062 INFO L225 Difference]: With dead ends: 19 [2019-09-03 21:04:33,062 INFO L226 Difference]: Without dead ends: 19 [2019-09-03 21:04:33,063 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 21:04:33,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-03 21:04:33,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-09-03 21:04:33,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-03 21:04:33,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-09-03 21:04:33,067 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2019-09-03 21:04:33,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:33,067 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-09-03 21:04:33,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 21:04:33,068 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-09-03 21:04:33,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 21:04:33,068 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:33,069 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:33,069 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:33,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:33,070 INFO L82 PathProgramCache]: Analyzing trace with hash -265742635, now seen corresponding path program 1 times [2019-09-03 21:04:33,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:33,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:33,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:33,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:33,071 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:33,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:33,163 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:33,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:33,164 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:33,165 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2019-09-03 21:04:33,167 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [16], [18], [20], [26], [29], [31], [37], [38], [39], [41] [2019-09-03 21:04:33,208 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 21:04:33,208 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 21:04:33,266 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-03 21:04:33,354 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 21:04:33,357 INFO L272 AbstractInterpreter]: Visited 14 different actions 72 times. Merged at 5 different actions 28 times. Widened at 1 different actions 4 times. Performed 137 root evaluator evaluations with a maximum evaluation depth of 6. Performed 137 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 8 fixpoints after 3 different actions. Largest state had 5 variables. [2019-09-03 21:04:33,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:33,360 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 21:04:33,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:33,360 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-03 21:04:33,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:33,376 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:04:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:33,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 21:04:33,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:33,433 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:33,434 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:33,467 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:33,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:33,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-09-03 21:04:33,472 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:33,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 21:04:33,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 21:04:33,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-03 21:04:33,476 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 5 states. [2019-09-03 21:04:33,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:33,527 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-09-03 21:04:33,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 21:04:33,529 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-09-03 21:04:33,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:33,530 INFO L225 Difference]: With dead ends: 22 [2019-09-03 21:04:33,530 INFO L226 Difference]: Without dead ends: 22 [2019-09-03 21:04:33,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-03 21:04:33,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-03 21:04:33,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-09-03 21:04:33,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-03 21:04:33,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-09-03 21:04:33,538 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2019-09-03 21:04:33,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:33,538 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-09-03 21:04:33,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 21:04:33,539 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-09-03 21:04:33,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-03 21:04:33,543 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:33,543 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:33,543 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:33,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:33,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1077650900, now seen corresponding path program 2 times [2019-09-03 21:04:33,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:33,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:33,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:33,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:33,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:33,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:33,694 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:33,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:33,694 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:33,695 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:33,695 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:33,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:33,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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:33,712 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:04:33,713 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:04:33,724 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-03 21:04:33,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:33,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 21:04:33,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:33,772 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-03 21:04:33,773 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:33,860 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-03 21:04:33,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:33,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2019-09-03 21:04:33,865 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:33,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 21:04:33,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 21:04:33,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-09-03 21:04:33,867 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 9 states. [2019-09-03 21:04:34,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:34,032 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-09-03 21:04:34,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 21:04:34,033 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-09-03 21:04:34,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:34,034 INFO L225 Difference]: With dead ends: 31 [2019-09-03 21:04:34,034 INFO L226 Difference]: Without dead ends: 28 [2019-09-03 21:04:34,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-09-03 21:04:34,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-03 21:04:34,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-09-03 21:04:34,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-03 21:04:34,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-09-03 21:04:34,045 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 19 [2019-09-03 21:04:34,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:34,046 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-09-03 21:04:34,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 21:04:34,046 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-09-03 21:04:34,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-03 21:04:34,048 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:34,048 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:34,050 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:34,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:34,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1478259702, now seen corresponding path program 3 times [2019-09-03 21:04:34,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:34,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:34,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:34,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:34,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:34,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:34,217 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 21:04:34,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:34,217 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:34,217 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:34,218 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:34,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:34,218 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:34,238 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:04:34,238 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:04:34,256 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:04:34,257 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:34,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 21:04:34,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:34,316 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 21:04:34,316 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:34,380 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 21:04:34,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:34,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-09-03 21:04:34,384 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:34,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 21:04:34,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 21:04:34,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-09-03 21:04:34,385 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 7 states. [2019-09-03 21:04:34,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:34,454 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-09-03 21:04:34,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 21:04:34,455 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-09-03 21:04:34,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:34,456 INFO L225 Difference]: With dead ends: 31 [2019-09-03 21:04:34,456 INFO L226 Difference]: Without dead ends: 31 [2019-09-03 21:04:34,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-09-03 21:04:34,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-03 21:04:34,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-09-03 21:04:34,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-03 21:04:34,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-09-03 21:04:34,460 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 25 [2019-09-03 21:04:34,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:34,461 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-09-03 21:04:34,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 21:04:34,461 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-09-03 21:04:34,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 21:04:34,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:34,462 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:34,463 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:34,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:34,463 INFO L82 PathProgramCache]: Analyzing trace with hash 238113751, now seen corresponding path program 4 times [2019-09-03 21:04:34,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:34,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:34,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:34,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:34,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:34,577 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 21:04:34,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:34,577 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:34,577 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:34,577 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:34,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:34,578 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-03 21:04:34,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:34,589 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:04:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:34,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 21:04:34,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:34,632 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 21:04:34,632 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:34,724 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 21:04:34,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:34,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-09-03 21:04:34,729 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:34,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 21:04:34,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 21:04:34,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-09-03 21:04:34,731 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 8 states. [2019-09-03 21:04:34,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:34,845 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-09-03 21:04:34,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 21:04:34,847 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-09-03 21:04:34,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:34,848 INFO L225 Difference]: With dead ends: 34 [2019-09-03 21:04:34,848 INFO L226 Difference]: Without dead ends: 34 [2019-09-03 21:04:34,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-09-03 21:04:34,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-03 21:04:34,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-09-03 21:04:34,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-03 21:04:34,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2019-09-03 21:04:34,855 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 28 [2019-09-03 21:04:34,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:34,859 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2019-09-03 21:04:34,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 21:04:34,859 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2019-09-03 21:04:34,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-03 21:04:34,860 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:34,861 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:34,861 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:34,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:34,862 INFO L82 PathProgramCache]: Analyzing trace with hash 358767702, now seen corresponding path program 5 times [2019-09-03 21:04:34,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:34,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:34,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:34,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:34,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:34,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:35,031 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 28 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 21:04:35,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:35,032 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:35,032 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:35,032 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:35,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:35,033 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) [2019-09-03 21:04:35,048 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:04:35,048 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:38,077 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 21:04:38,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:38,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 21:04:38,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:38,175 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 21:04:38,175 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:38,285 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 21:04:38,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:38,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2019-09-03 21:04:38,291 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:38,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 21:04:38,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 21:04:38,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-09-03 21:04:38,295 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 13 states. [2019-09-03 21:04:38,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:38,606 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-09-03 21:04:38,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 21:04:38,607 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2019-09-03 21:04:38,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:38,608 INFO L225 Difference]: With dead ends: 43 [2019-09-03 21:04:38,608 INFO L226 Difference]: Without dead ends: 40 [2019-09-03 21:04:38,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2019-09-03 21:04:38,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-03 21:04:38,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-09-03 21:04:38,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-03 21:04:38,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-09-03 21:04:38,613 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 31 [2019-09-03 21:04:38,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:38,614 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-09-03 21:04:38,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 21:04:38,614 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-09-03 21:04:38,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-03 21:04:38,615 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:38,615 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:38,615 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:38,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:38,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1444253772, now seen corresponding path program 6 times [2019-09-03 21:04:38,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:38,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:38,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:38,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:38,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:38,760 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 53 proven. 57 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-03 21:04:38,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:38,761 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:38,761 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:38,761 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:38,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:38,761 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) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:38,776 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:04:38,776 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:04:38,795 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:04:38,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:38,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 21:04:38,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:38,827 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 53 proven. 57 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-03 21:04:38,827 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:38,996 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 53 proven. 57 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-03 21:04:39,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:39,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-09-03 21:04:39,001 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:39,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 21:04:39,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 21:04:39,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-09-03 21:04:39,003 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 10 states. [2019-09-03 21:04:39,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:39,170 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-09-03 21:04:39,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 21:04:39,172 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2019-09-03 21:04:39,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:39,173 INFO L225 Difference]: With dead ends: 43 [2019-09-03 21:04:39,173 INFO L226 Difference]: Without dead ends: 43 [2019-09-03 21:04:39,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-09-03 21:04:39,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-03 21:04:39,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-09-03 21:04:39,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-03 21:04:39,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-09-03 21:04:39,178 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 37 [2019-09-03 21:04:39,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:39,179 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-09-03 21:04:39,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 21:04:39,179 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-09-03 21:04:39,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-03 21:04:39,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:39,180 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:39,180 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:39,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:39,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1512995307, now seen corresponding path program 7 times [2019-09-03 21:04:39,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:39,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:39,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:39,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:39,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:39,344 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 61 proven. 77 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-03 21:04:39,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:39,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:39,346 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:39,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:39,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:39,346 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) [2019-09-03 21:04:39,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:39,362 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:39,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-03 21:04:39,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:39,426 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 61 proven. 77 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-03 21:04:39,426 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:39,619 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 61 proven. 77 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-03 21:04:39,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:39,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-09-03 21:04:39,623 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:39,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 21:04:39,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 21:04:39,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-09-03 21:04:39,625 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 11 states. [2019-09-03 21:04:39,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:39,821 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2019-09-03 21:04:39,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 21:04:39,822 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 40 [2019-09-03 21:04:39,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:39,823 INFO L225 Difference]: With dead ends: 46 [2019-09-03 21:04:39,823 INFO L226 Difference]: Without dead ends: 46 [2019-09-03 21:04:39,823 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-09-03 21:04:39,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-03 21:04:39,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-09-03 21:04:39,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-03 21:04:39,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-09-03 21:04:39,828 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 40 [2019-09-03 21:04:39,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:39,828 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-09-03 21:04:39,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 21:04:39,829 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-09-03 21:04:39,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-03 21:04:39,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:39,830 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:39,830 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:39,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:39,831 INFO L82 PathProgramCache]: Analyzing trace with hash -692664300, now seen corresponding path program 8 times [2019-09-03 21:04:39,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:39,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:39,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:39,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:39,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:39,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:39,971 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 69 proven. 100 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-03 21:04:39,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:39,972 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:39,972 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:39,972 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:39,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:39,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 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-03 21:04:39,989 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:04:39,989 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:04:41,572 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-03 21:04:41,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:41,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 21:04:41,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:41,673 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-03 21:04:41,674 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:41,818 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-03 21:04:41,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:41,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 23 [2019-09-03 21:04:41,825 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:41,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 21:04:41,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 21:04:41,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2019-09-03 21:04:41,826 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 17 states. [2019-09-03 21:04:42,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:42,441 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2019-09-03 21:04:42,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 21:04:42,441 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 43 [2019-09-03 21:04:42,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:42,442 INFO L225 Difference]: With dead ends: 55 [2019-09-03 21:04:42,442 INFO L226 Difference]: Without dead ends: 52 [2019-09-03 21:04:42,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=893, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 21:04:42,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-03 21:04:42,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-09-03 21:04:42,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-03 21:04:42,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2019-09-03 21:04:42,447 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 43 [2019-09-03 21:04:42,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:42,448 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2019-09-03 21:04:42,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 21:04:42,448 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2019-09-03 21:04:42,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-03 21:04:42,449 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:42,449 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 9, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:42,449 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:42,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:42,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1913887926, now seen corresponding path program 9 times [2019-09-03 21:04:42,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:42,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:42,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:42,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:42,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:42,612 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 106 proven. 126 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-03 21:04:42,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:42,613 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:42,613 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:42,613 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:42,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:42,613 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-03 21:04:42,623 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:04:42,623 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:04:42,648 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:04:42,648 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:42,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 21:04:42,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:42,689 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 106 proven. 126 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-03 21:04:42,689 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:42,977 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 106 proven. 126 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-03 21:04:42,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:42,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-09-03 21:04:42,981 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:42,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 21:04:42,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 21:04:42,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-09-03 21:04:42,983 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 13 states. [2019-09-03 21:04:43,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:43,274 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2019-09-03 21:04:43,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 21:04:43,275 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 49 [2019-09-03 21:04:43,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:43,276 INFO L225 Difference]: With dead ends: 55 [2019-09-03 21:04:43,276 INFO L226 Difference]: Without dead ends: 55 [2019-09-03 21:04:43,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 87 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-09-03 21:04:43,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-03 21:04:43,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2019-09-03 21:04:43,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-03 21:04:43,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2019-09-03 21:04:43,281 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 49 [2019-09-03 21:04:43,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:43,282 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2019-09-03 21:04:43,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 21:04:43,282 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2019-09-03 21:04:43,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-03 21:04:43,283 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:43,283 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:43,283 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:43,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:43,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1840195991, now seen corresponding path program 10 times [2019-09-03 21:04:43,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:43,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:43,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:43,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:43,285 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:43,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:43,470 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 117 proven. 155 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-03 21:04:43,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:43,470 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:43,471 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:43,471 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:43,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:43,471 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) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:43,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:43,483 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:04:43,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:43,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 21:04:43,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:43,552 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 117 proven. 155 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-03 21:04:43,552 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:44,068 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 117 proven. 155 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-03 21:04:44,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:44,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-09-03 21:04:44,072 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:44,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 21:04:44,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 21:04:44,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2019-09-03 21:04:44,075 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 14 states. [2019-09-03 21:04:44,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:44,454 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2019-09-03 21:04:44,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 21:04:44,454 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 52 [2019-09-03 21:04:44,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:44,456 INFO L225 Difference]: With dead ends: 58 [2019-09-03 21:04:44,456 INFO L226 Difference]: Without dead ends: 58 [2019-09-03 21:04:44,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 92 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2019-09-03 21:04:44,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-03 21:04:44,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-09-03 21:04:44,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-03 21:04:44,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2019-09-03 21:04:44,462 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 52 [2019-09-03 21:04:44,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:44,462 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2019-09-03 21:04:44,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 21:04:44,463 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2019-09-03 21:04:44,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-03 21:04:44,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:44,464 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 11, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:44,464 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:44,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:44,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1212048662, now seen corresponding path program 11 times [2019-09-03 21:04:44,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:44,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:44,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:44,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:44,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:44,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:44,723 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 128 proven. 187 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-03 21:04:44,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:44,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:44,723 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:44,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:44,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:44,723 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) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:44,734 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:04:44,735 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:04:44,774 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-03 21:04:44,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:44,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 21:04:44,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:44,880 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 143 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-09-03 21:04:44,881 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:45,089 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 143 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-09-03 21:04:45,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:45,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 28 [2019-09-03 21:04:45,094 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:45,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 21:04:45,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 21:04:45,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=665, Unknown=0, NotChecked=0, Total=756 [2019-09-03 21:04:45,096 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 21 states. [2019-09-03 21:04:45,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:45,988 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2019-09-03 21:04:45,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 21:04:45,989 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 55 [2019-09-03 21:04:45,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:45,990 INFO L225 Difference]: With dead ends: 67 [2019-09-03 21:04:45,991 INFO L226 Difference]: Without dead ends: 64 [2019-09-03 21:04:45,992 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=227, Invalid=1413, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 21:04:45,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-03 21:04:45,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-09-03 21:04:45,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-03 21:04:45,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2019-09-03 21:04:45,997 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 55 [2019-09-03 21:04:45,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:45,998 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2019-09-03 21:04:45,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 21:04:45,998 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2019-09-03 21:04:45,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-03 21:04:45,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:45,999 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 12, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:45,999 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:46,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:46,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1882497524, now seen corresponding path program 12 times [2019-09-03 21:04:46,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:46,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:46,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:46,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:46,001 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:46,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:46,232 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 177 proven. 222 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-03 21:04:46,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:46,233 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:46,233 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:46,233 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:46,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:46,233 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) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:46,243 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:04:46,243 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:04:46,267 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:04:46,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:46,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 21:04:46,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:46,296 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 177 proven. 222 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-03 21:04:46,297 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:46,795 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 177 proven. 222 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (13)] Exception during sending of exit command (exit): Stream closed [2019-09-03 21:04:46,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:46,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-09-03 21:04:46,804 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:46,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 21:04:46,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 21:04:46,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2019-09-03 21:04:46,809 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 16 states. [2019-09-03 21:04:47,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:47,248 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2019-09-03 21:04:47,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 21:04:47,249 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 61 [2019-09-03 21:04:47,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:47,251 INFO L225 Difference]: With dead ends: 67 [2019-09-03 21:04:47,251 INFO L226 Difference]: Without dead ends: 67 [2019-09-03 21:04:47,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 108 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2019-09-03 21:04:47,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-03 21:04:47,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-09-03 21:04:47,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-03 21:04:47,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2019-09-03 21:04:47,256 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 61 [2019-09-03 21:04:47,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:47,256 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2019-09-03 21:04:47,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 21:04:47,256 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2019-09-03 21:04:47,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-03 21:04:47,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:47,257 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 13, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:47,258 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:47,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:47,258 INFO L82 PathProgramCache]: Analyzing trace with hash 604431701, now seen corresponding path program 13 times [2019-09-03 21:04:47,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:47,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:47,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:47,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:47,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:47,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:47,477 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 191 proven. 260 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-03 21:04:47,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:47,478 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:47,478 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:47,478 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:47,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:47,478 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-03 21:04:47,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:47,489 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:04:47,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:47,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-03 21:04:47,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:47,556 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 191 proven. 260 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-03 21:04:47,557 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:47,993 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 191 proven. 260 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-03 21:04:47,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:47,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-09-03 21:04:47,996 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:47,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 21:04:47,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 21:04:47,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2019-09-03 21:04:47,998 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 17 states. [2019-09-03 21:04:48,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:48,427 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2019-09-03 21:04:48,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 21:04:48,428 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 64 [2019-09-03 21:04:48,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:48,429 INFO L225 Difference]: With dead ends: 70 [2019-09-03 21:04:48,429 INFO L226 Difference]: Without dead ends: 70 [2019-09-03 21:04:48,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 113 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2019-09-03 21:04:48,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-03 21:04:48,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-09-03 21:04:48,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-03 21:04:48,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2019-09-03 21:04:48,442 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 64 [2019-09-03 21:04:48,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:48,442 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2019-09-03 21:04:48,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 21:04:48,442 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2019-09-03 21:04:48,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-03 21:04:48,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:48,443 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 14, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:48,444 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:48,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:48,446 INFO L82 PathProgramCache]: Analyzing trace with hash 630577748, now seen corresponding path program 14 times [2019-09-03 21:04:48,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:48,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:48,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:48,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:48,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:48,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:48,708 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 205 proven. 301 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-03 21:04:48,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:48,708 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:48,708 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:48,709 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:48,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:48,709 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-03 21:04:48,724 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:04:48,724 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:04:49,039 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-03 21:04:49,039 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:49,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 21:04:49,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:49,177 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-09-03 21:04:49,177 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:49,419 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (15)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 21:04:49,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:49,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 10] total 33 [2019-09-03 21:04:49,431 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:49,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 21:04:49,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 21:04:49,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=941, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 21:04:49,434 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 25 states. [2019-09-03 21:04:50,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:50,667 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2019-09-03 21:04:50,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 21:04:50,667 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 67 [2019-09-03 21:04:50,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:50,668 INFO L225 Difference]: With dead ends: 79 [2019-09-03 21:04:50,669 INFO L226 Difference]: Without dead ends: 76 [2019-09-03 21:04:50,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 119 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=299, Invalid=2053, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 21:04:50,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-03 21:04:50,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-09-03 21:04:50,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-03 21:04:50,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2019-09-03 21:04:50,675 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 67 [2019-09-03 21:04:50,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:50,675 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2019-09-03 21:04:50,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 21:04:50,675 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2019-09-03 21:04:50,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-03 21:04:50,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:50,676 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 15, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:50,676 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:50,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:50,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1267214986, now seen corresponding path program 15 times [2019-09-03 21:04:50,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:50,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:50,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:50,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:50,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:50,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:50,935 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 266 proven. 345 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 21:04:50,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:50,935 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:50,936 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:50,936 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:50,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:50,936 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) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:50,945 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:04:50,946 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:04:50,965 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:04:50,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:50,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-03 21:04:50,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:51,112 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 41 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:51,113 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:52,050 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 41 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:52,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:52,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 23, 23] total 45 [2019-09-03 21:04:52,054 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:52,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 21:04:52,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 21:04:52,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=565, Invalid=1415, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 21:04:52,055 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 24 states. [2019-09-03 21:04:53,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:53,110 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2019-09-03 21:04:53,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 21:04:53,111 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 73 [2019-09-03 21:04:53,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:53,112 INFO L225 Difference]: With dead ends: 94 [2019-09-03 21:04:53,112 INFO L226 Difference]: Without dead ends: 94 [2019-09-03 21:04:53,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 119 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=565, Invalid=1415, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 21:04:53,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-03 21:04:53,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-09-03 21:04:53,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-09-03 21:04:53,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2019-09-03 21:04:53,117 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 73 [2019-09-03 21:04:53,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:53,118 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2019-09-03 21:04:53,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 21:04:53,118 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2019-09-03 21:04:53,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-03 21:04:53,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:53,119 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 21, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:53,119 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:53,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:53,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1688565398, now seen corresponding path program 16 times [2019-09-03 21:04:53,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:53,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:53,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:53,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:53,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:53,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:53,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 368 proven. 672 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 21:04:53,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:53,536 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:53,536 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:53,536 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:53,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:53,536 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-03 21:04:53,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:53,547 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:04:53,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:53,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-03 21:04:53,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:53,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 368 proven. 672 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 21:04:53,645 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:54,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 368 proven. 672 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 21:04:54,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:54,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-09-03 21:04:54,838 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:54,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 21:04:54,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 21:04:54,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 21:04:54,840 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand 25 states. [2019-09-03 21:04:55,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:55,978 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2019-09-03 21:04:55,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 21:04:55,979 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 91 [2019-09-03 21:04:55,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:55,980 INFO L225 Difference]: With dead ends: 97 [2019-09-03 21:04:55,980 INFO L226 Difference]: Without dead ends: 97 [2019-09-03 21:04:55,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 159 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 21:04:55,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-09-03 21:04:55,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2019-09-03 21:04:55,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-03 21:04:55,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2019-09-03 21:04:55,985 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 91 [2019-09-03 21:04:55,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:55,985 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2019-09-03 21:04:55,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 21:04:55,986 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2019-09-03 21:04:55,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-03 21:04:55,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:55,987 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 22, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:55,987 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:55,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:55,987 INFO L82 PathProgramCache]: Analyzing trace with hash -174826953, now seen corresponding path program 17 times [2019-09-03 21:04:55,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:55,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:55,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:55,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:55,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:56,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 385 proven. 737 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 21:04:56,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:56,560 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:56,561 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:56,561 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:56,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:56,561 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) [2019-09-03 21:04:56,588 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:04:56,589 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:58,754 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-03 21:04:58,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:58,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 21:04:58,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:58,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2019-09-03 21:04:58,992 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:59,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2019-09-03 21:04:59,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:59,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 11, 11] total 43 [2019-09-03 21:04:59,468 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:59,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-03 21:04:59,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-03 21:04:59,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1650, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 21:04:59,470 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 34 states. [2019-09-03 21:05:01,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:05:01,624 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2019-09-03 21:05:01,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-03 21:05:01,624 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 94 [2019-09-03 21:05:01,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:05:01,625 INFO L225 Difference]: With dead ends: 106 [2019-09-03 21:05:01,625 INFO L226 Difference]: Without dead ends: 103 [2019-09-03 21:05:01,627 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 171 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=459, Invalid=3963, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 21:05:01,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-09-03 21:05:01,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-09-03 21:05:01,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-09-03 21:05:01,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2019-09-03 21:05:01,630 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 94 [2019-09-03 21:05:01,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:05:01,631 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2019-09-03 21:05:01,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-03 21:05:01,631 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2019-09-03 21:05:01,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-03 21:05:01,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:05:01,632 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 23, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:05:01,632 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:05:01,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:05:01,632 INFO L82 PathProgramCache]: Analyzing trace with hash 113447893, now seen corresponding path program 18 times [2019-09-03 21:05:01,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:05:01,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:01,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:05:01,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:01,634 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:05:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:02,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 473 proven. 805 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-03 21:05:02,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:02,212 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:05:02,213 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:05:02,213 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:05:02,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:02,213 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) [2019-09-03 21:05:02,240 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:05:02,241 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:05:02,273 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:05:02,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:05:02,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-03 21:05:02,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:05:02,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 473 proven. 805 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-03 21:05:02,357 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:05:03,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 473 proven. 805 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-03 21:05:03,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:05:03,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-09-03 21:05:03,717 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:05:03,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 21:05:03,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 21:05:03,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=723, Invalid=1827, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 21:05:03,719 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 27 states. [2019-09-03 21:05:05,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:05:05,043 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2019-09-03 21:05:05,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 21:05:05,044 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 100 [2019-09-03 21:05:05,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:05:05,045 INFO L225 Difference]: With dead ends: 106 [2019-09-03 21:05:05,045 INFO L226 Difference]: Without dead ends: 106 [2019-09-03 21:05:05,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 175 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=723, Invalid=1827, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 21:05:05,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-09-03 21:05:05,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-09-03 21:05:05,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-09-03 21:05:05,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2019-09-03 21:05:05,050 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 100 [2019-09-03 21:05:05,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:05:05,051 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2019-09-03 21:05:05,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 21:05:05,051 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2019-09-03 21:05:05,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-03 21:05:05,051 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:05:05,052 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 24, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:05:05,052 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:05:05,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:05:05,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1662235988, now seen corresponding path program 19 times [2019-09-03 21:05:05,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:05:05,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:05,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:05:05,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:05,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:05:05,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:05,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 493 proven. 876 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-03 21:05:05,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:05,805 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:05:05,805 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:05:05,806 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:05:05,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:05,806 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-03 21:05:05,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:05:05,826 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:05:05,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:05,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-03 21:05:05,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:05:05,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 493 proven. 876 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-03 21:05:05,928 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:05:07,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 493 proven. 876 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (20)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 21:05:07,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:05:07,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-09-03 21:05:07,392 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:05:07,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 21:05:07,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 21:05:07,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 21:05:07,394 INFO L87 Difference]: Start difference. First operand 105 states and 113 transitions. Second operand 28 states. [2019-09-03 21:05:08,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:05:08,763 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2019-09-03 21:05:08,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 21:05:08,765 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 103 [2019-09-03 21:05:08,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:05:08,766 INFO L225 Difference]: With dead ends: 109 [2019-09-03 21:05:08,766 INFO L226 Difference]: Without dead ends: 109 [2019-09-03 21:05:08,768 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 180 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 21:05:08,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-09-03 21:05:08,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2019-09-03 21:05:08,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-09-03 21:05:08,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2019-09-03 21:05:08,771 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 103 [2019-09-03 21:05:08,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:05:08,771 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2019-09-03 21:05:08,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 21:05:08,772 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2019-09-03 21:05:08,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-03 21:05:08,772 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:05:08,772 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 25, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:05:08,773 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:05:08,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:05:08,773 INFO L82 PathProgramCache]: Analyzing trace with hash 774713205, now seen corresponding path program 20 times [2019-09-03 21:05:08,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:05:08,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:08,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:05:08,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:08,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:05:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:09,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 513 proven. 950 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-03 21:05:09,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:09,311 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:05:09,311 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:05:09,311 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:05:09,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:09,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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:05:09,327 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:05:09,327 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:05:48,095 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-03 21:05:48,095 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:05:49,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 21:05:49,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:05:49,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2019-09-03 21:05:49,391 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:05:49,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (21)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 21:05:49,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:05:49,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 12, 12] total 48 [2019-09-03 21:05:49,848 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:05:49,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-03 21:05:49,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-03 21:05:49,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2072, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 21:05:49,850 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 38 states. [2019-09-03 21:05:53,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:05:53,016 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2019-09-03 21:05:53,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-03 21:05:53,017 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 106 [2019-09-03 21:05:53,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:05:53,018 INFO L225 Difference]: With dead ends: 118 [2019-09-03 21:05:53,018 INFO L226 Difference]: Without dead ends: 115 [2019-09-03 21:05:53,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 193 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=552, Invalid=4998, Unknown=0, NotChecked=0, Total=5550 [2019-09-03 21:05:53,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-09-03 21:05:53,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2019-09-03 21:05:53,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-09-03 21:05:53,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2019-09-03 21:05:53,024 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 106 [2019-09-03 21:05:53,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:05:53,024 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2019-09-03 21:05:53,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-03 21:05:53,024 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2019-09-03 21:05:53,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-03 21:05:53,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:05:53,025 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 26, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:05:53,025 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:05:53,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:05:53,026 INFO L82 PathProgramCache]: Analyzing trace with hash 345637975, now seen corresponding path program 21 times [2019-09-03 21:05:53,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:05:53,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:53,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:05:53,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:53,027 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:05:53,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:53,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 613 proven. 1027 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-03 21:05:53,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:53,573 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:05:53,573 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:05:53,574 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:05:53,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:53,574 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-03 21:05:53,584 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:05:53,584 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:05:53,614 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:05:53,615 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:05:53,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-03 21:05:53,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:05:53,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 613 proven. 1027 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-03 21:05:53,677 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:05:55,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 613 proven. 1027 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-03 21:05:55,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:05:55,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-09-03 21:05:55,198 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:05:55,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 21:05:55,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 21:05:55,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=894, Invalid=2298, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 21:05:55,200 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand 30 states. [2019-09-03 21:05:56,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:05:56,900 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2019-09-03 21:05:56,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 21:05:56,900 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 112 [2019-09-03 21:05:56,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:05:56,901 INFO L225 Difference]: With dead ends: 118 [2019-09-03 21:05:56,902 INFO L226 Difference]: Without dead ends: 118 [2019-09-03 21:05:56,904 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 196 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=894, Invalid=2298, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 21:05:56,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-03 21:05:56,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-09-03 21:05:56,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-09-03 21:05:56,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 126 transitions. [2019-09-03 21:05:56,907 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 126 transitions. Word has length 112 [2019-09-03 21:05:56,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:05:56,907 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 126 transitions. [2019-09-03 21:05:56,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 21:05:56,908 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2019-09-03 21:05:56,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-03 21:05:56,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:05:56,908 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 27, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:05:56,909 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:05:56,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:05:56,909 INFO L82 PathProgramCache]: Analyzing trace with hash 855727958, now seen corresponding path program 22 times [2019-09-03 21:05:56,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:05:56,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:56,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:05:56,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:56,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:05:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:57,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 636 proven. 1107 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-03 21:05:57,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:57,458 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:05:57,458 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:05:57,458 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:05:57,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:57,458 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) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:05:57,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:05:57,469 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:05:57,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:57,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-03 21:05:57,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:05:57,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 636 proven. 1107 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-03 21:05:57,573 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:05:59,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 636 proven. 1107 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-03 21:05:59,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:05:59,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-09-03 21:05:59,187 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:05:59,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 21:05:59,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 21:05:59,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=955, Invalid=2467, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 21:05:59,189 INFO L87 Difference]: Start difference. First operand 117 states and 126 transitions. Second operand 31 states. [2019-09-03 21:06:00,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:06:00,931 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2019-09-03 21:06:00,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-03 21:06:00,932 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 115 [2019-09-03 21:06:00,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:06:00,933 INFO L225 Difference]: With dead ends: 121 [2019-09-03 21:06:00,933 INFO L226 Difference]: Without dead ends: 121 [2019-09-03 21:06:00,935 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 201 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=955, Invalid=2467, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 21:06:00,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-09-03 21:06:00,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2019-09-03 21:06:00,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-03 21:06:00,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2019-09-03 21:06:00,938 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 115 [2019-09-03 21:06:00,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:06:00,939 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2019-09-03 21:06:00,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 21:06:00,939 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2019-09-03 21:06:00,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-03 21:06:00,940 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:06:00,940 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 28, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:06:00,940 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:06:00,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:06:00,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1352118263, now seen corresponding path program 23 times [2019-09-03 21:06:00,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:06:00,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:00,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:06:00,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:00,941 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:06:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:06:01,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 659 proven. 1190 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-03 21:06:01,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:01,538 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:06:01,538 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:06:01,539 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:06:01,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:01,539 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) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:06:01,550 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:06:01,550 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:06:01,743 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-03 21:06:01,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:06:01,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 21:06:01,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:06:02,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2019-09-03 21:06:02,070 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:06:02,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2019-09-03 21:06:02,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:06:02,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 13, 13] total 53 [2019-09-03 21:06:02,597 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:06:02,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-03 21:06:02,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-03 21:06:02,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=2542, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 21:06:02,599 INFO L87 Difference]: Start difference. First operand 120 states and 129 transitions. Second operand 42 states. [2019-09-03 21:06:06,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:06:06,430 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2019-09-03 21:06:06,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-03 21:06:06,430 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 118 [2019-09-03 21:06:06,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:06:06,432 INFO L225 Difference]: With dead ends: 130 [2019-09-03 21:06:06,432 INFO L226 Difference]: Without dead ends: 127 [2019-09-03 21:06:06,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 215 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=653, Invalid=6153, Unknown=0, NotChecked=0, Total=6806 [2019-09-03 21:06:06,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-09-03 21:06:06,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2019-09-03 21:06:06,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-09-03 21:06:06,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2019-09-03 21:06:06,437 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 118 [2019-09-03 21:06:06,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:06:06,437 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2019-09-03 21:06:06,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-03 21:06:06,437 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2019-09-03 21:06:06,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-03 21:06:06,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:06:06,438 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 29, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:06:06,438 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:06:06,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:06:06,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1971547371, now seen corresponding path program 24 times [2019-09-03 21:06:06,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:06:06,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:06,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:06:06,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:06,440 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:06:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:06:07,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 771 proven. 1276 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-03 21:06:07,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:07,076 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:06:07,076 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:06:07,076 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:06:07,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:07,076 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-03 21:06:07,087 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:06:07,087 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:06:07,121 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:06:07,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:06:07,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-03 21:06:07,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:06:07,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 771 proven. 1276 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-03 21:06:07,179 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:06:09,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 771 proven. 1276 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-03 21:06:09,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:06:09,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-09-03 21:06:09,091 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:06:09,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 21:06:09,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 21:06:09,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=2823, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 21:06:09,092 INFO L87 Difference]: Start difference. First operand 126 states and 136 transitions. Second operand 33 states. [2019-09-03 21:06:11,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:06:11,086 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2019-09-03 21:06:11,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-03 21:06:11,087 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 124 [2019-09-03 21:06:11,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:06:11,088 INFO L225 Difference]: With dead ends: 130 [2019-09-03 21:06:11,088 INFO L226 Difference]: Without dead ends: 130 [2019-09-03 21:06:11,089 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 217 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1083, Invalid=2823, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 21:06:11,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-09-03 21:06:11,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2019-09-03 21:06:11,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-09-03 21:06:11,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2019-09-03 21:06:11,093 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 124 [2019-09-03 21:06:11,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:06:11,093 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2019-09-03 21:06:11,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 21:06:11,093 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2019-09-03 21:06:11,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-03 21:06:11,094 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:06:11,094 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 30, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:06:11,095 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:06:11,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:06:11,095 INFO L82 PathProgramCache]: Analyzing trace with hash -349149292, now seen corresponding path program 25 times [2019-09-03 21:06:11,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:06:11,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:11,096 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:06:11,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:11,096 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:06:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:06:11,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 797 proven. 1365 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-03 21:06:11,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:11,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:06:11,755 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:06:11,755 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:06:11,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:11,756 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-03 21:06:11,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:06:11,766 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:06:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:06:11,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-03 21:06:11,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:06:11,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 797 proven. 1365 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-03 21:06:11,856 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:06:13,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 797 proven. 1365 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-03 21:06:13,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:06:13,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-09-03 21:06:13,823 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:06:13,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-03 21:06:13,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-03 21:06:13,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1150, Invalid=3010, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 21:06:13,824 INFO L87 Difference]: Start difference. First operand 129 states and 139 transitions. Second operand 34 states. [2019-09-03 21:06:15,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:06:15,974 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2019-09-03 21:06:15,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 21:06:15,975 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 127 [2019-09-03 21:06:15,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:06:15,976 INFO L225 Difference]: With dead ends: 133 [2019-09-03 21:06:15,976 INFO L226 Difference]: Without dead ends: 133 [2019-09-03 21:06:15,977 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 222 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1150, Invalid=3010, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 21:06:15,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-03 21:06:15,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2019-09-03 21:06:15,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-09-03 21:06:15,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 142 transitions. [2019-09-03 21:06:15,980 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 142 transitions. Word has length 127 [2019-09-03 21:06:15,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:06:15,981 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 142 transitions. [2019-09-03 21:06:15,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-03 21:06:15,981 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2019-09-03 21:06:15,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-03 21:06:15,982 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:06:15,982 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 31, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:06:15,982 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:06:15,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:06:15,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1245040309, now seen corresponding path program 26 times [2019-09-03 21:06:15,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:06:15,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:15,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:06:15,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:15,983 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:06:16,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:06:16,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 823 proven. 1457 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-03 21:06:16,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:16,706 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:06:16,706 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:06:16,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:06:16,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:16,707 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) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:06:16,721 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:06:16,722 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:07:39,792 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-03 21:07:39,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:07:40,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 21:07:40,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:07:40,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 923 refuted. 0 times theorem prover too weak. 1457 trivial. 0 not checked. [2019-09-03 21:07:40,478 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:07:41,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 923 refuted. 0 times theorem prover too weak. 1457 trivial. 0 not checked. [2019-09-03 21:07:41,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:07:41,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 14, 14] total 58 [2019-09-03 21:07:41,107 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:07:41,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-03 21:07:41,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-03 21:07:41,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=3060, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 21:07:41,108 INFO L87 Difference]: Start difference. First operand 132 states and 142 transitions. Second operand 46 states. [2019-09-03 21:07:45,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:07:45,842 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2019-09-03 21:07:45,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-03 21:07:45,842 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 130 [2019-09-03 21:07:45,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:07:45,843 INFO L225 Difference]: With dead ends: 142 [2019-09-03 21:07:45,843 INFO L226 Difference]: Without dead ends: 139 [2019-09-03 21:07:45,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 237 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=762, Invalid=7428, Unknown=0, NotChecked=0, Total=8190 [2019-09-03 21:07:45,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-09-03 21:07:45,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2019-09-03 21:07:45,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-09-03 21:07:45,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2019-09-03 21:07:45,849 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 130 [2019-09-03 21:07:45,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:07:45,849 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2019-09-03 21:07:45,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-03 21:07:45,849 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2019-09-03 21:07:45,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-03 21:07:45,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:07:45,850 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 32, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:07:45,850 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:07:45,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:07:45,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1081887255, now seen corresponding path program 27 times [2019-09-03 21:07:45,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:07:45,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:45,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:07:45,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:45,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:07:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:07:46,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 947 proven. 1552 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-03 21:07:46,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:46,581 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:07:46,581 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:07:46,582 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:07:46,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:46,582 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) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:07:46,601 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:07:46,601 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:07:46,636 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:07:46,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:07:46,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 85 conjunts are in the unsatisfiable core [2019-09-03 21:07:46,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:07:47,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 83 proven. 2542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:07:47,006 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:07:50,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 83 proven. 2542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:07:50,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:07:50,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 44, 44] total 87 [2019-09-03 21:07:50,805 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:07:50,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-03 21:07:50,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-03 21:07:50,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2010, Invalid=5472, Unknown=0, NotChecked=0, Total=7482 [2019-09-03 21:07:50,806 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand 45 states. [2019-09-03 21:07:54,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:07:54,609 INFO L93 Difference]: Finished difference Result 169 states and 180 transitions. [2019-09-03 21:07:54,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-03 21:07:54,610 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 136 [2019-09-03 21:07:54,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:07:54,611 INFO L225 Difference]: With dead ends: 169 [2019-09-03 21:07:54,612 INFO L226 Difference]: Without dead ends: 169 [2019-09-03 21:07:54,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 220 SyntacticMatches, 3 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=2010, Invalid=5472, Unknown=0, NotChecked=0, Total=7482 [2019-09-03 21:07:54,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-03 21:07:54,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 168. [2019-09-03 21:07:54,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-09-03 21:07:54,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 179 transitions. [2019-09-03 21:07:54,617 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 179 transitions. Word has length 136 [2019-09-03 21:07:54,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:07:54,618 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 179 transitions. [2019-09-03 21:07:54,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-03 21:07:54,618 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 179 transitions. [2019-09-03 21:07:54,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-03 21:07:54,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:07:54,619 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 42, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:07:54,619 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:07:54,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:07:54,620 INFO L82 PathProgramCache]: Analyzing trace with hash 163058743, now seen corresponding path program 28 times [2019-09-03 21:07:54,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:07:54,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:54,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:07:54,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:54,621 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:07:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:07:55,886 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 1237 proven. 2667 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-03 21:07:55,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:55,886 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:07:55,886 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:07:55,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:07:55,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:55,886 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-03 21:07:55,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:07:55,897 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:07:55,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:07:55,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 87 conjunts are in the unsatisfiable core [2019-09-03 21:07:55,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:07:56,023 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 1237 proven. 2667 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-03 21:07:56,023 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:07:59,925 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 1237 proven. 2667 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-03 21:07:59,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:07:59,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-09-03 21:07:59,928 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:07:59,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-03 21:07:59,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-03 21:07:59,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2110, Invalid=5722, Unknown=0, NotChecked=0, Total=7832 [2019-09-03 21:07:59,930 INFO L87 Difference]: Start difference. First operand 168 states and 179 transitions. Second operand 46 states. [2019-09-03 21:08:04,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:08:04,151 INFO L93 Difference]: Finished difference Result 172 states and 183 transitions. [2019-09-03 21:08:04,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-03 21:08:04,151 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 166 [2019-09-03 21:08:04,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:08:04,153 INFO L225 Difference]: With dead ends: 172 [2019-09-03 21:08:04,153 INFO L226 Difference]: Without dead ends: 172 [2019-09-03 21:08:04,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 288 SyntacticMatches, 3 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=2110, Invalid=5722, Unknown=0, NotChecked=0, Total=7832 [2019-09-03 21:08:04,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-09-03 21:08:04,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2019-09-03 21:08:04,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-09-03 21:08:04,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 182 transitions. [2019-09-03 21:08:04,157 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 182 transitions. Word has length 166 [2019-09-03 21:08:04,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:08:04,157 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 182 transitions. [2019-09-03 21:08:04,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-03 21:08:04,158 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 182 transitions. [2019-09-03 21:08:04,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-03 21:08:04,158 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:08:04,158 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 43, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:08:04,159 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:08:04,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:08:04,159 INFO L82 PathProgramCache]: Analyzing trace with hash -975644170, now seen corresponding path program 29 times [2019-09-03 21:08:04,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:08:04,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:08:04,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:08:04,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:08:04,160 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:08:04,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:08:05,390 INFO L134 CoverageAnalysis]: Checked inductivity of 4187 backedges. 1266 proven. 2795 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-03 21:08:05,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:08:05,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:08:05,391 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:08:05,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:08:05,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:08:05,391 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) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:08:05,401 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:08:05,401 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:10:04,652 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-03 21:10:04,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:10:09,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 21:10:09,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:10:09,916 INFO L134 CoverageAnalysis]: Checked inductivity of 4187 backedges. 0 proven. 1392 refuted. 0 times theorem prover too weak. 2795 trivial. 0 not checked. [2019-09-03 21:10:09,916 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:10:10,931 INFO L134 CoverageAnalysis]: Checked inductivity of 4187 backedges. 0 proven. 1392 refuted. 0 times theorem prover too weak. 2795 trivial. 0 not checked. [2019-09-03 21:10:10,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:10:10,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 15, 15] total 72 [2019-09-03 21:10:10,937 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:10:10,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-03 21:10:10,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-03 21:10:10,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=4805, Unknown=0, NotChecked=0, Total=5112 [2019-09-03 21:10:10,938 INFO L87 Difference]: Start difference. First operand 171 states and 182 transitions. Second operand 59 states. [2019-09-03 21:10:18,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:10:18,104 INFO L93 Difference]: Finished difference Result 181 states and 193 transitions. [2019-09-03 21:10:18,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-03 21:10:18,104 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 169 [2019-09-03 21:10:18,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:10:18,106 INFO L225 Difference]: With dead ends: 181 [2019-09-03 21:10:18,106 INFO L226 Difference]: Without dead ends: 178 [2019-09-03 21:10:18,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 313 SyntacticMatches, 2 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1039 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1059, Invalid=12513, Unknown=0, NotChecked=0, Total=13572 [2019-09-03 21:10:18,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-09-03 21:10:18,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2019-09-03 21:10:18,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-03 21:10:18,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 189 transitions. [2019-09-03 21:10:18,112 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 189 transitions. Word has length 169 [2019-09-03 21:10:18,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:10:18,112 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 189 transitions. [2019-09-03 21:10:18,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-03 21:10:18,113 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 189 transitions. [2019-09-03 21:10:18,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-03 21:10:18,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:10:18,114 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 44, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:10:18,114 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:10:18,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:10:18,114 INFO L82 PathProgramCache]: Analyzing trace with hash 265050964, now seen corresponding path program 30 times [2019-09-03 21:10:18,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:10:18,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:10:18,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:10:18,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:10:18,115 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:10:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:10:19,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 1429 proven. 2926 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-09-03 21:10:19,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:10:19,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:10:19,403 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:10:19,404 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:10:19,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:10:19,404 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-03 21:10:19,417 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:10:19,417 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:10:19,472 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:10:19,472 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:10:19,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 91 conjunts are in the unsatisfiable core [2019-09-03 21:10:19,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:10:19,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 1429 proven. 2926 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-09-03 21:10:19,577 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:10:24,067 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 1429 proven. 2926 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-09-03 21:10:24,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:10:24,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-09-03 21:10:24,070 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:10:24,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-03 21:10:24,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-03 21:10:24,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2298, Invalid=6258, Unknown=0, NotChecked=0, Total=8556 [2019-09-03 21:10:24,072 INFO L87 Difference]: Start difference. First operand 177 states and 189 transitions. Second operand 48 states. [2019-09-03 21:10:28,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:10:28,653 INFO L93 Difference]: Finished difference Result 181 states and 193 transitions. [2019-09-03 21:10:28,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-03 21:10:28,656 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 175 [2019-09-03 21:10:28,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:10:28,657 INFO L225 Difference]: With dead ends: 181 [2019-09-03 21:10:28,657 INFO L226 Difference]: Without dead ends: 181 [2019-09-03 21:10:28,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 304 SyntacticMatches, 3 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=2298, Invalid=6258, Unknown=0, NotChecked=0, Total=8556 [2019-09-03 21:10:28,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-09-03 21:10:28,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2019-09-03 21:10:28,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-03 21:10:28,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 192 transitions. [2019-09-03 21:10:28,662 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 192 transitions. Word has length 175 [2019-09-03 21:10:28,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:10:28,662 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 192 transitions. [2019-09-03 21:10:28,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-03 21:10:28,662 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 192 transitions. [2019-09-03 21:10:28,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-03 21:10:28,663 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:10:28,663 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 45, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:10:28,664 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:10:28,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:10:28,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1098605451, now seen corresponding path program 31 times [2019-09-03 21:10:28,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:10:28,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:10:28,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:10:28,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:10:28,665 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:10:28,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:10:30,038 INFO L134 CoverageAnalysis]: Checked inductivity of 4676 backedges. 1461 proven. 3060 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-09-03 21:10:30,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:10:30,039 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:10:30,039 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:10:30,039 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:10:30,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:10:30,039 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) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:10:30,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:10:30,049 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:10:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:10:30,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 93 conjunts are in the unsatisfiable core [2019-09-03 21:10:30,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:10:30,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4676 backedges. 1461 proven. 3060 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-09-03 21:10:30,187 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:10:35,011 INFO L134 CoverageAnalysis]: Checked inductivity of 4676 backedges. 1461 proven. 3060 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-09-03 21:10:35,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:10:35,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-09-03 21:10:35,015 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:10:35,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-03 21:10:35,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-03 21:10:35,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2395, Invalid=6535, Unknown=0, NotChecked=0, Total=8930 [2019-09-03 21:10:35,016 INFO L87 Difference]: Start difference. First operand 180 states and 192 transitions. Second operand 49 states. [2019-09-03 21:10:39,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:10:39,845 INFO L93 Difference]: Finished difference Result 184 states and 196 transitions. [2019-09-03 21:10:39,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-03 21:10:39,845 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 178 [2019-09-03 21:10:39,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:10:39,847 INFO L225 Difference]: With dead ends: 184 [2019-09-03 21:10:39,848 INFO L226 Difference]: Without dead ends: 184 [2019-09-03 21:10:39,848 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 309 SyntacticMatches, 3 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=2395, Invalid=6535, Unknown=0, NotChecked=0, Total=8930 [2019-09-03 21:10:39,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-09-03 21:10:39,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2019-09-03 21:10:39,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-09-03 21:10:39,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 195 transitions. [2019-09-03 21:10:39,852 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 195 transitions. Word has length 178 [2019-09-03 21:10:39,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:10:39,853 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 195 transitions. [2019-09-03 21:10:39,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-03 21:10:39,853 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 195 transitions. [2019-09-03 21:10:39,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-03 21:10:39,854 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:10:39,854 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 46, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:10:39,855 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:10:39,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:10:39,855 INFO L82 PathProgramCache]: Analyzing trace with hash 308788148, now seen corresponding path program 32 times [2019-09-03 21:10:39,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:10:39,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:10:39,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:10:39,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:10:39,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:10:39,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:10:41,174 INFO L134 CoverageAnalysis]: Checked inductivity of 4845 backedges. 1493 proven. 3197 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-09-03 21:10:41,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:10:41,175 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:10:41,175 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:10:41,175 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:10:41,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:10:41,175 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) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:10:41,186 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:10:41,186 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:10:56,841 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-03 21:10:56,841 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:10:58,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 21:10:58,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:10:58,980 INFO L134 CoverageAnalysis]: Checked inductivity of 4845 backedges. 0 proven. 1648 refuted. 0 times theorem prover too weak. 3197 trivial. 0 not checked. [2019-09-03 21:10:58,980 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:11:00,025 INFO L134 CoverageAnalysis]: Checked inductivity of 4845 backedges. 0 proven. 1648 refuted. 0 times theorem prover too weak. 3197 trivial. 0 not checked. [2019-09-03 21:11:00,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:11:00,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 16, 16] total 77 [2019-09-03 21:11:00,031 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:11:00,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-03 21:11:00,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-03 21:11:00,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=5509, Unknown=0, NotChecked=0, Total=5852 [2019-09-03 21:11:00,032 INFO L87 Difference]: Start difference. First operand 183 states and 195 transitions. Second operand 63 states. [2019-09-03 21:11:09,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:11:09,584 INFO L93 Difference]: Finished difference Result 193 states and 206 transitions. [2019-09-03 21:11:09,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-03 21:11:09,585 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 181 [2019-09-03 21:11:09,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:11:09,587 INFO L225 Difference]: With dead ends: 193 [2019-09-03 21:11:09,587 INFO L226 Difference]: Without dead ends: 190 [2019-09-03 21:11:09,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 335 SyntacticMatches, 2 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1181 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1193, Invalid=14307, Unknown=0, NotChecked=0, Total=15500 [2019-09-03 21:11:09,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-09-03 21:11:09,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2019-09-03 21:11:09,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-03 21:11:09,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 202 transitions. [2019-09-03 21:11:09,592 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 202 transitions. Word has length 181 [2019-09-03 21:11:09,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:11:09,593 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 202 transitions. [2019-09-03 21:11:09,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-03 21:11:09,593 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 202 transitions. [2019-09-03 21:11:09,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-03 21:11:09,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:11:09,594 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 47, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:11:09,594 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:11:09,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:11:09,595 INFO L82 PathProgramCache]: Analyzing trace with hash -216698282, now seen corresponding path program 33 times [2019-09-03 21:11:09,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:11:09,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:11:09,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:11:09,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:11:09,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:11:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:11:11,044 INFO L134 CoverageAnalysis]: Checked inductivity of 5192 backedges. 1668 proven. 3337 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-09-03 21:11:11,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:11:11,044 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:11:11,045 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:11:11,045 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:11:11,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:11:11,045 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) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:11:11,055 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:11:11,055 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:11:11,117 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:11:11,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:11:11,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 97 conjunts are in the unsatisfiable core [2019-09-03 21:11:11,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:11:11,284 INFO L134 CoverageAnalysis]: Checked inductivity of 5192 backedges. 1668 proven. 3337 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-09-03 21:11:11,285 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:11:16,148 INFO L134 CoverageAnalysis]: Checked inductivity of 5192 backedges. 1668 proven. 3337 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-09-03 21:11:16,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:11:16,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-09-03 21:11:16,152 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:11:16,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-03 21:11:16,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-03 21:11:16,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2595, Invalid=7107, Unknown=0, NotChecked=0, Total=9702 [2019-09-03 21:11:16,153 INFO L87 Difference]: Start difference. First operand 189 states and 202 transitions. Second operand 51 states. [2019-09-03 21:11:21,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:11:21,451 INFO L93 Difference]: Finished difference Result 193 states and 206 transitions. [2019-09-03 21:11:21,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-03 21:11:21,451 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 187 [2019-09-03 21:11:21,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:11:21,453 INFO L225 Difference]: With dead ends: 193 [2019-09-03 21:11:21,453 INFO L226 Difference]: Without dead ends: 193 [2019-09-03 21:11:21,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 325 SyntacticMatches, 3 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=2595, Invalid=7107, Unknown=0, NotChecked=0, Total=9702 [2019-09-03 21:11:21,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-09-03 21:11:21,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2019-09-03 21:11:21,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-03 21:11:21,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 205 transitions. [2019-09-03 21:11:21,460 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 205 transitions. Word has length 187 [2019-09-03 21:11:21,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:11:21,460 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 205 transitions. [2019-09-03 21:11:21,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-03 21:11:21,461 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 205 transitions. [2019-09-03 21:11:21,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-03 21:11:21,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:11:21,462 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 48, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:11:21,462 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:11:21,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:11:21,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1364724215, now seen corresponding path program 34 times [2019-09-03 21:11:21,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:11:21,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:11:21,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:11:21,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:11:21,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:11:21,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:11:22,985 INFO L134 CoverageAnalysis]: Checked inductivity of 5370 backedges. 1703 proven. 3480 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-09-03 21:11:22,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:11:22,985 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:11:22,986 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:11:22,986 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:11:22,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:11:22,986 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) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:11:22,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:11:22,997 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:11:23,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:11:23,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 99 conjunts are in the unsatisfiable core [2019-09-03 21:11:23,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:11:23,176 INFO L134 CoverageAnalysis]: Checked inductivity of 5370 backedges. 1703 proven. 3480 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-09-03 21:11:23,176 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:11:28,303 INFO L134 CoverageAnalysis]: Checked inductivity of 5370 backedges. 1703 proven. 3480 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-09-03 21:11:28,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:11:28,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-09-03 21:11:28,306 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:11:28,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-03 21:11:28,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-03 21:11:28,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2698, Invalid=7402, Unknown=0, NotChecked=0, Total=10100 [2019-09-03 21:11:28,308 INFO L87 Difference]: Start difference. First operand 192 states and 205 transitions. Second operand 52 states. [2019-09-03 21:11:33,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:11:33,815 INFO L93 Difference]: Finished difference Result 196 states and 209 transitions. [2019-09-03 21:11:33,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-03 21:11:33,816 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 190 [2019-09-03 21:11:33,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:11:33,818 INFO L225 Difference]: With dead ends: 196 [2019-09-03 21:11:33,818 INFO L226 Difference]: Without dead ends: 196 [2019-09-03 21:11:33,819 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 330 SyntacticMatches, 3 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=2698, Invalid=7402, Unknown=0, NotChecked=0, Total=10100 [2019-09-03 21:11:33,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-09-03 21:11:33,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 195. [2019-09-03 21:11:33,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-03 21:11:33,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 208 transitions. [2019-09-03 21:11:33,823 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 208 transitions. Word has length 190 [2019-09-03 21:11:33,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:11:33,823 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 208 transitions. [2019-09-03 21:11:33,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-03 21:11:33,823 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 208 transitions. [2019-09-03 21:11:33,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-03 21:11:33,825 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:11:33,825 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 49, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:11:33,825 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:11:33,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:11:33,825 INFO L82 PathProgramCache]: Analyzing trace with hash 2026062518, now seen corresponding path program 35 times [2019-09-03 21:11:33,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:11:33,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:11:33,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:11:33,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:11:33,826 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:11:33,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:11:35,510 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 1738 proven. 3626 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-09-03 21:11:35,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:11:35,510 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:11:35,511 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:11:35,511 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:11:35,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:11:35,511 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) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:11:35,522 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:11:35,522 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:13:01,766 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-09-03 21:13:01,766 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:13:02,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 21:13:02,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:13:03,214 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 0 proven. 1925 refuted. 0 times theorem prover too weak. 3626 trivial. 0 not checked. [2019-09-03 21:13:03,214 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:13:04,383 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 0 proven. 1925 refuted. 0 times theorem prover too weak. 3626 trivial. 0 not checked. [2019-09-03 21:13:04,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:13:04,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 17, 17] total 82 [2019-09-03 21:13:04,389 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:13:04,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-03 21:13:04,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-03 21:13:04,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=6261, Unknown=0, NotChecked=0, Total=6642 [2019-09-03 21:13:04,390 INFO L87 Difference]: Start difference. First operand 195 states and 208 transitions. Second operand 67 states. [2019-09-03 21:13:15,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:13:15,205 INFO L93 Difference]: Finished difference Result 205 states and 219 transitions. [2019-09-03 21:13:15,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-03 21:13:15,205 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 193 [2019-09-03 21:13:15,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:13:15,207 INFO L225 Difference]: With dead ends: 205 [2019-09-03 21:13:15,207 INFO L226 Difference]: Without dead ends: 202 [2019-09-03 21:13:15,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 357 SyntacticMatches, 2 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1332 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1335, Invalid=16221, Unknown=0, NotChecked=0, Total=17556 [2019-09-03 21:13:15,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-03 21:13:15,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2019-09-03 21:13:15,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-09-03 21:13:15,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 215 transitions. [2019-09-03 21:13:15,211 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 215 transitions. Word has length 193 [2019-09-03 21:13:15,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:13:15,211 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 215 transitions. [2019-09-03 21:13:15,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-03 21:13:15,211 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 215 transitions. [2019-09-03 21:13:15,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-03 21:13:15,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:13:15,212 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 50, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:13:15,213 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:13:15,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:13:15,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1688759700, now seen corresponding path program 36 times [2019-09-03 21:13:15,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:13:15,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:13:15,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:13:15,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:13:15,214 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:13:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:13:16,729 INFO L134 CoverageAnalysis]: Checked inductivity of 5922 backedges. 1925 proven. 3775 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-09-03 21:13:16,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:13:16,729 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:13:16,729 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:13:16,729 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:13:16,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:13:16,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 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-03 21:13:16,740 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:13:16,740 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:13:16,791 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:13:16,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:13:16,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 103 conjunts are in the unsatisfiable core [2019-09-03 21:13:16,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:13:16,897 INFO L134 CoverageAnalysis]: Checked inductivity of 5922 backedges. 1925 proven. 3775 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-09-03 21:13:16,898 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:13:22,496 INFO L134 CoverageAnalysis]: Checked inductivity of 5922 backedges. 1925 proven. 3775 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-09-03 21:13:22,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:13:22,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-09-03 21:13:22,500 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:13:22,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-03 21:13:22,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-03 21:13:22,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2910, Invalid=8010, Unknown=0, NotChecked=0, Total=10920 [2019-09-03 21:13:22,501 INFO L87 Difference]: Start difference. First operand 201 states and 215 transitions. Second operand 54 states. [2019-09-03 21:13:28,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:13:28,492 INFO L93 Difference]: Finished difference Result 205 states and 219 transitions. [2019-09-03 21:13:28,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-03 21:13:28,492 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 199 [2019-09-03 21:13:28,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:13:28,494 INFO L225 Difference]: With dead ends: 205 [2019-09-03 21:13:28,494 INFO L226 Difference]: Without dead ends: 205 [2019-09-03 21:13:28,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 346 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=2910, Invalid=8010, Unknown=0, NotChecked=0, Total=10920 [2019-09-03 21:13:28,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-09-03 21:13:28,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2019-09-03 21:13:28,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-09-03 21:13:28,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 218 transitions. [2019-09-03 21:13:28,499 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 218 transitions. Word has length 199 [2019-09-03 21:13:28,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:13:28,500 INFO L475 AbstractCegarLoop]: Abstraction has 204 states and 218 transitions. [2019-09-03 21:13:28,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-03 21:13:28,500 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 218 transitions. [2019-09-03 21:13:28,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-03 21:13:28,501 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:13:28,501 INFO L399 BasicCegarLoop]: trace histogram [64, 64, 51, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:13:28,501 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:13:28,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:13:28,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1188586571, now seen corresponding path program 37 times [2019-09-03 21:13:28,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:13:28,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:13:28,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:13:28,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:13:28,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:13:28,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:13:30,995 INFO L134 CoverageAnalysis]: Checked inductivity of 6112 backedges. 1963 proven. 3927 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-09-03 21:13:30,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:13:30,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:13:30,996 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:13:30,996 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:13:30,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:13:30,996 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) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:13:31,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:13:31,006 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:13:31,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:13:31,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 105 conjunts are in the unsatisfiable core [2019-09-03 21:13:31,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:13:31,181 INFO L134 CoverageAnalysis]: Checked inductivity of 6112 backedges. 1963 proven. 3927 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-09-03 21:13:31,181 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:13:37,086 INFO L134 CoverageAnalysis]: Checked inductivity of 6112 backedges. 1963 proven. 3927 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-09-03 21:13:37,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:13:37,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-09-03 21:13:37,090 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:13:37,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-03 21:13:37,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-03 21:13:37,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3019, Invalid=8323, Unknown=0, NotChecked=0, Total=11342 [2019-09-03 21:13:37,091 INFO L87 Difference]: Start difference. First operand 204 states and 218 transitions. Second operand 55 states. [2019-09-03 21:13:43,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:13:43,305 INFO L93 Difference]: Finished difference Result 208 states and 222 transitions. [2019-09-03 21:13:43,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-03 21:13:43,305 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 202 [2019-09-03 21:13:43,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:13:43,307 INFO L225 Difference]: With dead ends: 208 [2019-09-03 21:13:43,307 INFO L226 Difference]: Without dead ends: 208 [2019-09-03 21:13:43,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 351 SyntacticMatches, 3 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=3019, Invalid=8323, Unknown=0, NotChecked=0, Total=11342 [2019-09-03 21:13:43,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-09-03 21:13:43,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 207. [2019-09-03 21:13:43,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-09-03 21:13:43,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 221 transitions. [2019-09-03 21:13:43,312 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 221 transitions. Word has length 202 [2019-09-03 21:13:43,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:13:43,313 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 221 transitions. [2019-09-03 21:13:43,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-03 21:13:43,314 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 221 transitions. [2019-09-03 21:13:43,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-03 21:13:43,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:13:43,315 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 52, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:13:43,315 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:13:43,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:13:43,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1254052364, now seen corresponding path program 38 times [2019-09-03 21:13:43,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:13:43,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:13:43,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:13:43,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:13:43,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:13:43,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:13:45,599 INFO L134 CoverageAnalysis]: Checked inductivity of 6305 backedges. 2001 proven. 4082 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-09-03 21:13:45,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:13:45,600 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:13:45,600 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:13:45,600 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:13:45,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:13:45,600 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-03 21:13:45,610 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:13:45,610 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:15:03,764 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-09-03 21:15:03,764 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:15:03,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 21:15:03,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:15:04,770 INFO L134 CoverageAnalysis]: Checked inductivity of 6305 backedges. 0 proven. 2223 refuted. 0 times theorem prover too weak. 4082 trivial. 0 not checked. [2019-09-03 21:15:04,771 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:15:06,144 INFO L134 CoverageAnalysis]: Checked inductivity of 6305 backedges. 0 proven. 2223 refuted. 0 times theorem prover too weak. 4082 trivial. 0 not checked. [2019-09-03 21:15:06,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:15:06,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 18, 18] total 87 [2019-09-03 21:15:06,152 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:15:06,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-03 21:15:06,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-03 21:15:06,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=7061, Unknown=0, NotChecked=0, Total=7482 [2019-09-03 21:15:06,153 INFO L87 Difference]: Start difference. First operand 207 states and 221 transitions. Second operand 71 states. [2019-09-03 21:15:17,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:15:17,648 INFO L93 Difference]: Finished difference Result 217 states and 232 transitions. [2019-09-03 21:15:17,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-03 21:15:17,648 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 205 [2019-09-03 21:15:17,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:15:17,650 INFO L225 Difference]: With dead ends: 217 [2019-09-03 21:15:17,650 INFO L226 Difference]: Without dead ends: 214 [2019-09-03 21:15:17,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 379 SyntacticMatches, 2 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1492 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1485, Invalid=18255, Unknown=0, NotChecked=0, Total=19740 [2019-09-03 21:15:17,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-03 21:15:17,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2019-09-03 21:15:17,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-09-03 21:15:17,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 228 transitions. [2019-09-03 21:15:17,655 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 228 transitions. Word has length 205 [2019-09-03 21:15:17,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:15:17,655 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 228 transitions. [2019-09-03 21:15:17,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-03 21:15:17,655 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 228 transitions. [2019-09-03 21:15:17,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-03 21:15:17,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:15:17,657 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 53, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:15:17,657 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:15:17,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:15:17,657 INFO L82 PathProgramCache]: Analyzing trace with hash 638585622, now seen corresponding path program 39 times [2019-09-03 21:15:17,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:15:17,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:15:17,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:15:17,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:15:17,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:15:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:15:19,568 INFO L134 CoverageAnalysis]: Checked inductivity of 6700 backedges. 2200 proven. 4240 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-09-03 21:15:19,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:15:19,568 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:15:19,568 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:15:19,568 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:15:19,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:15:19,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 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-03 21:15:19,578 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:15:19,578 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:15:19,637 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:15:19,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:15:19,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 109 conjunts are in the unsatisfiable core [2019-09-03 21:15:19,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:15:19,759 INFO L134 CoverageAnalysis]: Checked inductivity of 6700 backedges. 2200 proven. 4240 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-09-03 21:15:19,759 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:15:25,902 INFO L134 CoverageAnalysis]: Checked inductivity of 6700 backedges. 2200 proven. 4240 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-09-03 21:15:25,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:15:25,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2019-09-03 21:15:25,912 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:15:25,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-03 21:15:25,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-03 21:15:25,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3243, Invalid=8967, Unknown=0, NotChecked=0, Total=12210 [2019-09-03 21:15:25,914 INFO L87 Difference]: Start difference. First operand 213 states and 228 transitions. Second operand 57 states. [2019-09-03 21:15:32,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:15:32,620 INFO L93 Difference]: Finished difference Result 217 states and 232 transitions. [2019-09-03 21:15:32,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-03 21:15:32,621 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 211 [2019-09-03 21:15:32,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:15:32,623 INFO L225 Difference]: With dead ends: 217 [2019-09-03 21:15:32,623 INFO L226 Difference]: Without dead ends: 217 [2019-09-03 21:15:32,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 367 SyntacticMatches, 3 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=3243, Invalid=8967, Unknown=0, NotChecked=0, Total=12210 [2019-09-03 21:15:32,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-09-03 21:15:32,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 216. [2019-09-03 21:15:32,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-09-03 21:15:32,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 231 transitions. [2019-09-03 21:15:32,627 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 231 transitions. Word has length 211 [2019-09-03 21:15:32,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:15:32,628 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 231 transitions. [2019-09-03 21:15:32,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-03 21:15:32,628 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 231 transitions. [2019-09-03 21:15:32,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-09-03 21:15:32,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:15:32,629 INFO L399 BasicCegarLoop]: trace histogram [68, 68, 54, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:15:32,630 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:15:32,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:15:32,630 INFO L82 PathProgramCache]: Analyzing trace with hash -31584329, now seen corresponding path program 40 times [2019-09-03 21:15:32,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:15:32,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:15:32,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:15:32,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:15:32,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:15:32,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:15:34,573 INFO L134 CoverageAnalysis]: Checked inductivity of 6902 backedges. 2241 proven. 4401 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-09-03 21:15:34,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:15:34,573 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:15:34,574 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:15:34,574 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:15:34,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:15:34,574 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-03 21:15:34,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:15:34,586 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:15:34,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:15:34,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 111 conjunts are in the unsatisfiable core [2019-09-03 21:15:34,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:15:34,753 INFO L134 CoverageAnalysis]: Checked inductivity of 6902 backedges. 2241 proven. 4401 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-09-03 21:15:34,753 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:15:41,210 INFO L134 CoverageAnalysis]: Checked inductivity of 6902 backedges. 2241 proven. 4401 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-09-03 21:15:41,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:15:41,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2019-09-03 21:15:41,213 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:15:41,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-03 21:15:41,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-03 21:15:41,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3358, Invalid=9298, Unknown=0, NotChecked=0, Total=12656 [2019-09-03 21:15:41,215 INFO L87 Difference]: Start difference. First operand 216 states and 231 transitions. Second operand 58 states. [2019-09-03 21:15:48,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:15:48,143 INFO L93 Difference]: Finished difference Result 220 states and 235 transitions. [2019-09-03 21:15:48,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-03 21:15:48,143 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 214 [2019-09-03 21:15:48,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:15:48,145 INFO L225 Difference]: With dead ends: 220 [2019-09-03 21:15:48,145 INFO L226 Difference]: Without dead ends: 220 [2019-09-03 21:15:48,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 372 SyntacticMatches, 3 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=3358, Invalid=9298, Unknown=0, NotChecked=0, Total=12656 [2019-09-03 21:15:48,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-09-03 21:15:48,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 219. [2019-09-03 21:15:48,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-09-03 21:15:48,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 234 transitions. [2019-09-03 21:15:48,150 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 234 transitions. Word has length 214 [2019-09-03 21:15:48,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:15:48,150 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 234 transitions. [2019-09-03 21:15:48,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-03 21:15:48,151 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 234 transitions. [2019-09-03 21:15:48,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-03 21:15:48,152 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:15:48,152 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 55, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:15:48,152 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:15:48,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:15:48,153 INFO L82 PathProgramCache]: Analyzing trace with hash -2056602762, now seen corresponding path program 41 times [2019-09-03 21:15:48,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:15:48,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:15:48,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:15:48,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:15:48,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:15:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:15:49,975 INFO L134 CoverageAnalysis]: Checked inductivity of 7107 backedges. 2282 proven. 4565 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-09-03 21:15:49,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:15:49,976 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:15:49,976 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:15:49,976 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:15:49,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:15:49,976 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) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:15:49,986 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:15:49,986 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP)