java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-acceleration/functions_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 01:49:48,707 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 01:49:48,709 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 01:49:48,721 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 01:49:48,721 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 01:49:48,722 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 01:49:48,723 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 01:49:48,725 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 01:49:48,727 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 01:49:48,728 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 01:49:48,729 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 01:49:48,730 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 01:49:48,730 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 01:49:48,731 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 01:49:48,732 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 01:49:48,733 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 01:49:48,734 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 01:49:48,735 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 01:49:48,736 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 01:49:48,739 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 01:49:48,740 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 01:49:48,742 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 01:49:48,743 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 01:49:48,744 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 01:49:48,746 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 01:49:48,747 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 01:49:48,747 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 01:49:48,748 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 01:49:48,748 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 01:49:48,750 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 01:49:48,751 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 01:49:48,751 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 01:49:48,752 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 01:49:48,753 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 01:49:48,754 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 01:49:48,756 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 01:49:48,757 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 01:49:48,757 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 01:49:48,757 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 01:49:48,758 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 01:49:48,759 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 01:49:48,761 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 01:49:48,790 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 01:49:48,790 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 01:49:48,791 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 01:49:48,792 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 01:49:48,792 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 01:49:48,793 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 01:49:48,793 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 01:49:48,793 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 01:49:48,793 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 01:49:48,793 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 01:49:48,795 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 01:49:48,796 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 01:49:48,796 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 01:49:48,796 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 01:49:48,797 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 01:49:48,797 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 01:49:48,797 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 01:49:48,797 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 01:49:48,797 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 01:49:48,798 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 01:49:48,798 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 01:49:48,798 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 01:49:48,798 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 01:49:48,799 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 01:49:48,799 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 01:49:48,799 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 01:49:48,799 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 01:49:48,799 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 01:49:48,800 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 01:49:48,800 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 01:49:48,846 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 01:49:48,857 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 01:49:48,861 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 01:49:48,863 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 01:49:48,863 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 01:49:48,864 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/functions_1-2.c [2019-09-10 01:49:48,926 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/338cbbca2/fbd7578e50cc4db0ab47ced5929a8197/FLAG73d830154 [2019-09-10 01:49:49,383 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 01:49:49,384 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/functions_1-2.c [2019-09-10 01:49:49,390 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/338cbbca2/fbd7578e50cc4db0ab47ced5929a8197/FLAG73d830154 [2019-09-10 01:49:49,769 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/338cbbca2/fbd7578e50cc4db0ab47ced5929a8197 [2019-09-10 01:49:49,777 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 01:49:49,779 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 01:49:49,780 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 01:49:49,780 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 01:49:49,784 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 01:49:49,789 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:49:49" (1/1) ... [2019-09-10 01:49:49,792 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@181c038 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:49:49, skipping insertion in model container [2019-09-10 01:49:49,792 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:49:49" (1/1) ... [2019-09-10 01:49:49,800 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 01:49:49,817 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 01:49:50,079 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:49:50,091 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 01:49:50,114 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:49:50,132 INFO L192 MainTranslator]: Completed translation [2019-09-10 01:49:50,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:49:50 WrapperNode [2019-09-10 01:49:50,134 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 01:49:50,135 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 01:49:50,135 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 01:49:50,135 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 01:49:50,252 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:49:50" (1/1) ... [2019-09-10 01:49:50,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:49:50" (1/1) ... [2019-09-10 01:49:50,261 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:49:50" (1/1) ... [2019-09-10 01:49:50,261 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:49:50" (1/1) ... [2019-09-10 01:49:50,269 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:49:50" (1/1) ... [2019-09-10 01:49:50,274 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:49:50" (1/1) ... [2019-09-10 01:49:50,275 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:49:50" (1/1) ... [2019-09-10 01:49:50,278 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 01:49:50,279 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 01:49:50,279 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 01:49:50,279 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 01:49:50,280 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:49:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 01:49:50,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 01:49:50,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 01:49:50,356 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-10 01:49:50,357 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-09-10 01:49:50,357 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 01:49:50,357 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 01:49:50,357 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 01:49:50,357 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-09-10 01:49:50,357 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 01:49:50,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 01:49:50,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 01:49:50,537 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 01:49:50,538 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 01:49:50,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:49:50 BoogieIcfgContainer [2019-09-10 01:49:50,539 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 01:49:50,540 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 01:49:50,540 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 01:49:50,543 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 01:49:50,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 01:49:49" (1/3) ... [2019-09-10 01:49:50,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67fcd80a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:49:50, skipping insertion in model container [2019-09-10 01:49:50,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:49:50" (2/3) ... [2019-09-10 01:49:50,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67fcd80a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:49:50, skipping insertion in model container [2019-09-10 01:49:50,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:49:50" (3/3) ... [2019-09-10 01:49:50,547 INFO L109 eAbstractionObserver]: Analyzing ICFG functions_1-2.c [2019-09-10 01:49:50,557 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 01:49:50,564 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 01:49:50,581 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 01:49:50,608 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 01:49:50,608 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 01:49:50,608 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 01:49:50,608 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 01:49:50,608 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 01:49:50,609 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 01:49:50,609 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 01:49:50,609 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 01:49:50,624 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-09-10 01:49:50,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-10 01:49:50,634 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:49:50,635 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:49:50,637 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:49:50,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:49:50,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1238725826, now seen corresponding path program 1 times [2019-09-10 01:49:50,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:49:50,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:50,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:49:50,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:50,695 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:49:50,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:49:50,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:50,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:49:50,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-10 01:49:50,757 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:49:50,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 01:49:50,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 01:49:50,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 01:49:50,780 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2019-09-10 01:49:50,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:49:50,794 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-09-10 01:49:50,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 01:49:50,796 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-10 01:49:50,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:49:50,803 INFO L225 Difference]: With dead ends: 22 [2019-09-10 01:49:50,804 INFO L226 Difference]: Without dead ends: 16 [2019-09-10 01:49:50,805 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-10 01:49:50,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-10 01:49:50,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-10 01:49:50,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-10 01:49:50,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-09-10 01:49:50,842 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 10 [2019-09-10 01:49:50,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:49:50,843 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-09-10 01:49:50,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 01:49:50,843 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-09-10 01:49:50,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-10 01:49:50,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:49:50,844 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:49:50,844 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:49:50,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:49:50,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1244266952, now seen corresponding path program 1 times [2019-09-10 01:49:50,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:49:50,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:50,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:49:50,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:50,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:49:50,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:49:50,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:50,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:49:50,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 01:49:50,964 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:49:50,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 01:49:50,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 01:49:50,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:49:50,967 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 3 states. [2019-09-10 01:49:51,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:49:51,003 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-09-10 01:49:51,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 01:49:51,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-10 01:49:51,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:49:51,007 INFO L225 Difference]: With dead ends: 19 [2019-09-10 01:49:51,007 INFO L226 Difference]: Without dead ends: 19 [2019-09-10 01:49:51,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:49:51,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-10 01:49:51,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-09-10 01:49:51,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-10 01:49:51,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-09-10 01:49:51,030 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 10 [2019-09-10 01:49:51,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:49:51,030 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-09-10 01:49:51,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 01:49:51,031 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-09-10 01:49:51,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-10 01:49:51,032 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:49:51,032 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:49:51,032 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:49:51,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:49:51,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1831198934, now seen corresponding path program 1 times [2019-09-10 01:49:51,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:49:51,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:51,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:49:51,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:51,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:49:51,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:49:51,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:51,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:51,219 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:49:51,220 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2019-09-10 01:49:51,222 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [6], [13], [15], [17], [23], [26], [28], [34], [35], [36], [38], [39], [40] [2019-09-10 01:49:51,254 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 01:49:51,255 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 01:49:51,322 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 01:49:51,639 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 01:49:51,642 INFO L272 AbstractInterpreter]: Visited 16 different actions 82 times. Merged at 4 different actions 24 times. Widened at 1 different actions 4 times. Performed 108 root evaluator evaluations with a maximum evaluation depth of 12. Performed 108 inverse root evaluator evaluations with a maximum inverse evaluation depth of 12. Found 1 fixpoints after 1 different actions. Largest state had 3 variables. [2019-09-10 01:49:51,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:49:51,647 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 01:49:51,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:51,648 INFO 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) [2019-09-10 01:49:51,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:49:51,680 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:49:51,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:49:51,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 01:49:51,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:49:51,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:51,816 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:49:51,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:51,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:49:51,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-09-10 01:49:51,999 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:49:52,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 01:49:52,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 01:49:52,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-10 01:49:52,001 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 7 states. [2019-09-10 01:49:52,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:49:52,097 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-09-10 01:49:52,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 01:49:52,100 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-09-10 01:49:52,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:49:52,101 INFO L225 Difference]: With dead ends: 22 [2019-09-10 01:49:52,101 INFO L226 Difference]: Without dead ends: 22 [2019-09-10 01:49:52,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-09-10 01:49:52,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-10 01:49:52,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2019-09-10 01:49:52,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-10 01:49:52,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-09-10 01:49:52,107 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 16 [2019-09-10 01:49:52,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:49:52,107 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-09-10 01:49:52,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 01:49:52,108 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-09-10 01:49:52,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-10 01:49:52,110 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:49:52,110 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:49:52,111 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:49:52,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:49:52,111 INFO L82 PathProgramCache]: Analyzing trace with hash 329045236, now seen corresponding path program 2 times [2019-09-10 01:49:52,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:49:52,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:52,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:49:52,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:52,113 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:49:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:49:52,333 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 01:49:52,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:52,333 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:49:52,334 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:49:52,334 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:49:52,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:52,334 INFO 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-10 01:49:52,359 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:49:52,359 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:49:52,381 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-10 01:49:52,381 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:49:52,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-10 01:49:52,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:49:52,432 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 01:49:52,432 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:49:52,685 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 01:49:52,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:49:52,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 16 [2019-09-10 01:49:52,689 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:49:52,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 01:49:52,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 01:49:52,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-09-10 01:49:52,691 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 9 states. [2019-09-10 01:49:52,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:49:52,824 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-09-10 01:49:52,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 01:49:52,825 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-09-10 01:49:52,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:49:52,826 INFO L225 Difference]: With dead ends: 25 [2019-09-10 01:49:52,826 INFO L226 Difference]: Without dead ends: 25 [2019-09-10 01:49:52,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2019-09-10 01:49:52,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-10 01:49:52,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2019-09-10 01:49:52,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-10 01:49:52,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-09-10 01:49:52,836 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 22 [2019-09-10 01:49:52,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:49:52,837 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-09-10 01:49:52,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 01:49:52,837 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-09-10 01:49:52,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-10 01:49:52,838 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:49:52,838 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:49:52,840 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:49:52,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:49:52,842 INFO L82 PathProgramCache]: Analyzing trace with hash 755481234, now seen corresponding path program 3 times [2019-09-10 01:49:52,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:49:52,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:52,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:49:52,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:52,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:49:52,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:49:53,070 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 01:49:53,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:53,071 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:49:53,071 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:49:53,072 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:49:53,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:53,072 INFO 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-10 01:49:53,087 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:49:53,087 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:49:53,105 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:49:53,105 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:49:53,106 WARN L254 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-10 01:49:53,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:49:53,167 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 01:49:53,168 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:49:53,529 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 01:49:53,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:49:53,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 12] total 21 [2019-09-10 01:49:53,534 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:49:53,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 01:49:53,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 01:49:53,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2019-09-10 01:49:53,535 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 11 states. [2019-09-10 01:49:53,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:49:53,715 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2019-09-10 01:49:53,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 01:49:53,716 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2019-09-10 01:49:53,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:49:53,717 INFO L225 Difference]: With dead ends: 28 [2019-09-10 01:49:53,721 INFO L226 Difference]: Without dead ends: 28 [2019-09-10 01:49:53,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 41 SyntacticMatches, 8 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2019-09-10 01:49:53,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-10 01:49:53,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-09-10 01:49:53,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-10 01:49:53,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2019-09-10 01:49:53,729 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 28 [2019-09-10 01:49:53,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:49:53,731 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-09-10 01:49:53,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 01:49:53,731 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2019-09-10 01:49:53,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-10 01:49:53,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:49:53,738 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:49:53,739 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:49:53,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:49:53,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1475645008, now seen corresponding path program 4 times [2019-09-10 01:49:53,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:49:53,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:53,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:49:53,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:53,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:49:53,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:49:53,976 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 01:49:53,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:53,976 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:49:53,976 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:49:53,977 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:49:53,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:53,977 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:49:53,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:49:53,999 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:49:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:49:54,015 WARN L254 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-10 01:49:54,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:49:54,067 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 01:49:54,067 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:49:54,608 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 01:49:54,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:49:54,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 15] total 26 [2019-09-10 01:49:54,614 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:49:54,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 01:49:54,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 01:49:54,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=546, Unknown=0, NotChecked=0, Total=650 [2019-09-10 01:49:54,616 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 13 states. [2019-09-10 01:49:54,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:49:54,842 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2019-09-10 01:49:54,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 01:49:54,843 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2019-09-10 01:49:54,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:49:54,844 INFO L225 Difference]: With dead ends: 31 [2019-09-10 01:49:54,844 INFO L226 Difference]: Without dead ends: 31 [2019-09-10 01:49:54,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 49 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2019-09-10 01:49:54,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-10 01:49:54,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2019-09-10 01:49:54,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-10 01:49:54,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-09-10 01:49:54,850 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 34 [2019-09-10 01:49:54,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:49:54,850 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-09-10 01:49:54,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 01:49:54,851 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-09-10 01:49:54,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-10 01:49:54,852 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:49:54,852 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:49:54,852 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:49:54,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:49:54,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1545919054, now seen corresponding path program 5 times [2019-09-10 01:49:54,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:49:54,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:54,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:49:54,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:54,854 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:49:54,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:49:55,074 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-10 01:49:55,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:55,075 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:49:55,075 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:49:55,075 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:49:55,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:55,075 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:49:55,087 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:49:55,087 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:49:55,140 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-10 01:49:55,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:49:55,143 WARN L254 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-10 01:49:55,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:49:55,210 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-10 01:49:55,210 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:49:55,906 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 01:49:55,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:49:55,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 18] total 31 [2019-09-10 01:49:55,910 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:49:55,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 01:49:55,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 01:49:55,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=793, Unknown=0, NotChecked=0, Total=930 [2019-09-10 01:49:55,912 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 15 states. [2019-09-10 01:49:56,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:49:56,250 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2019-09-10 01:49:56,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 01:49:56,251 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2019-09-10 01:49:56,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:49:56,252 INFO L225 Difference]: With dead ends: 34 [2019-09-10 01:49:56,252 INFO L226 Difference]: Without dead ends: 34 [2019-09-10 01:49:56,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 57 SyntacticMatches, 12 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=217, Invalid=1043, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 01:49:56,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-10 01:49:56,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-09-10 01:49:56,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-10 01:49:56,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-09-10 01:49:56,261 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 40 [2019-09-10 01:49:56,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:49:56,262 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-09-10 01:49:56,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 01:49:56,262 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2019-09-10 01:49:56,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-10 01:49:56,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:49:56,263 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:49:56,263 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:49:56,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:49:56,264 INFO L82 PathProgramCache]: Analyzing trace with hash 128504940, now seen corresponding path program 6 times [2019-09-10 01:49:56,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:49:56,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:56,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:49:56,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:56,265 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:49:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:49:56,488 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-10 01:49:56,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:56,488 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:49:56,489 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:49:56,489 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:49:56,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:56,489 INFO 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-10 01:49:56,505 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:49:56,505 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:49:56,530 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:49:56,530 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:49:56,532 WARN L254 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-10 01:49:56,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:49:56,595 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-10 01:49:56,595 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:49:57,453 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 01:49:57,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:49:57,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 21] total 36 [2019-09-10 01:49:57,457 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:49:57,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 01:49:57,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 01:49:57,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1086, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 01:49:57,458 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 17 states. [2019-09-10 01:49:57,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:49:57,882 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2019-09-10 01:49:57,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 01:49:57,882 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2019-09-10 01:49:57,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:49:57,884 INFO L225 Difference]: With dead ends: 37 [2019-09-10 01:49:57,884 INFO L226 Difference]: Without dead ends: 37 [2019-09-10 01:49:57,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 65 SyntacticMatches, 14 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=282, Invalid=1440, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 01:49:57,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-10 01:49:57,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2019-09-10 01:49:57,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-10 01:49:57,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2019-09-10 01:49:57,890 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 46 [2019-09-10 01:49:57,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:49:57,890 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2019-09-10 01:49:57,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 01:49:57,891 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2019-09-10 01:49:57,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-10 01:49:57,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:49:57,892 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:49:57,892 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:49:57,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:49:57,893 INFO L82 PathProgramCache]: Analyzing trace with hash -842776566, now seen corresponding path program 7 times [2019-09-10 01:49:57,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:49:57,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:57,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:49:57,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:57,894 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:49:57,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:49:58,239 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-09-10 01:49:58,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:58,240 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:49:58,240 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:49:58,240 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:49:58,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:58,240 INFO 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-10 01:49:58,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:49:58,260 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-10 01:49:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:49:58,282 WARN L254 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 73 conjunts are in the unsatisfiable core [2019-09-10 01:49:58,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:49:58,381 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-09-10 01:49:58,382 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:49:59,418 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-10 01:49:59,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:49:59,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 24] total 41 [2019-09-10 01:49:59,422 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:49:59,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 01:49:59,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 01:49:59,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1425, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 01:49:59,424 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 19 states. [2019-09-10 01:49:59,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:49:59,945 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2019-09-10 01:49:59,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 01:49:59,948 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 52 [2019-09-10 01:49:59,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:49:59,949 INFO L225 Difference]: With dead ends: 40 [2019-09-10 01:49:59,950 INFO L226 Difference]: Without dead ends: 40 [2019-09-10 01:49:59,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 73 SyntacticMatches, 16 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=355, Invalid=1901, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 01:49:59,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-10 01:49:59,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-09-10 01:49:59,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-10 01:49:59,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2019-09-10 01:49:59,956 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 52 [2019-09-10 01:49:59,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:49:59,957 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-09-10 01:49:59,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 01:49:59,957 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2019-09-10 01:49:59,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 01:49:59,958 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:49:59,958 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:49:59,959 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:49:59,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:49:59,959 INFO L82 PathProgramCache]: Analyzing trace with hash 880540968, now seen corresponding path program 8 times [2019-09-10 01:49:59,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:49:59,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:59,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:49:59,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:59,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:49:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:50:00,294 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-10 01:50:00,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:50:00,295 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:50:00,295 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:50:00,295 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:50:00,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:50:00,295 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:50:00,317 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:50:00,317 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:50:54,287 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-10 01:50:54,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:50:54,511 WARN L254 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 83 conjunts are in the unsatisfiable core [2019-09-10 01:50:54,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:50:54,617 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-10 01:50:54,617 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:50:55,816 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-10 01:50:55,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:50:55,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 27] total 46 [2019-09-10 01:50:55,822 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:50:55,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 01:50:55,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 01:50:55,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=1810, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 01:50:55,823 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 21 states. [2019-09-10 01:50:56,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:50:56,459 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2019-09-10 01:50:56,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 01:50:56,460 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 58 [2019-09-10 01:50:56,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:50:56,461 INFO L225 Difference]: With dead ends: 43 [2019-09-10 01:50:56,461 INFO L226 Difference]: Without dead ends: 43 [2019-09-10 01:50:56,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 81 SyntacticMatches, 18 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=436, Invalid=2426, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 01:50:56,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-10 01:50:56,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2019-09-10 01:50:56,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-10 01:50:56,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2019-09-10 01:50:56,468 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 58 [2019-09-10 01:50:56,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:50:56,468 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2019-09-10 01:50:56,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 01:50:56,468 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2019-09-10 01:50:56,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 01:50:56,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:50:56,470 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:50:56,470 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:50:56,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:50:56,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1565725754, now seen corresponding path program 9 times [2019-09-10 01:50:56,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:50:56,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:50:56,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:50:56,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:50:56,472 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:50:56,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:50:56,854 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-09-10 01:50:56,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:50:56,854 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:50:56,854 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:50:56,854 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:50:56,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:50:56,854 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:50:56,866 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:50:56,867 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:50:56,897 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:50:56,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:50:56,899 WARN L254 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 93 conjunts are in the unsatisfiable core [2019-09-10 01:50:56,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:50:57,007 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-09-10 01:50:57,008 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:50:58,666 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 01:50:58,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:50:58,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 30] total 51 [2019-09-10 01:50:58,675 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:50:58,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 01:50:58,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 01:50:58,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=2241, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 01:50:58,679 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 23 states. [2019-09-10 01:50:59,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:50:59,477 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2019-09-10 01:50:59,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 01:50:59,478 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 64 [2019-09-10 01:50:59,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:50:59,480 INFO L225 Difference]: With dead ends: 46 [2019-09-10 01:50:59,480 INFO L226 Difference]: Without dead ends: 46 [2019-09-10 01:50:59,482 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 89 SyntacticMatches, 20 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=525, Invalid=3015, Unknown=0, NotChecked=0, Total=3540 [2019-09-10 01:50:59,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-10 01:50:59,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2019-09-10 01:50:59,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-10 01:50:59,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2019-09-10 01:50:59,487 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 64 [2019-09-10 01:50:59,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:50:59,487 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2019-09-10 01:50:59,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 01:50:59,488 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2019-09-10 01:50:59,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 01:50:59,489 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:50:59,489 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:50:59,489 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:50:59,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:50:59,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1577839588, now seen corresponding path program 10 times [2019-09-10 01:50:59,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:50:59,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:50:59,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:50:59,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:50:59,491 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:50:59,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:50:59,995 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-09-10 01:50:59,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:50:59,998 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:50:59,998 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:50:59,998 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:50:59,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:50:59,998 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:51:00,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:51:00,013 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:51:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:51:00,043 WARN L254 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 103 conjunts are in the unsatisfiable core [2019-09-10 01:51:00,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:51:00,140 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-09-10 01:51:00,140 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:51:02,321 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 01:51:02,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:51:02,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 33] total 56 [2019-09-10 01:51:02,326 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:51:02,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 01:51:02,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 01:51:02,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=2718, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 01:51:02,328 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 25 states. [2019-09-10 01:51:03,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:51:03,258 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2019-09-10 01:51:03,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 01:51:03,259 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 70 [2019-09-10 01:51:03,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:51:03,261 INFO L225 Difference]: With dead ends: 49 [2019-09-10 01:51:03,261 INFO L226 Difference]: Without dead ends: 49 [2019-09-10 01:51:03,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 97 SyntacticMatches, 22 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=622, Invalid=3668, Unknown=0, NotChecked=0, Total=4290 [2019-09-10 01:51:03,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-10 01:51:03,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-09-10 01:51:03,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-10 01:51:03,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2019-09-10 01:51:03,268 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 70 [2019-09-10 01:51:03,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:51:03,268 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2019-09-10 01:51:03,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 01:51:03,268 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2019-09-10 01:51:03,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 01:51:03,270 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:51:03,270 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:51:03,270 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:51:03,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:51:03,271 INFO L82 PathProgramCache]: Analyzing trace with hash 153476482, now seen corresponding path program 11 times [2019-09-10 01:51:03,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:51:03,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:03,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:51:03,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:03,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:51:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:51:03,737 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2019-09-10 01:51:03,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:03,737 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:51:03,737 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:51:03,738 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:51:03,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:03,738 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10 01:51:03,753 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:51:03,754 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:51:44,899 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-10 01:51:44,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:51:45,534 WARN L254 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 113 conjunts are in the unsatisfiable core [2019-09-10 01:51:45,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:51:45,664 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2019-09-10 01:51:45,665 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:51:47,926 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 286 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-09-10 01:51:47,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:51:47,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 36] total 61 [2019-09-10 01:51:47,932 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:51:47,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-10 01:51:47,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-10 01:51:47,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=3241, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 01:51:47,934 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand 27 states. [2019-09-10 01:51:49,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:51:49,028 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2019-09-10 01:51:49,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 01:51:49,029 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 76 [2019-09-10 01:51:49,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:51:49,030 INFO L225 Difference]: With dead ends: 52 [2019-09-10 01:51:49,030 INFO L226 Difference]: Without dead ends: 52 [2019-09-10 01:51:49,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 105 SyntacticMatches, 24 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=727, Invalid=4385, Unknown=0, NotChecked=0, Total=5112 [2019-09-10 01:51:49,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-10 01:51:49,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2019-09-10 01:51:49,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-10 01:51:49,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2019-09-10 01:51:49,036 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 76 [2019-09-10 01:51:49,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:51:49,037 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2019-09-10 01:51:49,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-10 01:51:49,037 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2019-09-10 01:51:49,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 01:51:49,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:51:49,039 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:51:49,039 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:51:49,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:51:49,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1587568480, now seen corresponding path program 12 times [2019-09-10 01:51:49,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:51:49,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:49,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:51:49,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:49,040 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:51:49,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:51:49,635 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2019-09-10 01:51:49,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:49,635 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:51:49,635 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:51:49,636 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:51:49,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:49,636 INFO 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-10 01:51:49,648 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:51:49,649 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:51:49,684 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:51:49,684 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:51:49,687 WARN L254 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 123 conjunts are in the unsatisfiable core [2019-09-10 01:51:49,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:51:49,845 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2019-09-10 01:51:49,846 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:51:52,351 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-10 01:51:52,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:51:52,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 39] total 66 [2019-09-10 01:51:52,361 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:51:52,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-10 01:51:52,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-10 01:51:52,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=480, Invalid=3810, Unknown=0, NotChecked=0, Total=4290 [2019-09-10 01:51:52,363 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand 29 states. [2019-09-10 01:51:53,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:51:53,580 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2019-09-10 01:51:53,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 01:51:53,580 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 82 [2019-09-10 01:51:53,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:51:53,582 INFO L225 Difference]: With dead ends: 55 [2019-09-10 01:51:53,582 INFO L226 Difference]: Without dead ends: 55 [2019-09-10 01:51:53,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 113 SyntacticMatches, 26 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=840, Invalid=5166, Unknown=0, NotChecked=0, Total=6006 [2019-09-10 01:51:53,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-10 01:51:53,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2019-09-10 01:51:53,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-10 01:51:53,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2019-09-10 01:51:53,588 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 82 [2019-09-10 01:51:53,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:51:53,589 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2019-09-10 01:51:53,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-10 01:51:53,589 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2019-09-10 01:51:53,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 01:51:53,591 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:51:53,591 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:51:53,591 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:51:53,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:51:53,592 INFO L82 PathProgramCache]: Analyzing trace with hash -50981570, now seen corresponding path program 13 times [2019-09-10 01:51:53,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:51:53,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:53,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:51:53,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:53,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:51:53,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:51:54,169 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2019-09-10 01:51:54,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:54,170 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:51:54,170 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:51:54,170 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:51:54,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:54,170 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:51:54,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:51:54,183 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:51:54,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:51:54,216 WARN L254 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 133 conjunts are in the unsatisfiable core [2019-09-10 01:51:54,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:51:54,323 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2019-09-10 01:51:54,323 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:51:57,402 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 0 proven. 403 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-09-10 01:51:57,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:51:57,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 42] total 71 [2019-09-10 01:51:57,405 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:51:57,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 01:51:57,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 01:51:57,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=545, Invalid=4425, Unknown=0, NotChecked=0, Total=4970 [2019-09-10 01:51:57,409 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand 31 states. [2019-09-10 01:51:58,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:51:58,862 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2019-09-10 01:51:58,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 01:51:58,863 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 88 [2019-09-10 01:51:58,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:51:58,865 INFO L225 Difference]: With dead ends: 58 [2019-09-10 01:51:58,865 INFO L226 Difference]: Without dead ends: 58 [2019-09-10 01:51:58,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 121 SyntacticMatches, 28 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=961, Invalid=6011, Unknown=0, NotChecked=0, Total=6972 [2019-09-10 01:51:58,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-10 01:51:58,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2019-09-10 01:51:58,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-10 01:51:58,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 69 transitions. [2019-09-10 01:51:58,880 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 69 transitions. Word has length 88 [2019-09-10 01:51:58,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:51:58,880 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 69 transitions. [2019-09-10 01:51:58,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 01:51:58,881 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2019-09-10 01:51:58,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 01:51:58,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:51:58,885 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:51:58,885 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:51:58,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:51:58,886 INFO L82 PathProgramCache]: Analyzing trace with hash -922870948, now seen corresponding path program 14 times [2019-09-10 01:51:58,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:51:58,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:58,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:51:58,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:58,890 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:51:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:51:59,644 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2019-09-10 01:51:59,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:59,645 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:51:59,645 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:51:59,645 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:51:59,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:59,645 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:51:59,660 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:51:59,660 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:54:15,873 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-10 01:54:15,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:54:16,269 WARN L254 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 143 conjunts are in the unsatisfiable core [2019-09-10 01:54:16,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:54:16,357 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2019-09-10 01:54:16,357 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:54:19,612 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 0 proven. 469 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-10 01:54:19,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:54:19,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 45] total 76 [2019-09-10 01:54:19,619 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:54:19,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-10 01:54:19,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-10 01:54:19,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=614, Invalid=5086, Unknown=0, NotChecked=0, Total=5700 [2019-09-10 01:54:19,631 INFO L87 Difference]: Start difference. First operand 56 states and 69 transitions. Second operand 33 states. [2019-09-10 01:54:21,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:54:21,276 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2019-09-10 01:54:21,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 01:54:21,277 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 94 [2019-09-10 01:54:21,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:54:21,278 INFO L225 Difference]: With dead ends: 61 [2019-09-10 01:54:21,278 INFO L226 Difference]: Without dead ends: 61 [2019-09-10 01:54:21,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 129 SyntacticMatches, 30 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1090, Invalid=6920, Unknown=0, NotChecked=0, Total=8010 [2019-09-10 01:54:21,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-10 01:54:21,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-09-10 01:54:21,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-10 01:54:21,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2019-09-10 01:54:21,289 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 94 [2019-09-10 01:54:21,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:54:21,290 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2019-09-10 01:54:21,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-10 01:54:21,290 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2019-09-10 01:54:21,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 01:54:21,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:54:21,291 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:54:21,292 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:54:21,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:54:21,292 INFO L82 PathProgramCache]: Analyzing trace with hash 124031738, now seen corresponding path program 15 times [2019-09-10 01:54:21,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:54:21,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:21,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:54:21,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:21,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:54:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:54:22,063 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2019-09-10 01:54:22,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:22,064 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:54:22,064 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:54:22,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:54:22,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:22,064 INFO 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-10 01:54:22,076 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:54:22,076 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:54:22,121 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:54:22,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:54:22,124 WARN L254 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 153 conjunts are in the unsatisfiable core [2019-09-10 01:54:22,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:54:22,218 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2019-09-10 01:54:22,218 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:54:26,211 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 0 proven. 540 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (16)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 01:54:26,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:54:26,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 48] total 81 [2019-09-10 01:54:26,215 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:54:26,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-10 01:54:26,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-10 01:54:26,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=687, Invalid=5793, Unknown=0, NotChecked=0, Total=6480 [2019-09-10 01:54:26,217 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. Second operand 35 states. [2019-09-10 01:54:27,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:54:27,977 INFO L93 Difference]: Finished difference Result 64 states and 80 transitions. [2019-09-10 01:54:27,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 01:54:27,978 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 100 [2019-09-10 01:54:27,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:54:27,979 INFO L225 Difference]: With dead ends: 64 [2019-09-10 01:54:27,979 INFO L226 Difference]: Without dead ends: 64 [2019-09-10 01:54:27,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 137 SyntacticMatches, 32 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 919 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1227, Invalid=7893, Unknown=0, NotChecked=0, Total=9120 [2019-09-10 01:54:27,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-10 01:54:27,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2019-09-10 01:54:27,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-10 01:54:27,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 77 transitions. [2019-09-10 01:54:27,986 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 77 transitions. Word has length 100 [2019-09-10 01:54:27,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:54:27,987 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 77 transitions. [2019-09-10 01:54:27,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-10 01:54:27,987 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 77 transitions. [2019-09-10 01:54:27,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 01:54:27,988 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:54:27,988 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:54:27,988 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:54:27,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:54:27,989 INFO L82 PathProgramCache]: Analyzing trace with hash 216947736, now seen corresponding path program 16 times [2019-09-10 01:54:27,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:54:27,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:27,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:54:27,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:27,990 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:54:28,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:54:28,929 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2019-09-10 01:54:28,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:28,930 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:54:28,930 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:54:28,930 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:54:28,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:28,930 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:54:28,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:54:28,940 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:54:28,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:54:28,980 WARN L254 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 163 conjunts are in the unsatisfiable core [2019-09-10 01:54:28,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:54:29,107 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2019-09-10 01:54:29,108 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:54:33,328 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 0 proven. 616 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-10 01:54:33,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:54:33,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 51] total 86 [2019-09-10 01:54:33,332 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:54:33,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-10 01:54:33,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-10 01:54:33,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=764, Invalid=6546, Unknown=0, NotChecked=0, Total=7310 [2019-09-10 01:54:33,334 INFO L87 Difference]: Start difference. First operand 62 states and 77 transitions. Second operand 37 states. [2019-09-10 01:54:35,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:54:35,319 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2019-09-10 01:54:35,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-10 01:54:35,320 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 106 [2019-09-10 01:54:35,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:54:35,321 INFO L225 Difference]: With dead ends: 67 [2019-09-10 01:54:35,322 INFO L226 Difference]: Without dead ends: 67 [2019-09-10 01:54:35,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 145 SyntacticMatches, 34 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1036 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1372, Invalid=8930, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 01:54:35,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-10 01:54:35,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2019-09-10 01:54:35,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-10 01:54:35,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 81 transitions. [2019-09-10 01:54:35,328 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 81 transitions. Word has length 106 [2019-09-10 01:54:35,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:54:35,328 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 81 transitions. [2019-09-10 01:54:35,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-10 01:54:35,328 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 81 transitions. [2019-09-10 01:54:35,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 01:54:35,329 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:54:35,330 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:54:35,330 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:54:35,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:54:35,330 INFO L82 PathProgramCache]: Analyzing trace with hash -13085002, now seen corresponding path program 17 times [2019-09-10 01:54:35,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:54:35,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:35,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:54:35,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:35,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:54:35,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:54:36,324 INFO L134 CoverageAnalysis]: Checked inductivity of 833 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-09-10 01:54:36,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:36,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:54:36,324 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:54:36,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:54:36,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:36,325 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:54:36,351 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:54:36,352 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-10 01:57:47,288 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-10 01:57:47,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:57:47,755 WARN L254 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 173 conjunts are in the unsatisfiable core [2019-09-10 01:57:47,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:57:47,919 INFO L134 CoverageAnalysis]: Checked inductivity of 833 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-09-10 01:57:47,919 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:57:52,459 INFO L134 CoverageAnalysis]: Checked inductivity of 833 backedges. 0 proven. 697 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-09-10 01:57:52,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:57:52,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 54] total 91 [2019-09-10 01:57:52,467 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:57:52,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-10 01:57:52,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-10 01:57:52,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=845, Invalid=7345, Unknown=0, NotChecked=0, Total=8190 [2019-09-10 01:57:52,469 INFO L87 Difference]: Start difference. First operand 65 states and 81 transitions. Second operand 39 states. [2019-09-10 01:57:54,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:57:54,650 INFO L93 Difference]: Finished difference Result 70 states and 88 transitions. [2019-09-10 01:57:54,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-10 01:57:54,650 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 112 [2019-09-10 01:57:54,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:57:54,652 INFO L225 Difference]: With dead ends: 70 [2019-09-10 01:57:54,653 INFO L226 Difference]: Without dead ends: 70 [2019-09-10 01:57:54,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 153 SyntacticMatches, 36 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1525, Invalid=10031, Unknown=0, NotChecked=0, Total=11556 [2019-09-10 01:57:54,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-10 01:57:54,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2019-09-10 01:57:54,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-10 01:57:54,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 85 transitions. [2019-09-10 01:57:54,658 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 85 transitions. Word has length 112 [2019-09-10 01:57:54,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:57:54,659 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 85 transitions. [2019-09-10 01:57:54,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-10 01:57:54,659 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 85 transitions. [2019-09-10 01:57:54,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 01:57:54,660 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:57:54,660 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:57:54,660 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:57:54,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:57:54,660 INFO L82 PathProgramCache]: Analyzing trace with hash -759733548, now seen corresponding path program 18 times [2019-09-10 01:57:54,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:57:54,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:57:54,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:57:54,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:57:54,663 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:57:54,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:57:55,597 INFO L134 CoverageAnalysis]: Checked inductivity of 936 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2019-09-10 01:57:55,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:57:55,598 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:57:55,598 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:57:55,598 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:57:55,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:57:55,598 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:57:55,608 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:57:55,609 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:57:55,656 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:57:55,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:57:55,660 WARN L254 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 183 conjunts are in the unsatisfiable core [2019-09-10 01:57:55,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:57:55,795 INFO L134 CoverageAnalysis]: Checked inductivity of 936 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2019-09-10 01:57:55,795 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:58:00,917 INFO L134 CoverageAnalysis]: Checked inductivity of 936 backedges. 0 proven. 783 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-09-10 01:58:00,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:58:00,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 57] total 96 [2019-09-10 01:58:00,925 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:58:00,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-10 01:58:00,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-10 01:58:00,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=930, Invalid=8190, Unknown=0, NotChecked=0, Total=9120 [2019-09-10 01:58:00,926 INFO L87 Difference]: Start difference. First operand 68 states and 85 transitions. Second operand 41 states. [2019-09-10 01:58:03,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:58:03,447 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2019-09-10 01:58:03,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-10 01:58:03,448 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 118 [2019-09-10 01:58:03,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:58:03,449 INFO L225 Difference]: With dead ends: 73 [2019-09-10 01:58:03,449 INFO L226 Difference]: Without dead ends: 73 [2019-09-10 01:58:03,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 161 SyntacticMatches, 38 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1291 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1686, Invalid=11196, Unknown=0, NotChecked=0, Total=12882 [2019-09-10 01:58:03,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-09-10 01:58:03,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2019-09-10 01:58:03,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-10 01:58:03,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 89 transitions. [2019-09-10 01:58:03,454 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 89 transitions. Word has length 118 [2019-09-10 01:58:03,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:58:03,454 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 89 transitions. [2019-09-10 01:58:03,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-10 01:58:03,454 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2019-09-10 01:58:03,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 01:58:03,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:58:03,456 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:58:03,456 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:58:03,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:58:03,456 INFO L82 PathProgramCache]: Analyzing trace with hash -927440782, now seen corresponding path program 19 times [2019-09-10 01:58:03,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:58:03,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:58:03,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:58:03,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:58:03,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:58:03,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:58:04,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1045 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2019-09-10 01:58:04,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:58:04,737 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:58:04,737 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:58:04,737 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:58:04,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:58:04,737 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:58:04,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:58:04,751 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:58:04,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:58:04,800 WARN L254 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 193 conjunts are in the unsatisfiable core [2019-09-10 01:58:04,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:58:04,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1045 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2019-09-10 01:58:04,936 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:58:10,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1045 backedges. 0 proven. 874 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-09-10 01:58:10,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:58:10,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 60] total 101 [2019-09-10 01:58:10,826 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:58:10,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-10 01:58:10,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-10 01:58:10,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1019, Invalid=9081, Unknown=0, NotChecked=0, Total=10100 [2019-09-10 01:58:10,828 INFO L87 Difference]: Start difference. First operand 71 states and 89 transitions. Second operand 43 states. [2019-09-10 01:58:13,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:58:13,527 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2019-09-10 01:58:13,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-10 01:58:13,527 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 124 [2019-09-10 01:58:13,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:58:13,529 INFO L225 Difference]: With dead ends: 76 [2019-09-10 01:58:13,529 INFO L226 Difference]: Without dead ends: 76 [2019-09-10 01:58:13,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 169 SyntacticMatches, 40 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1429 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=1855, Invalid=12425, Unknown=0, NotChecked=0, Total=14280 [2019-09-10 01:58:13,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-10 01:58:13,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2019-09-10 01:58:13,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-09-10 01:58:13,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2019-09-10 01:58:13,533 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 124 [2019-09-10 01:58:13,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:58:13,534 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2019-09-10 01:58:13,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-10 01:58:13,534 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2019-09-10 01:58:13,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 01:58:13,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:58:13,536 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:58:13,536 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:58:13,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:58:13,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1835020176, now seen corresponding path program 20 times [2019-09-10 01:58:13,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:58:13,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:58:13,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:58:13,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:58:13,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:58:13,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:58:15,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-09-10 01:58:15,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:58:15,015 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:58:15,015 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:58:15,015 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:58:15,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:58:15,015 INFO 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-10 01:58:15,026 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:58:15,027 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:01:02,393 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-10 02:01:02,393 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:01:02,742 WARN L254 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 203 conjunts are in the unsatisfiable core [2019-09-10 02:01:02,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:01:02,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-09-10 02:01:02,882 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:01:11,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 0 proven. 968 refuted. 2 times theorem prover too weak. 190 trivial. 0 not checked. [2019-09-10 02:01:11,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:01:11,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 63] total 106 [2019-09-10 02:01:11,655 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:01:11,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-10 02:01:11,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-10 02:01:11,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1112, Invalid=10017, Unknown=1, NotChecked=0, Total=11130 [2019-09-10 02:01:11,657 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand 45 states. [2019-09-10 02:01:14,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:01:14,623 INFO L93 Difference]: Finished difference Result 79 states and 100 transitions. [2019-09-10 02:01:14,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-10 02:01:14,626 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 130 [2019-09-10 02:01:14,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:01:14,627 INFO L225 Difference]: With dead ends: 79 [2019-09-10 02:01:14,627 INFO L226 Difference]: Without dead ends: 79 [2019-09-10 02:01:14,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 177 SyntacticMatches, 42 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1574 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=2032, Invalid=13717, Unknown=1, NotChecked=0, Total=15750 [2019-09-10 02:01:14,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-09-10 02:01:14,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2019-09-10 02:01:14,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-10 02:01:14,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 97 transitions. [2019-09-10 02:01:14,632 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 97 transitions. Word has length 130 [2019-09-10 02:01:14,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:01:14,633 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 97 transitions. [2019-09-10 02:01:14,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-10 02:01:14,633 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 97 transitions. [2019-09-10 02:01:14,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 02:01:14,634 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:01:14,634 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:01:14,635 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:01:14,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:01:14,635 INFO L82 PathProgramCache]: Analyzing trace with hash 363573294, now seen corresponding path program 21 times [2019-09-10 02:01:14,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:01:14,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:01:14,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:01:14,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:01:14,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:01:14,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:01:15,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-09-10 02:01:15,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:01:15,825 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:01:15,825 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:01:15,826 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:01:15,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:01:15,826 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:01:15,836 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:01:15,836 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:01:15,886 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:01:15,887 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:01:15,890 WARN L254 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 213 conjunts are in the unsatisfiable core [2019-09-10 02:01:15,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:01:16,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-09-10 02:01:16,064 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:01:22,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 0 proven. 1071 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-10 02:01:22,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:01:22,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 66] total 111 [2019-09-10 02:01:22,835 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:01:22,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-10 02:01:22,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-10 02:01:22,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1209, Invalid=11001, Unknown=0, NotChecked=0, Total=12210 [2019-09-10 02:01:22,837 INFO L87 Difference]: Start difference. First operand 77 states and 97 transitions. Second operand 47 states. [2019-09-10 02:01:26,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:01:26,068 INFO L93 Difference]: Finished difference Result 82 states and 104 transitions. [2019-09-10 02:01:26,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-10 02:01:26,069 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 136 [2019-09-10 02:01:26,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:01:26,071 INFO L225 Difference]: With dead ends: 82 [2019-09-10 02:01:26,071 INFO L226 Difference]: Without dead ends: 82 [2019-09-10 02:01:26,072 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 185 SyntacticMatches, 44 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1726 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=2217, Invalid=15075, Unknown=0, NotChecked=0, Total=17292 [2019-09-10 02:01:26,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-10 02:01:26,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2019-09-10 02:01:26,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-10 02:01:26,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 101 transitions. [2019-09-10 02:01:26,076 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 101 transitions. Word has length 136 [2019-09-10 02:01:26,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:01:26,077 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 101 transitions. [2019-09-10 02:01:26,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-10 02:01:26,077 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 101 transitions. [2019-09-10 02:01:26,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-10 02:01:26,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:01:26,078 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:01:26,078 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:01:26,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:01:26,079 INFO L82 PathProgramCache]: Analyzing trace with hash -579878324, now seen corresponding path program 22 times [2019-09-10 02:01:26,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:01:26,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:01:26,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:01:26,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:01:26,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:01:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:01:27,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1408 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2019-09-10 02:01:27,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:01:27,549 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:01:27,549 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:01:27,549 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:01:27,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:01:27,549 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10 02:01:27,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:01:27,559 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:01:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:01:27,608 WARN L254 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 223 conjunts are in the unsatisfiable core [2019-09-10 02:01:27,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:01:27,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1408 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2019-09-10 02:01:27,772 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:01:36,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1408 backedges. 0 proven. 1175 refuted. 2 times theorem prover too weak. 231 trivial. 0 not checked. [2019-09-10 02:01:36,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:01:36,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 69] total 116 [2019-09-10 02:01:36,907 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:01:36,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-10 02:01:36,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-10 02:01:36,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1310, Invalid=12029, Unknown=1, NotChecked=0, Total=13340 [2019-09-10 02:01:36,909 INFO L87 Difference]: Start difference. First operand 80 states and 101 transitions. Second operand 49 states. [2019-09-10 02:01:40,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:01:40,410 INFO L93 Difference]: Finished difference Result 85 states and 108 transitions. [2019-09-10 02:01:40,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-10 02:01:40,411 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 142 [2019-09-10 02:01:40,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:01:40,413 INFO L225 Difference]: With dead ends: 85 [2019-09-10 02:01:40,413 INFO L226 Difference]: Without dead ends: 85 [2019-09-10 02:01:40,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 193 SyntacticMatches, 46 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1885 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=2410, Invalid=16495, Unknown=1, NotChecked=0, Total=18906 [2019-09-10 02:01:40,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-09-10 02:01:40,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2019-09-10 02:01:40,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-10 02:01:40,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 105 transitions. [2019-09-10 02:01:40,419 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 105 transitions. Word has length 142 [2019-09-10 02:01:40,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:01:40,419 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 105 transitions. [2019-09-10 02:01:40,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-10 02:01:40,420 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 105 transitions. [2019-09-10 02:01:40,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 02:01:40,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:01:40,421 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:01:40,421 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:01:40,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:01:40,421 INFO L82 PathProgramCache]: Analyzing trace with hash 626607594, now seen corresponding path program 23 times [2019-09-10 02:01:40,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:01:40,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:01:40,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:01:40,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:01:40,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:01:40,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:01:42,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1541 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2019-09-10 02:01:42,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:01:42,269 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:01:42,269 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:01:42,269 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:01:42,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:01:42,269 INFO 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-10 02:01:42,281 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:01:42,281 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP)