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-lit/gr2006.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 20:54:25,735 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:54:25,737 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:54:25,748 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:54:25,749 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:54:25,750 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:54:25,751 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:54:25,753 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:54:25,755 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:54:25,755 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:54:25,756 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:54:25,757 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:54:25,758 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:54:25,759 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:54:25,760 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:54:25,761 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:54:25,761 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:54:25,762 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:54:25,764 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:54:25,766 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:54:25,772 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:54:25,773 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:54:25,774 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:54:25,775 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:54:25,778 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:54:25,779 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:54:25,779 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:54:25,781 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:54:25,781 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:54:25,782 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:54:25,782 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:54:25,784 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:54:25,786 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:54:25,786 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:54:25,789 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:54:25,790 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:54:25,790 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:54:25,790 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:54:25,791 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:54:25,793 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:54:25,794 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:54:25,795 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-03 20:54:25,823 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:54:25,823 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:54:25,824 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 20:54:25,825 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 20:54:25,825 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 20:54:25,825 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 20:54:25,826 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 20:54:25,826 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 20:54:25,826 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 20:54:25,826 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 20:54:25,828 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:54:25,828 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:54:25,829 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:54:25,829 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:54:25,829 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:54:25,829 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:54:25,830 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:54:25,830 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:54:25,830 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:54:25,831 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:54:25,831 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:54:25,831 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 20:54:25,831 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:54:25,831 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:54:25,832 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:54:25,832 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:54:25,832 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 20:54:25,832 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:54:25,832 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:54:25,833 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 20:54:25,882 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:54:25,902 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:54:25,907 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:54:25,908 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:54:25,909 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:54:25,910 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gr2006.i [2019-09-03 20:54:25,976 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1c20e821/8681f442c475489893da5c2deb317bc5/FLAGdc13bcf9b [2019-09-03 20:54:26,383 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:54:26,384 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gr2006.i [2019-09-03 20:54:26,390 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1c20e821/8681f442c475489893da5c2deb317bc5/FLAGdc13bcf9b [2019-09-03 20:54:26,759 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1c20e821/8681f442c475489893da5c2deb317bc5 [2019-09-03 20:54:26,768 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:54:26,770 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:54:26,773 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:54:26,773 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:54:26,776 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:54:26,777 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:54:26" (1/1) ... [2019-09-03 20:54:26,780 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51b70148 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:54:26, skipping insertion in model container [2019-09-03 20:54:26,780 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:54:26" (1/1) ... [2019-09-03 20:54:26,787 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:54:26,805 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:54:26,961 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:54:26,964 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:54:26,980 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:54:26,994 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:54:26,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:54:26 WrapperNode [2019-09-03 20:54:26,994 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:54:26,995 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:54:26,995 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:54:26,995 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:54:27,008 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:54:26" (1/1) ... [2019-09-03 20:54:27,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:54:26" (1/1) ... [2019-09-03 20:54:27,014 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:54:26" (1/1) ... [2019-09-03 20:54:27,014 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:54:26" (1/1) ... [2019-09-03 20:54:27,094 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:54:26" (1/1) ... [2019-09-03 20:54:27,103 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:54:26" (1/1) ... [2019-09-03 20:54:27,104 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:54:26" (1/1) ... [2019-09-03 20:54:27,105 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:54:27,106 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:54:27,106 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:54:27,106 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:54:27,107 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:54:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:54:27,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:54:27,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:54:27,158 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 20:54:27,158 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:54:27,158 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:54:27,158 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 20:54:27,158 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:54:27,159 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 20:54:27,159 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:54:27,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:54:27,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:54:27,332 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:54:27,332 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-03 20:54:27,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:54:27 BoogieIcfgContainer [2019-09-03 20:54:27,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:54:27,335 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:54:27,335 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:54:27,338 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:54:27,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:54:26" (1/3) ... [2019-09-03 20:54:27,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bf89b8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:54:27, skipping insertion in model container [2019-09-03 20:54:27,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:54:26" (2/3) ... [2019-09-03 20:54:27,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bf89b8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:54:27, skipping insertion in model container [2019-09-03 20:54:27,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:54:27" (3/3) ... [2019-09-03 20:54:27,341 INFO L109 eAbstractionObserver]: Analyzing ICFG gr2006.i [2019-09-03 20:54:27,350 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:54:27,357 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 20:54:27,373 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 20:54:27,398 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:54:27,399 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 20:54:27,399 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:54:27,399 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:54:27,399 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:54:27,399 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:54:27,400 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:54:27,400 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:54:27,412 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-09-03 20:54:27,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:54:27,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:27,420 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:27,422 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:27,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:27,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1001202113, now seen corresponding path program 1 times [2019-09-03 20:54:27,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:27,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:27,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:27,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:27,473 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:27,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:27,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:54:27,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 20:54:27,522 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:54:27,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 20:54:27,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 20:54:27,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:54:27,544 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2019-09-03 20:54:27,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:27,559 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2019-09-03 20:54:27,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 20:54:27,560 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-03 20:54:27,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:27,567 INFO L225 Difference]: With dead ends: 20 [2019-09-03 20:54:27,567 INFO L226 Difference]: Without dead ends: 13 [2019-09-03 20:54:27,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:54:27,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-09-03 20:54:27,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-09-03 20:54:27,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-03 20:54:27,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-09-03 20:54:27,596 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-09-03 20:54:27,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:27,596 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-09-03 20:54:27,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 20:54:27,597 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-09-03 20:54:27,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 20:54:27,597 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:27,598 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:27,598 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:27,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:27,598 INFO L82 PathProgramCache]: Analyzing trace with hash 563077882, now seen corresponding path program 1 times [2019-09-03 20:54:27,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:27,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:27,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:27,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:27,600 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:27,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:27,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:54:27,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:54:27,660 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:54:27,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:54:27,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:54:27,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:54:27,662 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 4 states. [2019-09-03 20:54:27,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:27,714 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2019-09-03 20:54:27,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:54:27,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-03 20:54:27,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:27,716 INFO L225 Difference]: With dead ends: 17 [2019-09-03 20:54:27,716 INFO L226 Difference]: Without dead ends: 17 [2019-09-03 20:54:27,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:54:27,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-03 20:54:27,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-03 20:54:27,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-03 20:54:27,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-09-03 20:54:27,727 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2019-09-03 20:54:27,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:27,727 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-09-03 20:54:27,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:54:27,728 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-09-03 20:54:27,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 20:54:27,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:27,729 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:27,729 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:27,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:27,730 INFO L82 PathProgramCache]: Analyzing trace with hash 620336184, now seen corresponding path program 1 times [2019-09-03 20:54:27,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:27,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:27,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:27,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:27,732 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:27,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:27,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:27,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:54:27,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:54:27,766 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:54:27,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:54:27,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:54:27,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:54:27,768 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 3 states. [2019-09-03 20:54:27,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:27,808 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-09-03 20:54:27,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:54:27,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-09-03 20:54:27,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:27,810 INFO L225 Difference]: With dead ends: 20 [2019-09-03 20:54:27,811 INFO L226 Difference]: Without dead ends: 20 [2019-09-03 20:54:27,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:54:27,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-03 20:54:27,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-09-03 20:54:27,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-03 20:54:27,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-09-03 20:54:27,816 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2019-09-03 20:54:27,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:27,817 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-09-03 20:54:27,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:54:27,817 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-09-03 20:54:27,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 20:54:27,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:27,818 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:27,819 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:27,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:27,819 INFO L82 PathProgramCache]: Analyzing trace with hash -657196198, now seen corresponding path program 1 times [2019-09-03 20:54:27,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:27,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:27,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:27,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:27,821 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:27,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:27,852 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 20:54:27,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:27,853 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:27,854 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2019-09-03 20:54:27,856 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [16], [18], [22], [24], [31], [34], [36], [42], [43], [44], [46] [2019-09-03 20:54:27,885 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:54:27,885 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:54:28,007 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:54:28,010 INFO L272 AbstractInterpreter]: Visited 14 different actions 73 times. Merged at 5 different actions 32 times. Widened at 1 different actions 5 times. Performed 197 root evaluator evaluations with a maximum evaluation depth of 4. Performed 197 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 10 fixpoints after 3 different actions. Largest state had 5 variables. [2019-09-03 20:54:28,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:28,015 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:54:28,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:28,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 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:28,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:28,035 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:54:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:28,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-03 20:54:28,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:28,079 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 20:54:28,079 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:28,120 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 20:54:28,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:28,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-09-03 20:54:28,128 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:28,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:54:28,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:54:28,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:54:28,129 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 4 states. [2019-09-03 20:54:28,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:28,153 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2019-09-03 20:54:28,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:54:28,154 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-09-03 20:54:28,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:28,155 INFO L225 Difference]: With dead ends: 23 [2019-09-03 20:54:28,155 INFO L226 Difference]: Without dead ends: 23 [2019-09-03 20:54:28,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:54:28,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-03 20:54:28,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-09-03 20:54:28,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-03 20:54:28,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-09-03 20:54:28,160 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 18 [2019-09-03 20:54:28,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:28,160 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-09-03 20:54:28,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:54:28,161 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-09-03 20:54:28,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-03 20:54:28,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:28,162 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:28,162 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:28,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:28,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1550672957, now seen corresponding path program 2 times [2019-09-03 20:54:28,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:28,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:28,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:28,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:28,164 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:28,246 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 20:54:28,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:28,247 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:28,247 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:28,247 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:28,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:28,247 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:54:28,264 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:54:28,264 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:28,292 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 20:54:28,292 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:28,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 20:54:28,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:28,317 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:28,318 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:28,404 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:28,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:28,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10 [2019-09-03 20:54:28,409 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:28,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:54:28,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:54:28,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:54:28,410 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 6 states. [2019-09-03 20:54:28,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:28,439 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2019-09-03 20:54:28,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:54:28,440 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-09-03 20:54:28,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:28,441 INFO L225 Difference]: With dead ends: 29 [2019-09-03 20:54:28,441 INFO L226 Difference]: Without dead ends: 29 [2019-09-03 20:54:28,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:54:28,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-03 20:54:28,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-09-03 20:54:28,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-03 20:54:28,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-09-03 20:54:28,446 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 21 [2019-09-03 20:54:28,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:28,447 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-09-03 20:54:28,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:54:28,447 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-09-03 20:54:28,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-03 20:54:28,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:28,448 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:28,449 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:28,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:28,449 INFO L82 PathProgramCache]: Analyzing trace with hash -755753187, now seen corresponding path program 3 times [2019-09-03 20:54:28,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:28,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:28,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:28,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:28,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:28,531 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 20:54:28,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:28,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:28,532 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:28,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:28,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:28,533 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:54:28,554 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:54:28,554 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:28,576 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:54:28,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:28,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-03 20:54:28,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:28,605 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 20:54:28,606 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:28,688 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 20:54:28,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:28,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2019-09-03 20:54:28,692 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:28,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:54:28,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:54:28,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:54:28,694 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 7 states. [2019-09-03 20:54:28,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:28,733 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2019-09-03 20:54:28,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:54:28,734 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-09-03 20:54:28,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:28,735 INFO L225 Difference]: With dead ends: 32 [2019-09-03 20:54:28,735 INFO L226 Difference]: Without dead ends: 32 [2019-09-03 20:54:28,735 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:54:28,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-03 20:54:28,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-09-03 20:54:28,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-03 20:54:28,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-09-03 20:54:28,740 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2019-09-03 20:54:28,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:28,740 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-09-03 20:54:28,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:54:28,740 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-09-03 20:54:28,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-03 20:54:28,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:28,741 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:28,742 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:28,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:28,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1097923174, now seen corresponding path program 4 times [2019-09-03 20:54:28,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:28,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:28,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:28,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:28,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:28,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:28,809 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 22 proven. 40 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 20:54:28,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:28,810 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:28,810 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:28,810 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:28,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:28,810 INFO 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-03 20:54:28,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:28,823 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-03 20:54:28,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:28,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-03 20:54:28,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:28,848 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 22 proven. 40 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 20:54:28,849 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:28,978 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 22 proven. 40 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:54:28,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:28,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2019-09-03 20:54:28,982 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:28,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 20:54:28,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 20:54:28,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-03 20:54:28,984 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 8 states. [2019-09-03 20:54:29,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:29,027 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2019-09-03 20:54:29,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:54:29,027 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-09-03 20:54:29,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:29,028 INFO L225 Difference]: With dead ends: 35 [2019-09-03 20:54:29,028 INFO L226 Difference]: Without dead ends: 35 [2019-09-03 20:54:29,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-03 20:54:29,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-03 20:54:29,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-09-03 20:54:29,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-03 20:54:29,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2019-09-03 20:54:29,033 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 30 [2019-09-03 20:54:29,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:29,033 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2019-09-03 20:54:29,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 20:54:29,033 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2019-09-03 20:54:29,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-03 20:54:29,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:29,035 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:29,035 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:29,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:29,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1568354813, now seen corresponding path program 5 times [2019-09-03 20:54:29,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:29,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:29,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:29,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:29,036 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:29,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:29,117 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 26 proven. 57 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 20:54:29,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:29,117 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:29,117 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:29,117 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:29,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:29,118 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:54:29,141 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:54:29,141 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:29,167 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-03 20:54:29,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:29,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-03 20:54:29,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:29,211 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 57 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-03 20:54:29,212 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:29,263 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 57 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-03 20:54:29,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:29,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 12 [2019-09-03 20:54:29,267 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:29,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 20:54:29,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 20:54:29,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:54:29,270 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 12 states. [2019-09-03 20:54:29,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:29,426 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-09-03 20:54:29,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 20:54:29,429 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-09-03 20:54:29,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:29,430 INFO L225 Difference]: With dead ends: 45 [2019-09-03 20:54:29,430 INFO L226 Difference]: Without dead ends: 45 [2019-09-03 20:54:29,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=275, Unknown=0, NotChecked=0, Total=420 [2019-09-03 20:54:29,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-03 20:54:29,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2019-09-03 20:54:29,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-03 20:54:29,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2019-09-03 20:54:29,439 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 33 [2019-09-03 20:54:29,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:29,443 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2019-09-03 20:54:29,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 20:54:29,443 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2019-09-03 20:54:29,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-03 20:54:29,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:29,444 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:29,444 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:29,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:29,445 INFO L82 PathProgramCache]: Analyzing trace with hash 801367963, now seen corresponding path program 6 times [2019-09-03 20:54:29,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:29,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:29,446 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:29,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:29,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:29,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:29,580 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 53 proven. 77 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-03 20:54:29,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:29,581 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:29,581 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:29,581 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:29,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:29,581 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:29,598 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:54:29,598 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:54:29,620 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:54:29,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:29,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 20:54:29,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:29,643 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 53 proven. 77 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-03 20:54:29,643 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:29,790 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 53 proven. 77 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-03 20:54:29,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:29,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2019-09-03 20:54:29,794 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:29,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 20:54:29,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 20:54:29,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-03 20:54:29,795 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 10 states. [2019-09-03 20:54:29,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:29,831 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2019-09-03 20:54:29,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 20:54:29,832 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2019-09-03 20:54:29,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:29,833 INFO L225 Difference]: With dead ends: 44 [2019-09-03 20:54:29,834 INFO L226 Difference]: Without dead ends: 44 [2019-09-03 20:54:29,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-03 20:54:29,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-03 20:54:29,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-09-03 20:54:29,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-03 20:54:29,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-09-03 20:54:29,839 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 39 [2019-09-03 20:54:29,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:29,840 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-09-03 20:54:29,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 20:54:29,840 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-09-03 20:54:29,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-03 20:54:29,841 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:29,841 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:29,841 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:29,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:29,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1305478504, now seen corresponding path program 7 times [2019-09-03 20:54:29,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:29,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:29,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:29,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:29,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:29,936 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 60 proven. 100 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-03 20:54:29,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:29,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:29,936 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:29,936 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:29,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:29,937 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:29,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:29,964 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:54:29,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:29,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 20:54:29,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:29,991 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 60 proven. 100 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-03 20:54:29,991 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:30,122 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 60 proven. 100 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-03 20:54:30,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:30,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2019-09-03 20:54:30,126 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:30,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 20:54:30,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 20:54:30,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-03 20:54:30,128 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 11 states. [2019-09-03 20:54:30,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:30,168 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2019-09-03 20:54:30,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 20:54:30,169 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2019-09-03 20:54:30,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:30,170 INFO L225 Difference]: With dead ends: 47 [2019-09-03 20:54:30,170 INFO L226 Difference]: Without dead ends: 47 [2019-09-03 20:54:30,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-03 20:54:30,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-03 20:54:30,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-09-03 20:54:30,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-03 20:54:30,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2019-09-03 20:54:30,178 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 42 [2019-09-03 20:54:30,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:30,179 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2019-09-03 20:54:30,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 20:54:30,179 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2019-09-03 20:54:30,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-03 20:54:30,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:30,187 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:30,187 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:30,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:30,187 INFO L82 PathProgramCache]: Analyzing trace with hash 283486843, now seen corresponding path program 8 times [2019-09-03 20:54:30,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:30,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:30,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:30,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:30,189 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:30,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:30,326 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 67 proven. 126 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-03 20:54:30,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:30,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:30,327 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:30,327 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:30,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:30,328 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:30,340 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:54:30,340 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:54:30,365 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-03 20:54:30,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:30,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 20:54:30,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:30,423 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 130 proven. 17 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-03 20:54:30,423 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:30,489 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 130 proven. 17 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-03 20:54:30,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:30,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 16 [2019-09-03 20:54:30,494 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:30,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 20:54:30,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 20:54:30,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2019-09-03 20:54:30,495 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 16 states. [2019-09-03 20:54:30,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:30,717 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2019-09-03 20:54:30,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 20:54:30,718 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 45 [2019-09-03 20:54:30,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:30,720 INFO L225 Difference]: With dead ends: 60 [2019-09-03 20:54:30,720 INFO L226 Difference]: Without dead ends: 60 [2019-09-03 20:54:30,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 81 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2019-09-03 20:54:30,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-03 20:54:30,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2019-09-03 20:54:30,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-03 20:54:30,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-09-03 20:54:30,725 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 45 [2019-09-03 20:54:30,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:30,726 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-09-03 20:54:30,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 20:54:30,726 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-09-03 20:54:30,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-03 20:54:30,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:30,727 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:30,727 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:30,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:30,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1264097757, now seen corresponding path program 9 times [2019-09-03 20:54:30,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:30,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:30,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:30,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:30,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:30,829 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 106 proven. 155 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:54:30,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:30,829 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:30,829 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:30,830 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:30,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:30,830 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:30,853 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:54:30,853 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:54:30,871 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:54:30,871 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:30,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 20:54:30,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:30,884 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 106 proven. 155 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:54:30,884 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:31,081 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 106 proven. 155 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:54:31,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:31,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2019-09-03 20:54:31,084 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:31,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 20:54:31,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 20:54:31,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-03 20:54:31,086 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 13 states. [2019-09-03 20:54:31,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:31,127 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2019-09-03 20:54:31,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 20:54:31,127 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 51 [2019-09-03 20:54:31,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:31,128 INFO L225 Difference]: With dead ends: 56 [2019-09-03 20:54:31,128 INFO L226 Difference]: Without dead ends: 56 [2019-09-03 20:54:31,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-03 20:54:31,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-03 20:54:31,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-09-03 20:54:31,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-03 20:54:31,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-09-03 20:54:31,133 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 51 [2019-09-03 20:54:31,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:31,133 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-09-03 20:54:31,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 20:54:31,133 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-09-03 20:54:31,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-03 20:54:31,136 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:31,136 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 11, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:31,137 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:31,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:31,137 INFO L82 PathProgramCache]: Analyzing trace with hash 2042042714, now seen corresponding path program 10 times [2019-09-03 20:54:31,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:31,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:31,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:31,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:31,139 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:31,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:31,277 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 116 proven. 187 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:54:31,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:31,278 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:31,278 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:31,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:31,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:31,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:31,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:31,295 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:54:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:31,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 20:54:31,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:31,341 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 116 proven. 187 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:54:31,342 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:31,602 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 116 proven. 187 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:54:31,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:31,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 26 [2019-09-03 20:54:31,607 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:31,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 20:54:31,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 20:54:31,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-03 20:54:31,609 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 14 states. [2019-09-03 20:54:31,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:31,663 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2019-09-03 20:54:31,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 20:54:31,664 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2019-09-03 20:54:31,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:31,665 INFO L225 Difference]: With dead ends: 59 [2019-09-03 20:54:31,665 INFO L226 Difference]: Without dead ends: 59 [2019-09-03 20:54:31,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-03 20:54:31,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-03 20:54:31,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-09-03 20:54:31,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-03 20:54:31,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-09-03 20:54:31,670 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 54 [2019-09-03 20:54:31,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:31,670 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2019-09-03 20:54:31,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 20:54:31,671 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2019-09-03 20:54:31,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-03 20:54:31,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:31,672 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 12, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:31,672 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:31,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:31,672 INFO L82 PathProgramCache]: Analyzing trace with hash -2138239811, now seen corresponding path program 11 times [2019-09-03 20:54:31,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:31,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:31,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:31,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:31,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:31,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:31,788 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 126 proven. 222 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:54:31,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:31,788 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:31,789 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:31,789 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:31,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:31,789 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:31,798 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:54:31,798 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:54:31,819 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-03 20:54:31,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:31,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 20:54:31,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:31,891 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 233 proven. 34 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-09-03 20:54:31,891 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:31,979 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 233 proven. 34 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-09-03 20:54:31,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:31,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7, 7] total 20 [2019-09-03 20:54:31,982 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:31,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 20:54:31,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 20:54:31,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2019-09-03 20:54:31,984 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 20 states. [2019-09-03 20:54:32,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:32,244 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2019-09-03 20:54:32,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 20:54:32,244 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 57 [2019-09-03 20:54:32,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:32,245 INFO L225 Difference]: With dead ends: 75 [2019-09-03 20:54:32,245 INFO L226 Difference]: Without dead ends: 75 [2019-09-03 20:54:32,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 102 SyntacticMatches, 8 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=417, Invalid=915, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 20:54:32,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-03 20:54:32,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 64. [2019-09-03 20:54:32,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-03 20:54:32,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2019-09-03 20:54:32,251 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 57 [2019-09-03 20:54:32,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:32,251 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2019-09-03 20:54:32,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 20:54:32,252 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2019-09-03 20:54:32,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-03 20:54:32,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:32,253 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 13, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:32,253 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:32,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:32,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1471912923, now seen corresponding path program 12 times [2019-09-03 20:54:32,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:32,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:32,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:32,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:32,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:32,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:32,390 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 177 proven. 260 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-03 20:54:32,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:32,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:32,390 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:32,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:32,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:32,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:32,401 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:54:32,401 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:54:32,431 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:54:32,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:32,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 20:54:32,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:32,447 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 177 proven. 260 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-03 20:54:32,448 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:32,746 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 177 proven. 260 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-03 20:54:32,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:32,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2019-09-03 20:54:32,749 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:32,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 20:54:32,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 20:54:32,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-03 20:54:32,750 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 16 states. [2019-09-03 20:54:32,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:32,812 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2019-09-03 20:54:32,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 20:54:32,813 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 63 [2019-09-03 20:54:32,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:32,814 INFO L225 Difference]: With dead ends: 68 [2019-09-03 20:54:32,814 INFO L226 Difference]: Without dead ends: 68 [2019-09-03 20:54:32,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-03 20:54:32,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-03 20:54:32,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-09-03 20:54:32,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-03 20:54:32,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2019-09-03 20:54:32,819 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 63 [2019-09-03 20:54:32,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:32,820 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2019-09-03 20:54:32,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 20:54:32,820 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2019-09-03 20:54:32,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-03 20:54:32,821 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:32,821 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 14, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:32,821 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:32,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:32,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1598932952, now seen corresponding path program 13 times [2019-09-03 20:54:32,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:32,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:32,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:32,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:32,822 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:32,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:32,955 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 190 proven. 301 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-03 20:54:32,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:32,956 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:32,956 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:32,956 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:32,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:32,956 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:32,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:32,968 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:54:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:33,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 20:54:33,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:33,016 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 190 proven. 301 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-03 20:54:33,017 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:33,302 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 190 proven. 301 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-03 20:54:33,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:33,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2019-09-03 20:54:33,306 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:33,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 20:54:33,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 20:54:33,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-03 20:54:33,307 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 17 states. [2019-09-03 20:54:33,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:33,366 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2019-09-03 20:54:33,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 20:54:33,366 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-09-03 20:54:33,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:33,367 INFO L225 Difference]: With dead ends: 71 [2019-09-03 20:54:33,367 INFO L226 Difference]: Without dead ends: 71 [2019-09-03 20:54:33,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-03 20:54:33,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-03 20:54:33,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-09-03 20:54:33,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-03 20:54:33,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2019-09-03 20:54:33,373 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 66 [2019-09-03 20:54:33,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:33,373 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2019-09-03 20:54:33,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 20:54:33,373 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2019-09-03 20:54:33,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-03 20:54:33,374 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:33,374 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 15, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:33,375 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:33,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:33,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1786429115, now seen corresponding path program 14 times [2019-09-03 20:54:33,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:33,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:33,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:33,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:33,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:33,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:33,525 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 203 proven. 345 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-03 20:54:33,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:33,526 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:33,526 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:33,526 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:33,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:33,526 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:33,553 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:54:33,554 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:54:33,578 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-03 20:54:33,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:33,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 20:54:33,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:33,665 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 366 proven. 57 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-09-03 20:54:33,665 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:33,779 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 366 proven. 57 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-09-03 20:54:33,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:33,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8, 8] total 24 [2019-09-03 20:54:33,783 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:33,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 20:54:33,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 20:54:33,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-09-03 20:54:33,784 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand 24 states. [2019-09-03 20:54:34,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:34,144 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2019-09-03 20:54:34,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 20:54:34,144 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 69 [2019-09-03 20:54:34,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:34,145 INFO L225 Difference]: With dead ends: 90 [2019-09-03 20:54:34,145 INFO L226 Difference]: Without dead ends: 90 [2019-09-03 20:54:34,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 123 SyntacticMatches, 10 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=604, Invalid=1376, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 20:54:34,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-03 20:54:34,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 76. [2019-09-03 20:54:34,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-03 20:54:34,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2019-09-03 20:54:34,150 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 69 [2019-09-03 20:54:34,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:34,150 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2019-09-03 20:54:34,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 20:54:34,150 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2019-09-03 20:54:34,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-03 20:54:34,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:34,151 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 16, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:34,151 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:34,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:34,152 INFO L82 PathProgramCache]: Analyzing trace with hash 679355549, now seen corresponding path program 15 times [2019-09-03 20:54:34,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:34,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:34,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:34,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:34,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:34,334 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 266 proven. 392 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-03 20:54:34,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:34,335 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:34,335 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:34,335 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:34,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:34,335 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:54:34,364 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:54:34,365 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:34,394 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:54:34,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:34,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 20:54:34,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:34,412 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 266 proven. 392 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-03 20:54:34,413 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:34,896 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 266 proven. 392 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-03 20:54:34,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:34,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 36 [2019-09-03 20:54:34,902 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:34,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 20:54:34,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 20:54:34,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 20:54:34,904 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 19 states. [2019-09-03 20:54:34,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:34,951 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2019-09-03 20:54:34,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 20:54:34,951 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 75 [2019-09-03 20:54:34,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:34,952 INFO L225 Difference]: With dead ends: 80 [2019-09-03 20:54:34,952 INFO L226 Difference]: Without dead ends: 80 [2019-09-03 20:54:34,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 20:54:34,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-03 20:54:34,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-09-03 20:54:34,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-03 20:54:34,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2019-09-03 20:54:34,957 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 75 [2019-09-03 20:54:34,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:34,957 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2019-09-03 20:54:34,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 20:54:34,957 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2019-09-03 20:54:34,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-03 20:54:34,958 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:34,958 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 17, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:34,959 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:34,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:34,959 INFO L82 PathProgramCache]: Analyzing trace with hash 514145562, now seen corresponding path program 16 times [2019-09-03 20:54:34,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:34,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:34,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:34,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:34,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:35,130 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 282 proven. 442 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-03 20:54:35,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:35,130 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:35,130 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:35,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:35,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:35,131 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:35,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:35,141 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:54:35,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:35,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-03 20:54:35,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:35,184 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 282 proven. 442 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-03 20:54:35,185 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:35,591 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 282 proven. 442 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-03 20:54:35,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:35,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 38 [2019-09-03 20:54:35,596 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:35,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 20:54:35,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 20:54:35,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 20:54:35,598 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 20 states. [2019-09-03 20:54:35,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:35,642 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2019-09-03 20:54:35,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 20:54:35,642 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 78 [2019-09-03 20:54:35,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:35,643 INFO L225 Difference]: With dead ends: 83 [2019-09-03 20:54:35,643 INFO L226 Difference]: Without dead ends: 83 [2019-09-03 20:54:35,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 20:54:35,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-09-03 20:54:35,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2019-09-03 20:54:35,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-03 20:54:35,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2019-09-03 20:54:35,648 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 78 [2019-09-03 20:54:35,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:35,648 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2019-09-03 20:54:35,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 20:54:35,648 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2019-09-03 20:54:35,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-03 20:54:35,649 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:35,649 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 18, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:35,649 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:35,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:35,650 INFO L82 PathProgramCache]: Analyzing trace with hash 775944061, now seen corresponding path program 17 times [2019-09-03 20:54:35,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:35,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:35,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:35,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:35,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:35,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:35,901 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 298 proven. 495 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-03 20:54:35,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:35,901 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:35,902 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:35,902 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:35,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:35,902 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:54:35,918 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:54:35,918 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:35,949 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-03 20:54:35,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:35,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 20:54:35,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:36,062 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 529 proven. 86 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2019-09-03 20:54:36,063 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:36,231 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 529 proven. 86 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2019-09-03 20:54:36,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:36,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 9, 9] total 28 [2019-09-03 20:54:36,234 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:36,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 20:54:36,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 20:54:36,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=511, Unknown=0, NotChecked=0, Total=756 [2019-09-03 20:54:36,235 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand 28 states. [2019-09-03 20:54:36,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:36,620 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2019-09-03 20:54:36,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-03 20:54:36,621 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 81 [2019-09-03 20:54:36,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:36,622 INFO L225 Difference]: With dead ends: 105 [2019-09-03 20:54:36,622 INFO L226 Difference]: Without dead ends: 105 [2019-09-03 20:54:36,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 144 SyntacticMatches, 12 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=825, Invalid=1931, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 20:54:36,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-09-03 20:54:36,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 88. [2019-09-03 20:54:36,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-03 20:54:36,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2019-09-03 20:54:36,627 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 81 [2019-09-03 20:54:36,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:36,627 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2019-09-03 20:54:36,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 20:54:36,628 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2019-09-03 20:54:36,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-03 20:54:36,628 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:36,629 INFO L399 BasicCegarLoop]: trace histogram [26, 25, 19, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:36,629 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:36,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:36,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1028866075, now seen corresponding path program 18 times [2019-09-03 20:54:36,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:36,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:36,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:36,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:36,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:36,842 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 373 proven. 551 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-03 20:54:36,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:36,842 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:36,842 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:36,843 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:36,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:36,843 INFO 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-03 20:54:36,858 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:54:36,858 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:54:36,897 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:54:36,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:36,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 20:54:36,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:36,913 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 373 proven. 551 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-03 20:54:36,913 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:37,410 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 373 proven. 551 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-03 20:54:37,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:37,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 42 [2019-09-03 20:54:37,413 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:37,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 20:54:37,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 20:54:37,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 20:54:37,415 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 22 states. [2019-09-03 20:54:37,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:37,500 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2019-09-03 20:54:37,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-03 20:54:37,501 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 87 [2019-09-03 20:54:37,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:37,502 INFO L225 Difference]: With dead ends: 92 [2019-09-03 20:54:37,502 INFO L226 Difference]: Without dead ends: 92 [2019-09-03 20:54:37,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 20:54:37,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-09-03 20:54:37,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-09-03 20:54:37,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-03 20:54:37,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2019-09-03 20:54:37,507 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 87 [2019-09-03 20:54:37,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:37,507 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2019-09-03 20:54:37,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 20:54:37,507 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2019-09-03 20:54:37,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-03 20:54:37,508 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:37,508 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 20, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:37,508 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:37,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:37,509 INFO L82 PathProgramCache]: Analyzing trace with hash -275741416, now seen corresponding path program 19 times [2019-09-03 20:54:37,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:37,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:37,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:37,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:37,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:37,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:37,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 392 proven. 610 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-03 20:54:37,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:37,777 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:37,777 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:37,777 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:37,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:37,777 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:37,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:37,804 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:54:37,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:37,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 20:54:37,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:37,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 392 proven. 610 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-03 20:54:37,855 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:38,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 392 proven. 610 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-03 20:54:38,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:38,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 44 [2019-09-03 20:54:38,438 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:38,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 20:54:38,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 20:54:38,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 20:54:38,439 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand 23 states. [2019-09-03 20:54:38,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:38,509 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2019-09-03 20:54:38,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 20:54:38,511 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 90 [2019-09-03 20:54:38,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:38,513 INFO L225 Difference]: With dead ends: 95 [2019-09-03 20:54:38,513 INFO L226 Difference]: Without dead ends: 95 [2019-09-03 20:54:38,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 20:54:38,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-09-03 20:54:38,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-09-03 20:54:38,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-09-03 20:54:38,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2019-09-03 20:54:38,516 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 90 [2019-09-03 20:54:38,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:38,516 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2019-09-03 20:54:38,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 20:54:38,516 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2019-09-03 20:54:38,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-03 20:54:38,517 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:38,517 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 21, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:38,518 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:38,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:38,518 INFO L82 PathProgramCache]: Analyzing trace with hash -678444293, now seen corresponding path program 20 times [2019-09-03 20:54:38,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:38,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:38,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:38,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:38,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:38,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:38,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 411 proven. 672 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-03 20:54:38,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:38,754 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:38,754 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:38,754 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:38,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:38,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:38,772 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:54:38,772 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:54:38,815 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-03 20:54:38,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:38,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 20:54:38,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:38,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 722 proven. 121 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2019-09-03 20:54:38,940 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:39,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 722 proven. 121 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2019-09-03 20:54:39,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:39,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 10, 10] total 32 [2019-09-03 20:54:39,134 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:39,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 20:54:39,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 20:54:39,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=672, Unknown=0, NotChecked=0, Total=992 [2019-09-03 20:54:39,135 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand 32 states. [2019-09-03 20:54:39,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:39,620 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2019-09-03 20:54:39,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 20:54:39,621 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 93 [2019-09-03 20:54:39,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:39,623 INFO L225 Difference]: With dead ends: 120 [2019-09-03 20:54:39,623 INFO L226 Difference]: Without dead ends: 120 [2019-09-03 20:54:39,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 165 SyntacticMatches, 14 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1080, Invalid=2580, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 20:54:39,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-03 20:54:39,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 100. [2019-09-03 20:54:39,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-03 20:54:39,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2019-09-03 20:54:39,628 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 93 [2019-09-03 20:54:39,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:39,628 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2019-09-03 20:54:39,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 20:54:39,628 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2019-09-03 20:54:39,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-03 20:54:39,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:39,629 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 22, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:39,629 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:39,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:39,630 INFO L82 PathProgramCache]: Analyzing trace with hash 2063122269, now seen corresponding path program 21 times [2019-09-03 20:54:39,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:39,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:39,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:39,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:39,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:39,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:39,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 498 proven. 737 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-03 20:54:39,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:39,920 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:39,920 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:39,920 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:39,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:39,921 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:39,930 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:54:39,931 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:54:39,972 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:54:39,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:39,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 20:54:39,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:39,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 498 proven. 737 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-03 20:54:39,989 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:40,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 498 proven. 737 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-03 20:54:40,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:40,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2019-09-03 20:54:40,561 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:40,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 20:54:40,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 20:54:40,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 20:54:40,563 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 25 states. [2019-09-03 20:54:40,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:40,637 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2019-09-03 20:54:40,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 20:54:40,637 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 99 [2019-09-03 20:54:40,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:40,638 INFO L225 Difference]: With dead ends: 104 [2019-09-03 20:54:40,639 INFO L226 Difference]: Without dead ends: 104 [2019-09-03 20:54:40,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 20:54:40,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-03 20:54:40,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-09-03 20:54:40,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-03 20:54:40,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-09-03 20:54:40,643 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 99 [2019-09-03 20:54:40,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:40,644 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-09-03 20:54:40,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 20:54:40,644 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-09-03 20:54:40,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-03 20:54:40,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:40,645 INFO L399 BasicCegarLoop]: trace histogram [31, 30, 23, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:40,645 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:40,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:40,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1055748314, now seen corresponding path program 22 times [2019-09-03 20:54:40,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:40,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:40,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:40,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:40,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:40,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:40,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 520 proven. 805 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-03 20:54:40,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:40,923 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:40,923 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:40,923 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:40,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:40,924 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:40,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:40,934 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:54:40,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:40,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-03 20:54:40,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:40,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 520 proven. 805 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-03 20:54:40,999 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:41,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 520 proven. 805 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-03 20:54:41,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:41,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 50 [2019-09-03 20:54:41,656 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:41,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 20:54:41,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 20:54:41,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 20:54:41,658 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 26 states. [2019-09-03 20:54:41,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:41,744 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2019-09-03 20:54:41,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 20:54:41,744 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 102 [2019-09-03 20:54:41,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:41,745 INFO L225 Difference]: With dead ends: 107 [2019-09-03 20:54:41,745 INFO L226 Difference]: Without dead ends: 107 [2019-09-03 20:54:41,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 20:54:41,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-03 20:54:41,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-09-03 20:54:41,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-09-03 20:54:41,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2019-09-03 20:54:41,749 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 102 [2019-09-03 20:54:41,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:41,749 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2019-09-03 20:54:41,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 20:54:41,750 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2019-09-03 20:54:41,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-03 20:54:41,750 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:41,750 INFO L399 BasicCegarLoop]: trace histogram [32, 31, 24, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:41,750 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:41,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:41,751 INFO L82 PathProgramCache]: Analyzing trace with hash -685247939, now seen corresponding path program 23 times [2019-09-03 20:54:41,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:41,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:41,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:41,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:41,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:41,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:42,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 542 proven. 876 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-03 20:54:42,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:42,049 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:42,049 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:42,049 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:42,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:42,049 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:42,060 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:54:42,060 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:54:42,104 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-09-03 20:54:42,105 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:42,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 20:54:42,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:42,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 945 proven. 162 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2019-09-03 20:54:42,291 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:42,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 945 proven. 162 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2019-09-03 20:54:42,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:42,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 11, 11] total 36 [2019-09-03 20:54:42,524 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:42,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 20:54:42,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 20:54:42,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=405, Invalid=855, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 20:54:42,526 INFO L87 Difference]: Start difference. First operand 106 states and 114 transitions. Second operand 36 states. [2019-09-03 20:54:43,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:43,068 INFO L93 Difference]: Finished difference Result 135 states and 151 transitions. [2019-09-03 20:54:43,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-03 20:54:43,069 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 105 [2019-09-03 20:54:43,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:43,071 INFO L225 Difference]: With dead ends: 135 [2019-09-03 20:54:43,071 INFO L226 Difference]: Without dead ends: 135 [2019-09-03 20:54:43,072 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 186 SyntacticMatches, 16 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1233 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1369, Invalid=3323, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 20:54:43,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-09-03 20:54:43,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 112. [2019-09-03 20:54:43,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-03 20:54:43,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2019-09-03 20:54:43,075 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 105 [2019-09-03 20:54:43,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:43,075 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2019-09-03 20:54:43,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 20:54:43,075 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2019-09-03 20:54:43,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-03 20:54:43,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:43,076 INFO L399 BasicCegarLoop]: trace histogram [34, 33, 25, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:43,077 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:43,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:43,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1450628187, now seen corresponding path program 24 times [2019-09-03 20:54:43,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:43,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:43,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:43,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:43,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:43,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:43,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 641 proven. 950 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-03 20:54:43,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:43,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:43,532 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:43,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:43,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:43,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:54:43,557 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:54:43,557 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:43,606 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:54:43,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:43,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 20:54:43,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:43,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 641 proven. 950 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-03 20:54:43,628 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:44,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 641 proven. 950 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-03 20:54:44,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:44,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 52 [2019-09-03 20:54:44,428 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:44,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 20:54:44,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 20:54:44,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:54:44,430 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand 28 states. [2019-09-03 20:54:44,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:44,524 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2019-09-03 20:54:44,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-03 20:54:44,524 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 111 [2019-09-03 20:54:44,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:44,525 INFO L225 Difference]: With dead ends: 116 [2019-09-03 20:54:44,526 INFO L226 Difference]: Without dead ends: 116 [2019-09-03 20:54:44,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 197 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:54:44,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-03 20:54:44,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-09-03 20:54:44,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-03 20:54:44,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2019-09-03 20:54:44,533 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 111 [2019-09-03 20:54:44,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:44,534 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2019-09-03 20:54:44,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 20:54:44,534 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2019-09-03 20:54:44,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-03 20:54:44,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:44,535 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 26, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:44,536 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:44,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:44,536 INFO L82 PathProgramCache]: Analyzing trace with hash -639356328, now seen corresponding path program 25 times [2019-09-03 20:54:44,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:44,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:44,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:44,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:44,538 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:44,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 666 proven. 1027 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-03 20:54:44,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:44,920 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:44,920 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:44,921 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:44,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:44,921 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:44,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:44,931 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:54:44,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:44,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 20:54:44,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:44,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 666 proven. 1027 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-03 20:54:44,979 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:45,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 666 proven. 1027 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (26)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:54:45,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:45,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 52 [2019-09-03 20:54:45,792 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:45,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 20:54:45,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 20:54:45,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:54:45,794 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 29 states. [2019-09-03 20:54:45,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:45,869 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2019-09-03 20:54:45,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 20:54:45,871 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 114 [2019-09-03 20:54:45,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:45,872 INFO L225 Difference]: With dead ends: 119 [2019-09-03 20:54:45,872 INFO L226 Difference]: Without dead ends: 119 [2019-09-03 20:54:45,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 202 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:54:45,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-09-03 20:54:45,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-09-03 20:54:45,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-09-03 20:54:45,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2019-09-03 20:54:45,878 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 114 [2019-09-03 20:54:45,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:45,878 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2019-09-03 20:54:45,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 20:54:45,878 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2019-09-03 20:54:45,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-03 20:54:45,879 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:45,879 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 27, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:45,880 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:45,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:45,881 INFO L82 PathProgramCache]: Analyzing trace with hash 772847419, now seen corresponding path program 26 times [2019-09-03 20:54:45,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:45,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:45,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:45,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:45,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:45,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:46,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 691 proven. 1107 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-03 20:54:46,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:46,341 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:46,341 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:46,341 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:46,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:46,343 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:54:46,366 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:54:46,366 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:46,417 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-09-03 20:54:46,417 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:46,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 20:54:46,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:46,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 1198 proven. 209 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2019-09-03 20:54:46,656 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:46,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 1198 proven. 209 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2019-09-03 20:54:46,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:46,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 12, 12] total 40 [2019-09-03 20:54:46,984 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:46,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-03 20:54:46,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-03 20:54:46,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=500, Invalid=1060, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 20:54:46,986 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand 40 states. [2019-09-03 20:54:47,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:47,663 INFO L93 Difference]: Finished difference Result 150 states and 168 transitions. [2019-09-03 20:54:47,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-03 20:54:47,664 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 117 [2019-09-03 20:54:47,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:47,665 INFO L225 Difference]: With dead ends: 150 [2019-09-03 20:54:47,665 INFO L226 Difference]: Without dead ends: 150 [2019-09-03 20:54:47,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 207 SyntacticMatches, 18 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1558 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1692, Invalid=4160, Unknown=0, NotChecked=0, Total=5852 [2019-09-03 20:54:47,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-09-03 20:54:47,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 124. [2019-09-03 20:54:47,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-09-03 20:54:47,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2019-09-03 20:54:47,672 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 117 [2019-09-03 20:54:47,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:47,672 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2019-09-03 20:54:47,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-03 20:54:47,672 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2019-09-03 20:54:47,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-03 20:54:47,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:47,673 INFO L399 BasicCegarLoop]: trace histogram [38, 37, 28, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:47,673 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:47,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:47,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1269011939, now seen corresponding path program 27 times [2019-09-03 20:54:47,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:47,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:47,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:47,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:47,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:48,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2109 backedges. 802 proven. 1190 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-03 20:54:48,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:48,035 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:48,035 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:48,035 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:48,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:48,036 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:48,045 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:54:48,046 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:54:48,079 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:54:48,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:48,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 20:54:48,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:48,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2109 backedges. 802 proven. 1190 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-03 20:54:48,095 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:48,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2109 backedges. 802 proven. 1190 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-03 20:54:48,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:48,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 52 [2019-09-03 20:54:48,929 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:48,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 20:54:48,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 20:54:48,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:54:48,931 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 31 states. [2019-09-03 20:54:49,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:49,017 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2019-09-03 20:54:49,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 20:54:49,020 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 123 [2019-09-03 20:54:49,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:49,021 INFO L225 Difference]: With dead ends: 128 [2019-09-03 20:54:49,021 INFO L226 Difference]: Without dead ends: 128 [2019-09-03 20:54:49,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 218 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:54:49,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-03 20:54:49,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-09-03 20:54:49,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-09-03 20:54:49,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2019-09-03 20:54:49,025 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 123 [2019-09-03 20:54:49,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:49,025 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2019-09-03 20:54:49,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 20:54:49,025 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2019-09-03 20:54:49,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-03 20:54:49,026 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:49,026 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 29, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:49,026 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:49,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:49,027 INFO L82 PathProgramCache]: Analyzing trace with hash -853298022, now seen corresponding path program 28 times [2019-09-03 20:54:49,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:49,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:49,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:49,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:49,028 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:49,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 830 proven. 1276 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-03 20:54:49,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:49,449 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:49,449 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:49,449 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:49,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:49,449 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:49,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:49,459 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:54:49,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:49,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-03 20:54:49,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:49,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 830 proven. 1276 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-03 20:54:49,518 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:50,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 830 proven. 1276 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-03 20:54:50,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:50,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 52 [2019-09-03 20:54:50,321 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:50,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 20:54:50,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 20:54:50,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:54:50,322 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand 32 states. [2019-09-03 20:54:50,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:50,458 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2019-09-03 20:54:50,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-03 20:54:50,459 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 126 [2019-09-03 20:54:50,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:50,460 INFO L225 Difference]: With dead ends: 131 [2019-09-03 20:54:50,460 INFO L226 Difference]: Without dead ends: 131 [2019-09-03 20:54:50,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 223 SyntacticMatches, 10 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:54:50,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-09-03 20:54:50,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2019-09-03 20:54:50,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-03 20:54:50,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 140 transitions. [2019-09-03 20:54:50,464 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 140 transitions. Word has length 126 [2019-09-03 20:54:50,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:50,464 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 140 transitions. [2019-09-03 20:54:50,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 20:54:50,464 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 140 transitions. [2019-09-03 20:54:50,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-03 20:54:50,465 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:50,465 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 30, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:50,465 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:50,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:50,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1289288957, now seen corresponding path program 29 times [2019-09-03 20:54:50,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:50,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:50,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:50,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:50,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:50,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:50,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2340 backedges. 858 proven. 1365 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-03 20:54:50,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:50,893 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:50,893 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:50,893 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:50,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:50,893 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:50,903 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:54:50,903 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:54:50,956 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-09-03 20:54:50,956 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:50,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 20:54:50,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:51,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2340 backedges. 1481 proven. 262 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2019-09-03 20:54:51,149 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:51,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2340 backedges. 1481 proven. 262 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2019-09-03 20:54:51,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:51,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 13, 13] total 44 [2019-09-03 20:54:51,490 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:51,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-03 20:54:51,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-03 20:54:51,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=605, Invalid=1287, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 20:54:51,491 INFO L87 Difference]: Start difference. First operand 130 states and 140 transitions. Second operand 44 states. [2019-09-03 20:54:52,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:52,262 INFO L93 Difference]: Finished difference Result 165 states and 185 transitions. [2019-09-03 20:54:52,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-03 20:54:52,263 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 129 [2019-09-03 20:54:52,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:52,265 INFO L225 Difference]: With dead ends: 165 [2019-09-03 20:54:52,265 INFO L226 Difference]: Without dead ends: 165 [2019-09-03 20:54:52,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 228 SyntacticMatches, 20 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1921 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2049, Invalid=5091, Unknown=0, NotChecked=0, Total=7140 [2019-09-03 20:54:52,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-09-03 20:54:52,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 136. [2019-09-03 20:54:52,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-09-03 20:54:52,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2019-09-03 20:54:52,271 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 129 [2019-09-03 20:54:52,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:52,272 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2019-09-03 20:54:52,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-03 20:54:52,272 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2019-09-03 20:54:52,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-03 20:54:52,273 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:52,273 INFO L399 BasicCegarLoop]: trace histogram [42, 41, 31, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:52,273 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:52,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:52,274 INFO L82 PathProgramCache]: Analyzing trace with hash 403855515, now seen corresponding path program 30 times [2019-09-03 20:54:52,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:52,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:52,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:52,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:52,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:52,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 981 proven. 1457 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-09-03 20:54:52,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:52,717 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:52,717 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:52,717 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:52,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:52,717 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:52,726 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:54:52,726 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:54:52,786 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:54:52,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:52,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 20:54:52,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:52,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 981 proven. 1457 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-09-03 20:54:52,812 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:53,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 981 proven. 1457 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-09-03 20:54:53,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:53,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 52 [2019-09-03 20:54:53,604 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:53,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-03 20:54:53,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-03 20:54:53,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:54:53,605 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand 34 states. [2019-09-03 20:54:53,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:53,726 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2019-09-03 20:54:53,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-03 20:54:53,726 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 135 [2019-09-03 20:54:53,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:53,728 INFO L225 Difference]: With dead ends: 140 [2019-09-03 20:54:53,728 INFO L226 Difference]: Without dead ends: 140 [2019-09-03 20:54:53,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 239 SyntacticMatches, 14 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:54:53,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-09-03 20:54:53,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2019-09-03 20:54:53,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-09-03 20:54:53,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 150 transitions. [2019-09-03 20:54:53,731 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 150 transitions. Word has length 135 [2019-09-03 20:54:53,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:53,732 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 150 transitions. [2019-09-03 20:54:53,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-03 20:54:53,732 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 150 transitions. [2019-09-03 20:54:53,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-03 20:54:53,733 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:53,733 INFO L399 BasicCegarLoop]: trace histogram [43, 42, 32, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:53,733 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:53,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:53,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1808478312, now seen corresponding path program 31 times [2019-09-03 20:54:53,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:53,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:53,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:53,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:53,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:53,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:54,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 1012 proven. 1552 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-09-03 20:54:54,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:54,199 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:54,199 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:54,199 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:54,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:54,200 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:54,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:54,210 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:54:54,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:54,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 20:54:54,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:54,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 1012 proven. 1552 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-09-03 20:54:54,275 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:55,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 1012 proven. 1552 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-09-03 20:54:55,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:55,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 52 [2019-09-03 20:54:55,120 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:55,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-03 20:54:55,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-03 20:54:55,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:54:55,122 INFO L87 Difference]: Start difference. First operand 139 states and 150 transitions. Second operand 35 states. [2019-09-03 20:54:55,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:55,243 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2019-09-03 20:54:55,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 20:54:55,251 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 138 [2019-09-03 20:54:55,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:55,252 INFO L225 Difference]: With dead ends: 143 [2019-09-03 20:54:55,252 INFO L226 Difference]: Without dead ends: 143 [2019-09-03 20:54:55,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 244 SyntacticMatches, 16 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:54:55,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-09-03 20:54:55,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2019-09-03 20:54:55,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-09-03 20:54:55,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2019-09-03 20:54:55,256 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 153 transitions. Word has length 138 [2019-09-03 20:54:55,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:55,256 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 153 transitions. [2019-09-03 20:54:55,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-03 20:54:55,257 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2019-09-03 20:54:55,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-03 20:54:55,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:55,257 INFO L399 BasicCegarLoop]: trace histogram [44, 43, 33, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:55,258 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:55,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:55,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1122605947, now seen corresponding path program 32 times [2019-09-03 20:54:55,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:55,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:55,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:55,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:55,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:55,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2838 backedges. 1043 proven. 1650 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-09-03 20:54:55,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:55,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:55,764 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:55,764 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:55,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:55,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:54:55,782 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:54:55,782 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:55,838 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-09-03 20:54:55,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:55,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 20:54:55,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:56,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2838 backedges. 1794 proven. 321 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2019-09-03 20:54:56,094 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:56,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2838 backedges. 1794 proven. 321 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2019-09-03 20:54:56,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:56,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 14, 14] total 48 [2019-09-03 20:54:56,496 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:56,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-03 20:54:56,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-03 20:54:56,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=720, Invalid=1536, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 20:54:56,497 INFO L87 Difference]: Start difference. First operand 142 states and 153 transitions. Second operand 48 states. [2019-09-03 20:54:57,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:57,387 INFO L93 Difference]: Finished difference Result 180 states and 202 transitions. [2019-09-03 20:54:57,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-03 20:54:57,387 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 141 [2019-09-03 20:54:57,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:57,388 INFO L225 Difference]: With dead ends: 180 [2019-09-03 20:54:57,388 INFO L226 Difference]: Without dead ends: 180 [2019-09-03 20:54:57,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 249 SyntacticMatches, 22 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2322 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2440, Invalid=6116, Unknown=0, NotChecked=0, Total=8556 [2019-09-03 20:54:57,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-03 20:54:57,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 148. [2019-09-03 20:54:57,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-09-03 20:54:57,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 160 transitions. [2019-09-03 20:54:57,393 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 160 transitions. Word has length 141 [2019-09-03 20:54:57,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:57,393 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 160 transitions. [2019-09-03 20:54:57,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-03 20:54:57,394 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 160 transitions. [2019-09-03 20:54:57,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-03 20:54:57,394 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:57,395 INFO L399 BasicCegarLoop]: trace histogram [46, 45, 34, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:57,395 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:57,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:57,395 INFO L82 PathProgramCache]: Analyzing trace with hash -415423267, now seen corresponding path program 33 times [2019-09-03 20:54:57,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:57,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:57,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:57,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:57,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:57,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3105 backedges. 1178 proven. 1751 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-09-03 20:54:57,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:57,908 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:57,908 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:57,909 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:57,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:57,909 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:54:57,936 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:54:57,936 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:57,980 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:54:57,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:57,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 20:54:57,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:58,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3105 backedges. 1178 proven. 1751 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-09-03 20:54:58,006 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:58,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3105 backedges. 1178 proven. 1751 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-09-03 20:54:58,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:58,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 52 [2019-09-03 20:54:58,778 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:58,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 20:54:58,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 20:54:58,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:54:58,780 INFO L87 Difference]: Start difference. First operand 148 states and 160 transitions. Second operand 37 states. [2019-09-03 20:54:58,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:58,945 INFO L93 Difference]: Finished difference Result 152 states and 164 transitions. [2019-09-03 20:54:58,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-03 20:54:58,945 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 147 [2019-09-03 20:54:58,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:58,947 INFO L225 Difference]: With dead ends: 152 [2019-09-03 20:54:58,947 INFO L226 Difference]: Without dead ends: 152 [2019-09-03 20:54:58,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 260 SyntacticMatches, 20 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:54:58,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-03 20:54:58,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2019-09-03 20:54:58,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-09-03 20:54:58,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 163 transitions. [2019-09-03 20:54:58,951 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 163 transitions. Word has length 147 [2019-09-03 20:54:58,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:58,951 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 163 transitions. [2019-09-03 20:54:58,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 20:54:58,952 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 163 transitions. [2019-09-03 20:54:58,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-03 20:54:58,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:58,953 INFO L399 BasicCegarLoop]: trace histogram [47, 46, 35, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:58,953 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:58,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:58,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1557923930, now seen corresponding path program 34 times [2019-09-03 20:54:58,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:58,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:58,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:58,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:58,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:58,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:59,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 1212 proven. 1855 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-09-03 20:54:59,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:59,489 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:59,489 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:59,489 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:59,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:59,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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:59,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:59,498 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:54:59,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:59,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-03 20:54:59,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:59,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 1212 proven. 1855 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-09-03 20:54:59,573 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:00,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 1212 proven. 1855 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-09-03 20:55:00,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:00,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 52 [2019-09-03 20:55:00,940 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:00,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-03 20:55:00,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-03 20:55:00,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:55:00,941 INFO L87 Difference]: Start difference. First operand 151 states and 163 transitions. Second operand 38 states. [2019-09-03 20:55:01,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:01,082 INFO L93 Difference]: Finished difference Result 155 states and 167 transitions. [2019-09-03 20:55:01,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-03 20:55:01,082 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 150 [2019-09-03 20:55:01,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:01,083 INFO L225 Difference]: With dead ends: 155 [2019-09-03 20:55:01,084 INFO L226 Difference]: Without dead ends: 155 [2019-09-03 20:55:01,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 265 SyntacticMatches, 22 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:55:01,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-09-03 20:55:01,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2019-09-03 20:55:01,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-09-03 20:55:01,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2019-09-03 20:55:01,087 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 150 [2019-09-03 20:55:01,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:01,088 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2019-09-03 20:55:01,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-03 20:55:01,088 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2019-09-03 20:55:01,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-03 20:55:01,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:01,089 INFO L399 BasicCegarLoop]: trace histogram [48, 47, 36, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:01,089 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:01,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:01,090 INFO L82 PathProgramCache]: Analyzing trace with hash 31922109, now seen corresponding path program 35 times [2019-09-03 20:55:01,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:01,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:01,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:01,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:01,091 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:01,807 INFO L134 CoverageAnalysis]: Checked inductivity of 3384 backedges. 1246 proven. 1962 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-09-03 20:55:01,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:01,807 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:01,808 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:01,808 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:01,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:01,808 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:55:01,827 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:55:01,827 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:01,887 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-09-03 20:55:01,887 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:01,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 20:55:01,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:02,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3384 backedges. 2137 proven. 386 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-09-03 20:55:02,145 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:02,581 INFO L134 CoverageAnalysis]: Checked inductivity of 3384 backedges. 2137 proven. 386 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-09-03 20:55:02,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:02,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 15, 15] total 52 [2019-09-03 20:55:02,584 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:02,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-03 20:55:02,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-03 20:55:02,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=845, Invalid=1807, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:55:02,587 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 52 states. [2019-09-03 20:55:03,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:03,741 INFO L93 Difference]: Finished difference Result 195 states and 219 transitions. [2019-09-03 20:55:03,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-03 20:55:03,743 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 153 [2019-09-03 20:55:03,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:03,745 INFO L225 Difference]: With dead ends: 195 [2019-09-03 20:55:03,745 INFO L226 Difference]: Without dead ends: 195 [2019-09-03 20:55:03,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 270 SyntacticMatches, 24 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2761 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2865, Invalid=7235, Unknown=0, NotChecked=0, Total=10100 [2019-09-03 20:55:03,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-09-03 20:55:03,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 160. [2019-09-03 20:55:03,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-03 20:55:03,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 173 transitions. [2019-09-03 20:55:03,749 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 173 transitions. Word has length 153 [2019-09-03 20:55:03,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:03,749 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 173 transitions. [2019-09-03 20:55:03,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-03 20:55:03,750 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 173 transitions. [2019-09-03 20:55:03,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-03 20:55:03,750 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:03,751 INFO L399 BasicCegarLoop]: trace histogram [50, 49, 37, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:03,751 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:03,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:03,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1240347429, now seen corresponding path program 36 times [2019-09-03 20:55:03,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:03,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:03,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:03,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:03,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:04,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3675 backedges. 1393 proven. 2072 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-03 20:55:04,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:04,373 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:04,373 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:04,374 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:04,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:04,374 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:04,385 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:55:04,385 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:55:04,430 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:55:04,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:04,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-03 20:55:04,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:04,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3675 backedges. 1393 proven. 2072 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-03 20:55:04,461 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:05,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3675 backedges. 1393 proven. 2072 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-03 20:55:05,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:05,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 52 [2019-09-03 20:55:05,382 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:05,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-03 20:55:05,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-03 20:55:05,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:55:05,383 INFO L87 Difference]: Start difference. First operand 160 states and 173 transitions. Second operand 40 states. [2019-09-03 20:55:05,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:05,524 INFO L93 Difference]: Finished difference Result 164 states and 177 transitions. [2019-09-03 20:55:05,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-03 20:55:05,525 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 159 [2019-09-03 20:55:05,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:05,526 INFO L225 Difference]: With dead ends: 164 [2019-09-03 20:55:05,527 INFO L226 Difference]: Without dead ends: 164 [2019-09-03 20:55:05,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 281 SyntacticMatches, 26 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:55:05,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-09-03 20:55:05,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2019-09-03 20:55:05,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-09-03 20:55:05,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 176 transitions. [2019-09-03 20:55:05,530 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 176 transitions. Word has length 159 [2019-09-03 20:55:05,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:05,531 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 176 transitions. [2019-09-03 20:55:05,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-03 20:55:05,531 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 176 transitions. [2019-09-03 20:55:05,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-03 20:55:05,532 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:05,532 INFO L399 BasicCegarLoop]: trace histogram [51, 50, 38, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:05,532 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:05,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:05,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1399741656, now seen corresponding path program 37 times [2019-09-03 20:55:05,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:05,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:05,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:05,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:05,534 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:06,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3825 backedges. 1430 proven. 2185 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-03 20:55:06,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:06,194 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:06,194 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:06,195 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:06,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:06,195 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:06,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:06,205 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:55:06,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:06,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 20:55:06,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:06,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3825 backedges. 1430 proven. 2185 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-03 20:55:06,283 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:07,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3825 backedges. 1430 proven. 2185 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-03 20:55:07,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:07,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 52 [2019-09-03 20:55:07,232 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:07,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-03 20:55:07,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-03 20:55:07,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:55:07,233 INFO L87 Difference]: Start difference. First operand 163 states and 176 transitions. Second operand 41 states. [2019-09-03 20:55:07,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:07,366 INFO L93 Difference]: Finished difference Result 167 states and 180 transitions. [2019-09-03 20:55:07,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-03 20:55:07,366 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 162 [2019-09-03 20:55:07,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:07,368 INFO L225 Difference]: With dead ends: 167 [2019-09-03 20:55:07,368 INFO L226 Difference]: Without dead ends: 167 [2019-09-03 20:55:07,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 286 SyntacticMatches, 28 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:55:07,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-09-03 20:55:07,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2019-09-03 20:55:07,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-09-03 20:55:07,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 179 transitions. [2019-09-03 20:55:07,373 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 179 transitions. Word has length 162 [2019-09-03 20:55:07,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:07,374 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 179 transitions. [2019-09-03 20:55:07,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-03 20:55:07,374 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 179 transitions. [2019-09-03 20:55:07,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-03 20:55:07,375 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:07,375 INFO L399 BasicCegarLoop]: trace histogram [52, 51, 39, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:07,375 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:07,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:07,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1442418757, now seen corresponding path program 38 times [2019-09-03 20:55:07,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:07,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:07,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:07,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:07,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:07,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:07,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3978 backedges. 1467 proven. 2301 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-03 20:55:07,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:07,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:07,996 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:07,996 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:07,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:07,997 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:08,007 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:55:08,007 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:55:08,082 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-09-03 20:55:08,083 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:08,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 20:55:08,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:08,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3978 backedges. 2510 proven. 457 refuted. 0 times theorem prover too weak. 1011 trivial. 0 not checked. [2019-09-03 20:55:08,390 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:08,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3978 backedges. 2510 proven. 457 refuted. 0 times theorem prover too weak. 1011 trivial. 0 not checked. [2019-09-03 20:55:08,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:08,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 16, 16] total 56 [2019-09-03 20:55:08,940 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:08,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-03 20:55:08,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-03 20:55:08,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=980, Invalid=2100, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 20:55:08,941 INFO L87 Difference]: Start difference. First operand 166 states and 179 transitions. Second operand 56 states. [2019-09-03 20:55:10,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:10,014 INFO L93 Difference]: Finished difference Result 210 states and 236 transitions. [2019-09-03 20:55:10,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-03 20:55:10,015 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 165 [2019-09-03 20:55:10,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:10,017 INFO L225 Difference]: With dead ends: 210 [2019-09-03 20:55:10,017 INFO L226 Difference]: Without dead ends: 210 [2019-09-03 20:55:10,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 291 SyntacticMatches, 26 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3238 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3324, Invalid=8448, Unknown=0, NotChecked=0, Total=11772 [2019-09-03 20:55:10,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-03 20:55:10,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 172. [2019-09-03 20:55:10,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-03 20:55:10,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 186 transitions. [2019-09-03 20:55:10,021 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 186 transitions. Word has length 165 [2019-09-03 20:55:10,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:10,022 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 186 transitions. [2019-09-03 20:55:10,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-03 20:55:10,022 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 186 transitions. [2019-09-03 20:55:10,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-03 20:55:10,023 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:10,023 INFO L399 BasicCegarLoop]: trace histogram [54, 53, 40, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:10,023 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:10,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:10,024 INFO L82 PathProgramCache]: Analyzing trace with hash 120516509, now seen corresponding path program 39 times [2019-09-03 20:55:10,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:10,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:10,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:10,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:10,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:10,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:10,781 INFO L134 CoverageAnalysis]: Checked inductivity of 4293 backedges. 1626 proven. 2420 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-09-03 20:55:10,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:10,782 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:10,782 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:10,782 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:10,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:10,782 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:10,792 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:55:10,793 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:55:10,841 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:55:10,841 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:10,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 20:55:10,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:10,873 INFO L134 CoverageAnalysis]: Checked inductivity of 4293 backedges. 1626 proven. 2420 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-09-03 20:55:10,874 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:11,733 INFO L134 CoverageAnalysis]: Checked inductivity of 4293 backedges. 1626 proven. 2420 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-09-03 20:55:11,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:11,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 52 [2019-09-03 20:55:11,736 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:11,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-03 20:55:11,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-03 20:55:11,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:55:11,737 INFO L87 Difference]: Start difference. First operand 172 states and 186 transitions. Second operand 43 states. [2019-09-03 20:55:11,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:11,895 INFO L93 Difference]: Finished difference Result 176 states and 190 transitions. [2019-09-03 20:55:11,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-03 20:55:11,895 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 171 [2019-09-03 20:55:11,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:11,896 INFO L225 Difference]: With dead ends: 176 [2019-09-03 20:55:11,897 INFO L226 Difference]: Without dead ends: 176 [2019-09-03 20:55:11,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 302 SyntacticMatches, 32 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:55:11,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-09-03 20:55:11,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2019-09-03 20:55:11,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-03 20:55:11,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 189 transitions. [2019-09-03 20:55:11,901 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 189 transitions. Word has length 171 [2019-09-03 20:55:11,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:11,902 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 189 transitions. [2019-09-03 20:55:11,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-03 20:55:11,902 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 189 transitions. [2019-09-03 20:55:11,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-03 20:55:11,903 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:11,903 INFO L399 BasicCegarLoop]: trace histogram [55, 54, 41, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:11,903 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:11,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:11,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1655335962, now seen corresponding path program 40 times [2019-09-03 20:55:11,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:11,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:11,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:11,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:11,905 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:11,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:12,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4455 backedges. 1666 proven. 2542 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-09-03 20:55:12,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:12,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:12,742 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:12,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:12,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:12,742 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:12,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:12,752 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:55:12,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:12,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-03 20:55:12,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:12,828 INFO L134 CoverageAnalysis]: Checked inductivity of 4455 backedges. 1666 proven. 2542 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-09-03 20:55:12,829 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:13,704 INFO L134 CoverageAnalysis]: Checked inductivity of 4455 backedges. 1666 proven. 2542 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-09-03 20:55:13,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:13,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 52 [2019-09-03 20:55:13,707 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:13,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-03 20:55:13,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-03 20:55:13,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:55:13,708 INFO L87 Difference]: Start difference. First operand 175 states and 189 transitions. Second operand 44 states. [2019-09-03 20:55:13,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:13,866 INFO L93 Difference]: Finished difference Result 179 states and 193 transitions. [2019-09-03 20:55:13,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-03 20:55:13,866 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 174 [2019-09-03 20:55:13,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:13,867 INFO L225 Difference]: With dead ends: 179 [2019-09-03 20:55:13,867 INFO L226 Difference]: Without dead ends: 179 [2019-09-03 20:55:13,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 307 SyntacticMatches, 34 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:55:13,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-03 20:55:13,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2019-09-03 20:55:13,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-09-03 20:55:13,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 192 transitions. [2019-09-03 20:55:13,871 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 192 transitions. Word has length 174 [2019-09-03 20:55:13,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:13,872 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 192 transitions. [2019-09-03 20:55:13,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-03 20:55:13,872 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 192 transitions. [2019-09-03 20:55:13,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-03 20:55:13,873 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:13,873 INFO L399 BasicCegarLoop]: trace histogram [56, 55, 42, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:13,873 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:13,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:13,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1239827069, now seen corresponding path program 41 times [2019-09-03 20:55:13,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:13,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:13,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:13,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:13,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:13,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:14,704 INFO L134 CoverageAnalysis]: Checked inductivity of 4620 backedges. 1706 proven. 2667 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-09-03 20:55:14,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:14,704 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:14,704 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:14,704 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:14,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:14,704 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:14,714 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:55:14,714 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:55:14,791 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-09-03 20:55:14,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:14,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 20:55:14,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:15,122 INFO L134 CoverageAnalysis]: Checked inductivity of 4620 backedges. 2913 proven. 534 refuted. 0 times theorem prover too weak. 1173 trivial. 0 not checked. [2019-09-03 20:55:15,122 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:15,719 INFO L134 CoverageAnalysis]: Checked inductivity of 4620 backedges. 2913 proven. 534 refuted. 0 times theorem prover too weak. 1173 trivial. 0 not checked. [2019-09-03 20:55:15,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:15,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 17, 17] total 60 [2019-09-03 20:55:15,723 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:15,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-03 20:55:15,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-03 20:55:15,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1125, Invalid=2415, Unknown=0, NotChecked=0, Total=3540 [2019-09-03 20:55:15,724 INFO L87 Difference]: Start difference. First operand 178 states and 192 transitions. Second operand 60 states. [2019-09-03 20:55:16,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:16,998 INFO L93 Difference]: Finished difference Result 225 states and 253 transitions. [2019-09-03 20:55:16,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-03 20:55:16,999 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 177 [2019-09-03 20:55:16,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:17,001 INFO L225 Difference]: With dead ends: 225 [2019-09-03 20:55:17,001 INFO L226 Difference]: Without dead ends: 225 [2019-09-03 20:55:17,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 312 SyntacticMatches, 28 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3753 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3817, Invalid=9755, Unknown=0, NotChecked=0, Total=13572 [2019-09-03 20:55:17,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-09-03 20:55:17,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 184. [2019-09-03 20:55:17,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-03 20:55:17,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 199 transitions. [2019-09-03 20:55:17,005 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 199 transitions. Word has length 177 [2019-09-03 20:55:17,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:17,006 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 199 transitions. [2019-09-03 20:55:17,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-03 20:55:17,006 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 199 transitions. [2019-09-03 20:55:17,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-03 20:55:17,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:17,007 INFO L399 BasicCegarLoop]: trace histogram [58, 57, 43, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:17,007 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:17,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:17,007 INFO L82 PathProgramCache]: Analyzing trace with hash -480169701, now seen corresponding path program 42 times [2019-09-03 20:55:17,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:17,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:17,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:17,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:17,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:17,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4959 backedges. 1877 proven. 2795 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2019-09-03 20:55:17,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:17,766 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:17,766 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:17,766 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:17,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:17,766 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:17,776 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:55:17,776 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:55:17,847 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:55:17,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:17,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-03 20:55:17,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:17,883 INFO L134 CoverageAnalysis]: Checked inductivity of 4959 backedges. 1877 proven. 2795 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2019-09-03 20:55:17,883 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:18,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4959 backedges. 1877 proven. 2795 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2019-09-03 20:55:18,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:18,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 52 [2019-09-03 20:55:18,782 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:18,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-03 20:55:18,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-03 20:55:18,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:55:18,783 INFO L87 Difference]: Start difference. First operand 184 states and 199 transitions. Second operand 46 states. [2019-09-03 20:55:18,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:18,924 INFO L93 Difference]: Finished difference Result 188 states and 203 transitions. [2019-09-03 20:55:18,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-03 20:55:18,924 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 183 [2019-09-03 20:55:18,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:18,926 INFO L225 Difference]: With dead ends: 188 [2019-09-03 20:55:18,926 INFO L226 Difference]: Without dead ends: 188 [2019-09-03 20:55:18,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 323 SyntacticMatches, 38 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:55:18,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-03 20:55:18,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 187. [2019-09-03 20:55:18,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-09-03 20:55:18,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 202 transitions. [2019-09-03 20:55:18,930 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 202 transitions. Word has length 183 [2019-09-03 20:55:18,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:18,930 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 202 transitions. [2019-09-03 20:55:18,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-03 20:55:18,930 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 202 transitions. [2019-09-03 20:55:18,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-03 20:55:18,931 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:18,931 INFO L399 BasicCegarLoop]: trace histogram [59, 58, 44, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:18,931 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:18,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:18,931 INFO L82 PathProgramCache]: Analyzing trace with hash -881010152, now seen corresponding path program 43 times [2019-09-03 20:55:18,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:18,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:18,932 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:18,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:18,932 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:18,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:19,752 INFO L134 CoverageAnalysis]: Checked inductivity of 5133 backedges. 1920 proven. 2926 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2019-09-03 20:55:19,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:19,753 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:19,753 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:19,753 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:19,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:19,753 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:19,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:19,764 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:55:19,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:19,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-03 20:55:19,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:19,860 INFO L134 CoverageAnalysis]: Checked inductivity of 5133 backedges. 1920 proven. 2926 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2019-09-03 20:55:19,860 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:20,765 INFO L134 CoverageAnalysis]: Checked inductivity of 5133 backedges. 1920 proven. 2926 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2019-09-03 20:55:20,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:20,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 52 [2019-09-03 20:55:20,768 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:20,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-03 20:55:20,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-03 20:55:20,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:55:20,769 INFO L87 Difference]: Start difference. First operand 187 states and 202 transitions. Second operand 47 states. [2019-09-03 20:55:20,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:20,939 INFO L93 Difference]: Finished difference Result 191 states and 206 transitions. [2019-09-03 20:55:20,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-03 20:55:20,942 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 186 [2019-09-03 20:55:20,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:20,943 INFO L225 Difference]: With dead ends: 191 [2019-09-03 20:55:20,943 INFO L226 Difference]: Without dead ends: 191 [2019-09-03 20:55:20,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 328 SyntacticMatches, 40 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 980 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:55:20,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-09-03 20:55:20,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2019-09-03 20:55:20,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-03 20:55:20,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 205 transitions. [2019-09-03 20:55:20,947 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 205 transitions. Word has length 186 [2019-09-03 20:55:20,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:20,947 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 205 transitions. [2019-09-03 20:55:20,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-03 20:55:20,947 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 205 transitions. [2019-09-03 20:55:20,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-03 20:55:20,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:20,948 INFO L399 BasicCegarLoop]: trace histogram [60, 59, 45, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:20,949 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:20,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:20,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1985164283, now seen corresponding path program 44 times [2019-09-03 20:55:20,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:20,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:20,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:20,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:20,950 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:20,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:22,004 INFO L134 CoverageAnalysis]: Checked inductivity of 5310 backedges. 1963 proven. 3060 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2019-09-03 20:55:22,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:22,005 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:22,005 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:22,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:22,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:22,005 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:22,015 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:55:22,015 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:55:22,099 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-09-03 20:55:22,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:22,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 20:55:22,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:22,517 INFO L134 CoverageAnalysis]: Checked inductivity of 5310 backedges. 3346 proven. 617 refuted. 0 times theorem prover too weak. 1347 trivial. 0 not checked. [2019-09-03 20:55:22,518 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:23,193 INFO L134 CoverageAnalysis]: Checked inductivity of 5310 backedges. 3346 proven. 617 refuted. 0 times theorem prover too weak. 1347 trivial. 0 not checked. [2019-09-03 20:55:23,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:23,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 18, 18] total 64 [2019-09-03 20:55:23,196 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:23,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-03 20:55:23,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-03 20:55:23,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1280, Invalid=2752, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 20:55:23,197 INFO L87 Difference]: Start difference. First operand 190 states and 205 transitions. Second operand 64 states. [2019-09-03 20:55:24,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:24,759 INFO L93 Difference]: Finished difference Result 240 states and 270 transitions. [2019-09-03 20:55:24,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-03 20:55:24,760 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 189 [2019-09-03 20:55:24,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:24,762 INFO L225 Difference]: With dead ends: 240 [2019-09-03 20:55:24,762 INFO L226 Difference]: Without dead ends: 240 [2019-09-03 20:55:24,763 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 333 SyntacticMatches, 30 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4306 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4344, Invalid=11156, Unknown=0, NotChecked=0, Total=15500 [2019-09-03 20:55:24,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-09-03 20:55:24,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 196. [2019-09-03 20:55:24,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-09-03 20:55:24,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 212 transitions. [2019-09-03 20:55:24,767 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 212 transitions. Word has length 189 [2019-09-03 20:55:24,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:24,767 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 212 transitions. [2019-09-03 20:55:24,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-03 20:55:24,767 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 212 transitions. [2019-09-03 20:55:24,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-03 20:55:24,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:24,768 INFO L399 BasicCegarLoop]: trace histogram [62, 61, 46, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:24,768 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:24,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:24,769 INFO L82 PathProgramCache]: Analyzing trace with hash 684051037, now seen corresponding path program 45 times [2019-09-03 20:55:24,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:24,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:24,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:24,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:24,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:26,418 INFO L134 CoverageAnalysis]: Checked inductivity of 5673 backedges. 2146 proven. 3197 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-09-03 20:55:26,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:26,418 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:26,419 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:26,419 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:26,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:26,419 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:26,443 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:55:26,444 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:55:26,529 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:55:26,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:26,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-03 20:55:26,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:26,604 INFO L134 CoverageAnalysis]: Checked inductivity of 5673 backedges. 2146 proven. 3197 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-09-03 20:55:26,604 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:28,475 INFO L134 CoverageAnalysis]: Checked inductivity of 5673 backedges. 2146 proven. 3197 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-09-03 20:55:28,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:28,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 52 [2019-09-03 20:55:28,481 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:28,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-03 20:55:28,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-03 20:55:28,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:55:28,482 INFO L87 Difference]: Start difference. First operand 196 states and 212 transitions. Second operand 49 states. [2019-09-03 20:55:28,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:28,633 INFO L93 Difference]: Finished difference Result 200 states and 216 transitions. [2019-09-03 20:55:28,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-03 20:55:28,634 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 195 [2019-09-03 20:55:28,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:28,635 INFO L225 Difference]: With dead ends: 200 [2019-09-03 20:55:28,635 INFO L226 Difference]: Without dead ends: 200 [2019-09-03 20:55:28,635 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 344 SyntacticMatches, 44 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:55:28,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-09-03 20:55:28,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2019-09-03 20:55:28,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-03 20:55:28,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 215 transitions. [2019-09-03 20:55:28,642 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 215 transitions. Word has length 195 [2019-09-03 20:55:28,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:28,642 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 215 transitions. [2019-09-03 20:55:28,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-03 20:55:28,642 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 215 transitions. [2019-09-03 20:55:28,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-03 20:55:28,643 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:28,643 INFO L399 BasicCegarLoop]: trace histogram [63, 62, 47, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:28,644 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:28,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:28,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1948442586, now seen corresponding path program 46 times [2019-09-03 20:55:28,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:28,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:28,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:28,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:28,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:29,546 INFO L134 CoverageAnalysis]: Checked inductivity of 5859 backedges. 2192 proven. 3337 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-09-03 20:55:29,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:29,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:29,547 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:29,547 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:29,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:29,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:29,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:29,557 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:55:29,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:29,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-03 20:55:29,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:29,657 INFO L134 CoverageAnalysis]: Checked inductivity of 5859 backedges. 2192 proven. 3337 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-09-03 20:55:29,657 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:30,577 INFO L134 CoverageAnalysis]: Checked inductivity of 5859 backedges. 2192 proven. 3337 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-09-03 20:55:30,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:30,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 52 [2019-09-03 20:55:30,581 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:30,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-03 20:55:30,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-03 20:55:30,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:55:30,582 INFO L87 Difference]: Start difference. First operand 199 states and 215 transitions. Second operand 50 states. [2019-09-03 20:55:30,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:30,756 INFO L93 Difference]: Finished difference Result 203 states and 219 transitions. [2019-09-03 20:55:30,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-03 20:55:30,756 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 198 [2019-09-03 20:55:30,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:30,757 INFO L225 Difference]: With dead ends: 203 [2019-09-03 20:55:30,757 INFO L226 Difference]: Without dead ends: 203 [2019-09-03 20:55:30,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 349 SyntacticMatches, 46 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1127 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:55:30,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-09-03 20:55:30,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2019-09-03 20:55:30,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-03 20:55:30,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 218 transitions. [2019-09-03 20:55:30,761 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 218 transitions. Word has length 198 [2019-09-03 20:55:30,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:30,762 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 218 transitions. [2019-09-03 20:55:30,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-03 20:55:30,762 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 218 transitions. [2019-09-03 20:55:30,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-03 20:55:30,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:30,763 INFO L399 BasicCegarLoop]: trace histogram [64, 63, 48, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:30,763 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:30,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:30,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1721074371, now seen corresponding path program 47 times [2019-09-03 20:55:30,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:30,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:30,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:30,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:30,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:30,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:31,670 INFO L134 CoverageAnalysis]: Checked inductivity of 6048 backedges. 2238 proven. 3480 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-09-03 20:55:31,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:31,670 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:31,670 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:31,670 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:31,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:31,670 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:31,680 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:55:31,680 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:55:31,771 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-09-03 20:55:31,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:31,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 20:55:31,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:32,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6048 backedges. 3809 proven. 706 refuted. 0 times theorem prover too weak. 1533 trivial. 0 not checked. [2019-09-03 20:55:32,269 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:33,054 INFO L134 CoverageAnalysis]: Checked inductivity of 6048 backedges. 3809 proven. 706 refuted. 0 times theorem prover too weak. 1533 trivial. 0 not checked. [2019-09-03 20:55:33,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:33,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 19, 19] total 68 [2019-09-03 20:55:33,057 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:33,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-03 20:55:33,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-03 20:55:33,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1445, Invalid=3111, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 20:55:33,058 INFO L87 Difference]: Start difference. First operand 202 states and 218 transitions. Second operand 68 states. [2019-09-03 20:55:34,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:34,567 INFO L93 Difference]: Finished difference Result 255 states and 287 transitions. [2019-09-03 20:55:34,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-03 20:55:34,570 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 201 [2019-09-03 20:55:34,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:34,572 INFO L225 Difference]: With dead ends: 255 [2019-09-03 20:55:34,572 INFO L226 Difference]: Without dead ends: 255 [2019-09-03 20:55:34,573 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 354 SyntacticMatches, 32 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4897 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4905, Invalid=12651, Unknown=0, NotChecked=0, Total=17556 [2019-09-03 20:55:34,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-09-03 20:55:34,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 208. [2019-09-03 20:55:34,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-09-03 20:55:34,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 225 transitions. [2019-09-03 20:55:34,576 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 225 transitions. Word has length 201 [2019-09-03 20:55:34,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:34,576 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 225 transitions. [2019-09-03 20:55:34,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-03 20:55:34,577 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 225 transitions. [2019-09-03 20:55:34,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-03 20:55:34,578 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:34,578 INFO L399 BasicCegarLoop]: trace histogram [66, 65, 49, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:34,578 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:34,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:34,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1846770341, now seen corresponding path program 48 times [2019-09-03 20:55:34,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:34,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:34,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:34,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:34,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:34,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:35,802 INFO L134 CoverageAnalysis]: Checked inductivity of 6435 backedges. 2433 proven. 3626 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2019-09-03 20:55:35,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:35,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:35,802 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:35,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:35,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:35,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:35,812 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:55:35,812 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:55:35,876 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:55:35,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:35,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-03 20:55:35,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:35,921 INFO L134 CoverageAnalysis]: Checked inductivity of 6435 backedges. 2433 proven. 3626 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2019-09-03 20:55:35,921 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:36,871 INFO L134 CoverageAnalysis]: Checked inductivity of 6435 backedges. 2433 proven. 3626 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (49)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:55:36,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:36,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 52 [2019-09-03 20:55:36,874 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:36,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-03 20:55:36,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-03 20:55:36,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:55:36,876 INFO L87 Difference]: Start difference. First operand 208 states and 225 transitions. Second operand 52 states. [2019-09-03 20:55:37,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:37,073 INFO L93 Difference]: Finished difference Result 226 states and 243 transitions. [2019-09-03 20:55:37,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-03 20:55:37,073 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 207 [2019-09-03 20:55:37,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:37,075 INFO L225 Difference]: With dead ends: 226 [2019-09-03 20:55:37,075 INFO L226 Difference]: Without dead ends: 226 [2019-09-03 20:55:37,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 365 SyntacticMatches, 50 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:55:37,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-09-03 20:55:37,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 211. [2019-09-03 20:55:37,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-09-03 20:55:37,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 228 transitions. [2019-09-03 20:55:37,079 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 228 transitions. Word has length 207 [2019-09-03 20:55:37,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:37,080 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 228 transitions. [2019-09-03 20:55:37,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-03 20:55:37,080 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 228 transitions. [2019-09-03 20:55:37,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-03 20:55:37,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:37,081 INFO L399 BasicCegarLoop]: trace histogram [67, 66, 50, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:37,082 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:37,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:37,082 INFO L82 PathProgramCache]: Analyzing trace with hash -280213672, now seen corresponding path program 49 times [2019-09-03 20:55:37,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:37,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:37,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:37,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:37,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:37,375 INFO L134 CoverageAnalysis]: Checked inductivity of 6633 backedges. 4200 proven. 801 refuted. 0 times theorem prover too weak. 1632 trivial. 0 not checked. [2019-09-03 20:55:37,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:37,375 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:37,375 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:37,375 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:37,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:37,376 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:55:37,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:37,395 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:37,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-03 20:55:37,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:38,287 INFO L134 CoverageAnalysis]: Checked inductivity of 6633 backedges. 5783 proven. 801 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-03 20:55:38,287 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:39,056 INFO L134 CoverageAnalysis]: Checked inductivity of 6633 backedges. 5783 proven. 801 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-03 20:55:39,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:39,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 53, 53] total 86 [2019-09-03 20:55:39,059 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:39,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-03 20:55:39,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-03 20:55:39,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-09-03 20:55:39,060 INFO L87 Difference]: Start difference. First operand 211 states and 228 transitions. Second operand 53 states. [2019-09-03 20:55:39,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:39,463 INFO L93 Difference]: Finished difference Result 1979 states and 2574 transitions. [2019-09-03 20:55:39,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-03 20:55:39,464 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 210 [2019-09-03 20:55:39,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:39,474 INFO L225 Difference]: With dead ends: 1979 [2019-09-03 20:55:39,475 INFO L226 Difference]: Without dead ends: 1979 [2019-09-03 20:55:39,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 338 SyntacticMatches, 34 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4711 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-09-03 20:55:39,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states. [2019-09-03 20:55:39,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 313. [2019-09-03 20:55:39,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-09-03 20:55:39,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 364 transitions. [2019-09-03 20:55:39,492 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 364 transitions. Word has length 210 [2019-09-03 20:55:39,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:39,493 INFO L475 AbstractCegarLoop]: Abstraction has 313 states and 364 transitions. [2019-09-03 20:55:39,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-03 20:55:39,493 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 364 transitions. [2019-09-03 20:55:39,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-03 20:55:39,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:39,497 INFO L399 BasicCegarLoop]: trace histogram [101, 100, 51, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:39,497 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:39,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:39,497 INFO L82 PathProgramCache]: Analyzing trace with hash -644776136, now seen corresponding path program 50 times [2019-09-03 20:55:39,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:39,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:39,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:39,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:39,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:39,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:43,235 INFO L134 CoverageAnalysis]: Checked inductivity of 15150 backedges. 0 proven. 15150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:43,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:43,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:43,235 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:43,235 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:43,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:43,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:43,246 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:55:43,246 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:55:43,414 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 77 check-sat command(s) [2019-09-03 20:55:43,414 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:43,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 109 conjunts are in the unsatisfiable core [2019-09-03 20:55:43,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:43,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:43,881 INFO L134 CoverageAnalysis]: Checked inductivity of 15150 backedges. 7648 proven. 3876 refuted. 0 times theorem prover too weak. 3626 trivial. 0 not checked. [2019-09-03 20:55:43,882 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:44,250 INFO L134 CoverageAnalysis]: Checked inductivity of 15150 backedges. 7648 proven. 3876 refuted. 0 times theorem prover too weak. 3626 trivial. 0 not checked. [2019-09-03 20:55:44,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:44,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 57, 57] total 108 [2019-09-03 20:55:44,254 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:44,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-09-03 20:55:44,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-09-03 20:55:44,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1491, Invalid=10065, Unknown=0, NotChecked=0, Total=11556 [2019-09-03 20:55:44,255 INFO L87 Difference]: Start difference. First operand 313 states and 364 transitions. Second operand 108 states. [2019-09-03 20:55:51,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:51,371 INFO L93 Difference]: Finished difference Result 4239 states and 4339 transitions. [2019-09-03 20:55:51,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-09-03 20:55:51,372 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 312 [2019-09-03 20:55:51,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:51,392 INFO L225 Difference]: With dead ends: 4239 [2019-09-03 20:55:51,392 INFO L226 Difference]: Without dead ends: 4236 [2019-09-03 20:55:51,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 730 GetRequests, 619 SyntacticMatches, 4 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2860 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1497, Invalid=10275, Unknown=0, NotChecked=0, Total=11772 [2019-09-03 20:55:51,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4236 states. [2019-09-03 20:55:51,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4236 to 4187. [2019-09-03 20:55:51,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4187 states. [2019-09-03 20:55:51,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4187 states to 4187 states and 4287 transitions. [2019-09-03 20:55:51,453 INFO L78 Accepts]: Start accepts. Automaton has 4187 states and 4287 transitions. Word has length 312 [2019-09-03 20:55:51,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:51,454 INFO L475 AbstractCegarLoop]: Abstraction has 4187 states and 4287 transitions. [2019-09-03 20:55:51,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-09-03 20:55:51,454 INFO L276 IsEmpty]: Start isEmpty. Operand 4187 states and 4287 transitions. [2019-09-03 20:55:51,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-09-03 20:55:51,456 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:51,456 INFO L399 BasicCegarLoop]: trace histogram [102, 101, 52, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:51,456 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:51,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:51,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1847249315, now seen corresponding path program 51 times [2019-09-03 20:55:51,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:51,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:51,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:51,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:51,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:52,711 INFO L134 CoverageAnalysis]: Checked inductivity of 15453 backedges. 7903 proven. 7401 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-09-03 20:55:52,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:52,712 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:52,712 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:52,712 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:52,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:52,712 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:52,724 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:55:52,725 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:55:52,824 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:55:52,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:52,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 103 conjunts are in the unsatisfiable core [2019-09-03 20:55:52,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:52,945 INFO L134 CoverageAnalysis]: Checked inductivity of 15453 backedges. 7903 proven. 7401 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-09-03 20:55:52,945 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:54,870 INFO L134 CoverageAnalysis]: Checked inductivity of 15453 backedges. 7903 proven. 7401 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-09-03 20:55:54,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:54,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 54 [2019-09-03 20:55:54,873 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:54,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-03 20:55:54,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-03 20:55:54,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 20:55:54,875 INFO L87 Difference]: Start difference. First operand 4187 states and 4287 transitions. Second operand 54 states. [2019-09-03 20:55:56,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:56,007 INFO L93 Difference]: Finished difference Result 4341 states and 4441 transitions. [2019-09-03 20:55:56,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-03 20:55:56,008 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 315 [2019-09-03 20:55:56,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:56,028 INFO L225 Difference]: With dead ends: 4341 [2019-09-03 20:55:56,029 INFO L226 Difference]: Without dead ends: 4190 [2019-09-03 20:55:56,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 733 GetRequests, 579 SyntacticMatches, 102 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2950 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 20:55:56,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4190 states. [2019-09-03 20:55:56,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4190 to 4190. [2019-09-03 20:55:56,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4190 states. [2019-09-03 20:55:56,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4190 states to 4190 states and 4290 transitions. [2019-09-03 20:55:56,091 INFO L78 Accepts]: Start accepts. Automaton has 4190 states and 4290 transitions. Word has length 315 [2019-09-03 20:55:56,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:56,091 INFO L475 AbstractCegarLoop]: Abstraction has 4190 states and 4290 transitions. [2019-09-03 20:55:56,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-03 20:55:56,092 INFO L276 IsEmpty]: Start isEmpty. Operand 4190 states and 4290 transitions. [2019-09-03 20:55:56,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-03 20:55:56,093 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:56,094 INFO L399 BasicCegarLoop]: trace histogram [103, 102, 52, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:56,094 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:56,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:56,094 INFO L82 PathProgramCache]: Analyzing trace with hash -973780774, now seen corresponding path program 52 times [2019-09-03 20:55:56,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:56,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:56,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:56,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:56,095 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:57,433 INFO L134 CoverageAnalysis]: Checked inductivity of 15759 backedges. 11729 proven. 0 refuted. 0 times theorem prover too weak. 4030 trivial. 0 not checked. [2019-09-03 20:55:57,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:55:57,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2019-09-03 20:55:57,433 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:55:57,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-03 20:55:57,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-03 20:55:57,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 20:55:57,434 INFO L87 Difference]: Start difference. First operand 4190 states and 4290 transitions. Second operand 53 states. [2019-09-03 20:55:57,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:57,689 INFO L93 Difference]: Finished difference Result 157 states and 156 transitions. [2019-09-03 20:55:57,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-03 20:55:57,689 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 318 [2019-09-03 20:55:57,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:57,690 INFO L225 Difference]: With dead ends: 157 [2019-09-03 20:55:57,690 INFO L226 Difference]: Without dead ends: 0 [2019-09-03 20:55:57,690 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 20:55:57,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-03 20:55:57,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-03 20:55:57,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-03 20:55:57,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-03 20:55:57,691 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 318 [2019-09-03 20:55:57,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:57,692 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-03 20:55:57,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-03 20:55:57,692 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-03 20:55:57,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-03 20:55:57,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 08:55:57 BoogieIcfgContainer [2019-09-03 20:55:57,697 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 20:55:57,699 INFO L168 Benchmark]: Toolchain (without parser) took 90928.64 ms. Allocated memory was 132.1 MB in the beginning and 805.8 MB in the end (delta: 673.7 MB). Free memory was 88.1 MB in the beginning and 417.3 MB in the end (delta: -329.2 MB). Peak memory consumption was 344.5 MB. Max. memory is 7.1 GB. [2019-09-03 20:55:57,699 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 132.1 MB. Free memory was 106.3 MB in the beginning and 106.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-03 20:55:57,700 INFO L168 Benchmark]: CACSL2BoogieTranslator took 222.02 ms. Allocated memory is still 132.1 MB. Free memory was 87.7 MB in the beginning and 78.8 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. [2019-09-03 20:55:57,700 INFO L168 Benchmark]: Boogie Preprocessor took 110.36 ms. Allocated memory was 132.1 MB in the beginning and 198.7 MB in the end (delta: 66.6 MB). Free memory was 78.8 MB in the beginning and 176.3 MB in the end (delta: -97.5 MB). Peak memory consumption was 16.7 MB. Max. memory is 7.1 GB. [2019-09-03 20:55:57,701 INFO L168 Benchmark]: RCFGBuilder took 228.39 ms. Allocated memory is still 198.7 MB. Free memory was 176.3 MB in the beginning and 164.7 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. [2019-09-03 20:55:57,702 INFO L168 Benchmark]: TraceAbstraction took 90362.11 ms. Allocated memory was 198.7 MB in the beginning and 805.8 MB in the end (delta: 607.1 MB). Free memory was 164.1 MB in the beginning and 417.3 MB in the end (delta: -253.2 MB). Peak memory consumption was 353.9 MB. Max. memory is 7.1 GB. [2019-09-03 20:55:57,704 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 132.1 MB. Free memory was 106.3 MB in the beginning and 106.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 222.02 ms. Allocated memory is still 132.1 MB. Free memory was 87.7 MB in the beginning and 78.8 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 110.36 ms. Allocated memory was 132.1 MB in the beginning and 198.7 MB in the end (delta: 66.6 MB). Free memory was 78.8 MB in the beginning and 176.3 MB in the end (delta: -97.5 MB). Peak memory consumption was 16.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 228.39 ms. Allocated memory is still 198.7 MB. Free memory was 176.3 MB in the beginning and 164.7 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 90362.11 ms. Allocated memory was 198.7 MB in the beginning and 805.8 MB in the end (delta: 607.1 MB). Free memory was 164.1 MB in the beginning and 417.3 MB in the end (delta: -253.2 MB). Peak memory consumption was 353.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. SAFE Result, 90.3s OverallTime, 55 OverallIterations, 103 TraceHistogramMax, 23.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1027 SDtfs, 961 SDslu, 27456 SDs, 0 SdLazy, 18683 SolverSat, 1331 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14606 GetRequests, 11072 SyntacticMatches, 844 SemanticMatches, 2690 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49844 ImplicationChecksByTransitivity, 63.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4190occurred in iteration=54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 55 MinimizatonAttempts, 2153 StatesRemovedByMinimization, 51 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 60.4s InterpolantComputationTime, 12778 NumberOfCodeBlocks, 12301 NumberOfCodeBlocksAsserted, 592 NumberOfCheckSat, 18834 ConstructedInterpolants, 0 QuantifiedInterpolants, 7840138 SizeOfPredicates, 68 NumberOfNonLiveVariables, 13384 ConjunctsInSsa, 1465 ConjunctsInUnsatCore, 157 InterpolantComputations, 4 PerfectInterpolantSequences, 250034/448443 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...