java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-invgen/down.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 20:52:01,755 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:52:01,757 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:52:01,769 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:52:01,770 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:52:01,771 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:52:01,772 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:52:01,774 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:52:01,775 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:52:01,776 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:52:01,777 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:52:01,778 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:52:01,779 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:52:01,780 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:52:01,781 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:52:01,782 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:52:01,783 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:52:01,784 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:52:01,785 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:52:01,787 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:52:01,789 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:52:01,790 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:52:01,791 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:52:01,792 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:52:01,794 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:52:01,795 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:52:01,795 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:52:01,796 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:52:01,796 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:52:01,797 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:52:01,797 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:52:01,798 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:52:01,799 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:52:01,800 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:52:01,801 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:52:01,801 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:52:01,802 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:52:01,802 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:52:01,802 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:52:01,803 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:52:01,804 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:52:01,804 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:52:01,820 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:52:01,820 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:52:01,820 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 20:52:01,821 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 20:52:01,821 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 20:52:01,821 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 20:52:01,822 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 20:52:01,822 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 20:52:01,822 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 20:52:01,822 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 20:52:01,823 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:52:01,823 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:52:01,823 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:52:01,824 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:52:01,824 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:52:01,824 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:52:01,824 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:52:01,824 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:52:01,824 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:52:01,825 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:52:01,825 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:52:01,825 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 20:52:01,825 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:52:01,825 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:52:01,826 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:52:01,826 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:52:01,826 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 20:52:01,826 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:52:01,826 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:52:01,827 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 20:52:01,854 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:52:01,867 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:52:01,870 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:52:01,871 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:52:01,871 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:52:01,872 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/down.i [2019-09-03 20:52:01,930 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f093cecc/fdd48b7346184e4e91ebc5765db9a62b/FLAG2da369535 [2019-09-03 20:52:02,363 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:52:02,364 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/down.i [2019-09-03 20:52:02,369 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f093cecc/fdd48b7346184e4e91ebc5765db9a62b/FLAG2da369535 [2019-09-03 20:52:02,766 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f093cecc/fdd48b7346184e4e91ebc5765db9a62b [2019-09-03 20:52:02,776 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:52:02,778 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:52:02,779 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:52:02,779 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:52:02,783 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:52:02,784 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:52:02" (1/1) ... [2019-09-03 20:52:02,787 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f273eb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:02, skipping insertion in model container [2019-09-03 20:52:02,787 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:52:02" (1/1) ... [2019-09-03 20:52:02,794 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:52:02,811 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:52:03,040 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:52:03,045 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:52:03,066 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:52:03,083 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:52:03,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:03 WrapperNode [2019-09-03 20:52:03,084 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:52:03,085 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:52:03,085 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:52:03,085 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:52:03,099 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:03" (1/1) ... [2019-09-03 20:52:03,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:03" (1/1) ... [2019-09-03 20:52:03,194 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:03" (1/1) ... [2019-09-03 20:52:03,195 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:03" (1/1) ... [2019-09-03 20:52:03,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:03" (1/1) ... [2019-09-03 20:52:03,205 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:03" (1/1) ... [2019-09-03 20:52:03,206 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:03" (1/1) ... [2019-09-03 20:52:03,212 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:52:03,213 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:52:03,213 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:52:03,213 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:52:03,218 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:52:03,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:52:03,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:52:03,278 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 20:52:03,279 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:52:03,279 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:52:03,279 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 20:52:03,279 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:52:03,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 20:52:03,280 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:52:03,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:52:03,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:52:03,461 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:52:03,461 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-03 20:52:03,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:52:03 BoogieIcfgContainer [2019-09-03 20:52:03,463 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:52:03,471 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:52:03,471 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:52:03,475 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:52:03,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:52:02" (1/3) ... [2019-09-03 20:52:03,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59346f21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:52:03, skipping insertion in model container [2019-09-03 20:52:03,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:03" (2/3) ... [2019-09-03 20:52:03,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59346f21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:52:03, skipping insertion in model container [2019-09-03 20:52:03,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:52:03" (3/3) ... [2019-09-03 20:52:03,493 INFO L109 eAbstractionObserver]: Analyzing ICFG down.i [2019-09-03 20:52:03,512 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:52:03,532 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 20:52:03,560 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 20:52:03,586 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:52:03,586 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 20:52:03,586 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:52:03,586 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:52:03,587 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:52:03,587 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:52:03,587 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:52:03,587 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:52:03,598 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-09-03 20:52:03,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 20:52:03,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:03,606 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:03,608 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:03,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:03,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1785764952, now seen corresponding path program 1 times [2019-09-03 20:52:03,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:03,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:03,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:03,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:03,660 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:03,789 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:52:03,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:03,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:52:03,791 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:03,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:52:03,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:52:03,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:52:03,811 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2019-09-03 20:52:03,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:03,906 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2019-09-03 20:52:03,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:52:03,908 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-09-03 20:52:03,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:03,919 INFO L225 Difference]: With dead ends: 27 [2019-09-03 20:52:03,919 INFO L226 Difference]: Without dead ends: 17 [2019-09-03 20:52:03,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:52:03,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-03 20:52:03,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-03 20:52:03,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-03 20:52:03,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-09-03 20:52:03,956 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2019-09-03 20:52:03,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:03,956 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-09-03 20:52:03,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:52:03,957 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-09-03 20:52:03,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-03 20:52:03,958 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:03,958 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:03,958 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:03,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:03,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1701245161, now seen corresponding path program 1 times [2019-09-03 20:52:03,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:03,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:03,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:03,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:03,961 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:04,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:04,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:04,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 20:52:04,020 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:04,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:52:04,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:52:04,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:52:04,022 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 6 states. [2019-09-03 20:52:04,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:04,099 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2019-09-03 20:52:04,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:52:04,099 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-09-03 20:52:04,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:04,102 INFO L225 Difference]: With dead ends: 27 [2019-09-03 20:52:04,102 INFO L226 Difference]: Without dead ends: 27 [2019-09-03 20:52:04,103 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:52:04,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-03 20:52:04,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2019-09-03 20:52:04,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-03 20:52:04,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-09-03 20:52:04,113 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 13 [2019-09-03 20:52:04,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:04,114 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-09-03 20:52:04,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:52:04,114 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-09-03 20:52:04,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 20:52:04,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:04,115 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:04,115 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:04,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:04,116 INFO L82 PathProgramCache]: Analyzing trace with hash -186817542, now seen corresponding path program 1 times [2019-09-03 20:52:04,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:04,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:04,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:04,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:04,118 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:04,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:04,229 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:04,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:04,230 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:04,235 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2019-09-03 20:52:04,240 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [17], [26], [28], [34], [37], [39], [42], [44], [45], [46], [47], [49], [50] [2019-09-03 20:52:04,267 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:52:04,267 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:52:04,438 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:52:04,440 INFO L272 AbstractInterpreter]: Visited 17 different actions 85 times. Merged at 6 different actions 28 times. Widened at 2 different actions 4 times. Performed 167 root evaluator evaluations with a maximum evaluation depth of 6. Performed 167 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 5 fixpoints after 3 different actions. Largest state had 9 variables. [2019-09-03 20:52:04,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:04,444 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:52:04,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:04,444 INFO 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:52:04,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:04,460 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:52:04,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:04,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-03 20:52:04,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:04,506 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:04,507 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:04,558 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:04,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:04,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2019-09-03 20:52:04,564 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:04,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:52:04,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:52:04,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:52:04,566 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 7 states. [2019-09-03 20:52:04,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:04,647 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2019-09-03 20:52:04,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:52:04,648 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-09-03 20:52:04,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:04,650 INFO L225 Difference]: With dead ends: 29 [2019-09-03 20:52:04,651 INFO L226 Difference]: Without dead ends: 24 [2019-09-03 20:52:04,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:52:04,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-03 20:52:04,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-03 20:52:04,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-03 20:52:04,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-09-03 20:52:04,657 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 20 [2019-09-03 20:52:04,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:04,657 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-09-03 20:52:04,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:52:04,657 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-09-03 20:52:04,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-03 20:52:04,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:04,659 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:04,659 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:04,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:04,659 INFO L82 PathProgramCache]: Analyzing trace with hash 151164811, now seen corresponding path program 2 times [2019-09-03 20:52:04,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:04,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:04,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:04,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:04,661 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:04,740 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:04,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:04,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:04,741 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:04,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:52:04,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:04,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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:04,769 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:04,769 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:52:04,784 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-03 20:52:04,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:04,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 20:52:04,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:04,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:04,824 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:04,825 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:04,877 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:04,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:04,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2019-09-03 20:52:04,882 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:04,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 20:52:04,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 20:52:04,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:52:04,883 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 9 states. [2019-09-03 20:52:04,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:04,948 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2019-09-03 20:52:04,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:52:04,950 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-09-03 20:52:04,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:04,951 INFO L225 Difference]: With dead ends: 35 [2019-09-03 20:52:04,951 INFO L226 Difference]: Without dead ends: 35 [2019-09-03 20:52:04,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:52:04,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-03 20:52:04,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2019-09-03 20:52:04,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-03 20:52:04,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-09-03 20:52:04,957 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 21 [2019-09-03 20:52:04,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:04,959 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-09-03 20:52:04,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 20:52:04,960 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-09-03 20:52:04,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 20:52:04,961 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:04,961 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:04,961 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:04,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:04,961 INFO L82 PathProgramCache]: Analyzing trace with hash -596024552, now seen corresponding path program 3 times [2019-09-03 20:52:04,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:04,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:04,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:04,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:04,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:04,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:05,068 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:52:05,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:05,069 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:05,070 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:05,070 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:52:05,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:05,070 INFO 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:52:05,083 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:05,083 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:52:05,103 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:05,103 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:05,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 20:52:05,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:05,115 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:52:05,115 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:05,176 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:52:05,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:05,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2019-09-03 20:52:05,181 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:05,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 20:52:05,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 20:52:05,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:52:05,182 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 9 states. [2019-09-03 20:52:05,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:05,289 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-09-03 20:52:05,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:52:05,290 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2019-09-03 20:52:05,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:05,291 INFO L225 Difference]: With dead ends: 40 [2019-09-03 20:52:05,296 INFO L226 Difference]: Without dead ends: 32 [2019-09-03 20:52:05,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-09-03 20:52:05,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-03 20:52:05,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-09-03 20:52:05,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-03 20:52:05,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-09-03 20:52:05,303 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 28 [2019-09-03 20:52:05,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:05,303 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-09-03 20:52:05,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 20:52:05,304 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-09-03 20:52:05,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-03 20:52:05,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:05,308 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:05,308 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:05,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:05,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1736542807, now seen corresponding path program 4 times [2019-09-03 20:52:05,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:05,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:05,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:05,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:05,315 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:05,415 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:52:05,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:05,417 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:05,417 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:05,417 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:52:05,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:05,418 INFO 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:52:05,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:05,442 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:52:05,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:05,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 20:52:05,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:05,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:05,504 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:52:05,504 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:05,551 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:52:05,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:05,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2019-09-03 20:52:05,555 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:05,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 20:52:05,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 20:52:05,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:52:05,557 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 10 states. [2019-09-03 20:52:05,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:05,619 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2019-09-03 20:52:05,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:52:05,620 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-09-03 20:52:05,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:05,621 INFO L225 Difference]: With dead ends: 43 [2019-09-03 20:52:05,621 INFO L226 Difference]: Without dead ends: 43 [2019-09-03 20:52:05,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:52:05,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-03 20:52:05,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2019-09-03 20:52:05,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-03 20:52:05,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-09-03 20:52:05,634 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 29 [2019-09-03 20:52:05,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:05,635 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-09-03 20:52:05,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 20:52:05,635 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-09-03 20:52:05,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-03 20:52:05,636 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:05,636 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:05,637 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:05,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:05,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1844119354, now seen corresponding path program 5 times [2019-09-03 20:52:05,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:05,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:05,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:05,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:05,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:05,781 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:52:05,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:05,782 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:05,782 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:05,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:52:05,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:05,783 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:05,801 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:05,802 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:52:05,818 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 20:52:05,819 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:05,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 20:52:05,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:05,831 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:52:05,831 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:05,914 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:52:05,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:05,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 11 [2019-09-03 20:52:05,918 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:05,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 20:52:05,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 20:52:05,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:52:05,920 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 11 states. [2019-09-03 20:52:06,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:06,069 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2019-09-03 20:52:06,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 20:52:06,069 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-09-03 20:52:06,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:06,070 INFO L225 Difference]: With dead ends: 51 [2019-09-03 20:52:06,070 INFO L226 Difference]: Without dead ends: 40 [2019-09-03 20:52:06,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 65 SyntacticMatches, 8 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-09-03 20:52:06,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-03 20:52:06,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-09-03 20:52:06,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-03 20:52:06,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-09-03 20:52:06,076 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 36 [2019-09-03 20:52:06,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:06,076 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-09-03 20:52:06,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 20:52:06,077 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-09-03 20:52:06,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-03 20:52:06,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:06,078 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:06,078 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:06,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:06,079 INFO L82 PathProgramCache]: Analyzing trace with hash 528545995, now seen corresponding path program 6 times [2019-09-03 20:52:06,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:06,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:06,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:06,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:06,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:06,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:06,138 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:52:06,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:06,139 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:06,139 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:06,139 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:52:06,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:06,139 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:52:06,159 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:06,159 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:06,176 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:06,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:06,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 20:52:06,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:06,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:06,212 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:52:06,212 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:06,287 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:52:06,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:06,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2019-09-03 20:52:06,290 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:06,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 20:52:06,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 20:52:06,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:52:06,292 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 11 states. [2019-09-03 20:52:06,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:06,381 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2019-09-03 20:52:06,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 20:52:06,381 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2019-09-03 20:52:06,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:06,382 INFO L225 Difference]: With dead ends: 51 [2019-09-03 20:52:06,383 INFO L226 Difference]: Without dead ends: 51 [2019-09-03 20:52:06,383 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 68 SyntacticMatches, 8 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:52:06,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-03 20:52:06,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2019-09-03 20:52:06,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-03 20:52:06,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-09-03 20:52:06,388 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 37 [2019-09-03 20:52:06,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:06,389 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-09-03 20:52:06,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 20:52:06,389 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-09-03 20:52:06,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-03 20:52:06,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:06,390 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:06,390 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:06,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:06,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1720130008, now seen corresponding path program 7 times [2019-09-03 20:52:06,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:06,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:06,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:06,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:06,392 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:06,490 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 20:52:06,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:06,491 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:06,491 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:06,491 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:52:06,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:06,491 INFO 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:52:06,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:06,511 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:52:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:06,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 20:52:06,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:06,541 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 20:52:06,541 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:06,628 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 20:52:06,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:06,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 13 [2019-09-03 20:52:06,633 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:06,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 20:52:06,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 20:52:06,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-09-03 20:52:06,635 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 13 states. [2019-09-03 20:52:06,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:06,755 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2019-09-03 20:52:06,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 20:52:06,755 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2019-09-03 20:52:06,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:06,756 INFO L225 Difference]: With dead ends: 62 [2019-09-03 20:52:06,756 INFO L226 Difference]: Without dead ends: 48 [2019-09-03 20:52:06,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 79 SyntacticMatches, 10 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2019-09-03 20:52:06,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-03 20:52:06,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-09-03 20:52:06,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-03 20:52:06,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-09-03 20:52:06,762 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 44 [2019-09-03 20:52:06,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:06,762 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-09-03 20:52:06,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 20:52:06,763 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-09-03 20:52:06,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-03 20:52:06,764 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:06,764 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:06,764 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:06,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:06,765 INFO L82 PathProgramCache]: Analyzing trace with hash 442428009, now seen corresponding path program 8 times [2019-09-03 20:52:06,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:06,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:06,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:06,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:06,766 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:06,879 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 20:52:06,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:06,880 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:06,880 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:06,880 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:52:06,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:06,882 INFO 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:52:06,893 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:06,893 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:52:06,922 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-03 20:52:06,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:06,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 20:52:06,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:06,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:06,976 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 20:52:06,976 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:07,051 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 20:52:07,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:07,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 12 [2019-09-03 20:52:07,055 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:07,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 20:52:07,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 20:52:07,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:52:07,057 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 12 states. [2019-09-03 20:52:07,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:07,135 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2019-09-03 20:52:07,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 20:52:07,136 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2019-09-03 20:52:07,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:07,138 INFO L225 Difference]: With dead ends: 59 [2019-09-03 20:52:07,138 INFO L226 Difference]: Without dead ends: 59 [2019-09-03 20:52:07,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 83 SyntacticMatches, 10 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-09-03 20:52:07,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-03 20:52:07,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2019-09-03 20:52:07,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-03 20:52:07,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-09-03 20:52:07,143 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 45 [2019-09-03 20:52:07,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:07,144 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-09-03 20:52:07,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 20:52:07,144 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-09-03 20:52:07,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-03 20:52:07,145 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:07,145 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:07,145 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:07,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:07,146 INFO L82 PathProgramCache]: Analyzing trace with hash 21084794, now seen corresponding path program 9 times [2019-09-03 20:52:07,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:07,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:07,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:07,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:07,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:07,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:07,258 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 20:52:07,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:07,259 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:07,259 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:07,259 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:52:07,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:07,259 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:52:07,274 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:07,274 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:07,295 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:07,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:07,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 20:52:07,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:07,308 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 20:52:07,308 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:07,438 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 20:52:07,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:07,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 15 [2019-09-03 20:52:07,444 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:07,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 20:52:07,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 20:52:07,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-09-03 20:52:07,446 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 15 states. [2019-09-03 20:52:07,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:07,635 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2019-09-03 20:52:07,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 20:52:07,635 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2019-09-03 20:52:07,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:07,636 INFO L225 Difference]: With dead ends: 73 [2019-09-03 20:52:07,637 INFO L226 Difference]: Without dead ends: 56 [2019-09-03 20:52:07,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 93 SyntacticMatches, 12 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2019-09-03 20:52:07,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-03 20:52:07,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-09-03 20:52:07,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-03 20:52:07,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-09-03 20:52:07,645 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 52 [2019-09-03 20:52:07,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:07,645 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-09-03 20:52:07,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 20:52:07,646 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-09-03 20:52:07,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-03 20:52:07,649 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:07,649 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:07,649 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:07,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:07,650 INFO L82 PathProgramCache]: Analyzing trace with hash -2096338421, now seen corresponding path program 10 times [2019-09-03 20:52:07,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:07,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:07,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:07,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:07,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:07,753 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 31 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 20:52:07,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:07,753 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:07,753 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:07,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:52:07,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:07,754 INFO 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:52:07,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:07,768 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:52:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:07,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 20:52:07,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:07,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:07,837 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 31 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 20:52:07,837 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:07,914 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 31 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 20:52:07,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:07,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2019-09-03 20:52:07,919 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:07,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 20:52:07,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 20:52:07,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-09-03 20:52:07,920 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 13 states. [2019-09-03 20:52:08,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:08,037 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2019-09-03 20:52:08,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 20:52:08,038 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2019-09-03 20:52:08,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:08,039 INFO L225 Difference]: With dead ends: 67 [2019-09-03 20:52:08,039 INFO L226 Difference]: Without dead ends: 67 [2019-09-03 20:52:08,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 98 SyntacticMatches, 12 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-09-03 20:52:08,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-03 20:52:08,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2019-09-03 20:52:08,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-03 20:52:08,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-09-03 20:52:08,045 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 53 [2019-09-03 20:52:08,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:08,045 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-09-03 20:52:08,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 20:52:08,045 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-09-03 20:52:08,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-03 20:52:08,046 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:08,046 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:08,046 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:08,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:08,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1572192408, now seen corresponding path program 11 times [2019-09-03 20:52:08,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:08,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:08,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:08,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:08,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:08,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:08,189 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 69 proven. 21 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:52:08,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:08,189 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:08,190 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:08,190 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:52:08,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:08,190 INFO 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:52:08,208 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:08,208 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:52:08,237 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-03 20:52:08,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:08,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 20:52:08,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:08,251 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 69 proven. 21 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:52:08,251 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:08,359 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 69 proven. 21 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:52:08,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:08,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 17 [2019-09-03 20:52:08,363 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:08,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 20:52:08,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 20:52:08,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-09-03 20:52:08,365 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 17 states. [2019-09-03 20:52:08,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:08,573 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2019-09-03 20:52:08,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 20:52:08,574 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 60 [2019-09-03 20:52:08,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:08,575 INFO L225 Difference]: With dead ends: 84 [2019-09-03 20:52:08,575 INFO L226 Difference]: Without dead ends: 64 [2019-09-03 20:52:08,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 107 SyntacticMatches, 14 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2019-09-03 20:52:08,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-03 20:52:08,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-09-03 20:52:08,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-03 20:52:08,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2019-09-03 20:52:08,581 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 60 [2019-09-03 20:52:08,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:08,581 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2019-09-03 20:52:08,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 20:52:08,581 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2019-09-03 20:52:08,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-03 20:52:08,582 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:08,582 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:08,583 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:08,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:08,583 INFO L82 PathProgramCache]: Analyzing trace with hash 941903657, now seen corresponding path program 12 times [2019-09-03 20:52:08,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:08,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:08,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:08,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:08,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:08,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:08,673 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 40 proven. 57 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:52:08,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:08,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:08,673 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:08,673 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:52:08,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:08,674 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:52:08,693 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:08,693 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:52:08,714 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:08,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:08,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 20:52:08,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:08,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:08,742 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 40 proven. 57 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:52:08,742 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:08,851 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 40 proven. 57 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:52:08,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:08,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 14 [2019-09-03 20:52:08,857 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:08,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 20:52:08,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 20:52:08,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-09-03 20:52:08,858 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 14 states. [2019-09-03 20:52:08,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:08,983 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2019-09-03 20:52:08,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 20:52:08,983 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 61 [2019-09-03 20:52:08,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:08,985 INFO L225 Difference]: With dead ends: 75 [2019-09-03 20:52:08,985 INFO L226 Difference]: Without dead ends: 75 [2019-09-03 20:52:08,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 113 SyntacticMatches, 14 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2019-09-03 20:52:08,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-03 20:52:08,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2019-09-03 20:52:09,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-03 20:52:09,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-09-03 20:52:09,001 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 61 [2019-09-03 20:52:09,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:09,002 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-09-03 20:52:09,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 20:52:09,006 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-09-03 20:52:09,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-03 20:52:09,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:09,008 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:09,011 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:09,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:09,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1438286406, now seen corresponding path program 13 times [2019-09-03 20:52:09,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:09,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:09,013 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:09,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:09,014 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:09,261 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 91 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:52:09,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:09,261 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:09,261 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:09,262 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:52:09,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:09,262 INFO 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) [2019-09-03 20:52:09,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:09,284 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:09,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 20:52:09,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:09,329 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 91 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:52:09,330 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:09,506 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 91 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:52:09,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:09,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 19 [2019-09-03 20:52:09,510 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:09,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 20:52:09,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 20:52:09,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-09-03 20:52:09,512 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 19 states. [2019-09-03 20:52:09,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:09,715 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2019-09-03 20:52:09,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 20:52:09,717 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 68 [2019-09-03 20:52:09,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:09,719 INFO L225 Difference]: With dead ends: 95 [2019-09-03 20:52:09,719 INFO L226 Difference]: Without dead ends: 72 [2019-09-03 20:52:09,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 121 SyntacticMatches, 16 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=199, Invalid=557, Unknown=0, NotChecked=0, Total=756 [2019-09-03 20:52:09,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-03 20:52:09,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-09-03 20:52:09,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-03 20:52:09,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2019-09-03 20:52:09,736 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 68 [2019-09-03 20:52:09,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:09,736 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2019-09-03 20:52:09,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 20:52:09,737 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2019-09-03 20:52:09,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-03 20:52:09,738 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:09,738 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:09,740 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:09,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:09,741 INFO L82 PathProgramCache]: Analyzing trace with hash 654895947, now seen corresponding path program 14 times [2019-09-03 20:52:09,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:09,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:09,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:09,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:09,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:09,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:09,870 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 50 proven. 77 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:52:09,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:09,871 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:09,871 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:09,871 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:52:09,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:09,872 INFO 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) [2019-09-03 20:52:09,892 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:09,893 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:09,924 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-03 20:52:09,924 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:09,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 20:52:09,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:09,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:09,962 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 50 proven. 77 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:52:09,962 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:10,083 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 50 proven. 77 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:52:10,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:10,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 15 [2019-09-03 20:52:10,087 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:10,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 20:52:10,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 20:52:10,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-09-03 20:52:10,091 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 15 states. [2019-09-03 20:52:10,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:10,183 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2019-09-03 20:52:10,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 20:52:10,183 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 69 [2019-09-03 20:52:10,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:10,184 INFO L225 Difference]: With dead ends: 83 [2019-09-03 20:52:10,184 INFO L226 Difference]: Without dead ends: 83 [2019-09-03 20:52:10,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 128 SyntacticMatches, 16 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-09-03 20:52:10,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-09-03 20:52:10,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2019-09-03 20:52:10,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-03 20:52:10,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-09-03 20:52:10,188 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 69 [2019-09-03 20:52:10,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:10,189 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-09-03 20:52:10,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 20:52:10,189 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-09-03 20:52:10,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-03 20:52:10,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:10,190 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:10,190 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:10,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:10,190 INFO L82 PathProgramCache]: Analyzing trace with hash -165587112, now seen corresponding path program 15 times [2019-09-03 20:52:10,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:10,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:10,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:10,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:10,192 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:10,364 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 116 proven. 36 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:52:10,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:10,365 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:10,365 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:10,365 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:52:10,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:10,365 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:10,377 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:10,377 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:52:10,404 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:10,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:10,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 20:52:10,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:10,418 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 116 proven. 36 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:52:10,418 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:10,589 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 116 proven. 36 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:52:10,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:10,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 21 [2019-09-03 20:52:10,592 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:10,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 20:52:10,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 20:52:10,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2019-09-03 20:52:10,593 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 21 states. [2019-09-03 20:52:10,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:10,924 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2019-09-03 20:52:10,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 20:52:10,928 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 76 [2019-09-03 20:52:10,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:10,928 INFO L225 Difference]: With dead ends: 106 [2019-09-03 20:52:10,929 INFO L226 Difference]: Without dead ends: 80 [2019-09-03 20:52:10,929 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 135 SyntacticMatches, 18 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=241, Invalid=689, Unknown=0, NotChecked=0, Total=930 [2019-09-03 20:52:10,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-03 20:52:10,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-09-03 20:52:10,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-03 20:52:10,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2019-09-03 20:52:10,933 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 76 [2019-09-03 20:52:10,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:10,934 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2019-09-03 20:52:10,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 20:52:10,934 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2019-09-03 20:52:10,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-03 20:52:10,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:10,935 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:10,935 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:10,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:10,935 INFO L82 PathProgramCache]: Analyzing trace with hash 501916649, now seen corresponding path program 16 times [2019-09-03 20:52:10,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:10,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:10,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:10,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:10,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:10,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:11,039 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 61 proven. 100 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:52:11,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:11,039 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:11,039 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:11,039 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:11,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:11,040 INFO 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:52:11,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:11,051 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:52:11,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:11,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 20:52:11,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:11,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:11,113 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 61 proven. 100 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:52:11,113 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:11,229 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 61 proven. 100 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:52:11,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:11,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 16 [2019-09-03 20:52:11,232 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:11,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 20:52:11,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 20:52:11,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-09-03 20:52:11,233 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 16 states. [2019-09-03 20:52:11,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:11,359 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2019-09-03 20:52:11,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 20:52:11,360 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 77 [2019-09-03 20:52:11,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:11,362 INFO L225 Difference]: With dead ends: 91 [2019-09-03 20:52:11,362 INFO L226 Difference]: Without dead ends: 91 [2019-09-03 20:52:11,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 143 SyntacticMatches, 18 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-09-03 20:52:11,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-03 20:52:11,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2019-09-03 20:52:11,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-03 20:52:11,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-09-03 20:52:11,367 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 77 [2019-09-03 20:52:11,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:11,368 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-09-03 20:52:11,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 20:52:11,368 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-09-03 20:52:11,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-03 20:52:11,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:11,369 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:11,369 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:11,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:11,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1520807686, now seen corresponding path program 17 times [2019-09-03 20:52:11,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:11,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:11,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:11,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:11,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:11,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:11,596 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 144 proven. 45 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:52:11,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:11,596 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:11,596 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:11,596 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:52:11,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:11,596 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:11,611 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:11,611 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:52:11,642 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-03 20:52:11,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:11,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 20:52:11,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:11,656 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 144 proven. 45 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:52:11,656 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:11,856 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 144 proven. 45 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:52:11,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:11,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 23 [2019-09-03 20:52:11,860 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:11,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 20:52:11,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 20:52:11,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2019-09-03 20:52:11,863 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 23 states. [2019-09-03 20:52:12,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:12,262 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2019-09-03 20:52:12,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 20:52:12,263 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 84 [2019-09-03 20:52:12,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:12,264 INFO L225 Difference]: With dead ends: 117 [2019-09-03 20:52:12,264 INFO L226 Difference]: Without dead ends: 88 [2019-09-03 20:52:12,264 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 149 SyntacticMatches, 20 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=287, Invalid=835, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 20:52:12,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-03 20:52:12,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-09-03 20:52:12,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-03 20:52:12,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2019-09-03 20:52:12,268 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 84 [2019-09-03 20:52:12,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:12,269 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2019-09-03 20:52:12,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 20:52:12,269 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2019-09-03 20:52:12,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-03 20:52:12,270 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:12,270 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:12,270 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:12,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:12,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1071283339, now seen corresponding path program 18 times [2019-09-03 20:52:12,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:12,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:12,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:12,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:12,271 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:12,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:12,393 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 73 proven. 126 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:52:12,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:12,394 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:12,394 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:12,394 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:52:12,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:12,394 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:52:12,411 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:12,411 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:12,442 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:12,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:12,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 20:52:12,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:12,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:12,483 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 73 proven. 126 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:52:12,483 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:12,689 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 73 proven. 126 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:52:12,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:12,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 17 [2019-09-03 20:52:12,693 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:12,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 20:52:12,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 20:52:12,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-09-03 20:52:12,695 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 17 states. [2019-09-03 20:52:12,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:12,867 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2019-09-03 20:52:12,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 20:52:12,867 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2019-09-03 20:52:12,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:12,869 INFO L225 Difference]: With dead ends: 99 [2019-09-03 20:52:12,869 INFO L226 Difference]: Without dead ends: 99 [2019-09-03 20:52:12,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 158 SyntacticMatches, 20 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2019-09-03 20:52:12,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-03 20:52:12,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2019-09-03 20:52:12,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-03 20:52:12,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-09-03 20:52:12,878 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 85 [2019-09-03 20:52:12,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:12,880 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-09-03 20:52:12,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 20:52:12,880 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-09-03 20:52:12,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-03 20:52:12,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:12,885 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:12,885 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:12,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:12,886 INFO L82 PathProgramCache]: Analyzing trace with hash 48619032, now seen corresponding path program 19 times [2019-09-03 20:52:12,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:12,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:12,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:12,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:12,889 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:13,138 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 175 proven. 55 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:52:13,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:13,139 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:13,139 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:13,139 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:52:13,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:13,139 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:52:13,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:13,160 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:52:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:13,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 20:52:13,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:13,202 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 175 proven. 55 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:52:13,203 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:13,416 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 175 proven. 55 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:52:13,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:13,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 25 [2019-09-03 20:52:13,420 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:13,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 20:52:13,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 20:52:13,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2019-09-03 20:52:13,422 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 25 states. [2019-09-03 20:52:13,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:13,874 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2019-09-03 20:52:13,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 20:52:13,876 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 92 [2019-09-03 20:52:13,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:13,877 INFO L225 Difference]: With dead ends: 128 [2019-09-03 20:52:13,877 INFO L226 Difference]: Without dead ends: 96 [2019-09-03 20:52:13,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 163 SyntacticMatches, 22 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=337, Invalid=995, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 20:52:13,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-03 20:52:13,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-09-03 20:52:13,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-03 20:52:13,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2019-09-03 20:52:13,882 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 92 [2019-09-03 20:52:13,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:13,882 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2019-09-03 20:52:13,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 20:52:13,882 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2019-09-03 20:52:13,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-03 20:52:13,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:13,883 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:13,883 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:13,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:13,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1764890455, now seen corresponding path program 20 times [2019-09-03 20:52:13,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:13,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:13,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:13,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:13,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:13,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:14,009 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 86 proven. 155 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:52:14,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:14,009 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:14,010 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:14,010 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:52:14,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:14,010 INFO 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:52:14,029 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:14,029 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:52:14,064 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-03 20:52:14,064 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:14,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 20:52:14,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:14,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:14,121 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 86 proven. 155 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:52:14,121 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:14,306 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 86 proven. 155 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:52:14,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:14,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 18 [2019-09-03 20:52:14,310 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:14,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 20:52:14,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 20:52:14,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2019-09-03 20:52:14,311 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 18 states. [2019-09-03 20:52:14,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:14,452 INFO L93 Difference]: Finished difference Result 107 states and 109 transitions. [2019-09-03 20:52:14,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 20:52:14,455 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 93 [2019-09-03 20:52:14,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:14,456 INFO L225 Difference]: With dead ends: 107 [2019-09-03 20:52:14,457 INFO L226 Difference]: Without dead ends: 107 [2019-09-03 20:52:14,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 173 SyntacticMatches, 22 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2019-09-03 20:52:14,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-03 20:52:14,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2019-09-03 20:52:14,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-03 20:52:14,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-09-03 20:52:14,461 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 93 [2019-09-03 20:52:14,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:14,461 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-09-03 20:52:14,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 20:52:14,462 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-09-03 20:52:14,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-03 20:52:14,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:14,463 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:14,463 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:14,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:14,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1343998918, now seen corresponding path program 21 times [2019-09-03 20:52:14,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:14,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:14,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:14,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:14,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:14,723 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 209 proven. 66 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:52:14,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:14,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:14,723 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:14,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:14,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:14,724 INFO 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:52:14,734 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:14,734 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:52:14,768 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:14,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:14,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 20:52:14,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:14,786 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 209 proven. 66 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:52:14,787 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:15,026 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 209 proven. 66 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:52:15,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:15,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 27 [2019-09-03 20:52:15,029 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:15,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 20:52:15,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 20:52:15,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=519, Unknown=0, NotChecked=0, Total=702 [2019-09-03 20:52:15,031 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 27 states. [2019-09-03 20:52:15,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:15,541 INFO L93 Difference]: Finished difference Result 139 states and 151 transitions. [2019-09-03 20:52:15,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 20:52:15,542 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 100 [2019-09-03 20:52:15,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:15,543 INFO L225 Difference]: With dead ends: 139 [2019-09-03 20:52:15,544 INFO L226 Difference]: Without dead ends: 104 [2019-09-03 20:52:15,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 177 SyntacticMatches, 24 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=391, Invalid=1169, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 20:52:15,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-03 20:52:15,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-09-03 20:52:15,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-03 20:52:15,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2019-09-03 20:52:15,549 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 100 [2019-09-03 20:52:15,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:15,549 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2019-09-03 20:52:15,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 20:52:15,549 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2019-09-03 20:52:15,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-03 20:52:15,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:15,551 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:15,551 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:15,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:15,551 INFO L82 PathProgramCache]: Analyzing trace with hash -2098913845, now seen corresponding path program 22 times [2019-09-03 20:52:15,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:15,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:15,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:15,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:15,552 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:15,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:15,720 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 100 proven. 187 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:52:15,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:15,721 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:15,721 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:15,721 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:52:15,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:15,722 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:52:15,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:15,738 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:15,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 20:52:15,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:15,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:15,830 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 100 proven. 187 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:52:15,830 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:16,030 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 100 proven. 187 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:52:16,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:16,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 19 [2019-09-03 20:52:16,034 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:16,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 20:52:16,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 20:52:16,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-09-03 20:52:16,039 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 19 states. [2019-09-03 20:52:16,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:16,155 INFO L93 Difference]: Finished difference Result 115 states and 117 transitions. [2019-09-03 20:52:16,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-03 20:52:16,155 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 101 [2019-09-03 20:52:16,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:16,157 INFO L225 Difference]: With dead ends: 115 [2019-09-03 20:52:16,157 INFO L226 Difference]: Without dead ends: 115 [2019-09-03 20:52:16,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 188 SyntacticMatches, 24 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2019-09-03 20:52:16,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-09-03 20:52:16,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2019-09-03 20:52:16,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-09-03 20:52:16,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-09-03 20:52:16,163 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 101 [2019-09-03 20:52:16,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:16,163 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-09-03 20:52:16,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 20:52:16,163 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-09-03 20:52:16,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-03 20:52:16,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:16,165 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:16,165 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:16,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:16,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1239460648, now seen corresponding path program 23 times [2019-09-03 20:52:16,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:16,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:16,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:16,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:16,166 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:16,447 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 246 proven. 78 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:52:16,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:16,448 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:16,448 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:16,448 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:52:16,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:16,448 INFO 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:52:16,458 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:16,458 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:52:16,505 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-03 20:52:16,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:16,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 20:52:16,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:16,521 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 246 proven. 78 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:52:16,521 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:16,845 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 246 proven. 78 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:52:16,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:16,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 29 [2019-09-03 20:52:16,849 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:16,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 20:52:16,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 20:52:16,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=601, Unknown=0, NotChecked=0, Total=812 [2019-09-03 20:52:16,850 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 29 states. [2019-09-03 20:52:17,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:17,221 INFO L93 Difference]: Finished difference Result 150 states and 163 transitions. [2019-09-03 20:52:17,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 20:52:17,222 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 108 [2019-09-03 20:52:17,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:17,224 INFO L225 Difference]: With dead ends: 150 [2019-09-03 20:52:17,224 INFO L226 Difference]: Without dead ends: 112 [2019-09-03 20:52:17,225 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 191 SyntacticMatches, 26 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=449, Invalid=1357, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 20:52:17,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-03 20:52:17,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-09-03 20:52:17,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-03 20:52:17,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2019-09-03 20:52:17,231 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 108 [2019-09-03 20:52:17,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:17,231 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2019-09-03 20:52:17,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 20:52:17,231 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2019-09-03 20:52:17,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-03 20:52:17,232 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:17,233 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:17,233 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:17,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:17,233 INFO L82 PathProgramCache]: Analyzing trace with hash -857072279, now seen corresponding path program 24 times [2019-09-03 20:52:17,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:17,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:17,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:17,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:17,234 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:17,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:17,395 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 115 proven. 222 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:52:17,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:17,396 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:17,396 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:17,396 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:52:17,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:17,396 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:17,406 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:17,406 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:52:17,444 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:17,444 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:17,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 20:52:17,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:17,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:17,503 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 115 proven. 222 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:52:17,503 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:17,732 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 115 proven. 222 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:52:17,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:17,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 20 [2019-09-03 20:52:17,735 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:17,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 20:52:17,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 20:52:17,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2019-09-03 20:52:17,737 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 20 states. [2019-09-03 20:52:17,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:17,889 INFO L93 Difference]: Finished difference Result 123 states and 125 transitions. [2019-09-03 20:52:17,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 20:52:17,890 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 109 [2019-09-03 20:52:17,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:17,891 INFO L225 Difference]: With dead ends: 123 [2019-09-03 20:52:17,891 INFO L226 Difference]: Without dead ends: 123 [2019-09-03 20:52:17,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 203 SyntacticMatches, 26 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2019-09-03 20:52:17,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-09-03 20:52:17,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2019-09-03 20:52:17,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-03 20:52:17,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2019-09-03 20:52:17,897 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 109 [2019-09-03 20:52:17,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:17,898 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2019-09-03 20:52:17,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 20:52:17,898 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2019-09-03 20:52:17,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-03 20:52:17,899 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:17,899 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:17,899 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:17,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:17,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1212622714, now seen corresponding path program 25 times [2019-09-03 20:52:17,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:17,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:17,901 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:17,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:17,901 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:17,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:18,228 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 286 proven. 91 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:52:18,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:18,229 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:18,229 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:18,229 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:52:18,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:18,229 INFO 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) [2019-09-03 20:52:18,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:18,244 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:18,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:18,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 20:52:18,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:18,327 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 286 proven. 91 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:52:18,328 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:18,619 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 286 proven. 91 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:52:18,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:18,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 31 [2019-09-03 20:52:18,622 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:18,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 20:52:18,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 20:52:18,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=689, Unknown=0, NotChecked=0, Total=930 [2019-09-03 20:52:18,623 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 31 states. [2019-09-03 20:52:19,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:19,319 INFO L93 Difference]: Finished difference Result 161 states and 175 transitions. [2019-09-03 20:52:19,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 20:52:19,319 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 116 [2019-09-03 20:52:19,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:19,320 INFO L225 Difference]: With dead ends: 161 [2019-09-03 20:52:19,321 INFO L226 Difference]: Without dead ends: 120 [2019-09-03 20:52:19,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 205 SyntacticMatches, 28 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=511, Invalid=1559, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 20:52:19,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-03 20:52:19,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-09-03 20:52:19,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-03 20:52:19,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2019-09-03 20:52:19,326 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 116 [2019-09-03 20:52:19,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:19,327 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2019-09-03 20:52:19,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 20:52:19,327 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2019-09-03 20:52:19,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-03 20:52:19,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:19,328 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:19,328 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:19,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:19,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1720504075, now seen corresponding path program 26 times [2019-09-03 20:52:19,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:19,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:19,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:19,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:19,330 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:19,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:19,530 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 131 proven. 260 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:52:19,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:19,530 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:19,531 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:19,531 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:52:19,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:19,531 INFO 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:52:19,552 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:19,552 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:52:19,627 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-03 20:52:19,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:19,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 20:52:19,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:19,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:19,697 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 131 proven. 260 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:52:19,697 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:20,005 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 131 proven. 260 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (27)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:52:20,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:20,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 21 [2019-09-03 20:52:20,018 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:20,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 20:52:20,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 20:52:20,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2019-09-03 20:52:20,019 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 21 states. [2019-09-03 20:52:20,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:20,210 INFO L93 Difference]: Finished difference Result 131 states and 133 transitions. [2019-09-03 20:52:20,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 20:52:20,211 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 117 [2019-09-03 20:52:20,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:20,212 INFO L225 Difference]: With dead ends: 131 [2019-09-03 20:52:20,213 INFO L226 Difference]: Without dead ends: 131 [2019-09-03 20:52:20,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 218 SyntacticMatches, 28 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=310, Unknown=0, NotChecked=0, Total=462 [2019-09-03 20:52:20,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-09-03 20:52:20,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2019-09-03 20:52:20,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-09-03 20:52:20,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2019-09-03 20:52:20,218 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 117 [2019-09-03 20:52:20,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:20,219 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2019-09-03 20:52:20,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 20:52:20,219 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2019-09-03 20:52:20,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-03 20:52:20,220 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:20,220 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:20,221 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:20,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:20,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1625930648, now seen corresponding path program 27 times [2019-09-03 20:52:20,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:20,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:20,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:20,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:20,222 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:20,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:20,622 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 329 proven. 105 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:52:20,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:20,623 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:20,623 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:20,623 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:52:20,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:20,623 INFO 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:52:20,634 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:20,634 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:52:20,673 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:20,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:20,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 20:52:20,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:20,692 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 329 proven. 105 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:52:20,692 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:21,002 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 329 proven. 105 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:52:21,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:21,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 33 [2019-09-03 20:52:21,005 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:21,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 20:52:21,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 20:52:21,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=783, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 20:52:21,007 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 33 states. [2019-09-03 20:52:21,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:21,755 INFO L93 Difference]: Finished difference Result 172 states and 187 transitions. [2019-09-03 20:52:21,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 20:52:21,756 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 124 [2019-09-03 20:52:21,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:21,758 INFO L225 Difference]: With dead ends: 172 [2019-09-03 20:52:21,758 INFO L226 Difference]: Without dead ends: 128 [2019-09-03 20:52:21,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 219 SyntacticMatches, 30 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=577, Invalid=1775, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 20:52:21,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-03 20:52:21,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2019-09-03 20:52:21,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-09-03 20:52:21,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 129 transitions. [2019-09-03 20:52:21,767 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 129 transitions. Word has length 124 [2019-09-03 20:52:21,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:21,767 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 129 transitions. [2019-09-03 20:52:21,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 20:52:21,767 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 129 transitions. [2019-09-03 20:52:21,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-03 20:52:21,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:21,768 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:21,769 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:21,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:21,769 INFO L82 PathProgramCache]: Analyzing trace with hash 156975657, now seen corresponding path program 28 times [2019-09-03 20:52:21,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:21,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:21,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:21,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:21,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:21,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:22,117 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 148 proven. 301 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:52:22,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:22,118 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:22,118 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:22,118 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:52:22,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:22,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 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:52:22,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:22,139 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:52:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:22,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 20:52:22,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:22,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:22,272 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 148 proven. 301 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:52:22,272 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:22,702 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 148 proven. 301 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:52:22,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:22,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 22 [2019-09-03 20:52:22,707 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:22,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 20:52:22,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 20:52:22,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=299, Unknown=0, NotChecked=0, Total=462 [2019-09-03 20:52:22,709 INFO L87 Difference]: Start difference. First operand 128 states and 129 transitions. Second operand 22 states. [2019-09-03 20:52:22,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:22,947 INFO L93 Difference]: Finished difference Result 139 states and 141 transitions. [2019-09-03 20:52:22,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 20:52:22,947 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 125 [2019-09-03 20:52:22,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:22,949 INFO L225 Difference]: With dead ends: 139 [2019-09-03 20:52:22,949 INFO L226 Difference]: Without dead ends: 139 [2019-09-03 20:52:22,950 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 233 SyntacticMatches, 30 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=169, Invalid=337, Unknown=0, NotChecked=0, Total=506 [2019-09-03 20:52:22,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-09-03 20:52:22,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2019-09-03 20:52:22,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-03 20:52:22,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2019-09-03 20:52:22,954 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 125 [2019-09-03 20:52:22,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:22,955 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2019-09-03 20:52:22,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 20:52:22,955 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2019-09-03 20:52:22,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-03 20:52:22,957 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:22,958 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:22,958 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:22,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:22,958 INFO L82 PathProgramCache]: Analyzing trace with hash -303617350, now seen corresponding path program 29 times [2019-09-03 20:52:22,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:22,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:22,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:22,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:22,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:22,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:23,613 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 375 proven. 120 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:52:23,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:23,614 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:23,614 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:23,614 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:52:23,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:23,614 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:52:23,629 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:23,630 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:23,686 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-03 20:52:23,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:23,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 20:52:23,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:23,721 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 375 proven. 120 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:52:23,721 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:24,199 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 375 proven. 120 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:52:24,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:24,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 35 [2019-09-03 20:52:24,202 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:24,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-03 20:52:24,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-03 20:52:24,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=883, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 20:52:24,203 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 35 states. [2019-09-03 20:52:25,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:25,079 INFO L93 Difference]: Finished difference Result 183 states and 199 transitions. [2019-09-03 20:52:25,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 20:52:25,086 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 132 [2019-09-03 20:52:25,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:25,087 INFO L225 Difference]: With dead ends: 183 [2019-09-03 20:52:25,087 INFO L226 Difference]: Without dead ends: 136 [2019-09-03 20:52:25,089 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 233 SyntacticMatches, 32 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=647, Invalid=2005, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:52:25,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-03 20:52:25,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2019-09-03 20:52:25,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-09-03 20:52:25,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 137 transitions. [2019-09-03 20:52:25,095 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 137 transitions. Word has length 132 [2019-09-03 20:52:25,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:25,095 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 137 transitions. [2019-09-03 20:52:25,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-03 20:52:25,095 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 137 transitions. [2019-09-03 20:52:25,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-03 20:52:25,097 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:25,097 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:25,097 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:25,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:25,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1647677515, now seen corresponding path program 30 times [2019-09-03 20:52:25,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:25,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:25,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:25,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:25,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:25,323 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 166 proven. 345 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:52:25,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:25,323 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:25,323 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:25,324 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:52:25,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:25,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:52:25,336 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:25,337 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:25,380 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:25,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:25,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 20:52:25,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:25,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:25,431 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 166 proven. 345 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:52:25,431 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:25,724 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 166 proven. 345 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (31)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:52:25,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:25,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 23 [2019-09-03 20:52:25,729 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:25,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 20:52:25,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 20:52:25,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=325, Unknown=0, NotChecked=0, Total=506 [2019-09-03 20:52:25,730 INFO L87 Difference]: Start difference. First operand 136 states and 137 transitions. Second operand 23 states. [2019-09-03 20:52:25,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:25,967 INFO L93 Difference]: Finished difference Result 147 states and 149 transitions. [2019-09-03 20:52:25,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-03 20:52:25,967 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 133 [2019-09-03 20:52:25,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:25,969 INFO L225 Difference]: With dead ends: 147 [2019-09-03 20:52:25,969 INFO L226 Difference]: Without dead ends: 147 [2019-09-03 20:52:25,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 248 SyntacticMatches, 32 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=365, Unknown=0, NotChecked=0, Total=552 [2019-09-03 20:52:25,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-09-03 20:52:25,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2019-09-03 20:52:25,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-09-03 20:52:25,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2019-09-03 20:52:25,981 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 133 [2019-09-03 20:52:25,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:25,981 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2019-09-03 20:52:25,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 20:52:25,981 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2019-09-03 20:52:25,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-03 20:52:25,983 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:25,984 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:25,984 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:25,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:25,984 INFO L82 PathProgramCache]: Analyzing trace with hash 861999704, now seen corresponding path program 31 times [2019-09-03 20:52:25,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:25,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:25,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:25,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:25,985 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:26,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:26,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1040 backedges. 424 proven. 136 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:52:26,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:26,512 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:26,512 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:26,512 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:52:26,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:26,513 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:52:26,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:26,528 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:26,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:26,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 20:52:26,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:26,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1040 backedges. 424 proven. 136 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:52:26,600 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:27,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1040 backedges. 424 proven. 136 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:52:27,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:27,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 37 [2019-09-03 20:52:27,025 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:27,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 20:52:27,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 20:52:27,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=989, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 20:52:27,027 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 37 states. [2019-09-03 20:52:28,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:28,019 INFO L93 Difference]: Finished difference Result 194 states and 211 transitions. [2019-09-03 20:52:28,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-03 20:52:28,020 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 140 [2019-09-03 20:52:28,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:28,021 INFO L225 Difference]: With dead ends: 194 [2019-09-03 20:52:28,022 INFO L226 Difference]: Without dead ends: 144 [2019-09-03 20:52:28,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 247 SyntacticMatches, 34 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 968 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=721, Invalid=2249, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 20:52:28,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-09-03 20:52:28,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2019-09-03 20:52:28,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-09-03 20:52:28,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2019-09-03 20:52:28,029 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 140 [2019-09-03 20:52:28,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:28,029 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2019-09-03 20:52:28,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 20:52:28,029 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2019-09-03 20:52:28,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-03 20:52:28,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:28,030 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:28,030 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:28,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:28,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1950177001, now seen corresponding path program 32 times [2019-09-03 20:52:28,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:28,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:28,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:28,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:28,032 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:28,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:28,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 185 proven. 392 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:52:28,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:28,286 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:28,286 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:28,287 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:52:28,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:28,287 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:52:28,304 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:28,304 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:52:28,372 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-03 20:52:28,373 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:28,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 20:52:28,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:28,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:28,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 185 proven. 392 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:52:28,439 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:28,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 185 proven. 392 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:52:28,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:28,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 24 [2019-09-03 20:52:28,755 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:28,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 20:52:28,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 20:52:28,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2019-09-03 20:52:28,756 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand 24 states. [2019-09-03 20:52:28,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:28,959 INFO L93 Difference]: Finished difference Result 155 states and 157 transitions. [2019-09-03 20:52:28,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 20:52:28,960 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 141 [2019-09-03 20:52:28,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:28,961 INFO L225 Difference]: With dead ends: 155 [2019-09-03 20:52:28,962 INFO L226 Difference]: Without dead ends: 155 [2019-09-03 20:52:28,962 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 263 SyntacticMatches, 34 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=206, Invalid=394, Unknown=0, NotChecked=0, Total=600 [2019-09-03 20:52:28,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-09-03 20:52:28,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2019-09-03 20:52:28,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-09-03 20:52:28,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2019-09-03 20:52:28,967 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 141 [2019-09-03 20:52:28,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:28,968 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2019-09-03 20:52:28,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 20:52:28,968 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2019-09-03 20:52:28,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-03 20:52:28,969 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:28,969 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:28,969 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:28,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:28,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1630027258, now seen corresponding path program 33 times [2019-09-03 20:52:28,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:28,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:28,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:28,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:28,970 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:28,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:29,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 476 proven. 153 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:52:29,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:29,435 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:29,435 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:29,435 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:52:29,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:29,435 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:29,445 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:29,445 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:52:29,512 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:29,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:29,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 20:52:29,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:29,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 476 proven. 153 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:52:29,541 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:30,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 476 proven. 153 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:52:30,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:30,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 39 [2019-09-03 20:52:30,042 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:30,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-03 20:52:30,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-03 20:52:30,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=1101, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 20:52:30,044 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 39 states. [2019-09-03 20:52:30,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:30,829 INFO L93 Difference]: Finished difference Result 205 states and 223 transitions. [2019-09-03 20:52:30,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 20:52:30,830 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 148 [2019-09-03 20:52:30,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:30,831 INFO L225 Difference]: With dead ends: 205 [2019-09-03 20:52:30,831 INFO L226 Difference]: Without dead ends: 152 [2019-09-03 20:52:30,832 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 261 SyntacticMatches, 36 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1088 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=799, Invalid=2507, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 20:52:30,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-03 20:52:30,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-09-03 20:52:30,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-03 20:52:30,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 153 transitions. [2019-09-03 20:52:30,838 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 153 transitions. Word has length 148 [2019-09-03 20:52:30,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:30,838 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 153 transitions. [2019-09-03 20:52:30,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-03 20:52:30,839 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 153 transitions. [2019-09-03 20:52:30,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-03 20:52:30,839 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:30,840 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:30,840 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:30,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:30,840 INFO L82 PathProgramCache]: Analyzing trace with hash 776167819, now seen corresponding path program 34 times [2019-09-03 20:52:30,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:30,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:30,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:30,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:30,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:31,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 205 proven. 442 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:52:31,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:31,227 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:31,227 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:31,227 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:52:31,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:31,228 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:52:31,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:31,240 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:31,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:31,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 20:52:31,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:31,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:31,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 205 proven. 442 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:52:31,333 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:31,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 205 proven. 442 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:52:31,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:31,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 25 [2019-09-03 20:52:31,715 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:31,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 20:52:31,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 20:52:31,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=380, Unknown=0, NotChecked=0, Total=600 [2019-09-03 20:52:31,716 INFO L87 Difference]: Start difference. First operand 152 states and 153 transitions. Second operand 25 states. [2019-09-03 20:52:31,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:31,960 INFO L93 Difference]: Finished difference Result 163 states and 165 transitions. [2019-09-03 20:52:31,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 20:52:31,961 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 149 [2019-09-03 20:52:31,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:31,963 INFO L225 Difference]: With dead ends: 163 [2019-09-03 20:52:31,963 INFO L226 Difference]: Without dead ends: 163 [2019-09-03 20:52:31,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 278 SyntacticMatches, 36 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=226, Invalid=424, Unknown=0, NotChecked=0, Total=650 [2019-09-03 20:52:31,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-09-03 20:52:31,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2019-09-03 20:52:31,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-09-03 20:52:31,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2019-09-03 20:52:31,975 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 149 [2019-09-03 20:52:31,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:31,975 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2019-09-03 20:52:31,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 20:52:31,975 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2019-09-03 20:52:31,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-03 20:52:31,976 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:31,977 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:31,977 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:31,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:31,977 INFO L82 PathProgramCache]: Analyzing trace with hash -56534760, now seen corresponding path program 35 times [2019-09-03 20:52:31,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:31,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:31,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:31,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:31,979 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:32,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1314 backedges. 531 proven. 171 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 20:52:32,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:32,784 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:32,784 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:32,784 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:52:32,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:32,785 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:52:32,804 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:32,804 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:52:32,875 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-09-03 20:52:32,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:32,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 20:52:32,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:32,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1314 backedges. 531 proven. 171 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 20:52:32,907 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:33,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1314 backedges. 531 proven. 171 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 20:52:33,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:33,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 41 [2019-09-03 20:52:33,393 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:33,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-03 20:52:33,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-03 20:52:33,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=1219, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 20:52:33,394 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 41 states. [2019-09-03 20:52:34,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:34,254 INFO L93 Difference]: Finished difference Result 216 states and 235 transitions. [2019-09-03 20:52:34,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-03 20:52:34,254 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 156 [2019-09-03 20:52:34,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:34,256 INFO L225 Difference]: With dead ends: 216 [2019-09-03 20:52:34,256 INFO L226 Difference]: Without dead ends: 160 [2019-09-03 20:52:34,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 275 SyntacticMatches, 38 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1215 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=881, Invalid=2779, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 20:52:34,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-09-03 20:52:34,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2019-09-03 20:52:34,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-03 20:52:34,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2019-09-03 20:52:34,262 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 156 [2019-09-03 20:52:34,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:34,263 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2019-09-03 20:52:34,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-03 20:52:34,263 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2019-09-03 20:52:34,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-03 20:52:34,264 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:34,264 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:34,265 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:34,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:34,265 INFO L82 PathProgramCache]: Analyzing trace with hash -726901847, now seen corresponding path program 36 times [2019-09-03 20:52:34,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:34,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:34,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:34,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:34,266 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:34,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 226 proven. 495 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 20:52:34,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:34,511 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:34,511 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:34,512 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:52:34,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:34,512 INFO 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:52:34,522 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:34,522 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:52:34,587 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:34,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:34,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 20:52:34,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:34,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:34,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 226 proven. 495 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 20:52:34,669 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:35,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 226 proven. 495 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 20:52:35,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:35,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 26 [2019-09-03 20:52:35,016 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:35,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 20:52:35,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 20:52:35,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=409, Unknown=0, NotChecked=0, Total=650 [2019-09-03 20:52:35,018 INFO L87 Difference]: Start difference. First operand 160 states and 161 transitions. Second operand 26 states. [2019-09-03 20:52:35,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:35,282 INFO L93 Difference]: Finished difference Result 171 states and 173 transitions. [2019-09-03 20:52:35,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 20:52:35,283 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 157 [2019-09-03 20:52:35,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:35,284 INFO L225 Difference]: With dead ends: 171 [2019-09-03 20:52:35,285 INFO L226 Difference]: Without dead ends: 171 [2019-09-03 20:52:35,286 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 293 SyntacticMatches, 38 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=247, Invalid=455, Unknown=0, NotChecked=0, Total=702 [2019-09-03 20:52:35,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-09-03 20:52:35,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2019-09-03 20:52:35,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-03 20:52:35,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2019-09-03 20:52:35,291 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 157 [2019-09-03 20:52:35,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:35,291 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2019-09-03 20:52:35,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 20:52:35,292 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2019-09-03 20:52:35,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-03 20:52:35,293 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:35,293 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:35,293 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:35,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:35,293 INFO L82 PathProgramCache]: Analyzing trace with hash -479305414, now seen corresponding path program 37 times [2019-09-03 20:52:35,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:35,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:35,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:35,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:35,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:35,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:36,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1463 backedges. 589 proven. 190 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 20:52:36,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:36,090 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:36,090 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:36,090 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:52:36,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:36,090 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:52:36,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:36,104 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:36,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:36,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 20:52:36,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:36,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1463 backedges. 589 proven. 190 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 20:52:36,197 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:36,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1463 backedges. 589 proven. 190 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 20:52:36,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:36,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 43 [2019-09-03 20:52:36,824 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:36,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-03 20:52:36,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-03 20:52:36,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1343, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 20:52:36,826 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 43 states. [2019-09-03 20:52:38,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:38,022 INFO L93 Difference]: Finished difference Result 227 states and 247 transitions. [2019-09-03 20:52:38,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-03 20:52:38,023 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 164 [2019-09-03 20:52:38,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:38,025 INFO L225 Difference]: With dead ends: 227 [2019-09-03 20:52:38,025 INFO L226 Difference]: Without dead ends: 168 [2019-09-03 20:52:38,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 289 SyntacticMatches, 40 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1349 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=967, Invalid=3065, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 20:52:38,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-03 20:52:38,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2019-09-03 20:52:38,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-09-03 20:52:38,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 169 transitions. [2019-09-03 20:52:38,032 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 169 transitions. Word has length 164 [2019-09-03 20:52:38,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:38,033 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 169 transitions. [2019-09-03 20:52:38,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-03 20:52:38,033 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 169 transitions. [2019-09-03 20:52:38,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-03 20:52:38,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:38,034 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:38,034 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:38,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:38,035 INFO L82 PathProgramCache]: Analyzing trace with hash 68829899, now seen corresponding path program 38 times [2019-09-03 20:52:38,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:38,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:38,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:38,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:38,036 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:38,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:38,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 248 proven. 551 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 20:52:38,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:38,329 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:38,329 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:38,330 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:52:38,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:38,330 INFO 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) [2019-09-03 20:52:38,345 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:38,345 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:38,461 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-09-03 20:52:38,461 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:38,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-03 20:52:38,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:38,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:38,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 248 proven. 551 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 20:52:38,559 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:39,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 248 proven. 551 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 20:52:39,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:39,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 27 [2019-09-03 20:52:39,098 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:39,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 20:52:39,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 20:52:39,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=439, Unknown=0, NotChecked=0, Total=702 [2019-09-03 20:52:39,099 INFO L87 Difference]: Start difference. First operand 168 states and 169 transitions. Second operand 27 states. [2019-09-03 20:52:39,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:39,298 INFO L93 Difference]: Finished difference Result 179 states and 181 transitions. [2019-09-03 20:52:39,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 20:52:39,299 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 165 [2019-09-03 20:52:39,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:39,301 INFO L225 Difference]: With dead ends: 179 [2019-09-03 20:52:39,301 INFO L226 Difference]: Without dead ends: 179 [2019-09-03 20:52:39,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 308 SyntacticMatches, 40 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=269, Invalid=487, Unknown=0, NotChecked=0, Total=756 [2019-09-03 20:52:39,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-03 20:52:39,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 175. [2019-09-03 20:52:39,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-03 20:52:39,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2019-09-03 20:52:39,308 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 165 [2019-09-03 20:52:39,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:39,309 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2019-09-03 20:52:39,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 20:52:39,309 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2019-09-03 20:52:39,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-03 20:52:39,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:39,311 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:39,311 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:39,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:39,312 INFO L82 PathProgramCache]: Analyzing trace with hash -356085800, now seen corresponding path program 39 times [2019-09-03 20:52:39,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:39,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:39,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:39,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:39,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:39,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:39,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1620 backedges. 650 proven. 210 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 20:52:39,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:39,975 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:39,976 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:39,976 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:39,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:39,976 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:52:39,986 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:39,986 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:52:40,039 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:40,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:40,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 20:52:40,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:40,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1620 backedges. 650 proven. 210 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 20:52:40,072 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:40,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1620 backedges. 650 proven. 210 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 20:52:40,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:40,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 45 [2019-09-03 20:52:40,749 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:40,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-03 20:52:40,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-03 20:52:40,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=507, Invalid=1473, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 20:52:40,751 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 45 states. [2019-09-03 20:52:42,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:42,054 INFO L93 Difference]: Finished difference Result 238 states and 259 transitions. [2019-09-03 20:52:42,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-03 20:52:42,060 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 172 [2019-09-03 20:52:42,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:42,062 INFO L225 Difference]: With dead ends: 238 [2019-09-03 20:52:42,062 INFO L226 Difference]: Without dead ends: 176 [2019-09-03 20:52:42,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 303 SyntacticMatches, 42 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1490 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1057, Invalid=3365, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 20:52:42,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-09-03 20:52:42,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2019-09-03 20:52:42,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-09-03 20:52:42,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 177 transitions. [2019-09-03 20:52:42,071 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 177 transitions. Word has length 172 [2019-09-03 20:52:42,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:42,071 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 177 transitions. [2019-09-03 20:52:42,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-03 20:52:42,071 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 177 transitions. [2019-09-03 20:52:42,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-03 20:52:42,072 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:42,072 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:42,073 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:42,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:42,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1355042921, now seen corresponding path program 40 times [2019-09-03 20:52:42,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:42,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:42,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:42,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:42,075 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:42,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1641 backedges. 271 proven. 610 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 20:52:42,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:42,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:42,403 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:42,403 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:52:42,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:42,403 INFO 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:52:42,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:42,413 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:52:42,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:42,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-03 20:52:42,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:42,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:42,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1641 backedges. 271 proven. 610 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 20:52:42,549 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:42,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1641 backedges. 271 proven. 610 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 20:52:42,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:42,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 28 [2019-09-03 20:52:42,959 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:42,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 20:52:42,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 20:52:42,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=470, Unknown=0, NotChecked=0, Total=756 [2019-09-03 20:52:42,960 INFO L87 Difference]: Start difference. First operand 176 states and 177 transitions. Second operand 28 states. [2019-09-03 20:52:43,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:43,175 INFO L93 Difference]: Finished difference Result 187 states and 189 transitions. [2019-09-03 20:52:43,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 20:52:43,175 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 173 [2019-09-03 20:52:43,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:43,177 INFO L225 Difference]: With dead ends: 187 [2019-09-03 20:52:43,177 INFO L226 Difference]: Without dead ends: 187 [2019-09-03 20:52:43,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 323 SyntacticMatches, 42 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=292, Invalid=520, Unknown=0, NotChecked=0, Total=812 [2019-09-03 20:52:43,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-09-03 20:52:43,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 183. [2019-09-03 20:52:43,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-09-03 20:52:43,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2019-09-03 20:52:43,182 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 173 [2019-09-03 20:52:43,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:43,183 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2019-09-03 20:52:43,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 20:52:43,183 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2019-09-03 20:52:43,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-03 20:52:43,184 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:43,184 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:43,184 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:43,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:43,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1998427258, now seen corresponding path program 41 times [2019-09-03 20:52:43,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:43,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:43,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:43,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:43,185 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:43,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:43,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 714 proven. 231 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-09-03 20:52:43,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:43,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:43,991 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:43,991 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:52:43,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:43,991 INFO 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:52:44,001 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:44,002 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:52:44,086 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-09-03 20:52:44,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:44,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-03 20:52:44,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:44,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 714 proven. 231 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-09-03 20:52:44,126 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:44,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 714 proven. 231 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-09-03 20:52:44,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:44,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 47 [2019-09-03 20:52:44,743 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:44,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-03 20:52:44,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-03 20:52:44,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=553, Invalid=1609, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 20:52:44,744 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 47 states. [2019-09-03 20:52:46,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:46,198 INFO L93 Difference]: Finished difference Result 249 states and 271 transitions. [2019-09-03 20:52:46,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-03 20:52:46,199 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 180 [2019-09-03 20:52:46,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:46,200 INFO L225 Difference]: With dead ends: 249 [2019-09-03 20:52:46,200 INFO L226 Difference]: Without dead ends: 184 [2019-09-03 20:52:46,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 317 SyntacticMatches, 44 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1638 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1151, Invalid=3679, Unknown=0, NotChecked=0, Total=4830 [2019-09-03 20:52:46,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-09-03 20:52:46,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-09-03 20:52:46,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-03 20:52:46,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 185 transitions. [2019-09-03 20:52:46,205 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 185 transitions. Word has length 180 [2019-09-03 20:52:46,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:46,206 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 185 transitions. [2019-09-03 20:52:46,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-03 20:52:46,206 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 185 transitions. [2019-09-03 20:52:46,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-03 20:52:46,207 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:46,207 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:46,207 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:46,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:46,208 INFO L82 PathProgramCache]: Analyzing trace with hash -568445941, now seen corresponding path program 42 times [2019-09-03 20:52:46,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:46,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:46,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:46,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:46,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:46,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:46,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1807 backedges. 295 proven. 672 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-09-03 20:52:46,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:46,559 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:46,560 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:46,560 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:52:46,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:46,560 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:52:46,572 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:46,572 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:52:46,624 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:46,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:46,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-03 20:52:46,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:46,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:46,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1807 backedges. 295 proven. 672 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-09-03 20:52:46,715 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:47,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1807 backedges. 295 proven. 672 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-09-03 20:52:47,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:47,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 29 [2019-09-03 20:52:47,241 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:47,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 20:52:47,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 20:52:47,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=502, Unknown=0, NotChecked=0, Total=812 [2019-09-03 20:52:47,242 INFO L87 Difference]: Start difference. First operand 184 states and 185 transitions. Second operand 29 states. [2019-09-03 20:52:47,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:47,496 INFO L93 Difference]: Finished difference Result 195 states and 197 transitions. [2019-09-03 20:52:47,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-03 20:52:47,497 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 181 [2019-09-03 20:52:47,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:47,498 INFO L225 Difference]: With dead ends: 195 [2019-09-03 20:52:47,499 INFO L226 Difference]: Without dead ends: 195 [2019-09-03 20:52:47,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 338 SyntacticMatches, 44 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=316, Invalid=554, Unknown=0, NotChecked=0, Total=870 [2019-09-03 20:52:47,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-09-03 20:52:47,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 191. [2019-09-03 20:52:47,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-03 20:52:47,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2019-09-03 20:52:47,507 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 181 [2019-09-03 20:52:47,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:47,507 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2019-09-03 20:52:47,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 20:52:47,507 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2019-09-03 20:52:47,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-03 20:52:47,509 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:47,509 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:47,509 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:47,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:47,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1257027224, now seen corresponding path program 43 times [2019-09-03 20:52:47,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:47,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:47,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:47,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:47,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:48,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1958 backedges. 781 proven. 253 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2019-09-03 20:52:48,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:48,374 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:48,374 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:48,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:52:48,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:48,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 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:52:48,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:48,385 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:52:48,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:48,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-03 20:52:48,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:48,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1958 backedges. 781 proven. 253 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2019-09-03 20:52:48,500 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:49,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1958 backedges. 781 proven. 253 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2019-09-03 20:52:49,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:49,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 49 [2019-09-03 20:52:49,134 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:49,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-03 20:52:49,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-03 20:52:49,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=601, Invalid=1751, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 20:52:49,135 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 49 states. [2019-09-03 20:52:50,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:50,690 INFO L93 Difference]: Finished difference Result 260 states and 283 transitions. [2019-09-03 20:52:50,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-03 20:52:50,692 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 188 [2019-09-03 20:52:50,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:50,693 INFO L225 Difference]: With dead ends: 260 [2019-09-03 20:52:50,693 INFO L226 Difference]: Without dead ends: 192 [2019-09-03 20:52:50,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 331 SyntacticMatches, 46 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1793 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1249, Invalid=4007, Unknown=0, NotChecked=0, Total=5256 [2019-09-03 20:52:50,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-09-03 20:52:50,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2019-09-03 20:52:50,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-03 20:52:50,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 193 transitions. [2019-09-03 20:52:50,699 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 193 transitions. Word has length 188 [2019-09-03 20:52:50,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:50,699 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 193 transitions. [2019-09-03 20:52:50,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-03 20:52:50,699 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 193 transitions. [2019-09-03 20:52:50,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-03 20:52:50,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:50,700 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:50,701 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:50,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:50,701 INFO L82 PathProgramCache]: Analyzing trace with hash 765539625, now seen corresponding path program 44 times [2019-09-03 20:52:50,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:50,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:50,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:50,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:50,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:50,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:51,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1981 backedges. 320 proven. 737 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2019-09-03 20:52:51,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:51,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:51,135 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:51,135 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:52:51,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:51,135 INFO 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) [2019-09-03 20:52:51,159 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:51,159 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:51,262 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-09-03 20:52:51,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:51,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-03 20:52:51,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:51,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:51,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1981 backedges. 320 proven. 737 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2019-09-03 20:52:51,329 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:52,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1981 backedges. 320 proven. 737 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2019-09-03 20:52:52,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:52,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 30 [2019-09-03 20:52:52,045 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:52,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 20:52:52,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 20:52:52,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=535, Unknown=0, NotChecked=0, Total=870 [2019-09-03 20:52:52,046 INFO L87 Difference]: Start difference. First operand 192 states and 193 transitions. Second operand 30 states. [2019-09-03 20:52:52,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:52,332 INFO L93 Difference]: Finished difference Result 203 states and 205 transitions. [2019-09-03 20:52:52,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 20:52:52,333 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 189 [2019-09-03 20:52:52,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:52,335 INFO L225 Difference]: With dead ends: 203 [2019-09-03 20:52:52,335 INFO L226 Difference]: Without dead ends: 203 [2019-09-03 20:52:52,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 353 SyntacticMatches, 46 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=341, Invalid=589, Unknown=0, NotChecked=0, Total=930 [2019-09-03 20:52:52,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-09-03 20:52:52,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 199. [2019-09-03 20:52:52,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-03 20:52:52,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2019-09-03 20:52:52,340 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 189 [2019-09-03 20:52:52,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:52,340 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2019-09-03 20:52:52,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 20:52:52,340 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2019-09-03 20:52:52,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-03 20:52:52,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:52,342 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:52,342 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:52,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:52,342 INFO L82 PathProgramCache]: Analyzing trace with hash 530175930, now seen corresponding path program 45 times [2019-09-03 20:52:52,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:52,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:52,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:52,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:52,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:52,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:53,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 851 proven. 276 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2019-09-03 20:52:53,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:53,209 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:53,209 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:53,210 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:52:53,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:53,210 INFO 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:52:53,225 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:53,226 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:52:53,294 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:53,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:53,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-03 20:52:53,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:53,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 851 proven. 276 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2019-09-03 20:52:53,325 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:54,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 851 proven. 276 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2019-09-03 20:52:54,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:54,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 51 [2019-09-03 20:52:54,163 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:54,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-03 20:52:54,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-03 20:52:54,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=651, Invalid=1899, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 20:52:54,164 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 51 states. [2019-09-03 20:52:55,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:55,835 INFO L93 Difference]: Finished difference Result 271 states and 295 transitions. [2019-09-03 20:52:55,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-03 20:52:55,836 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 196 [2019-09-03 20:52:55,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:55,837 INFO L225 Difference]: With dead ends: 271 [2019-09-03 20:52:55,837 INFO L226 Difference]: Without dead ends: 200 [2019-09-03 20:52:55,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 345 SyntacticMatches, 48 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1955 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1351, Invalid=4349, Unknown=0, NotChecked=0, Total=5700 [2019-09-03 20:52:55,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-09-03 20:52:55,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2019-09-03 20:52:55,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-03 20:52:55,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 201 transitions. [2019-09-03 20:52:55,844 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 201 transitions. Word has length 196 [2019-09-03 20:52:55,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:55,844 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 201 transitions. [2019-09-03 20:52:55,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-03 20:52:55,844 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 201 transitions. [2019-09-03 20:52:55,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-03 20:52:55,845 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:55,846 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:55,846 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:55,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:55,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1212992181, now seen corresponding path program 46 times [2019-09-03 20:52:55,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:55,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:55,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:55,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:55,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:56,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2163 backedges. 346 proven. 805 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2019-09-03 20:52:56,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:56,251 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:56,252 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:56,252 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:52:56,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:56,252 INFO 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) [2019-09-03 20:52:56,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:56,271 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:56,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:56,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-03 20:52:56,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:56,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:56,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2163 backedges. 346 proven. 805 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2019-09-03 20:52:56,408 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:56,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2163 backedges. 346 proven. 805 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2019-09-03 20:52:56,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:56,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 31 [2019-09-03 20:52:56,971 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:56,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 20:52:56,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 20:52:56,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=569, Unknown=0, NotChecked=0, Total=930 [2019-09-03 20:52:56,972 INFO L87 Difference]: Start difference. First operand 200 states and 201 transitions. Second operand 31 states. [2019-09-03 20:52:57,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:57,212 INFO L93 Difference]: Finished difference Result 211 states and 213 transitions. [2019-09-03 20:52:57,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-03 20:52:57,213 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 197 [2019-09-03 20:52:57,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:57,214 INFO L225 Difference]: With dead ends: 211 [2019-09-03 20:52:57,215 INFO L226 Difference]: Without dead ends: 211 [2019-09-03 20:52:57,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 368 SyntacticMatches, 48 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=367, Invalid=625, Unknown=0, NotChecked=0, Total=992 [2019-09-03 20:52:57,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-03 20:52:57,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 207. [2019-09-03 20:52:57,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-09-03 20:52:57,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2019-09-03 20:52:57,220 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 197 [2019-09-03 20:52:57,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:57,221 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2019-09-03 20:52:57,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 20:52:57,221 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2019-09-03 20:52:57,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-03 20:52:57,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:57,222 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:57,223 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:57,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:57,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1227869528, now seen corresponding path program 47 times [2019-09-03 20:52:57,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:57,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:57,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:57,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:57,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:57,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:58,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2328 backedges. 924 proven. 300 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2019-09-03 20:52:58,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:58,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:58,719 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:58,720 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:52:58,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:58,720 INFO 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:52:58,742 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:58,742 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:52:58,901 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-09-03 20:52:58,901 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:58,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-03 20:52:58,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:58,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2328 backedges. 924 proven. 300 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2019-09-03 20:52:58,985 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:00,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2328 backedges. 924 proven. 300 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2019-09-03 20:53:00,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:00,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 53 [2019-09-03 20:53:00,427 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:00,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-03 20:53:00,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-03 20:53:00,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=2053, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 20:53:00,429 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 53 states. [2019-09-03 20:53:02,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:02,300 INFO L93 Difference]: Finished difference Result 282 states and 307 transitions. [2019-09-03 20:53:02,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-03 20:53:02,301 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 204 [2019-09-03 20:53:02,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:02,302 INFO L225 Difference]: With dead ends: 282 [2019-09-03 20:53:02,302 INFO L226 Difference]: Without dead ends: 208 [2019-09-03 20:53:02,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 359 SyntacticMatches, 50 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2124 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1457, Invalid=4705, Unknown=0, NotChecked=0, Total=6162 [2019-09-03 20:53:02,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-09-03 20:53:02,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2019-09-03 20:53:02,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-09-03 20:53:02,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 209 transitions. [2019-09-03 20:53:02,309 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 209 transitions. Word has length 204 [2019-09-03 20:53:02,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:02,309 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 209 transitions. [2019-09-03 20:53:02,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-03 20:53:02,309 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 209 transitions. [2019-09-03 20:53:02,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-03 20:53:02,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:02,311 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:02,311 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:02,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:02,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1889596951, now seen corresponding path program 48 times [2019-09-03 20:53:02,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:02,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:02,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:02,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:02,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:02,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2353 backedges. 373 proven. 876 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2019-09-03 20:53:02,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:02,785 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:02,785 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:02,786 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:53:02,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:02,786 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:53:02,808 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:02,809 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:02,878 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:02,878 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:02,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-03 20:53:02,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:02,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:02,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2353 backedges. 373 proven. 876 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2019-09-03 20:53:02,954 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:03,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2353 backedges. 373 proven. 876 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2019-09-03 20:53:03,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:03,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 32 [2019-09-03 20:53:03,505 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:03,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 20:53:03,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 20:53:03,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=604, Unknown=0, NotChecked=0, Total=992 [2019-09-03 20:53:03,506 INFO L87 Difference]: Start difference. First operand 208 states and 209 transitions. Second operand 32 states. [2019-09-03 20:53:03,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:03,790 INFO L93 Difference]: Finished difference Result 219 states and 221 transitions. [2019-09-03 20:53:03,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 20:53:03,790 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 205 [2019-09-03 20:53:03,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:03,792 INFO L225 Difference]: With dead ends: 219 [2019-09-03 20:53:03,792 INFO L226 Difference]: Without dead ends: 219 [2019-09-03 20:53:03,793 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 383 SyntacticMatches, 50 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=394, Invalid=662, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 20:53:03,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-03 20:53:03,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 215. [2019-09-03 20:53:03,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-09-03 20:53:03,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2019-09-03 20:53:03,799 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 205 [2019-09-03 20:53:03,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:03,799 INFO L475 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2019-09-03 20:53:03,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 20:53:03,800 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2019-09-03 20:53:03,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-03 20:53:03,801 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:03,801 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:03,801 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:03,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:03,802 INFO L82 PathProgramCache]: Analyzing trace with hash 558312186, now seen corresponding path program 49 times [2019-09-03 20:53:03,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:03,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:03,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:03,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:03,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:03,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:04,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2525 backedges. 1000 proven. 325 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2019-09-03 20:53:04,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:04,832 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:04,832 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:04,832 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:53:04,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:04,832 INFO 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) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:04,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:04,843 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:53:04,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:04,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-03 20:53:04,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:04,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2525 backedges. 1000 proven. 325 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2019-09-03 20:53:04,976 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:05,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2525 backedges. 1000 proven. 325 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2019-09-03 20:53:05,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:05,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 55 [2019-09-03 20:53:05,901 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:05,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-03 20:53:05,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-03 20:53:05,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=757, Invalid=2213, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 20:53:05,902 INFO L87 Difference]: Start difference. First operand 215 states and 216 transitions. Second operand 55 states. [2019-09-03 20:53:07,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:07,903 INFO L93 Difference]: Finished difference Result 293 states and 319 transitions. [2019-09-03 20:53:07,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-03 20:53:07,903 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 212 [2019-09-03 20:53:07,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:07,905 INFO L225 Difference]: With dead ends: 293 [2019-09-03 20:53:07,906 INFO L226 Difference]: Without dead ends: 216 [2019-09-03 20:53:07,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 373 SyntacticMatches, 52 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2300 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1567, Invalid=5075, Unknown=0, NotChecked=0, Total=6642 [2019-09-03 20:53:07,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-09-03 20:53:07,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-09-03 20:53:07,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-09-03 20:53:07,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 217 transitions. [2019-09-03 20:53:07,912 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 217 transitions. Word has length 212 [2019-09-03 20:53:07,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:07,913 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 217 transitions. [2019-09-03 20:53:07,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-03 20:53:07,913 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 217 transitions. [2019-09-03 20:53:07,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-03 20:53:07,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:07,914 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:07,915 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:07,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:07,915 INFO L82 PathProgramCache]: Analyzing trace with hash -851622261, now seen corresponding path program 50 times [2019-09-03 20:53:07,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:07,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:07,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:07,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:07,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:08,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2551 backedges. 401 proven. 950 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2019-09-03 20:53:08,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:08,506 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:08,506 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:08,506 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:53:08,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:08,506 INFO 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:53:08,520 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:08,520 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:08,650 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-09-03 20:53:08,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:08,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-03 20:53:08,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:08,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:08,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2551 backedges. 401 proven. 950 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2019-09-03 20:53:08,742 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:09,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2551 backedges. 401 proven. 950 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2019-09-03 20:53:09,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:09,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 33 [2019-09-03 20:53:09,390 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:09,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 20:53:09,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 20:53:09,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=416, Invalid=640, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 20:53:09,391 INFO L87 Difference]: Start difference. First operand 216 states and 217 transitions. Second operand 33 states. [2019-09-03 20:53:09,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:09,745 INFO L93 Difference]: Finished difference Result 227 states and 229 transitions. [2019-09-03 20:53:09,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-03 20:53:09,745 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 213 [2019-09-03 20:53:09,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:09,748 INFO L225 Difference]: With dead ends: 227 [2019-09-03 20:53:09,748 INFO L226 Difference]: Without dead ends: 227 [2019-09-03 20:53:09,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 398 SyntacticMatches, 52 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=422, Invalid=700, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 20:53:09,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-09-03 20:53:09,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 223. [2019-09-03 20:53:09,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-09-03 20:53:09,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 224 transitions. [2019-09-03 20:53:09,753 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 224 transitions. Word has length 213 [2019-09-03 20:53:09,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:09,753 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 224 transitions. [2019-09-03 20:53:09,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 20:53:09,753 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 224 transitions. [2019-09-03 20:53:09,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-03 20:53:09,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:09,755 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:09,755 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:09,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:09,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1330916328, now seen corresponding path program 51 times [2019-09-03 20:53:09,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:09,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:09,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:09,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:09,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:09,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:10,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2730 backedges. 1079 proven. 351 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2019-09-03 20:53:10,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:10,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:10,756 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:10,756 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:53:10,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:10,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:53:10,767 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:10,767 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:53:10,839 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:10,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:10,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-03 20:53:10,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:10,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2730 backedges. 1079 proven. 351 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2019-09-03 20:53:10,893 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:11,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2730 backedges. 1079 proven. 351 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2019-09-03 20:53:11,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:11,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 57 [2019-09-03 20:53:11,814 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:11,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-03 20:53:11,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-03 20:53:11,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=813, Invalid=2379, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 20:53:11,815 INFO L87 Difference]: Start difference. First operand 223 states and 224 transitions. Second operand 57 states. [2019-09-03 20:53:13,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:13,983 INFO L93 Difference]: Finished difference Result 304 states and 331 transitions. [2019-09-03 20:53:13,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-03 20:53:13,983 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 220 [2019-09-03 20:53:13,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:13,985 INFO L225 Difference]: With dead ends: 304 [2019-09-03 20:53:13,985 INFO L226 Difference]: Without dead ends: 224 [2019-09-03 20:53:13,986 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 387 SyntacticMatches, 54 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2483 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1681, Invalid=5459, Unknown=0, NotChecked=0, Total=7140 [2019-09-03 20:53:13,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-09-03 20:53:13,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2019-09-03 20:53:13,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-09-03 20:53:13,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 225 transitions. [2019-09-03 20:53:13,992 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 225 transitions. Word has length 220 [2019-09-03 20:53:13,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:13,992 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 225 transitions. [2019-09-03 20:53:13,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-03 20:53:13,992 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 225 transitions. [2019-09-03 20:53:13,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-09-03 20:53:13,994 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:13,994 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:13,994 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:13,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:13,994 INFO L82 PathProgramCache]: Analyzing trace with hash 957992617, now seen corresponding path program 52 times [2019-09-03 20:53:13,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:13,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:13,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:13,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:13,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:14,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2757 backedges. 430 proven. 1027 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2019-09-03 20:53:14,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:14,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:14,723 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:14,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:14,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:14,724 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:53:14,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:14,743 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:14,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-03 20:53:14,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:14,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:14,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2757 backedges. 430 proven. 1027 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2019-09-03 20:53:14,968 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:15,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2757 backedges. 430 proven. 1027 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2019-09-03 20:53:15,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:15,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 34 [2019-09-03 20:53:15,718 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:15,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-03 20:53:15,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-03 20:53:15,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=677, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 20:53:15,719 INFO L87 Difference]: Start difference. First operand 224 states and 225 transitions. Second operand 34 states. [2019-09-03 20:53:15,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:15,999 INFO L93 Difference]: Finished difference Result 235 states and 237 transitions. [2019-09-03 20:53:16,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 20:53:16,000 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 221 [2019-09-03 20:53:16,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:16,001 INFO L225 Difference]: With dead ends: 235 [2019-09-03 20:53:16,002 INFO L226 Difference]: Without dead ends: 235 [2019-09-03 20:53:16,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 413 SyntacticMatches, 54 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=451, Invalid=739, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 20:53:16,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-09-03 20:53:16,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 231. [2019-09-03 20:53:16,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-09-03 20:53:16,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 232 transitions. [2019-09-03 20:53:16,006 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 232 transitions. Word has length 221 [2019-09-03 20:53:16,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:16,006 INFO L475 AbstractCegarLoop]: Abstraction has 231 states and 232 transitions. [2019-09-03 20:53:16,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-03 20:53:16,007 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 232 transitions. [2019-09-03 20:53:16,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-03 20:53:16,008 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:16,008 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:16,008 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:16,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:16,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1099533882, now seen corresponding path program 53 times [2019-09-03 20:53:16,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:16,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:16,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:16,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:16,010 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:17,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2943 backedges. 1161 proven. 378 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2019-09-03 20:53:17,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:17,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:17,310 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:17,310 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:53:17,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:17,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:17,319 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:17,320 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:17,419 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-09-03 20:53:17,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:17,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-03 20:53:17,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:17,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2943 backedges. 1161 proven. 378 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2019-09-03 20:53:17,468 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:18,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2943 backedges. 1161 proven. 378 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2019-09-03 20:53:18,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:18,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 59 [2019-09-03 20:53:18,416 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:18,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-03 20:53:18,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-03 20:53:18,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=871, Invalid=2551, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 20:53:18,417 INFO L87 Difference]: Start difference. First operand 231 states and 232 transitions. Second operand 59 states. [2019-09-03 20:53:20,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:20,687 INFO L93 Difference]: Finished difference Result 315 states and 343 transitions. [2019-09-03 20:53:20,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-03 20:53:20,688 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 228 [2019-09-03 20:53:20,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:20,689 INFO L225 Difference]: With dead ends: 315 [2019-09-03 20:53:20,690 INFO L226 Difference]: Without dead ends: 232 [2019-09-03 20:53:20,690 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 401 SyntacticMatches, 56 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2673 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1799, Invalid=5857, Unknown=0, NotChecked=0, Total=7656 [2019-09-03 20:53:20,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-09-03 20:53:20,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2019-09-03 20:53:20,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-09-03 20:53:20,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 233 transitions. [2019-09-03 20:53:20,695 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 233 transitions. Word has length 228 [2019-09-03 20:53:20,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:20,696 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 233 transitions. [2019-09-03 20:53:20,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-03 20:53:20,696 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 233 transitions. [2019-09-03 20:53:20,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-03 20:53:20,697 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:20,697 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:20,698 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:20,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:20,698 INFO L82 PathProgramCache]: Analyzing trace with hash -601856053, now seen corresponding path program 54 times [2019-09-03 20:53:20,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:20,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:20,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:20,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:20,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:20,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:21,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2971 backedges. 460 proven. 1107 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2019-09-03 20:53:21,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:21,153 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:21,153 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:21,153 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:53:21,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:21,154 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:21,165 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:21,166 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:53:21,240 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:21,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:21,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-03 20:53:21,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:21,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:21,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2971 backedges. 460 proven. 1107 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2019-09-03 20:53:21,336 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:21,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2971 backedges. 460 proven. 1107 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2019-09-03 20:53:21,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:21,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 35 [2019-09-03 20:53:21,990 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:21,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-03 20:53:21,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-03 20:53:21,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=715, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 20:53:21,991 INFO L87 Difference]: Start difference. First operand 232 states and 233 transitions. Second operand 35 states. [2019-09-03 20:53:22,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:22,361 INFO L93 Difference]: Finished difference Result 243 states and 245 transitions. [2019-09-03 20:53:22,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-03 20:53:22,362 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 229 [2019-09-03 20:53:22,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:22,364 INFO L225 Difference]: With dead ends: 243 [2019-09-03 20:53:22,364 INFO L226 Difference]: Without dead ends: 243 [2019-09-03 20:53:22,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 428 SyntacticMatches, 56 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 925 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=481, Invalid=779, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 20:53:22,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-09-03 20:53:22,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 239. [2019-09-03 20:53:22,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-09-03 20:53:22,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 240 transitions. [2019-09-03 20:53:22,370 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 240 transitions. Word has length 229 [2019-09-03 20:53:22,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:22,370 INFO L475 AbstractCegarLoop]: Abstraction has 239 states and 240 transitions. [2019-09-03 20:53:22,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-03 20:53:22,370 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 240 transitions. [2019-09-03 20:53:22,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-03 20:53:22,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:22,372 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:22,372 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:22,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:22,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1417884968, now seen corresponding path program 55 times [2019-09-03 20:53:22,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:22,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:22,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:22,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:22,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:23,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3164 backedges. 1246 proven. 406 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2019-09-03 20:53:23,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:23,527 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:23,527 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:23,527 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:53:23,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:23,527 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:23,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:23,540 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:53:23,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:23,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-03 20:53:23,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:23,664 INFO L134 CoverageAnalysis]: Checked inductivity of 3164 backedges. 1246 proven. 406 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2019-09-03 20:53:23,665 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:24,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3164 backedges. 1246 proven. 406 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2019-09-03 20:53:24,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:24,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 61 [2019-09-03 20:53:24,746 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:24,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-03 20:53:24,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-03 20:53:24,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=931, Invalid=2729, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 20:53:24,748 INFO L87 Difference]: Start difference. First operand 239 states and 240 transitions. Second operand 61 states. [2019-09-03 20:53:25,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:25,824 INFO L93 Difference]: Finished difference Result 326 states and 355 transitions. [2019-09-03 20:53:25,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-03 20:53:25,824 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 236 [2019-09-03 20:53:25,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:25,826 INFO L225 Difference]: With dead ends: 326 [2019-09-03 20:53:25,826 INFO L226 Difference]: Without dead ends: 240 [2019-09-03 20:53:25,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 562 GetRequests, 415 SyntacticMatches, 58 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2870 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1921, Invalid=6269, Unknown=0, NotChecked=0, Total=8190 [2019-09-03 20:53:25,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-09-03 20:53:25,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2019-09-03 20:53:25,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-09-03 20:53:25,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 241 transitions. [2019-09-03 20:53:25,833 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 241 transitions. Word has length 236 [2019-09-03 20:53:25,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:25,834 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 241 transitions. [2019-09-03 20:53:25,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-03 20:53:25,834 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 241 transitions. [2019-09-03 20:53:25,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-03 20:53:25,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:25,835 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:25,836 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:25,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:25,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1290634089, now seen corresponding path program 56 times [2019-09-03 20:53:25,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:25,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:25,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:25,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:25,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:25,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:26,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3193 backedges. 491 proven. 1190 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2019-09-03 20:53:26,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:26,439 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:26,439 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:26,440 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:53:26,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:26,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:26,449 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:26,449 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:26,548 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-09-03 20:53:26,548 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:26,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-03 20:53:26,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:26,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:26,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3193 backedges. 491 proven. 1190 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2019-09-03 20:53:26,628 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:27,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3193 backedges. 491 proven. 1190 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2019-09-03 20:53:27,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:27,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 36 [2019-09-03 20:53:27,624 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:27,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 20:53:27,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 20:53:27,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=506, Invalid=754, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 20:53:27,625 INFO L87 Difference]: Start difference. First operand 240 states and 241 transitions. Second operand 36 states. [2019-09-03 20:53:27,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:27,915 INFO L93 Difference]: Finished difference Result 251 states and 253 transitions. [2019-09-03 20:53:27,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 20:53:27,916 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 237 [2019-09-03 20:53:27,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:27,918 INFO L225 Difference]: With dead ends: 251 [2019-09-03 20:53:27,918 INFO L226 Difference]: Without dead ends: 251 [2019-09-03 20:53:27,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 443 SyntacticMatches, 58 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=512, Invalid=820, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 20:53:27,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-09-03 20:53:27,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 247. [2019-09-03 20:53:27,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-09-03 20:53:27,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 248 transitions. [2019-09-03 20:53:27,926 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 248 transitions. Word has length 237 [2019-09-03 20:53:27,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:27,926 INFO L475 AbstractCegarLoop]: Abstraction has 247 states and 248 transitions. [2019-09-03 20:53:27,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 20:53:27,926 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 248 transitions. [2019-09-03 20:53:27,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-03 20:53:27,928 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:27,928 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:27,928 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:27,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:27,928 INFO L82 PathProgramCache]: Analyzing trace with hash 113574266, now seen corresponding path program 57 times [2019-09-03 20:53:27,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:27,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:27,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:27,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:27,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:27,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:29,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3393 backedges. 1334 proven. 435 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2019-09-03 20:53:29,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:29,116 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:29,116 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:29,116 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:53:29,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:29,116 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:29,127 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:29,127 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:53:29,206 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:29,206 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:29,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-03 20:53:29,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:29,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3393 backedges. 1334 proven. 435 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2019-09-03 20:53:29,264 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:30,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3393 backedges. 1334 proven. 435 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2019-09-03 20:53:30,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:30,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 63 [2019-09-03 20:53:30,475 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:30,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-03 20:53:30,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-03 20:53:30,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=993, Invalid=2913, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 20:53:30,477 INFO L87 Difference]: Start difference. First operand 247 states and 248 transitions. Second operand 63 states. [2019-09-03 20:53:33,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:33,020 INFO L93 Difference]: Finished difference Result 337 states and 367 transitions. [2019-09-03 20:53:33,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-03 20:53:33,020 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 244 [2019-09-03 20:53:33,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:33,022 INFO L225 Difference]: With dead ends: 337 [2019-09-03 20:53:33,022 INFO L226 Difference]: Without dead ends: 248 [2019-09-03 20:53:33,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 429 SyntacticMatches, 60 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3074 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2047, Invalid=6695, Unknown=0, NotChecked=0, Total=8742 [2019-09-03 20:53:33,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-09-03 20:53:33,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2019-09-03 20:53:33,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-09-03 20:53:33,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 249 transitions. [2019-09-03 20:53:33,029 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 249 transitions. Word has length 244 [2019-09-03 20:53:33,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:33,029 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 249 transitions. [2019-09-03 20:53:33,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-03 20:53:33,029 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 249 transitions. [2019-09-03 20:53:33,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-03 20:53:33,031 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:33,031 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:33,031 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:33,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:33,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1656789259, now seen corresponding path program 58 times [2019-09-03 20:53:33,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:33,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:33,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:33,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:33,033 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:33,539 INFO L134 CoverageAnalysis]: Checked inductivity of 3423 backedges. 523 proven. 1276 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2019-09-03 20:53:33,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:33,539 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:33,539 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:33,539 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:33,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:33,539 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:33,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:33,551 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:53:33,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:33,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 66 conjunts are in the unsatisfiable core [2019-09-03 20:53:33,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:33,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:33,711 INFO L134 CoverageAnalysis]: Checked inductivity of 3423 backedges. 523 proven. 1276 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2019-09-03 20:53:33,711 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:34,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3423 backedges. 523 proven. 1276 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2019-09-03 20:53:34,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:34,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 37 [2019-09-03 20:53:34,560 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:34,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 20:53:34,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 20:53:34,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=538, Invalid=794, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 20:53:34,561 INFO L87 Difference]: Start difference. First operand 248 states and 249 transitions. Second operand 37 states. [2019-09-03 20:53:34,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:34,867 INFO L93 Difference]: Finished difference Result 259 states and 261 transitions. [2019-09-03 20:53:34,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-03 20:53:34,868 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 245 [2019-09-03 20:53:34,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:34,869 INFO L225 Difference]: With dead ends: 259 [2019-09-03 20:53:34,870 INFO L226 Difference]: Without dead ends: 259 [2019-09-03 20:53:34,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 458 SyntacticMatches, 60 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1051 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=544, Invalid=862, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 20:53:34,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-09-03 20:53:34,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 255. [2019-09-03 20:53:34,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-03 20:53:34,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 256 transitions. [2019-09-03 20:53:34,874 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 256 transitions. Word has length 245 [2019-09-03 20:53:34,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:34,874 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 256 transitions. [2019-09-03 20:53:34,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 20:53:34,875 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 256 transitions. [2019-09-03 20:53:34,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-03 20:53:34,876 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:34,876 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:34,876 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:34,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:34,877 INFO L82 PathProgramCache]: Analyzing trace with hash -2101431912, now seen corresponding path program 59 times [2019-09-03 20:53:34,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:34,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:34,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:34,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:34,878 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:34,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:36,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3630 backedges. 1425 proven. 465 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2019-09-03 20:53:36,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:36,098 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:36,098 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:36,098 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:53:36,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:36,099 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:36,109 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:36,109 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:36,214 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-09-03 20:53:36,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:36,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-03 20:53:36,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:36,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3630 backedges. 1425 proven. 465 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2019-09-03 20:53:36,273 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:37,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3630 backedges. 1425 proven. 465 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2019-09-03 20:53:37,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:37,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 65 [2019-09-03 20:53:37,454 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:37,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-03 20:53:37,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-03 20:53:37,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1057, Invalid=3103, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 20:53:37,455 INFO L87 Difference]: Start difference. First operand 255 states and 256 transitions. Second operand 65 states. [2019-09-03 20:53:39,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:39,400 INFO L93 Difference]: Finished difference Result 348 states and 379 transitions. [2019-09-03 20:53:39,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-03 20:53:39,400 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 252 [2019-09-03 20:53:39,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:39,402 INFO L225 Difference]: With dead ends: 348 [2019-09-03 20:53:39,402 INFO L226 Difference]: Without dead ends: 256 [2019-09-03 20:53:39,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 443 SyntacticMatches, 62 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3285 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2177, Invalid=7135, Unknown=0, NotChecked=0, Total=9312 [2019-09-03 20:53:39,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-09-03 20:53:39,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2019-09-03 20:53:39,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-03 20:53:39,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 257 transitions. [2019-09-03 20:53:39,408 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 257 transitions. Word has length 252 [2019-09-03 20:53:39,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:39,409 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 257 transitions. [2019-09-03 20:53:39,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-03 20:53:39,409 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 257 transitions. [2019-09-03 20:53:39,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-03 20:53:39,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:39,410 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:39,411 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:39,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:39,411 INFO L82 PathProgramCache]: Analyzing trace with hash 200681513, now seen corresponding path program 60 times [2019-09-03 20:53:39,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:39,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:39,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:39,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:39,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:40,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3661 backedges. 556 proven. 1365 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2019-09-03 20:53:40,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:40,005 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:40,006 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:40,006 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:53:40,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:40,006 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:53:40,019 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:40,020 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:40,092 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:40,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:40,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-03 20:53:40,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:40,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:40,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3661 backedges. 556 proven. 1365 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2019-09-03 20:53:40,171 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:40,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3661 backedges. 556 proven. 1365 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2019-09-03 20:53:40,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:40,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 38 [2019-09-03 20:53:40,970 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:40,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-03 20:53:40,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-03 20:53:40,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=571, Invalid=835, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 20:53:40,971 INFO L87 Difference]: Start difference. First operand 256 states and 257 transitions. Second operand 38 states. [2019-09-03 20:53:41,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:41,374 INFO L93 Difference]: Finished difference Result 267 states and 269 transitions. [2019-09-03 20:53:41,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-03 20:53:41,374 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 253 [2019-09-03 20:53:41,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:41,376 INFO L225 Difference]: With dead ends: 267 [2019-09-03 20:53:41,377 INFO L226 Difference]: Without dead ends: 267 [2019-09-03 20:53:41,377 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 473 SyntacticMatches, 62 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1117 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=577, Invalid=905, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 20:53:41,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-09-03 20:53:41,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 263. [2019-09-03 20:53:41,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-03 20:53:41,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 264 transitions. [2019-09-03 20:53:41,382 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 264 transitions. Word has length 253 [2019-09-03 20:53:41,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:41,382 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 264 transitions. [2019-09-03 20:53:41,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-03 20:53:41,383 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 264 transitions. [2019-09-03 20:53:41,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-03 20:53:41,384 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:41,384 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:41,385 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:41,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:41,385 INFO L82 PathProgramCache]: Analyzing trace with hash -128088902, now seen corresponding path program 61 times [2019-09-03 20:53:41,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:41,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:41,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:41,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:41,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:41,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:42,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3875 backedges. 1519 proven. 496 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-09-03 20:53:42,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:42,663 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:42,663 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:42,663 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:53:42,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:42,663 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:42,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:42,673 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:53:42,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:42,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 66 conjunts are in the unsatisfiable core [2019-09-03 20:53:42,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:42,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3875 backedges. 1519 proven. 496 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-09-03 20:53:42,796 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:44,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3875 backedges. 1519 proven. 496 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-09-03 20:53:44,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:44,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 67 [2019-09-03 20:53:44,036 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:44,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-03 20:53:44,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-03 20:53:44,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1123, Invalid=3299, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 20:53:44,037 INFO L87 Difference]: Start difference. First operand 263 states and 264 transitions. Second operand 67 states. [2019-09-03 20:53:46,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:46,111 INFO L93 Difference]: Finished difference Result 359 states and 391 transitions. [2019-09-03 20:53:46,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-03 20:53:46,111 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 260 [2019-09-03 20:53:46,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:46,113 INFO L225 Difference]: With dead ends: 359 [2019-09-03 20:53:46,113 INFO L226 Difference]: Without dead ends: 264 [2019-09-03 20:53:46,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 457 SyntacticMatches, 64 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3503 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2311, Invalid=7589, Unknown=0, NotChecked=0, Total=9900 [2019-09-03 20:53:46,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-09-03 20:53:46,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2019-09-03 20:53:46,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-09-03 20:53:46,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 265 transitions. [2019-09-03 20:53:46,119 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 265 transitions. Word has length 260 [2019-09-03 20:53:46,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:46,120 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 265 transitions. [2019-09-03 20:53:46,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-03 20:53:46,120 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 265 transitions. [2019-09-03 20:53:46,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-03 20:53:46,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:46,122 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:46,122 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:46,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:46,122 INFO L82 PathProgramCache]: Analyzing trace with hash -528360885, now seen corresponding path program 62 times [2019-09-03 20:53:46,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:46,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:46,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:46,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:46,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:46,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3907 backedges. 590 proven. 1457 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-09-03 20:53:46,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:46,732 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:46,732 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:46,732 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:53:46,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:46,733 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:46,745 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:46,745 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:46,875 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-09-03 20:53:46,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:46,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-03 20:53:46,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:46,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:46,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3907 backedges. 590 proven. 1457 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-09-03 20:53:46,961 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:47,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3907 backedges. 590 proven. 1457 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-09-03 20:53:47,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:47,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 39 [2019-09-03 20:53:47,832 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:47,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-03 20:53:47,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-03 20:53:47,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=605, Invalid=877, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 20:53:47,834 INFO L87 Difference]: Start difference. First operand 264 states and 265 transitions. Second operand 39 states. [2019-09-03 20:53:48,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:48,164 INFO L93 Difference]: Finished difference Result 275 states and 277 transitions. [2019-09-03 20:53:48,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-03 20:53:48,164 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 261 [2019-09-03 20:53:48,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:48,166 INFO L225 Difference]: With dead ends: 275 [2019-09-03 20:53:48,166 INFO L226 Difference]: Without dead ends: 275 [2019-09-03 20:53:48,167 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 488 SyntacticMatches, 64 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1185 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=611, Invalid=949, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 20:53:48,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-09-03 20:53:48,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 271. [2019-09-03 20:53:48,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-03 20:53:48,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 272 transitions. [2019-09-03 20:53:48,171 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 272 transitions. Word has length 261 [2019-09-03 20:53:48,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:48,172 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 272 transitions. [2019-09-03 20:53:48,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-03 20:53:48,172 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 272 transitions. [2019-09-03 20:53:48,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-03 20:53:48,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:48,173 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:48,174 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:48,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:48,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1586333784, now seen corresponding path program 63 times [2019-09-03 20:53:48,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:48,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:48,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:48,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:48,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:49,544 INFO L134 CoverageAnalysis]: Checked inductivity of 4128 backedges. 1616 proven. 528 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2019-09-03 20:53:49,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:49,545 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:49,545 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:49,545 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:53:49,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:49,545 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:49,556 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:49,557 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:53:49,642 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:49,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:49,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-03 20:53:49,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:49,688 INFO L134 CoverageAnalysis]: Checked inductivity of 4128 backedges. 1616 proven. 528 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2019-09-03 20:53:49,688 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:50,927 INFO L134 CoverageAnalysis]: Checked inductivity of 4128 backedges. 1616 proven. 528 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2019-09-03 20:53:50,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:50,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 69 [2019-09-03 20:53:50,931 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:50,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-03 20:53:50,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-03 20:53:50,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1191, Invalid=3501, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 20:53:50,933 INFO L87 Difference]: Start difference. First operand 271 states and 272 transitions. Second operand 69 states. [2019-09-03 20:53:52,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:52,703 INFO L93 Difference]: Finished difference Result 370 states and 403 transitions. [2019-09-03 20:53:52,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-03 20:53:52,703 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 268 [2019-09-03 20:53:52,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:52,705 INFO L225 Difference]: With dead ends: 370 [2019-09-03 20:53:52,705 INFO L226 Difference]: Without dead ends: 272 [2019-09-03 20:53:52,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 638 GetRequests, 471 SyntacticMatches, 66 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3728 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2449, Invalid=8057, Unknown=0, NotChecked=0, Total=10506 [2019-09-03 20:53:52,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-09-03 20:53:52,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2019-09-03 20:53:52,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-03 20:53:52,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 273 transitions. [2019-09-03 20:53:52,712 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 273 transitions. Word has length 268 [2019-09-03 20:53:52,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:52,712 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 273 transitions. [2019-09-03 20:53:52,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-03 20:53:52,712 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 273 transitions. [2019-09-03 20:53:52,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-09-03 20:53:52,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:52,714 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:52,714 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:52,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:52,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1773159191, now seen corresponding path program 64 times [2019-09-03 20:53:52,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:52,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:52,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:52,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:52,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:53,504 INFO L134 CoverageAnalysis]: Checked inductivity of 4161 backedges. 625 proven. 1552 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2019-09-03 20:53:53,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:53,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:53,505 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:53,505 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:53:53,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:53,505 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:53,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:53,516 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:53:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:53,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-03 20:53:53,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:53,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:53:53,695 INFO L134 CoverageAnalysis]: Checked inductivity of 4161 backedges. 625 proven. 1552 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2019-09-03 20:53:53,695 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:54,614 INFO L134 CoverageAnalysis]: Checked inductivity of 4161 backedges. 625 proven. 1552 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (65)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:53:54,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:54,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 40 [2019-09-03 20:53:54,618 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:54,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-03 20:53:54,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-03 20:53:54,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=640, Invalid=920, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 20:53:54,619 INFO L87 Difference]: Start difference. First operand 272 states and 273 transitions. Second operand 40 states. [2019-09-03 20:53:55,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:55,068 INFO L93 Difference]: Finished difference Result 283 states and 285 transitions. [2019-09-03 20:53:55,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 20:53:55,069 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 269 [2019-09-03 20:53:55,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:55,070 INFO L225 Difference]: With dead ends: 283 [2019-09-03 20:53:55,071 INFO L226 Difference]: Without dead ends: 283 [2019-09-03 20:53:55,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 503 SyntacticMatches, 66 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1255 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=646, Invalid=994, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 20:53:55,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-09-03 20:53:55,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 279. [2019-09-03 20:53:55,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-09-03 20:53:55,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 280 transitions. [2019-09-03 20:53:55,076 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 280 transitions. Word has length 269 [2019-09-03 20:53:55,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:55,076 INFO L475 AbstractCegarLoop]: Abstraction has 279 states and 280 transitions. [2019-09-03 20:53:55,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-03 20:53:55,076 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 280 transitions. [2019-09-03 20:53:55,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-09-03 20:53:55,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:55,078 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:55,078 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:55,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:55,079 INFO L82 PathProgramCache]: Analyzing trace with hash -558426118, now seen corresponding path program 65 times [2019-09-03 20:53:55,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:55,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:55,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:55,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:55,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:56,487 INFO L134 CoverageAnalysis]: Checked inductivity of 4389 backedges. 1716 proven. 561 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2019-09-03 20:53:56,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:56,487 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:56,487 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:56,488 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:53:56,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:56,488 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:56,499 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:56,499 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:56,624 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-09-03 20:53:56,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:56,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-03 20:53:56,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:56,669 INFO L134 CoverageAnalysis]: Checked inductivity of 4389 backedges. 1716 proven. 561 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2019-09-03 20:53:56,670 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:58,048 INFO L134 CoverageAnalysis]: Checked inductivity of 4389 backedges. 1716 proven. 561 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2019-09-03 20:53:58,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:58,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 71 [2019-09-03 20:53:58,052 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:58,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-03 20:53:58,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-03 20:53:58,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1261, Invalid=3709, Unknown=0, NotChecked=0, Total=4970 [2019-09-03 20:53:58,054 INFO L87 Difference]: Start difference. First operand 279 states and 280 transitions. Second operand 71 states. [2019-09-03 20:53:59,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:59,631 INFO L93 Difference]: Finished difference Result 381 states and 415 transitions. [2019-09-03 20:53:59,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-03 20:53:59,632 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 276 [2019-09-03 20:53:59,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:59,633 INFO L225 Difference]: With dead ends: 381 [2019-09-03 20:53:59,634 INFO L226 Difference]: Without dead ends: 280 [2019-09-03 20:53:59,635 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 657 GetRequests, 485 SyntacticMatches, 68 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3960 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2591, Invalid=8539, Unknown=0, NotChecked=0, Total=11130 [2019-09-03 20:53:59,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-09-03 20:53:59,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2019-09-03 20:53:59,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-09-03 20:53:59,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 281 transitions. [2019-09-03 20:53:59,640 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 281 transitions. Word has length 276 [2019-09-03 20:53:59,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:59,640 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 281 transitions. [2019-09-03 20:53:59,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-03 20:53:59,640 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 281 transitions. [2019-09-03 20:53:59,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-09-03 20:53:59,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:59,642 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:59,642 INFO L418 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:59,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:59,643 INFO L82 PathProgramCache]: Analyzing trace with hash 365439883, now seen corresponding path program 66 times [2019-09-03 20:53:59,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:59,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:59,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:59,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:59,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:00,235 INFO L134 CoverageAnalysis]: Checked inductivity of 4423 backedges. 661 proven. 1650 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2019-09-03 20:54:00,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:00,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:00,235 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:00,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:54:00,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:00,236 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:00,245 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:54:00,245 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:54:00,327 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:54:00,327 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:00,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-03 20:54:00,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:00,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:00,429 INFO L134 CoverageAnalysis]: Checked inductivity of 4423 backedges. 661 proven. 1650 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2019-09-03 20:54:00,430 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:01,345 INFO L134 CoverageAnalysis]: Checked inductivity of 4423 backedges. 661 proven. 1650 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2019-09-03 20:54:01,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:01,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 41 [2019-09-03 20:54:01,350 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:01,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-03 20:54:01,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-03 20:54:01,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=676, Invalid=964, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 20:54:01,351 INFO L87 Difference]: Start difference. First operand 280 states and 281 transitions. Second operand 41 states. [2019-09-03 20:54:01,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:01,792 INFO L93 Difference]: Finished difference Result 291 states and 293 transitions. [2019-09-03 20:54:01,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-03 20:54:01,793 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 277 [2019-09-03 20:54:01,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:01,795 INFO L225 Difference]: With dead ends: 291 [2019-09-03 20:54:01,795 INFO L226 Difference]: Without dead ends: 291 [2019-09-03 20:54:01,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 518 SyntacticMatches, 68 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1327 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=682, Invalid=1040, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 20:54:01,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-09-03 20:54:01,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 287. [2019-09-03 20:54:01,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-09-03 20:54:01,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 288 transitions. [2019-09-03 20:54:01,800 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 288 transitions. Word has length 277 [2019-09-03 20:54:01,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:01,800 INFO L475 AbstractCegarLoop]: Abstraction has 287 states and 288 transitions. [2019-09-03 20:54:01,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-03 20:54:01,801 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 288 transitions. [2019-09-03 20:54:01,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-09-03 20:54:01,802 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:01,802 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:01,803 INFO L418 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:01,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:01,803 INFO L82 PathProgramCache]: Analyzing trace with hash 101011224, now seen corresponding path program 67 times [2019-09-03 20:54:01,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:01,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:01,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:01,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:01,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:01,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:03,317 INFO L134 CoverageAnalysis]: Checked inductivity of 4658 backedges. 1819 proven. 595 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2019-09-03 20:54:03,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:03,317 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:03,318 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:03,318 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:03,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:03,318 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:03,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:03,328 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:54:03,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:03,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-03 20:54:03,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:03,461 INFO L134 CoverageAnalysis]: Checked inductivity of 4658 backedges. 1819 proven. 595 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2019-09-03 20:54:03,462 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:04,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4658 backedges. 1819 proven. 595 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2019-09-03 20:54:04,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:04,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 73 [2019-09-03 20:54:04,861 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:04,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-03 20:54:04,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-03 20:54:04,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1333, Invalid=3923, Unknown=0, NotChecked=0, Total=5256 [2019-09-03 20:54:04,863 INFO L87 Difference]: Start difference. First operand 287 states and 288 transitions. Second operand 73 states. [2019-09-03 20:54:06,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:06,515 INFO L93 Difference]: Finished difference Result 392 states and 427 transitions. [2019-09-03 20:54:06,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-03 20:54:06,515 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 284 [2019-09-03 20:54:06,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:06,517 INFO L225 Difference]: With dead ends: 392 [2019-09-03 20:54:06,517 INFO L226 Difference]: Without dead ends: 288 [2019-09-03 20:54:06,519 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 676 GetRequests, 499 SyntacticMatches, 70 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4199 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2737, Invalid=9035, Unknown=0, NotChecked=0, Total=11772 [2019-09-03 20:54:06,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-09-03 20:54:06,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2019-09-03 20:54:06,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-09-03 20:54:06,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 289 transitions. [2019-09-03 20:54:06,525 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 289 transitions. Word has length 284 [2019-09-03 20:54:06,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:06,525 INFO L475 AbstractCegarLoop]: Abstraction has 288 states and 289 transitions. [2019-09-03 20:54:06,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-03 20:54:06,525 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 289 transitions. [2019-09-03 20:54:06,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-09-03 20:54:06,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:06,527 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:06,527 INFO L418 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:06,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:06,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1424604759, now seen corresponding path program 68 times [2019-09-03 20:54:06,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:06,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:06,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:06,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:06,529 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:06,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:07,196 INFO L134 CoverageAnalysis]: Checked inductivity of 4693 backedges. 698 proven. 1751 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2019-09-03 20:54:07,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:07,196 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:07,196 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:07,196 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:07,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:07,196 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:07,208 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:54:07,208 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:54:07,340 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-09-03 20:54:07,340 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:07,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 76 conjunts are in the unsatisfiable core [2019-09-03 20:54:07,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:07,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:07,422 INFO L134 CoverageAnalysis]: Checked inductivity of 4693 backedges. 698 proven. 1751 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2019-09-03 20:54:07,423 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:08,414 INFO L134 CoverageAnalysis]: Checked inductivity of 4693 backedges. 698 proven. 1751 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2019-09-03 20:54:08,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:08,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 42 [2019-09-03 20:54:08,418 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:08,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-03 20:54:08,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-03 20:54:08,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=713, Invalid=1009, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 20:54:08,419 INFO L87 Difference]: Start difference. First operand 288 states and 289 transitions. Second operand 42 states. [2019-09-03 20:54:08,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:08,775 INFO L93 Difference]: Finished difference Result 299 states and 301 transitions. [2019-09-03 20:54:08,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-03 20:54:08,776 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 285 [2019-09-03 20:54:08,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:08,778 INFO L225 Difference]: With dead ends: 299 [2019-09-03 20:54:08,778 INFO L226 Difference]: Without dead ends: 299 [2019-09-03 20:54:08,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 644 GetRequests, 533 SyntacticMatches, 70 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1401 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=719, Invalid=1087, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 20:54:08,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-09-03 20:54:08,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 295. [2019-09-03 20:54:08,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-09-03 20:54:08,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 296 transitions. [2019-09-03 20:54:08,783 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 296 transitions. Word has length 285 [2019-09-03 20:54:08,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:08,783 INFO L475 AbstractCegarLoop]: Abstraction has 295 states and 296 transitions. [2019-09-03 20:54:08,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-03 20:54:08,783 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 296 transitions. [2019-09-03 20:54:08,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-09-03 20:54:08,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:08,785 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:08,785 INFO L418 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:08,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:08,785 INFO L82 PathProgramCache]: Analyzing trace with hash 53852986, now seen corresponding path program 69 times [2019-09-03 20:54:08,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:08,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:08,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:08,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:08,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:08,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:10,390 INFO L134 CoverageAnalysis]: Checked inductivity of 4935 backedges. 1925 proven. 630 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2019-09-03 20:54:10,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:10,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:10,391 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:10,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:10,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:10,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 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:10,405 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:54:10,405 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:54:10,497 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:54:10,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:10,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-03 20:54:10,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:10,548 INFO L134 CoverageAnalysis]: Checked inductivity of 4935 backedges. 1925 proven. 630 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2019-09-03 20:54:10,548 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:12,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4935 backedges. 1925 proven. 630 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2019-09-03 20:54:12,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:12,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 75 [2019-09-03 20:54:12,055 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:12,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-03 20:54:12,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-03 20:54:12,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1407, Invalid=4143, Unknown=0, NotChecked=0, Total=5550 [2019-09-03 20:54:12,057 INFO L87 Difference]: Start difference. First operand 295 states and 296 transitions. Second operand 75 states. [2019-09-03 20:54:14,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:14,044 INFO L93 Difference]: Finished difference Result 403 states and 439 transitions. [2019-09-03 20:54:14,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-03 20:54:14,044 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 292 [2019-09-03 20:54:14,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:14,046 INFO L225 Difference]: With dead ends: 403 [2019-09-03 20:54:14,046 INFO L226 Difference]: Without dead ends: 296 [2019-09-03 20:54:14,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 695 GetRequests, 513 SyntacticMatches, 72 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4445 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2887, Invalid=9545, Unknown=0, NotChecked=0, Total=12432 [2019-09-03 20:54:14,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-03 20:54:14,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2019-09-03 20:54:14,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-09-03 20:54:14,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 297 transitions. [2019-09-03 20:54:14,051 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 297 transitions. Word has length 292 [2019-09-03 20:54:14,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:14,052 INFO L475 AbstractCegarLoop]: Abstraction has 296 states and 297 transitions. [2019-09-03 20:54:14,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-03 20:54:14,052 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 297 transitions. [2019-09-03 20:54:14,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-09-03 20:54:14,054 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:14,054 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:14,054 INFO L418 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:14,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:14,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1140296907, now seen corresponding path program 70 times [2019-09-03 20:54:14,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:14,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:14,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:14,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:14,056 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:14,737 INFO L134 CoverageAnalysis]: Checked inductivity of 4971 backedges. 736 proven. 1855 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2019-09-03 20:54:14,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:14,738 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:14,738 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:14,738 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:14,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:14,738 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:14,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:14,751 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:54:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:14,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-03 20:54:14,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:14,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:14,955 INFO L134 CoverageAnalysis]: Checked inductivity of 4971 backedges. 736 proven. 1855 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2019-09-03 20:54:14,955 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:16,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4971 backedges. 736 proven. 1855 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2019-09-03 20:54:16,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:16,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 43 [2019-09-03 20:54:16,025 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:16,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-03 20:54:16,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-03 20:54:16,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=751, Invalid=1055, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 20:54:16,027 INFO L87 Difference]: Start difference. First operand 296 states and 297 transitions. Second operand 43 states. [2019-09-03 20:54:16,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:16,481 INFO L93 Difference]: Finished difference Result 307 states and 309 transitions. [2019-09-03 20:54:16,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-03 20:54:16,481 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 293 [2019-09-03 20:54:16,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:16,483 INFO L225 Difference]: With dead ends: 307 [2019-09-03 20:54:16,483 INFO L226 Difference]: Without dead ends: 307 [2019-09-03 20:54:16,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 662 GetRequests, 548 SyntacticMatches, 72 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1477 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=757, Invalid=1135, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 20:54:16,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-03 20:54:16,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 303. [2019-09-03 20:54:16,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-09-03 20:54:16,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 304 transitions. [2019-09-03 20:54:16,488 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 304 transitions. Word has length 293 [2019-09-03 20:54:16,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:16,488 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 304 transitions. [2019-09-03 20:54:16,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-03 20:54:16,488 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 304 transitions. [2019-09-03 20:54:16,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-03 20:54:16,490 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:16,490 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:16,490 INFO L418 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:16,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:16,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1623063080, now seen corresponding path program 71 times [2019-09-03 20:54:16,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:16,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:16,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:16,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:16,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:16,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:18,266 INFO L134 CoverageAnalysis]: Checked inductivity of 5220 backedges. 2034 proven. 666 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2019-09-03 20:54:18,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:18,267 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:18,267 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:18,267 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:18,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:18,267 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:18,278 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:54:18,278 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:54:18,427 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2019-09-03 20:54:18,427 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:18,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 715 conjuncts, 76 conjunts are in the unsatisfiable core [2019-09-03 20:54:18,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:18,487 INFO L134 CoverageAnalysis]: Checked inductivity of 5220 backedges. 2034 proven. 666 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2019-09-03 20:54:18,487 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:20,053 INFO L134 CoverageAnalysis]: Checked inductivity of 5220 backedges. 2034 proven. 666 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2019-09-03 20:54:20,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:20,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 77 [2019-09-03 20:54:20,057 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:20,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-03 20:54:20,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-03 20:54:20,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1483, Invalid=4369, Unknown=0, NotChecked=0, Total=5852 [2019-09-03 20:54:20,058 INFO L87 Difference]: Start difference. First operand 303 states and 304 transitions. Second operand 77 states. [2019-09-03 20:54:22,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:22,637 INFO L93 Difference]: Finished difference Result 414 states and 451 transitions. [2019-09-03 20:54:22,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-03 20:54:22,637 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 300 [2019-09-03 20:54:22,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:22,639 INFO L225 Difference]: With dead ends: 414 [2019-09-03 20:54:22,639 INFO L226 Difference]: Without dead ends: 304 [2019-09-03 20:54:22,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 714 GetRequests, 527 SyntacticMatches, 74 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4698 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=3041, Invalid=10069, Unknown=0, NotChecked=0, Total=13110 [2019-09-03 20:54:22,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-03 20:54:22,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2019-09-03 20:54:22,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-03 20:54:22,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 305 transitions. [2019-09-03 20:54:22,645 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 305 transitions. Word has length 300 [2019-09-03 20:54:22,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:22,645 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 305 transitions. [2019-09-03 20:54:22,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-03 20:54:22,645 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 305 transitions. [2019-09-03 20:54:22,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-09-03 20:54:22,647 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:22,647 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:22,647 INFO L418 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:22,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:22,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1751496297, now seen corresponding path program 72 times [2019-09-03 20:54:22,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:22,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:22,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:22,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:22,648 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:23,284 INFO L134 CoverageAnalysis]: Checked inductivity of 5257 backedges. 775 proven. 1962 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2019-09-03 20:54:23,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:23,284 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:23,284 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:23,284 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:23,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:23,285 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:23,294 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:54:23,295 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:54:23,394 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:54:23,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:23,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-03 20:54:23,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:23,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:23,485 INFO L134 CoverageAnalysis]: Checked inductivity of 5257 backedges. 775 proven. 1962 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2019-09-03 20:54:23,486 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:24,588 INFO L134 CoverageAnalysis]: Checked inductivity of 5257 backedges. 775 proven. 1962 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2019-09-03 20:54:24,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:24,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 44 [2019-09-03 20:54:24,592 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:24,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-03 20:54:24,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-03 20:54:24,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=790, Invalid=1102, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 20:54:24,594 INFO L87 Difference]: Start difference. First operand 304 states and 305 transitions. Second operand 44 states. [2019-09-03 20:54:25,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:25,007 INFO L93 Difference]: Finished difference Result 315 states and 317 transitions. [2019-09-03 20:54:25,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-03 20:54:25,010 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 301 [2019-09-03 20:54:25,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:25,012 INFO L225 Difference]: With dead ends: 315 [2019-09-03 20:54:25,012 INFO L226 Difference]: Without dead ends: 315 [2019-09-03 20:54:25,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 680 GetRequests, 563 SyntacticMatches, 74 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1555 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=796, Invalid=1184, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 20:54:25,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-09-03 20:54:25,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 311. [2019-09-03 20:54:25,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-09-03 20:54:25,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 312 transitions. [2019-09-03 20:54:25,016 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 312 transitions. Word has length 301 [2019-09-03 20:54:25,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:25,016 INFO L475 AbstractCegarLoop]: Abstraction has 311 states and 312 transitions. [2019-09-03 20:54:25,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-03 20:54:25,017 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 312 transitions. [2019-09-03 20:54:25,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-03 20:54:25,018 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:25,018 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:25,019 INFO L418 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:25,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:25,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1883074170, now seen corresponding path program 73 times [2019-09-03 20:54:25,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:25,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:25,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:25,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:25,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:26,744 INFO L134 CoverageAnalysis]: Checked inductivity of 5513 backedges. 2146 proven. 703 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2019-09-03 20:54:26,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:26,744 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:26,745 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:26,745 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:26,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:26,745 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:26,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:26,755 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:54:26,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:26,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 734 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-03 20:54:26,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:26,903 INFO L134 CoverageAnalysis]: Checked inductivity of 5513 backedges. 2146 proven. 703 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2019-09-03 20:54:26,904 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:28,535 INFO L134 CoverageAnalysis]: Checked inductivity of 5513 backedges. 2146 proven. 703 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2019-09-03 20:54:28,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:28,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 79 [2019-09-03 20:54:28,539 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:28,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-03 20:54:28,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-03 20:54:28,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1561, Invalid=4601, Unknown=0, NotChecked=0, Total=6162 [2019-09-03 20:54:28,540 INFO L87 Difference]: Start difference. First operand 311 states and 312 transitions. Second operand 79 states. [2019-09-03 20:54:31,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:31,396 INFO L93 Difference]: Finished difference Result 425 states and 463 transitions. [2019-09-03 20:54:31,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-03 20:54:31,398 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 308 [2019-09-03 20:54:31,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:31,399 INFO L225 Difference]: With dead ends: 425 [2019-09-03 20:54:31,399 INFO L226 Difference]: Without dead ends: 312 [2019-09-03 20:54:31,400 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 733 GetRequests, 541 SyntacticMatches, 76 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4958 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=3199, Invalid=10607, Unknown=0, NotChecked=0, Total=13806 [2019-09-03 20:54:31,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-09-03 20:54:31,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2019-09-03 20:54:31,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-09-03 20:54:31,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 313 transitions. [2019-09-03 20:54:31,404 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 313 transitions. Word has length 308 [2019-09-03 20:54:31,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:31,404 INFO L475 AbstractCegarLoop]: Abstraction has 312 states and 313 transitions. [2019-09-03 20:54:31,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-03 20:54:31,404 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 313 transitions. [2019-09-03 20:54:31,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-09-03 20:54:31,406 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:31,406 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:31,406 INFO L418 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:31,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:31,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1836318219, now seen corresponding path program 74 times [2019-09-03 20:54:31,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:31,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:31,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:31,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:31,407 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:32,116 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 815 proven. 2072 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2019-09-03 20:54:32,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:32,117 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:32,117 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:32,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:32,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:32,117 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:32,127 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:54:32,127 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:54:32,269 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-09-03 20:54:32,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:32,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 82 conjunts are in the unsatisfiable core [2019-09-03 20:54:32,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:32,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:32,360 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 815 proven. 2072 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2019-09-03 20:54:32,360 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:33,572 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 815 proven. 2072 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2019-09-03 20:54:33,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:33,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 45 [2019-09-03 20:54:33,576 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:33,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-03 20:54:33,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-03 20:54:33,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=830, Invalid=1150, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 20:54:33,577 INFO L87 Difference]: Start difference. First operand 312 states and 313 transitions. Second operand 45 states. [2019-09-03 20:54:34,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:34,066 INFO L93 Difference]: Finished difference Result 323 states and 325 transitions. [2019-09-03 20:54:34,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-03 20:54:34,066 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 309 [2019-09-03 20:54:34,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:34,068 INFO L225 Difference]: With dead ends: 323 [2019-09-03 20:54:34,068 INFO L226 Difference]: Without dead ends: 323 [2019-09-03 20:54:34,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 698 GetRequests, 578 SyntacticMatches, 76 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1635 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=836, Invalid=1234, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 20:54:34,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-09-03 20:54:34,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 319. [2019-09-03 20:54:34,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-09-03 20:54:34,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 320 transitions. [2019-09-03 20:54:34,073 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 320 transitions. Word has length 309 [2019-09-03 20:54:34,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:34,073 INFO L475 AbstractCegarLoop]: Abstraction has 319 states and 320 transitions. [2019-09-03 20:54:34,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-03 20:54:34,073 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 320 transitions. [2019-09-03 20:54:34,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-03 20:54:34,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:34,075 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:34,075 INFO L418 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:34,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:34,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1868541080, now seen corresponding path program 75 times [2019-09-03 20:54:34,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:34,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:34,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:34,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:34,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:35,872 INFO L134 CoverageAnalysis]: Checked inductivity of 5814 backedges. 2261 proven. 741 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2019-09-03 20:54:35,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:35,873 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:35,873 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:35,873 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,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:35,873 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:35,882 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:54:35,883 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:54:35,985 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:54:35,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:35,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-03 20:54:35,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:36,043 INFO L134 CoverageAnalysis]: Checked inductivity of 5814 backedges. 2261 proven. 741 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2019-09-03 20:54:36,043 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:37,779 INFO L134 CoverageAnalysis]: Checked inductivity of 5814 backedges. 2261 proven. 741 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2019-09-03 20:54:37,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:37,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 81 [2019-09-03 20:54:37,783 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:37,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-03 20:54:37,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-03 20:54:37,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1641, Invalid=4839, Unknown=0, NotChecked=0, Total=6480 [2019-09-03 20:54:37,785 INFO L87 Difference]: Start difference. First operand 319 states and 320 transitions. Second operand 81 states. [2019-09-03 20:54:40,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:40,821 INFO L93 Difference]: Finished difference Result 436 states and 475 transitions. [2019-09-03 20:54:40,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-03 20:54:40,822 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 316 [2019-09-03 20:54:40,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:40,824 INFO L225 Difference]: With dead ends: 436 [2019-09-03 20:54:40,824 INFO L226 Difference]: Without dead ends: 320 [2019-09-03 20:54:40,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 752 GetRequests, 555 SyntacticMatches, 78 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5225 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=3361, Invalid=11159, Unknown=0, NotChecked=0, Total=14520 [2019-09-03 20:54:40,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-09-03 20:54:40,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-09-03 20:54:40,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-09-03 20:54:40,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 321 transitions. [2019-09-03 20:54:40,830 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 321 transitions. Word has length 316 [2019-09-03 20:54:40,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:40,830 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 321 transitions. [2019-09-03 20:54:40,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-03 20:54:40,831 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 321 transitions. [2019-09-03 20:54:40,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-09-03 20:54:40,832 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:40,833 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:40,833 INFO L418 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:40,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:40,833 INFO L82 PathProgramCache]: Analyzing trace with hash 190454569, now seen corresponding path program 76 times [2019-09-03 20:54:40,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:40,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:40,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:40,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:40,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:41,582 INFO L134 CoverageAnalysis]: Checked inductivity of 5853 backedges. 856 proven. 2185 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2019-09-03 20:54:41,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:41,582 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:41,582 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:41,582 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:41,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:41,582 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:41,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:41,593 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:54:41,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:41,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 84 conjunts are in the unsatisfiable core [2019-09-03 20:54:41,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:41,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:41,791 INFO L134 CoverageAnalysis]: Checked inductivity of 5853 backedges. 856 proven. 2185 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2019-09-03 20:54:41,791 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:42,983 INFO L134 CoverageAnalysis]: Checked inductivity of 5853 backedges. 856 proven. 2185 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2019-09-03 20:54:42,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:42,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 46 [2019-09-03 20:54:42,987 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:42,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-03 20:54:42,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-03 20:54:42,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=871, Invalid=1199, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 20:54:42,988 INFO L87 Difference]: Start difference. First operand 320 states and 321 transitions. Second operand 46 states. [2019-09-03 20:54:43,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:43,532 INFO L93 Difference]: Finished difference Result 331 states and 333 transitions. [2019-09-03 20:54:43,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-03 20:54:43,533 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 317 [2019-09-03 20:54:43,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:43,535 INFO L225 Difference]: With dead ends: 331 [2019-09-03 20:54:43,535 INFO L226 Difference]: Without dead ends: 331 [2019-09-03 20:54:43,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 716 GetRequests, 593 SyntacticMatches, 78 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1717 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=877, Invalid=1285, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 20:54:43,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-09-03 20:54:43,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 327. [2019-09-03 20:54:43,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-09-03 20:54:43,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 328 transitions. [2019-09-03 20:54:43,539 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 328 transitions. Word has length 317 [2019-09-03 20:54:43,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:43,540 INFO L475 AbstractCegarLoop]: Abstraction has 327 states and 328 transitions. [2019-09-03 20:54:43,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-03 20:54:43,540 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 328 transitions. [2019-09-03 20:54:43,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-03 20:54:43,541 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:43,541 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:43,542 INFO L418 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:43,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:43,542 INFO L82 PathProgramCache]: Analyzing trace with hash 825373114, now seen corresponding path program 77 times [2019-09-03 20:54:43,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:43,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:43,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:43,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:43,543 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:45,393 INFO L134 CoverageAnalysis]: Checked inductivity of 6123 backedges. 2379 proven. 780 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2019-09-03 20:54:45,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:45,394 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:45,394 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:45,394 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:45,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:45,394 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:45,403 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:54:45,404 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:54:45,555 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-09-03 20:54:45,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:45,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 82 conjunts are in the unsatisfiable core [2019-09-03 20:54:45,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:45,614 INFO L134 CoverageAnalysis]: Checked inductivity of 6123 backedges. 2379 proven. 780 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2019-09-03 20:54:45,615 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:47,421 INFO L134 CoverageAnalysis]: Checked inductivity of 6123 backedges. 2379 proven. 780 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2019-09-03 20:54:47,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:47,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 83 [2019-09-03 20:54:47,425 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:47,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-09-03 20:54:47,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-09-03 20:54:47,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1723, Invalid=5083, Unknown=0, NotChecked=0, Total=6806 [2019-09-03 20:54:47,427 INFO L87 Difference]: Start difference. First operand 327 states and 328 transitions. Second operand 83 states. [2019-09-03 20:54:49,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:49,152 INFO L93 Difference]: Finished difference Result 447 states and 487 transitions. [2019-09-03 20:54:49,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-03 20:54:49,159 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 324 [2019-09-03 20:54:49,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:49,161 INFO L225 Difference]: With dead ends: 447 [2019-09-03 20:54:49,161 INFO L226 Difference]: Without dead ends: 328 [2019-09-03 20:54:49,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 771 GetRequests, 569 SyntacticMatches, 80 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5499 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=3527, Invalid=11725, Unknown=0, NotChecked=0, Total=15252 [2019-09-03 20:54:49,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-09-03 20:54:49,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2019-09-03 20:54:49,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-09-03 20:54:49,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 329 transitions. [2019-09-03 20:54:49,169 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 329 transitions. Word has length 324 [2019-09-03 20:54:49,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:49,169 INFO L475 AbstractCegarLoop]: Abstraction has 328 states and 329 transitions. [2019-09-03 20:54:49,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-09-03 20:54:49,169 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 329 transitions. [2019-09-03 20:54:49,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-09-03 20:54:49,171 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:49,171 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:49,171 INFO L418 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:49,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:49,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1784578229, now seen corresponding path program 78 times [2019-09-03 20:54:49,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:49,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:49,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:49,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:49,173 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:49,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:49,960 INFO L134 CoverageAnalysis]: Checked inductivity of 6163 backedges. 898 proven. 2301 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2019-09-03 20:54:49,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:49,961 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:49,961 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:49,961 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,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:49,961 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:49,974 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:54:49,974 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:54:50,080 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:54:50,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:50,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-03 20:54:50,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:50,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:54:50,179 INFO L134 CoverageAnalysis]: Checked inductivity of 6163 backedges. 898 proven. 2301 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2019-09-03 20:54:50,180 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:51,450 INFO L134 CoverageAnalysis]: Checked inductivity of 6163 backedges. 898 proven. 2301 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2019-09-03 20:54:51,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:51,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 47 [2019-09-03 20:54:51,454 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:51,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-03 20:54:51,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-03 20:54:51,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=913, Invalid=1249, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 20:54:51,456 INFO L87 Difference]: Start difference. First operand 328 states and 329 transitions. Second operand 47 states. [2019-09-03 20:54:51,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:51,933 INFO L93 Difference]: Finished difference Result 339 states and 341 transitions. [2019-09-03 20:54:51,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-03 20:54:51,933 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 325 [2019-09-03 20:54:51,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:51,936 INFO L225 Difference]: With dead ends: 339 [2019-09-03 20:54:51,936 INFO L226 Difference]: Without dead ends: 339 [2019-09-03 20:54:51,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 734 GetRequests, 608 SyntacticMatches, 80 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1801 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=919, Invalid=1337, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 20:54:51,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-09-03 20:54:51,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 335. [2019-09-03 20:54:51,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-09-03 20:54:51,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 336 transitions. [2019-09-03 20:54:51,945 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 336 transitions. Word has length 325 [2019-09-03 20:54:51,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:51,945 INFO L475 AbstractCegarLoop]: Abstraction has 335 states and 336 transitions. [2019-09-03 20:54:51,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-03 20:54:51,946 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 336 transitions. [2019-09-03 20:54:51,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-03 20:54:51,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:51,949 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:51,949 INFO L418 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:51,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:51,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1703263400, now seen corresponding path program 79 times [2019-09-03 20:54:51,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:51,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:51,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:51,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:51,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:52,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:54,279 INFO L134 CoverageAnalysis]: Checked inductivity of 6440 backedges. 2500 proven. 820 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2019-09-03 20:54:54,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:54,280 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:54,280 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:54,280 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,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:54,280 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:54,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:54,290 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:54:54,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:54,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 84 conjunts are in the unsatisfiable core [2019-09-03 20:54:54,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:54,456 INFO L134 CoverageAnalysis]: Checked inductivity of 6440 backedges. 2500 proven. 820 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2019-09-03 20:54:54,456 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:56,371 INFO L134 CoverageAnalysis]: Checked inductivity of 6440 backedges. 2500 proven. 820 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2019-09-03 20:54:56,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:56,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 85 [2019-09-03 20:54:56,374 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:56,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-09-03 20:54:56,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-09-03 20:54:56,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1807, Invalid=5333, Unknown=0, NotChecked=0, Total=7140 [2019-09-03 20:54:56,376 INFO L87 Difference]: Start difference. First operand 335 states and 336 transitions. Second operand 85 states. [2019-09-03 20:54:59,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:59,597 INFO L93 Difference]: Finished difference Result 458 states and 499 transitions. [2019-09-03 20:54:59,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-09-03 20:54:59,601 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 332 [2019-09-03 20:54:59,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:59,603 INFO L225 Difference]: With dead ends: 458 [2019-09-03 20:54:59,603 INFO L226 Difference]: Without dead ends: 336 [2019-09-03 20:54:59,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 790 GetRequests, 583 SyntacticMatches, 82 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5780 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=3697, Invalid=12305, Unknown=0, NotChecked=0, Total=16002 [2019-09-03 20:54:59,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-09-03 20:54:59,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2019-09-03 20:54:59,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-09-03 20:54:59,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 337 transitions. [2019-09-03 20:54:59,611 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 337 transitions. Word has length 332 [2019-09-03 20:54:59,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:59,611 INFO L475 AbstractCegarLoop]: Abstraction has 336 states and 337 transitions. [2019-09-03 20:54:59,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-09-03 20:54:59,611 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 337 transitions. [2019-09-03 20:54:59,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-03 20:54:59,613 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:59,613 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:59,613 INFO L418 AbstractCegarLoop]: === Iteration 82 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:59,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:59,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1341165591, now seen corresponding path program 80 times [2019-09-03 20:54:59,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:59,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:59,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:59,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:59,615 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:59,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:00,430 INFO L134 CoverageAnalysis]: Checked inductivity of 6481 backedges. 941 proven. 2420 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2019-09-03 20:55:00,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:00,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:00,431 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:00,431 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:00,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:00,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:00,442 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:55:00,442 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:55:00,601 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-09-03 20:55:00,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:00,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 88 conjunts are in the unsatisfiable core [2019-09-03 20:55:00,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:00,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:00,705 INFO L134 CoverageAnalysis]: Checked inductivity of 6481 backedges. 941 proven. 2420 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2019-09-03 20:55:00,706 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:02,034 INFO L134 CoverageAnalysis]: Checked inductivity of 6481 backedges. 941 proven. 2420 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2019-09-03 20:55:02,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:02,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 48 [2019-09-03 20:55:02,038 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:02,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-03 20:55:02,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-03 20:55:02,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=956, Invalid=1300, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 20:55:02,039 INFO L87 Difference]: Start difference. First operand 336 states and 337 transitions. Second operand 48 states. [2019-09-03 20:55:02,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:02,560 INFO L93 Difference]: Finished difference Result 347 states and 349 transitions. [2019-09-03 20:55:02,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-03 20:55:02,560 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 333 [2019-09-03 20:55:02,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:02,563 INFO L225 Difference]: With dead ends: 347 [2019-09-03 20:55:02,563 INFO L226 Difference]: Without dead ends: 347 [2019-09-03 20:55:02,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 752 GetRequests, 623 SyntacticMatches, 82 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1887 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=962, Invalid=1390, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 20:55:02,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-09-03 20:55:02,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 343. [2019-09-03 20:55:02,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-09-03 20:55:02,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 344 transitions. [2019-09-03 20:55:02,568 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 344 transitions. Word has length 333 [2019-09-03 20:55:02,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:02,568 INFO L475 AbstractCegarLoop]: Abstraction has 343 states and 344 transitions. [2019-09-03 20:55:02,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-03 20:55:02,568 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 344 transitions. [2019-09-03 20:55:02,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-09-03 20:55:02,569 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:02,569 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:02,570 INFO L418 AbstractCegarLoop]: === Iteration 83 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:02,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:02,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1837628166, now seen corresponding path program 81 times [2019-09-03 20:55:02,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:02,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:02,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:02,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:02,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:02,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:04,668 INFO L134 CoverageAnalysis]: Checked inductivity of 6765 backedges. 2624 proven. 861 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2019-09-03 20:55:04,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:04,669 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:04,669 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:04,669 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,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:04,669 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:04,681 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:55:04,681 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:55:04,795 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:55:04,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:04,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-03 20:55:04,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:04,869 INFO L134 CoverageAnalysis]: Checked inductivity of 6765 backedges. 2624 proven. 861 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2019-09-03 20:55:04,869 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:06,870 INFO L134 CoverageAnalysis]: Checked inductivity of 6765 backedges. 2624 proven. 861 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2019-09-03 20:55:06,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:06,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 87 [2019-09-03 20:55:06,874 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:06,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-09-03 20:55:06,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-09-03 20:55:06,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1893, Invalid=5589, Unknown=0, NotChecked=0, Total=7482 [2019-09-03 20:55:06,876 INFO L87 Difference]: Start difference. First operand 343 states and 344 transitions. Second operand 87 states. [2019-09-03 20:55:10,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:10,381 INFO L93 Difference]: Finished difference Result 469 states and 511 transitions. [2019-09-03 20:55:10,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-03 20:55:10,382 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 340 [2019-09-03 20:55:10,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:10,384 INFO L225 Difference]: With dead ends: 469 [2019-09-03 20:55:10,384 INFO L226 Difference]: Without dead ends: 344 [2019-09-03 20:55:10,386 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 809 GetRequests, 597 SyntacticMatches, 84 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6068 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=3871, Invalid=12899, Unknown=0, NotChecked=0, Total=16770 [2019-09-03 20:55:10,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-09-03 20:55:10,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2019-09-03 20:55:10,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-09-03 20:55:10,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 345 transitions. [2019-09-03 20:55:10,391 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 345 transitions. Word has length 340 [2019-09-03 20:55:10,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:10,391 INFO L475 AbstractCegarLoop]: Abstraction has 344 states and 345 transitions. [2019-09-03 20:55:10,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-09-03 20:55:10,392 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 345 transitions. [2019-09-03 20:55:10,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2019-09-03 20:55:10,393 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:10,394 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:10,394 INFO L418 AbstractCegarLoop]: === Iteration 84 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:10,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:10,394 INFO L82 PathProgramCache]: Analyzing trace with hash 14946443, now seen corresponding path program 82 times [2019-09-03 20:55:10,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:10,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:10,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:10,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:10,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:10,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:11,217 INFO L134 CoverageAnalysis]: Checked inductivity of 6807 backedges. 985 proven. 2542 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2019-09-03 20:55:11,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:11,217 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:11,218 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:11,218 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:11,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:11,218 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:11,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:11,229 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:55:11,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:11,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 90 conjunts are in the unsatisfiable core [2019-09-03 20:55:11,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:11,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:11,456 INFO L134 CoverageAnalysis]: Checked inductivity of 6807 backedges. 985 proven. 2542 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2019-09-03 20:55:11,456 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:12,820 INFO L134 CoverageAnalysis]: Checked inductivity of 6807 backedges. 985 proven. 2542 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2019-09-03 20:55:12,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:12,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 49 [2019-09-03 20:55:12,824 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:12,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-03 20:55:12,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-03 20:55:12,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1000, Invalid=1352, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 20:55:12,826 INFO L87 Difference]: Start difference. First operand 344 states and 345 transitions. Second operand 49 states. [2019-09-03 20:55:13,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:13,359 INFO L93 Difference]: Finished difference Result 355 states and 357 transitions. [2019-09-03 20:55:13,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-03 20:55:13,360 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 341 [2019-09-03 20:55:13,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:13,362 INFO L225 Difference]: With dead ends: 355 [2019-09-03 20:55:13,363 INFO L226 Difference]: Without dead ends: 355 [2019-09-03 20:55:13,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 770 GetRequests, 638 SyntacticMatches, 84 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1975 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1006, Invalid=1444, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 20:55:13,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-09-03 20:55:13,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 351. [2019-09-03 20:55:13,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-09-03 20:55:13,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 352 transitions. [2019-09-03 20:55:13,367 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 352 transitions. Word has length 341 [2019-09-03 20:55:13,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:13,368 INFO L475 AbstractCegarLoop]: Abstraction has 351 states and 352 transitions. [2019-09-03 20:55:13,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-03 20:55:13,368 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 352 transitions. [2019-09-03 20:55:13,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-09-03 20:55:13,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:13,369 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:13,370 INFO L418 AbstractCegarLoop]: === Iteration 85 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:13,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:13,370 INFO L82 PathProgramCache]: Analyzing trace with hash -475149800, now seen corresponding path program 83 times [2019-09-03 20:55:13,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:13,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:13,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:13,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:13,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:15,520 INFO L134 CoverageAnalysis]: Checked inductivity of 7098 backedges. 2751 proven. 903 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2019-09-03 20:55:15,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:15,521 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:15,521 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:15,521 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:15,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:15,521 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:15,532 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:55:15,532 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:55:15,702 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-09-03 20:55:15,703 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:15,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 88 conjunts are in the unsatisfiable core [2019-09-03 20:55:15,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:15,839 INFO L134 CoverageAnalysis]: Checked inductivity of 7098 backedges. 2751 proven. 903 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2019-09-03 20:55:15,839 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:17,950 INFO L134 CoverageAnalysis]: Checked inductivity of 7098 backedges. 2751 proven. 903 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2019-09-03 20:55:17,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:17,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 89 [2019-09-03 20:55:17,954 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:17,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-09-03 20:55:17,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-09-03 20:55:17,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1981, Invalid=5851, Unknown=0, NotChecked=0, Total=7832 [2019-09-03 20:55:17,956 INFO L87 Difference]: Start difference. First operand 351 states and 352 transitions. Second operand 89 states. [2019-09-03 20:55:22,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:22,805 INFO L93 Difference]: Finished difference Result 480 states and 523 transitions. [2019-09-03 20:55:22,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-03 20:55:22,805 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 348 [2019-09-03 20:55:22,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:22,807 INFO L225 Difference]: With dead ends: 480 [2019-09-03 20:55:22,808 INFO L226 Difference]: Without dead ends: 352 [2019-09-03 20:55:22,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 828 GetRequests, 611 SyntacticMatches, 86 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6363 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=4049, Invalid=13507, Unknown=0, NotChecked=0, Total=17556 [2019-09-03 20:55:22,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-09-03 20:55:22,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2019-09-03 20:55:22,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-03 20:55:22,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 353 transitions. [2019-09-03 20:55:22,814 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 353 transitions. Word has length 348 [2019-09-03 20:55:22,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:22,814 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 353 transitions. [2019-09-03 20:55:22,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-09-03 20:55:22,814 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 353 transitions. [2019-09-03 20:55:22,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2019-09-03 20:55:22,816 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:22,816 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:22,816 INFO L418 AbstractCegarLoop]: === Iteration 86 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:22,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:22,817 INFO L82 PathProgramCache]: Analyzing trace with hash 295810217, now seen corresponding path program 84 times [2019-09-03 20:55:22,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:22,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:22,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:22,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:22,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:22,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:23,682 INFO L134 CoverageAnalysis]: Checked inductivity of 7141 backedges. 1030 proven. 2667 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2019-09-03 20:55:23,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:23,682 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:23,682 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:23,682 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:23,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:23,683 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:23,693 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:55:23,693 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:55:23,806 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:55:23,807 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:23,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 834 conjuncts, 92 conjunts are in the unsatisfiable core [2019-09-03 20:55:23,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:23,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:23,920 INFO L134 CoverageAnalysis]: Checked inductivity of 7141 backedges. 1030 proven. 2667 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2019-09-03 20:55:23,920 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:25,376 INFO L134 CoverageAnalysis]: Checked inductivity of 7141 backedges. 1030 proven. 2667 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2019-09-03 20:55:25,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:25,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 50 [2019-09-03 20:55:25,380 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:25,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-03 20:55:25,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-03 20:55:25,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1045, Invalid=1405, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 20:55:25,383 INFO L87 Difference]: Start difference. First operand 352 states and 353 transitions. Second operand 50 states. [2019-09-03 20:55:25,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:25,933 INFO L93 Difference]: Finished difference Result 363 states and 365 transitions. [2019-09-03 20:55:25,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-03 20:55:25,934 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 349 [2019-09-03 20:55:25,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:25,936 INFO L225 Difference]: With dead ends: 363 [2019-09-03 20:55:25,936 INFO L226 Difference]: Without dead ends: 363 [2019-09-03 20:55:25,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 788 GetRequests, 653 SyntacticMatches, 86 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2065 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1051, Invalid=1499, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 20:55:25,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-09-03 20:55:25,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 359. [2019-09-03 20:55:25,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-09-03 20:55:25,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 360 transitions. [2019-09-03 20:55:25,942 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 360 transitions. Word has length 349 [2019-09-03 20:55:25,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:25,942 INFO L475 AbstractCegarLoop]: Abstraction has 359 states and 360 transitions. [2019-09-03 20:55:25,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-03 20:55:25,942 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 360 transitions. [2019-09-03 20:55:25,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-09-03 20:55:25,944 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:25,944 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:25,944 INFO L418 AbstractCegarLoop]: === Iteration 87 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:25,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:25,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1634920506, now seen corresponding path program 85 times [2019-09-03 20:55:25,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:25,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:25,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:25,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:25,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:25,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:28,155 INFO L134 CoverageAnalysis]: Checked inductivity of 7439 backedges. 2881 proven. 946 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2019-09-03 20:55:28,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:28,155 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:28,155 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:28,155 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:28,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:28,156 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:28,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:28,169 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:55:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:28,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 848 conjuncts, 90 conjunts are in the unsatisfiable core [2019-09-03 20:55:28,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:28,367 INFO L134 CoverageAnalysis]: Checked inductivity of 7439 backedges. 2881 proven. 946 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2019-09-03 20:55:28,368 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:30,543 INFO L134 CoverageAnalysis]: Checked inductivity of 7439 backedges. 2881 proven. 946 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2019-09-03 20:55:30,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:30,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 91 [2019-09-03 20:55:30,547 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:30,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-09-03 20:55:30,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-09-03 20:55:30,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2071, Invalid=6119, Unknown=0, NotChecked=0, Total=8190 [2019-09-03 20:55:30,549 INFO L87 Difference]: Start difference. First operand 359 states and 360 transitions. Second operand 91 states. [2019-09-03 20:55:34,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:34,444 INFO L93 Difference]: Finished difference Result 491 states and 535 transitions. [2019-09-03 20:55:34,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-03 20:55:34,445 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 356 [2019-09-03 20:55:34,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:34,447 INFO L225 Difference]: With dead ends: 491 [2019-09-03 20:55:34,447 INFO L226 Difference]: Without dead ends: 360 [2019-09-03 20:55:34,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 847 GetRequests, 625 SyntacticMatches, 88 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6665 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=4231, Invalid=14129, Unknown=0, NotChecked=0, Total=18360 [2019-09-03 20:55:34,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-09-03 20:55:34,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2019-09-03 20:55:34,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-09-03 20:55:34,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 361 transitions. [2019-09-03 20:55:34,454 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 361 transitions. Word has length 356 [2019-09-03 20:55:34,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:34,454 INFO L475 AbstractCegarLoop]: Abstraction has 360 states and 361 transitions. [2019-09-03 20:55:34,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-09-03 20:55:34,454 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 361 transitions. [2019-09-03 20:55:34,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-09-03 20:55:34,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:34,456 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:34,456 INFO L418 AbstractCegarLoop]: === Iteration 88 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:34,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:34,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1956622795, now seen corresponding path program 86 times [2019-09-03 20:55:34,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:34,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:34,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:34,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:34,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:34,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:35,364 INFO L134 CoverageAnalysis]: Checked inductivity of 7483 backedges. 1076 proven. 2795 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2019-09-03 20:55:35,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:35,365 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:35,365 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:35,365 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,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:35,365 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:35,377 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:55:35,377 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:55:35,555 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-09-03 20:55:35,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:35,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 94 conjunts are in the unsatisfiable core [2019-09-03 20:55:35,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:35,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:35,669 INFO L134 CoverageAnalysis]: Checked inductivity of 7483 backedges. 1076 proven. 2795 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2019-09-03 20:55:35,670 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:37,213 INFO L134 CoverageAnalysis]: Checked inductivity of 7483 backedges. 1076 proven. 2795 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2019-09-03 20:55:37,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:37,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 51 [2019-09-03 20:55:37,218 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:37,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-03 20:55:37,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-03 20:55:37,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1091, Invalid=1459, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 20:55:37,219 INFO L87 Difference]: Start difference. First operand 360 states and 361 transitions. Second operand 51 states. [2019-09-03 20:55:37,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:37,690 INFO L93 Difference]: Finished difference Result 371 states and 373 transitions. [2019-09-03 20:55:37,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-03 20:55:37,691 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 357 [2019-09-03 20:55:37,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:37,693 INFO L225 Difference]: With dead ends: 371 [2019-09-03 20:55:37,694 INFO L226 Difference]: Without dead ends: 371 [2019-09-03 20:55:37,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 806 GetRequests, 668 SyntacticMatches, 88 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2157 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1097, Invalid=1555, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:55:37,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-09-03 20:55:37,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 367. [2019-09-03 20:55:37,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-09-03 20:55:37,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 368 transitions. [2019-09-03 20:55:37,700 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 368 transitions. Word has length 357 [2019-09-03 20:55:37,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:37,701 INFO L475 AbstractCegarLoop]: Abstraction has 367 states and 368 transitions. [2019-09-03 20:55:37,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-03 20:55:37,701 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 368 transitions. [2019-09-03 20:55:37,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-09-03 20:55:37,703 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:37,703 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:37,703 INFO L418 AbstractCegarLoop]: === Iteration 89 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:37,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:37,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1830174936, now seen corresponding path program 87 times [2019-09-03 20:55:37,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:37,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:37,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:37,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:37,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:37,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:40,073 INFO L134 CoverageAnalysis]: Checked inductivity of 7788 backedges. 3014 proven. 990 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2019-09-03 20:55:40,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:40,074 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:40,074 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:40,074 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:40,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:40,074 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:40,085 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:55:40,085 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:55:40,212 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:55:40,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:40,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 92 conjunts are in the unsatisfiable core [2019-09-03 20:55:40,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:40,288 INFO L134 CoverageAnalysis]: Checked inductivity of 7788 backedges. 3014 proven. 990 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2019-09-03 20:55:40,288 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:42,597 INFO L134 CoverageAnalysis]: Checked inductivity of 7788 backedges. 3014 proven. 990 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2019-09-03 20:55:42,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:42,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 93 [2019-09-03 20:55:42,601 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:42,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-09-03 20:55:42,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-09-03 20:55:42,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2163, Invalid=6393, Unknown=0, NotChecked=0, Total=8556 [2019-09-03 20:55:42,603 INFO L87 Difference]: Start difference. First operand 367 states and 368 transitions. Second operand 93 states. [2019-09-03 20:55:46,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:46,633 INFO L93 Difference]: Finished difference Result 502 states and 547 transitions. [2019-09-03 20:55:46,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-09-03 20:55:46,637 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 364 [2019-09-03 20:55:46,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:46,639 INFO L225 Difference]: With dead ends: 502 [2019-09-03 20:55:46,639 INFO L226 Difference]: Without dead ends: 368 [2019-09-03 20:55:46,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 866 GetRequests, 639 SyntacticMatches, 90 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6974 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=4417, Invalid=14765, Unknown=0, NotChecked=0, Total=19182 [2019-09-03 20:55:46,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-09-03 20:55:46,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2019-09-03 20:55:46,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-09-03 20:55:46,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 369 transitions. [2019-09-03 20:55:46,647 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 369 transitions. Word has length 364 [2019-09-03 20:55:46,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:46,647 INFO L475 AbstractCegarLoop]: Abstraction has 368 states and 369 transitions. [2019-09-03 20:55:46,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-09-03 20:55:46,647 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 369 transitions. [2019-09-03 20:55:46,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-09-03 20:55:46,650 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:46,650 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:46,650 INFO L418 AbstractCegarLoop]: === Iteration 90 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:46,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:46,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1244457321, now seen corresponding path program 88 times [2019-09-03 20:55:46,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:46,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:46,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:46,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:46,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:47,567 INFO L134 CoverageAnalysis]: Checked inductivity of 7833 backedges. 1123 proven. 2926 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2019-09-03 20:55:47,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:47,567 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:47,568 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:47,568 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:47,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:47,568 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:47,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:47,578 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:55:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:47,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 96 conjunts are in the unsatisfiable core [2019-09-03 20:55:47,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:47,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:47,805 INFO L134 CoverageAnalysis]: Checked inductivity of 7833 backedges. 1123 proven. 2926 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2019-09-03 20:55:47,806 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:49,389 INFO L134 CoverageAnalysis]: Checked inductivity of 7833 backedges. 1123 proven. 2926 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2019-09-03 20:55:49,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:49,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 52 [2019-09-03 20:55:49,393 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:49,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-03 20:55:49,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-03 20:55:49,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1138, Invalid=1514, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:55:49,394 INFO L87 Difference]: Start difference. First operand 368 states and 369 transitions. Second operand 52 states. [2019-09-03 20:55:49,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:49,988 INFO L93 Difference]: Finished difference Result 379 states and 381 transitions. [2019-09-03 20:55:49,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-03 20:55:49,989 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 365 [2019-09-03 20:55:49,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:49,992 INFO L225 Difference]: With dead ends: 379 [2019-09-03 20:55:49,992 INFO L226 Difference]: Without dead ends: 379 [2019-09-03 20:55:49,992 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 824 GetRequests, 683 SyntacticMatches, 90 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2251 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1144, Invalid=1612, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 20:55:49,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-09-03 20:55:49,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 375. [2019-09-03 20:55:49,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-09-03 20:55:49,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 376 transitions. [2019-09-03 20:55:49,997 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 376 transitions. Word has length 365 [2019-09-03 20:55:49,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:49,998 INFO L475 AbstractCegarLoop]: Abstraction has 375 states and 376 transitions. [2019-09-03 20:55:49,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-03 20:55:49,998 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 376 transitions. [2019-09-03 20:55:50,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-03 20:55:50,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:50,000 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:50,001 INFO L418 AbstractCegarLoop]: === Iteration 91 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:50,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:50,001 INFO L82 PathProgramCache]: Analyzing trace with hash 747035514, now seen corresponding path program 89 times [2019-09-03 20:55:50,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:50,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:50,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:50,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:50,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:52,430 INFO L134 CoverageAnalysis]: Checked inductivity of 8145 backedges. 3150 proven. 1035 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2019-09-03 20:55:52,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:52,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:52,431 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:52,431 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,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:52,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:52,441 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:55:52,442 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:55:52,634 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-09-03 20:55:52,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:52,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 886 conjuncts, 94 conjunts are in the unsatisfiable core [2019-09-03 20:55:52,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:52,708 INFO L134 CoverageAnalysis]: Checked inductivity of 8145 backedges. 3150 proven. 1035 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2019-09-03 20:55:52,709 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:55,096 INFO L134 CoverageAnalysis]: Checked inductivity of 8145 backedges. 3150 proven. 1035 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2019-09-03 20:55:55,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:55,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 95 [2019-09-03 20:55:55,100 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:55,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-09-03 20:55:55,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-09-03 20:55:55,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2257, Invalid=6673, Unknown=0, NotChecked=0, Total=8930 [2019-09-03 20:55:55,102 INFO L87 Difference]: Start difference. First operand 375 states and 376 transitions. Second operand 95 states. [2019-09-03 20:55:58,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:58,382 INFO L93 Difference]: Finished difference Result 513 states and 559 transitions. [2019-09-03 20:55:58,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-03 20:55:58,385 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 372 [2019-09-03 20:55:58,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:58,387 INFO L225 Difference]: With dead ends: 513 [2019-09-03 20:55:58,387 INFO L226 Difference]: Without dead ends: 376 [2019-09-03 20:55:58,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 885 GetRequests, 653 SyntacticMatches, 92 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7290 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=4607, Invalid=15415, Unknown=0, NotChecked=0, Total=20022 [2019-09-03 20:55:58,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-09-03 20:55:58,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2019-09-03 20:55:58,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-09-03 20:55:58,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 377 transitions. [2019-09-03 20:55:58,393 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 377 transitions. Word has length 372 [2019-09-03 20:55:58,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:58,393 INFO L475 AbstractCegarLoop]: Abstraction has 376 states and 377 transitions. [2019-09-03 20:55:58,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-09-03 20:55:58,393 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 377 transitions. [2019-09-03 20:55:58,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-09-03 20:55:58,395 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:58,396 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:58,396 INFO L418 AbstractCegarLoop]: === Iteration 92 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:58,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:58,397 INFO L82 PathProgramCache]: Analyzing trace with hash 2000184075, now seen corresponding path program 90 times [2019-09-03 20:55:58,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:58,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:58,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:58,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:58,398 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:59,657 INFO L134 CoverageAnalysis]: Checked inductivity of 8191 backedges. 1171 proven. 3060 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2019-09-03 20:55:59,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:59,658 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:59,658 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:59,658 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:59,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:59,658 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:59,668 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:55:59,669 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:55:59,795 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:55:59,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:59,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 98 conjunts are in the unsatisfiable core [2019-09-03 20:55:59,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:59,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:55:59,918 INFO L134 CoverageAnalysis]: Checked inductivity of 8191 backedges. 1171 proven. 3060 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2019-09-03 20:55:59,918 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:01,558 INFO L134 CoverageAnalysis]: Checked inductivity of 8191 backedges. 1171 proven. 3060 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2019-09-03 20:56:01,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:01,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 53 [2019-09-03 20:56:01,562 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:01,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-03 20:56:01,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-03 20:56:01,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1186, Invalid=1570, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 20:56:01,564 INFO L87 Difference]: Start difference. First operand 376 states and 377 transitions. Second operand 53 states. [2019-09-03 20:56:02,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:02,159 INFO L93 Difference]: Finished difference Result 387 states and 389 transitions. [2019-09-03 20:56:02,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-03 20:56:02,159 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 373 [2019-09-03 20:56:02,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:02,162 INFO L225 Difference]: With dead ends: 387 [2019-09-03 20:56:02,162 INFO L226 Difference]: Without dead ends: 387 [2019-09-03 20:56:02,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 842 GetRequests, 698 SyntacticMatches, 92 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2347 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1192, Invalid=1670, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 20:56:02,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-09-03 20:56:02,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2019-09-03 20:56:02,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-09-03 20:56:02,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 384 transitions. [2019-09-03 20:56:02,167 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 384 transitions. Word has length 373 [2019-09-03 20:56:02,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:02,167 INFO L475 AbstractCegarLoop]: Abstraction has 383 states and 384 transitions. [2019-09-03 20:56:02,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-03 20:56:02,167 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 384 transitions. [2019-09-03 20:56:02,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-09-03 20:56:02,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:02,169 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:02,169 INFO L418 AbstractCegarLoop]: === Iteration 93 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:02,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:02,170 INFO L82 PathProgramCache]: Analyzing trace with hash 2010097560, now seen corresponding path program 91 times [2019-09-03 20:56:02,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:02,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:02,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:02,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:02,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:04,729 INFO L134 CoverageAnalysis]: Checked inductivity of 8510 backedges. 3289 proven. 1081 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2019-09-03 20:56:04,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:04,729 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:04,730 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:04,730 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:56:04,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:04,730 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:04,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:04,740 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:56:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:04,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 905 conjuncts, 96 conjunts are in the unsatisfiable core [2019-09-03 20:56:04,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:04,933 INFO L134 CoverageAnalysis]: Checked inductivity of 8510 backedges. 3289 proven. 1081 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2019-09-03 20:56:04,933 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:07,421 INFO L134 CoverageAnalysis]: Checked inductivity of 8510 backedges. 3289 proven. 1081 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2019-09-03 20:56:07,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:07,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 97 [2019-09-03 20:56:07,425 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:07,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-09-03 20:56:07,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-09-03 20:56:07,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2353, Invalid=6959, Unknown=0, NotChecked=0, Total=9312 [2019-09-03 20:56:07,427 INFO L87 Difference]: Start difference. First operand 383 states and 384 transitions. Second operand 97 states. [2019-09-03 20:56:11,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:11,729 INFO L93 Difference]: Finished difference Result 524 states and 571 transitions. [2019-09-03 20:56:11,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-09-03 20:56:11,730 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 380 [2019-09-03 20:56:11,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:11,732 INFO L225 Difference]: With dead ends: 524 [2019-09-03 20:56:11,732 INFO L226 Difference]: Without dead ends: 384 [2019-09-03 20:56:11,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 904 GetRequests, 667 SyntacticMatches, 94 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7613 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=4801, Invalid=16079, Unknown=0, NotChecked=0, Total=20880 [2019-09-03 20:56:11,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-09-03 20:56:11,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2019-09-03 20:56:11,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-09-03 20:56:11,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 385 transitions. [2019-09-03 20:56:11,738 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 385 transitions. Word has length 380 [2019-09-03 20:56:11,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:11,738 INFO L475 AbstractCegarLoop]: Abstraction has 384 states and 385 transitions. [2019-09-03 20:56:11,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-09-03 20:56:11,738 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 385 transitions. [2019-09-03 20:56:11,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2019-09-03 20:56:11,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:11,741 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:11,741 INFO L418 AbstractCegarLoop]: === Iteration 94 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:11,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:11,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1832055255, now seen corresponding path program 92 times [2019-09-03 20:56:11,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:11,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:11,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:11,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:11,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:11,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:12,818 INFO L134 CoverageAnalysis]: Checked inductivity of 8557 backedges. 1220 proven. 3197 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2019-09-03 20:56:12,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:12,818 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:12,818 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:12,818 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:56:12,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:12,819 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:12,828 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:56:12,828 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:56:13,029 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-09-03 20:56:13,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:13,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 100 conjunts are in the unsatisfiable core [2019-09-03 20:56:13,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:13,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:13,148 INFO L134 CoverageAnalysis]: Checked inductivity of 8557 backedges. 1220 proven. 3197 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2019-09-03 20:56:13,148 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:14,899 INFO L134 CoverageAnalysis]: Checked inductivity of 8557 backedges. 1220 proven. 3197 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2019-09-03 20:56:14,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:14,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 54 [2019-09-03 20:56:14,904 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:14,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-03 20:56:14,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-03 20:56:14,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1235, Invalid=1627, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 20:56:14,905 INFO L87 Difference]: Start difference. First operand 384 states and 385 transitions. Second operand 54 states. [2019-09-03 20:56:15,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:15,532 INFO L93 Difference]: Finished difference Result 395 states and 397 transitions. [2019-09-03 20:56:15,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-03 20:56:15,532 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 381 [2019-09-03 20:56:15,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:15,534 INFO L225 Difference]: With dead ends: 395 [2019-09-03 20:56:15,535 INFO L226 Difference]: Without dead ends: 395 [2019-09-03 20:56:15,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 860 GetRequests, 713 SyntacticMatches, 94 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2445 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1241, Invalid=1729, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 20:56:15,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-09-03 20:56:15,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 391. [2019-09-03 20:56:15,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-09-03 20:56:15,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 392 transitions. [2019-09-03 20:56:15,540 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 392 transitions. Word has length 381 [2019-09-03 20:56:15,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:15,540 INFO L475 AbstractCegarLoop]: Abstraction has 391 states and 392 transitions. [2019-09-03 20:56:15,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-03 20:56:15,540 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 392 transitions. [2019-09-03 20:56:15,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-09-03 20:56:15,542 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:15,542 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:15,542 INFO L418 AbstractCegarLoop]: === Iteration 95 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:15,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:15,542 INFO L82 PathProgramCache]: Analyzing trace with hash -2095587654, now seen corresponding path program 93 times [2019-09-03 20:56:15,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:15,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:15,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:15,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:15,543 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:18,196 INFO L134 CoverageAnalysis]: Checked inductivity of 8883 backedges. 3431 proven. 1128 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2019-09-03 20:56:18,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:18,196 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:18,197 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:18,197 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:56:18,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:18,197 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:18,207 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:56:18,207 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:56:18,333 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:56:18,334 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:18,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 98 conjunts are in the unsatisfiable core [2019-09-03 20:56:18,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:18,418 INFO L134 CoverageAnalysis]: Checked inductivity of 8883 backedges. 3431 proven. 1128 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2019-09-03 20:56:18,418 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:21,019 INFO L134 CoverageAnalysis]: Checked inductivity of 8883 backedges. 3431 proven. 1128 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2019-09-03 20:56:21,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:21,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 99 [2019-09-03 20:56:21,023 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:21,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-09-03 20:56:21,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-09-03 20:56:21,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2451, Invalid=7251, Unknown=0, NotChecked=0, Total=9702 [2019-09-03 20:56:21,025 INFO L87 Difference]: Start difference. First operand 391 states and 392 transitions. Second operand 99 states. [2019-09-03 20:56:25,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:25,524 INFO L93 Difference]: Finished difference Result 535 states and 583 transitions. [2019-09-03 20:56:25,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-03 20:56:25,524 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 388 [2019-09-03 20:56:25,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:25,525 INFO L225 Difference]: With dead ends: 535 [2019-09-03 20:56:25,526 INFO L226 Difference]: Without dead ends: 392 [2019-09-03 20:56:25,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 923 GetRequests, 681 SyntacticMatches, 96 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7943 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=4999, Invalid=16757, Unknown=0, NotChecked=0, Total=21756 [2019-09-03 20:56:25,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-09-03 20:56:25,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2019-09-03 20:56:25,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-09-03 20:56:25,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 393 transitions. [2019-09-03 20:56:25,531 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 393 transitions. Word has length 388 [2019-09-03 20:56:25,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:25,532 INFO L475 AbstractCegarLoop]: Abstraction has 392 states and 393 transitions. [2019-09-03 20:56:25,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-09-03 20:56:25,532 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 393 transitions. [2019-09-03 20:56:25,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2019-09-03 20:56:25,533 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:25,534 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:25,534 INFO L418 AbstractCegarLoop]: === Iteration 96 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:25,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:25,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1877859253, now seen corresponding path program 94 times [2019-09-03 20:56:25,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:25,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:25,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:25,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:25,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:25,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:26,613 INFO L134 CoverageAnalysis]: Checked inductivity of 8931 backedges. 1270 proven. 3337 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2019-09-03 20:56:26,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:26,613 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:26,613 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:26,613 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:26,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:26,613 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:26,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:26,624 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:56:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:26,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 929 conjuncts, 102 conjunts are in the unsatisfiable core [2019-09-03 20:56:26,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:26,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:26,874 INFO L134 CoverageAnalysis]: Checked inductivity of 8931 backedges. 1270 proven. 3337 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2019-09-03 20:56:26,874 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:28,652 INFO L134 CoverageAnalysis]: Checked inductivity of 8931 backedges. 1270 proven. 3337 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2019-09-03 20:56:28,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:28,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 55 [2019-09-03 20:56:28,656 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:28,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-03 20:56:28,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-03 20:56:28,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1285, Invalid=1685, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 20:56:28,658 INFO L87 Difference]: Start difference. First operand 392 states and 393 transitions. Second operand 55 states. [2019-09-03 20:56:29,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:29,170 INFO L93 Difference]: Finished difference Result 403 states and 405 transitions. [2019-09-03 20:56:29,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-03 20:56:29,171 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 389 [2019-09-03 20:56:29,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:29,173 INFO L225 Difference]: With dead ends: 403 [2019-09-03 20:56:29,173 INFO L226 Difference]: Without dead ends: 403 [2019-09-03 20:56:29,174 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 878 GetRequests, 728 SyntacticMatches, 96 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2545 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1291, Invalid=1789, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 20:56:29,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2019-09-03 20:56:29,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 399. [2019-09-03 20:56:29,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-09-03 20:56:29,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 400 transitions. [2019-09-03 20:56:29,179 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 400 transitions. Word has length 389 [2019-09-03 20:56:29,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:29,179 INFO L475 AbstractCegarLoop]: Abstraction has 399 states and 400 transitions. [2019-09-03 20:56:29,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-03 20:56:29,179 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 400 transitions. [2019-09-03 20:56:29,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-09-03 20:56:29,181 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:29,181 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:29,181 INFO L418 AbstractCegarLoop]: === Iteration 97 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:29,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:29,181 INFO L82 PathProgramCache]: Analyzing trace with hash 603323992, now seen corresponding path program 95 times [2019-09-03 20:56:29,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:29,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:29,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:29,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:29,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:32,127 INFO L134 CoverageAnalysis]: Checked inductivity of 9264 backedges. 3576 proven. 1176 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2019-09-03 20:56:32,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:32,128 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:32,128 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:32,128 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:56:32,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:32,128 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:32,140 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:56:32,140 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:56:32,352 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2019-09-03 20:56:32,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:32,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 943 conjuncts, 100 conjunts are in the unsatisfiable core [2019-09-03 20:56:32,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:32,435 INFO L134 CoverageAnalysis]: Checked inductivity of 9264 backedges. 3576 proven. 1176 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2019-09-03 20:56:32,435 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:35,107 INFO L134 CoverageAnalysis]: Checked inductivity of 9264 backedges. 3576 proven. 1176 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2019-09-03 20:56:35,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:35,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 101 [2019-09-03 20:56:35,111 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:35,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-09-03 20:56:35,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-09-03 20:56:35,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2551, Invalid=7549, Unknown=0, NotChecked=0, Total=10100 [2019-09-03 20:56:35,113 INFO L87 Difference]: Start difference. First operand 399 states and 400 transitions. Second operand 101 states. [2019-09-03 20:56:39,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:39,796 INFO L93 Difference]: Finished difference Result 546 states and 595 transitions. [2019-09-03 20:56:39,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-03 20:56:39,797 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 396 [2019-09-03 20:56:39,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:39,798 INFO L225 Difference]: With dead ends: 546 [2019-09-03 20:56:39,798 INFO L226 Difference]: Without dead ends: 400 [2019-09-03 20:56:39,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 942 GetRequests, 695 SyntacticMatches, 98 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8280 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=5201, Invalid=17449, Unknown=0, NotChecked=0, Total=22650 [2019-09-03 20:56:39,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2019-09-03 20:56:39,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2019-09-03 20:56:39,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-03 20:56:39,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 401 transitions. [2019-09-03 20:56:39,804 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 401 transitions. Word has length 396 [2019-09-03 20:56:39,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:39,804 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 401 transitions. [2019-09-03 20:56:39,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-09-03 20:56:39,804 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 401 transitions. [2019-09-03 20:56:39,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2019-09-03 20:56:39,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:39,806 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:39,807 INFO L418 AbstractCegarLoop]: === Iteration 98 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:39,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:39,807 INFO L82 PathProgramCache]: Analyzing trace with hash 60695273, now seen corresponding path program 96 times [2019-09-03 20:56:39,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:39,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:39,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:39,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:39,808 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:39,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:40,902 INFO L134 CoverageAnalysis]: Checked inductivity of 9313 backedges. 1321 proven. 3480 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2019-09-03 20:56:40,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:40,902 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:40,903 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:40,903 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:56:40,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:40,903 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:40,913 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:56:40,913 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:56:41,043 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:56:41,043 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:41,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 948 conjuncts, 104 conjunts are in the unsatisfiable core [2019-09-03 20:56:41,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:41,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:41,176 INFO L134 CoverageAnalysis]: Checked inductivity of 9313 backedges. 1321 proven. 3480 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2019-09-03 20:56:41,176 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:43,027 INFO L134 CoverageAnalysis]: Checked inductivity of 9313 backedges. 1321 proven. 3480 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2019-09-03 20:56:43,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:43,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 56 [2019-09-03 20:56:43,032 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:43,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-03 20:56:43,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-03 20:56:43,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1336, Invalid=1744, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 20:56:43,033 INFO L87 Difference]: Start difference. First operand 400 states and 401 transitions. Second operand 56 states. [2019-09-03 20:56:43,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:43,630 INFO L93 Difference]: Finished difference Result 411 states and 413 transitions. [2019-09-03 20:56:43,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-03 20:56:43,630 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 397 [2019-09-03 20:56:43,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:43,632 INFO L225 Difference]: With dead ends: 411 [2019-09-03 20:56:43,632 INFO L226 Difference]: Without dead ends: 411 [2019-09-03 20:56:43,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 896 GetRequests, 743 SyntacticMatches, 98 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2647 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1342, Invalid=1850, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 20:56:43,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-09-03 20:56:43,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 407. [2019-09-03 20:56:43,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-09-03 20:56:43,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 408 transitions. [2019-09-03 20:56:43,636 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 408 transitions. Word has length 397 [2019-09-03 20:56:43,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:43,637 INFO L475 AbstractCegarLoop]: Abstraction has 407 states and 408 transitions. [2019-09-03 20:56:43,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-03 20:56:43,637 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 408 transitions. [2019-09-03 20:56:43,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2019-09-03 20:56:43,638 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:43,639 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 50, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:43,639 INFO L418 AbstractCegarLoop]: === Iteration 99 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:43,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:43,639 INFO L82 PathProgramCache]: Analyzing trace with hash 898232826, now seen corresponding path program 97 times [2019-09-03 20:56:43,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:43,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:43,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:43,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:43,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:43,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:46,515 INFO L134 CoverageAnalysis]: Checked inductivity of 9653 backedges. 3724 proven. 1225 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2019-09-03 20:56:46,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:46,516 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:46,516 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:46,516 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:56:46,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:46,516 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:46,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:46,528 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:56:46,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:46,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 962 conjuncts, 102 conjunts are in the unsatisfiable core [2019-09-03 20:56:46,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:46,738 INFO L134 CoverageAnalysis]: Checked inductivity of 9653 backedges. 3724 proven. 1225 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2019-09-03 20:56:46,738 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:49,546 INFO L134 CoverageAnalysis]: Checked inductivity of 9653 backedges. 3724 proven. 1225 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2019-09-03 20:56:49,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:49,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 103 [2019-09-03 20:56:49,550 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:49,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-09-03 20:56:49,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-09-03 20:56:49,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2653, Invalid=7853, Unknown=0, NotChecked=0, Total=10506 [2019-09-03 20:56:49,552 INFO L87 Difference]: Start difference. First operand 407 states and 408 transitions. Second operand 103 states. [2019-09-03 20:56:54,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:54,385 INFO L93 Difference]: Finished difference Result 557 states and 607 transitions. [2019-09-03 20:56:54,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-09-03 20:56:54,386 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 404 [2019-09-03 20:56:54,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:54,389 INFO L225 Difference]: With dead ends: 557 [2019-09-03 20:56:54,389 INFO L226 Difference]: Without dead ends: 408 [2019-09-03 20:56:54,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 961 GetRequests, 709 SyntacticMatches, 100 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8624 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=5407, Invalid=18155, Unknown=0, NotChecked=0, Total=23562 [2019-09-03 20:56:54,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-09-03 20:56:54,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2019-09-03 20:56:54,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-09-03 20:56:54,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 409 transitions. [2019-09-03 20:56:54,397 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 409 transitions. Word has length 404 [2019-09-03 20:56:54,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:54,397 INFO L475 AbstractCegarLoop]: Abstraction has 408 states and 409 transitions. [2019-09-03 20:56:54,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-09-03 20:56:54,397 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 409 transitions. [2019-09-03 20:56:54,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2019-09-03 20:56:54,399 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:54,400 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:54,400 INFO L418 AbstractCegarLoop]: === Iteration 100 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:54,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:54,400 INFO L82 PathProgramCache]: Analyzing trace with hash -2020543093, now seen corresponding path program 98 times [2019-09-03 20:56:54,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:54,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:54,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:54,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:54,401 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:54,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:55,540 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 1373 proven. 3626 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2019-09-03 20:56:55,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:55,540 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:55,540 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:55,540 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:56:55,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:55,540 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:55,550 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:56:55,550 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:56:55,771 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-09-03 20:56:55,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:55,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 967 conjuncts, 106 conjunts are in the unsatisfiable core [2019-09-03 20:56:55,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:55,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:56:55,903 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 1373 proven. 3626 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2019-09-03 20:56:55,903 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:57,834 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 1373 proven. 3626 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2019-09-03 20:56:57,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:57,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 57 [2019-09-03 20:56:57,839 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:57,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-03 20:56:57,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-03 20:56:57,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1388, Invalid=1804, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 20:56:57,840 INFO L87 Difference]: Start difference. First operand 408 states and 409 transitions. Second operand 57 states. [2019-09-03 20:56:58,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:58,509 INFO L93 Difference]: Finished difference Result 419 states and 421 transitions. [2019-09-03 20:56:58,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-03 20:56:58,510 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 405 [2019-09-03 20:56:58,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:58,512 INFO L225 Difference]: With dead ends: 419 [2019-09-03 20:56:58,513 INFO L226 Difference]: Without dead ends: 419 [2019-09-03 20:56:58,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 914 GetRequests, 758 SyntacticMatches, 100 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2751 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1394, Invalid=1912, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 20:56:58,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-09-03 20:56:58,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 415. [2019-09-03 20:56:58,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2019-09-03 20:56:58,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 416 transitions. [2019-09-03 20:56:58,518 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 416 transitions. Word has length 405 [2019-09-03 20:56:58,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:58,518 INFO L475 AbstractCegarLoop]: Abstraction has 415 states and 416 transitions. [2019-09-03 20:56:58,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-03 20:56:58,518 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 416 transitions. [2019-09-03 20:56:58,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-09-03 20:56:58,521 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:58,521 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:58,521 INFO L418 AbstractCegarLoop]: === Iteration 101 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:58,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:58,522 INFO L82 PathProgramCache]: Analyzing trace with hash 816137496, now seen corresponding path program 99 times [2019-09-03 20:56:58,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:58,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:58,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:58,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:58,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:01,521 INFO L134 CoverageAnalysis]: Checked inductivity of 10050 backedges. 3875 proven. 1275 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2019-09-03 20:57:01,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:01,522 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:01,522 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:01,522 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:57:01,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:01,522 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:01,532 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:57:01,532 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:57:01,666 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:57:01,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:01,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 981 conjuncts, 104 conjunts are in the unsatisfiable core [2019-09-03 20:57:01,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:01,759 INFO L134 CoverageAnalysis]: Checked inductivity of 10050 backedges. 3875 proven. 1275 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2019-09-03 20:57:01,759 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:04,683 INFO L134 CoverageAnalysis]: Checked inductivity of 10050 backedges. 3875 proven. 1275 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2019-09-03 20:57:04,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:04,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 105 [2019-09-03 20:57:04,690 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:04,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-09-03 20:57:04,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-09-03 20:57:04,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2757, Invalid=8163, Unknown=0, NotChecked=0, Total=10920 [2019-09-03 20:57:04,692 INFO L87 Difference]: Start difference. First operand 415 states and 416 transitions. Second operand 105 states. [2019-09-03 20:57:09,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:09,707 INFO L93 Difference]: Finished difference Result 568 states and 619 transitions. [2019-09-03 20:57:09,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-09-03 20:57:09,707 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 412 [2019-09-03 20:57:09,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:09,710 INFO L225 Difference]: With dead ends: 568 [2019-09-03 20:57:09,710 INFO L226 Difference]: Without dead ends: 416 [2019-09-03 20:57:09,712 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 980 GetRequests, 723 SyntacticMatches, 102 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8975 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=5617, Invalid=18875, Unknown=0, NotChecked=0, Total=24492 [2019-09-03 20:57:09,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2019-09-03 20:57:09,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2019-09-03 20:57:09,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-09-03 20:57:09,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 417 transitions. [2019-09-03 20:57:09,719 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 417 transitions. Word has length 412 [2019-09-03 20:57:09,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:09,719 INFO L475 AbstractCegarLoop]: Abstraction has 416 states and 417 transitions. [2019-09-03 20:57:09,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-09-03 20:57:09,719 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 417 transitions. [2019-09-03 20:57:09,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2019-09-03 20:57:09,722 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:09,722 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:09,722 INFO L418 AbstractCegarLoop]: === Iteration 102 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:09,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:09,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1404839849, now seen corresponding path program 100 times [2019-09-03 20:57:09,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:09,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:09,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:09,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:09,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:10,890 INFO L134 CoverageAnalysis]: Checked inductivity of 10101 backedges. 1426 proven. 3775 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2019-09-03 20:57:10,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:10,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:10,890 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:10,890 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:57:10,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:10,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:10,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:10,900 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:57:11,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:11,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 986 conjuncts, 108 conjunts are in the unsatisfiable core [2019-09-03 20:57:11,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:11,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:11,165 INFO L134 CoverageAnalysis]: Checked inductivity of 10101 backedges. 1426 proven. 3775 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2019-09-03 20:57:11,165 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:13,206 INFO L134 CoverageAnalysis]: Checked inductivity of 10101 backedges. 1426 proven. 3775 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2019-09-03 20:57:13,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:13,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 58 [2019-09-03 20:57:13,210 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:13,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-03 20:57:13,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-03 20:57:13,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1441, Invalid=1865, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 20:57:13,212 INFO L87 Difference]: Start difference. First operand 416 states and 417 transitions. Second operand 58 states. [2019-09-03 20:57:13,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:13,824 INFO L93 Difference]: Finished difference Result 427 states and 429 transitions. [2019-09-03 20:57:13,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-03 20:57:13,824 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 413 [2019-09-03 20:57:13,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:13,827 INFO L225 Difference]: With dead ends: 427 [2019-09-03 20:57:13,827 INFO L226 Difference]: Without dead ends: 427 [2019-09-03 20:57:13,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 932 GetRequests, 773 SyntacticMatches, 102 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2857 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1447, Invalid=1975, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 20:57:13,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-09-03 20:57:13,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 423. [2019-09-03 20:57:13,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-09-03 20:57:13,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 424 transitions. [2019-09-03 20:57:13,833 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 424 transitions. Word has length 413 [2019-09-03 20:57:13,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:13,834 INFO L475 AbstractCegarLoop]: Abstraction has 423 states and 424 transitions. [2019-09-03 20:57:13,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-03 20:57:13,834 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 424 transitions. [2019-09-03 20:57:13,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-09-03 20:57:13,836 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:13,837 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 52, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:13,837 INFO L418 AbstractCegarLoop]: === Iteration 103 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:13,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:13,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1790896838, now seen corresponding path program 101 times [2019-09-03 20:57:13,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:13,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:13,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:13,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:13,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:13,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:16,951 INFO L134 CoverageAnalysis]: Checked inductivity of 10455 backedges. 4029 proven. 1326 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2019-09-03 20:57:16,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:16,951 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:16,952 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:16,952 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:57:16,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:16,952 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:16,962 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:57:16,962 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:57:17,194 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-09-03 20:57:17,194 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:17,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 1000 conjuncts, 106 conjunts are in the unsatisfiable core [2019-09-03 20:57:17,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:17,287 INFO L134 CoverageAnalysis]: Checked inductivity of 10455 backedges. 4029 proven. 1326 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2019-09-03 20:57:17,287 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:20,365 INFO L134 CoverageAnalysis]: Checked inductivity of 10455 backedges. 4029 proven. 1326 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2019-09-03 20:57:20,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:20,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 107 [2019-09-03 20:57:20,369 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:20,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-09-03 20:57:20,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-09-03 20:57:20,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2863, Invalid=8479, Unknown=0, NotChecked=0, Total=11342 [2019-09-03 20:57:20,371 INFO L87 Difference]: Start difference. First operand 423 states and 424 transitions. Second operand 107 states. [2019-09-03 20:57:25,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:25,622 INFO L93 Difference]: Finished difference Result 579 states and 631 transitions. [2019-09-03 20:57:25,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-09-03 20:57:25,622 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 420 [2019-09-03 20:57:25,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:25,624 INFO L225 Difference]: With dead ends: 579 [2019-09-03 20:57:25,624 INFO L226 Difference]: Without dead ends: 424 [2019-09-03 20:57:25,627 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 999 GetRequests, 737 SyntacticMatches, 104 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9333 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=5831, Invalid=19609, Unknown=0, NotChecked=0, Total=25440 [2019-09-03 20:57:25,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-09-03 20:57:25,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2019-09-03 20:57:25,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2019-09-03 20:57:25,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 425 transitions. [2019-09-03 20:57:25,633 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 425 transitions. Word has length 420 [2019-09-03 20:57:25,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:25,634 INFO L475 AbstractCegarLoop]: Abstraction has 424 states and 425 transitions. [2019-09-03 20:57:25,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-09-03 20:57:25,634 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 425 transitions. [2019-09-03 20:57:25,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-09-03 20:57:25,636 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:25,636 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:25,637 INFO L418 AbstractCegarLoop]: === Iteration 104 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:25,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:25,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1491544373, now seen corresponding path program 102 times [2019-09-03 20:57:25,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:25,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:25,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:25,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:25,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:25,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:26,889 INFO L134 CoverageAnalysis]: Checked inductivity of 10507 backedges. 1480 proven. 3927 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2019-09-03 20:57:26,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:26,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:26,890 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:26,890 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:57:26,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:26,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:26,903 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:57:26,903 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:57:27,041 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:57:27,041 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:27,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 1005 conjuncts, 110 conjunts are in the unsatisfiable core [2019-09-03 20:57:27,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:27,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:27,188 INFO L134 CoverageAnalysis]: Checked inductivity of 10507 backedges. 1480 proven. 3927 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2019-09-03 20:57:27,188 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:29,280 INFO L134 CoverageAnalysis]: Checked inductivity of 10507 backedges. 1480 proven. 3927 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2019-09-03 20:57:29,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:29,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 59 [2019-09-03 20:57:29,284 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:29,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-03 20:57:29,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-03 20:57:29,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1495, Invalid=1927, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 20:57:29,285 INFO L87 Difference]: Start difference. First operand 424 states and 425 transitions. Second operand 59 states. [2019-09-03 20:57:30,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:30,008 INFO L93 Difference]: Finished difference Result 435 states and 437 transitions. [2019-09-03 20:57:30,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-03 20:57:30,009 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 421 [2019-09-03 20:57:30,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:30,011 INFO L225 Difference]: With dead ends: 435 [2019-09-03 20:57:30,011 INFO L226 Difference]: Without dead ends: 435 [2019-09-03 20:57:30,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 950 GetRequests, 788 SyntacticMatches, 104 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2965 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1501, Invalid=2039, Unknown=0, NotChecked=0, Total=3540 [2019-09-03 20:57:30,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-09-03 20:57:30,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 431. [2019-09-03 20:57:30,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-09-03 20:57:30,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 432 transitions. [2019-09-03 20:57:30,018 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 432 transitions. Word has length 421 [2019-09-03 20:57:30,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:30,018 INFO L475 AbstractCegarLoop]: Abstraction has 431 states and 432 transitions. [2019-09-03 20:57:30,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-03 20:57:30,018 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 432 transitions. [2019-09-03 20:57:30,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2019-09-03 20:57:30,020 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:30,021 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 53, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:30,021 INFO L418 AbstractCegarLoop]: === Iteration 105 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:30,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:30,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1141277736, now seen corresponding path program 103 times [2019-09-03 20:57:30,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:30,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:30,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:30,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:30,023 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:33,336 INFO L134 CoverageAnalysis]: Checked inductivity of 10868 backedges. 4186 proven. 1378 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2019-09-03 20:57:33,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:33,336 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:33,336 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:33,336 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:57:33,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:33,337 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:33,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:33,348 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:57:33,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:33,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 1019 conjuncts, 108 conjunts are in the unsatisfiable core [2019-09-03 20:57:33,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:33,586 INFO L134 CoverageAnalysis]: Checked inductivity of 10868 backedges. 4186 proven. 1378 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2019-09-03 20:57:33,587 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:36,709 INFO L134 CoverageAnalysis]: Checked inductivity of 10868 backedges. 4186 proven. 1378 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2019-09-03 20:57:36,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:36,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 109 [2019-09-03 20:57:36,713 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:36,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-09-03 20:57:36,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-09-03 20:57:36,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2971, Invalid=8801, Unknown=0, NotChecked=0, Total=11772 [2019-09-03 20:57:36,715 INFO L87 Difference]: Start difference. First operand 431 states and 432 transitions. Second operand 109 states. [2019-09-03 20:57:42,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:42,263 INFO L93 Difference]: Finished difference Result 590 states and 643 transitions. [2019-09-03 20:57:42,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-09-03 20:57:42,263 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 428 [2019-09-03 20:57:42,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:42,265 INFO L225 Difference]: With dead ends: 590 [2019-09-03 20:57:42,265 INFO L226 Difference]: Without dead ends: 432 [2019-09-03 20:57:42,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1018 GetRequests, 751 SyntacticMatches, 106 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9698 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=6049, Invalid=20357, Unknown=0, NotChecked=0, Total=26406 [2019-09-03 20:57:42,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-09-03 20:57:42,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2019-09-03 20:57:42,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-09-03 20:57:42,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 433 transitions. [2019-09-03 20:57:42,271 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 433 transitions. Word has length 428 [2019-09-03 20:57:42,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:42,271 INFO L475 AbstractCegarLoop]: Abstraction has 432 states and 433 transitions. [2019-09-03 20:57:42,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-09-03 20:57:42,272 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 433 transitions. [2019-09-03 20:57:42,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2019-09-03 20:57:42,273 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:42,273 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 53, 53, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:42,273 INFO L418 AbstractCegarLoop]: === Iteration 106 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:42,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:42,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1723655063, now seen corresponding path program 104 times [2019-09-03 20:57:42,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:42,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:42,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:42,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:42,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:42,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:43,564 INFO L134 CoverageAnalysis]: Checked inductivity of 10921 backedges. 1535 proven. 4082 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2019-09-03 20:57:43,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:43,565 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:43,565 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:43,565 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:57:43,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:43,565 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:43,599 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:57:43,600 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:57:43,876 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-09-03 20:57:43,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:43,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 1024 conjuncts, 112 conjunts are in the unsatisfiable core [2019-09-03 20:57:43,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:43,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:44,028 INFO L134 CoverageAnalysis]: Checked inductivity of 10921 backedges. 1535 proven. 4082 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2019-09-03 20:57:44,028 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:46,187 INFO L134 CoverageAnalysis]: Checked inductivity of 10921 backedges. 1535 proven. 4082 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2019-09-03 20:57:46,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:46,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 60 [2019-09-03 20:57:46,192 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:46,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-03 20:57:46,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-03 20:57:46,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1550, Invalid=1990, Unknown=0, NotChecked=0, Total=3540 [2019-09-03 20:57:46,194 INFO L87 Difference]: Start difference. First operand 432 states and 433 transitions. Second operand 60 states. [2019-09-03 20:57:46,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:46,834 INFO L93 Difference]: Finished difference Result 443 states and 445 transitions. [2019-09-03 20:57:46,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-03 20:57:46,834 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 429 [2019-09-03 20:57:46,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:46,836 INFO L225 Difference]: With dead ends: 443 [2019-09-03 20:57:46,836 INFO L226 Difference]: Without dead ends: 443 [2019-09-03 20:57:46,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 968 GetRequests, 803 SyntacticMatches, 106 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3075 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1556, Invalid=2104, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 20:57:46,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-09-03 20:57:46,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 439. [2019-09-03 20:57:46,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-09-03 20:57:46,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 440 transitions. [2019-09-03 20:57:46,842 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 440 transitions. Word has length 429 [2019-09-03 20:57:46,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:46,842 INFO L475 AbstractCegarLoop]: Abstraction has 439 states and 440 transitions. [2019-09-03 20:57:46,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-03 20:57:46,842 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 440 transitions. [2019-09-03 20:57:46,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2019-09-03 20:57:46,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:46,844 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:46,844 INFO L418 AbstractCegarLoop]: === Iteration 107 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:46,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:46,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1264498566, now seen corresponding path program 105 times [2019-09-03 20:57:46,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:46,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:46,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:46,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:46,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:50,213 INFO L134 CoverageAnalysis]: Checked inductivity of 11289 backedges. 4346 proven. 1431 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2019-09-03 20:57:50,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:50,213 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:50,213 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:50,213 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:50,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:50,213 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:50,223 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:57:50,223 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:57:50,369 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:57:50,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:50,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 110 conjunts are in the unsatisfiable core [2019-09-03 20:57:50,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:50,473 INFO L134 CoverageAnalysis]: Checked inductivity of 11289 backedges. 4346 proven. 1431 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2019-09-03 20:57:50,473 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:53,718 INFO L134 CoverageAnalysis]: Checked inductivity of 11289 backedges. 4346 proven. 1431 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2019-09-03 20:57:53,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:53,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 111 [2019-09-03 20:57:53,723 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:53,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-09-03 20:57:53,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-09-03 20:57:53,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=9129, Unknown=0, NotChecked=0, Total=12210 [2019-09-03 20:57:53,725 INFO L87 Difference]: Start difference. First operand 439 states and 440 transitions. Second operand 111 states. [2019-09-03 20:57:58,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:58,105 INFO L93 Difference]: Finished difference Result 601 states and 655 transitions. [2019-09-03 20:57:58,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-09-03 20:57:58,111 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 436 [2019-09-03 20:57:58,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:58,112 INFO L225 Difference]: With dead ends: 601 [2019-09-03 20:57:58,112 INFO L226 Difference]: Without dead ends: 440 [2019-09-03 20:57:58,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1037 GetRequests, 765 SyntacticMatches, 108 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10070 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=6271, Invalid=21119, Unknown=0, NotChecked=0, Total=27390 [2019-09-03 20:57:58,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2019-09-03 20:57:58,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2019-09-03 20:57:58,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-09-03 20:57:58,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 441 transitions. [2019-09-03 20:57:58,120 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 441 transitions. Word has length 436 [2019-09-03 20:57:58,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:58,120 INFO L475 AbstractCegarLoop]: Abstraction has 440 states and 441 transitions. [2019-09-03 20:57:58,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-09-03 20:57:58,120 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 441 transitions. [2019-09-03 20:57:58,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2019-09-03 20:57:58,123 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:58,123 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:58,123 INFO L418 AbstractCegarLoop]: === Iteration 108 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:58,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:58,124 INFO L82 PathProgramCache]: Analyzing trace with hash -116537333, now seen corresponding path program 106 times [2019-09-03 20:57:58,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:58,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:58,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:58,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:58,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:59,401 INFO L134 CoverageAnalysis]: Checked inductivity of 11343 backedges. 1591 proven. 4240 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2019-09-03 20:57:59,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:59,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:59,402 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:59,402 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:57:59,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:59,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:59,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:59,413 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:57:59,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:59,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 1043 conjuncts, 114 conjunts are in the unsatisfiable core [2019-09-03 20:57:59,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:59,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:59,697 INFO L134 CoverageAnalysis]: Checked inductivity of 11343 backedges. 1591 proven. 4240 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2019-09-03 20:57:59,697 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:01,940 INFO L134 CoverageAnalysis]: Checked inductivity of 11343 backedges. 1591 proven. 4240 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2019-09-03 20:58:01,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:01,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 61 [2019-09-03 20:58:01,944 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:01,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-03 20:58:01,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-03 20:58:01,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1606, Invalid=2054, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 20:58:01,945 INFO L87 Difference]: Start difference. First operand 440 states and 441 transitions. Second operand 61 states. [2019-09-03 20:58:02,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:02,680 INFO L93 Difference]: Finished difference Result 451 states and 453 transitions. [2019-09-03 20:58:02,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-03 20:58:02,680 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 437 [2019-09-03 20:58:02,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:02,681 INFO L225 Difference]: With dead ends: 451 [2019-09-03 20:58:02,682 INFO L226 Difference]: Without dead ends: 451 [2019-09-03 20:58:02,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 986 GetRequests, 818 SyntacticMatches, 108 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3187 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1612, Invalid=2170, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 20:58:02,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-09-03 20:58:02,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 447. [2019-09-03 20:58:02,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2019-09-03 20:58:02,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 448 transitions. [2019-09-03 20:58:02,686 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 448 transitions. Word has length 437 [2019-09-03 20:58:02,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:02,686 INFO L475 AbstractCegarLoop]: Abstraction has 447 states and 448 transitions. [2019-09-03 20:58:02,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-03 20:58:02,686 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 448 transitions. [2019-09-03 20:58:02,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2019-09-03 20:58:02,688 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:02,688 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:02,688 INFO L418 AbstractCegarLoop]: === Iteration 109 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:02,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:02,688 INFO L82 PathProgramCache]: Analyzing trace with hash 51290776, now seen corresponding path program 107 times [2019-09-03 20:58:02,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:02,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:02,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:02,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:02,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:06,114 INFO L134 CoverageAnalysis]: Checked inductivity of 11718 backedges. 4509 proven. 1485 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2019-09-03 20:58:06,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:06,115 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:06,115 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:06,115 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:58:06,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:06,115 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:06,126 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:58:06,126 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:58:06,374 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2019-09-03 20:58:06,374 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:06,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 1057 conjuncts, 112 conjunts are in the unsatisfiable core [2019-09-03 20:58:06,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:06,473 INFO L134 CoverageAnalysis]: Checked inductivity of 11718 backedges. 4509 proven. 1485 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2019-09-03 20:58:06,474 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:09,817 INFO L134 CoverageAnalysis]: Checked inductivity of 11718 backedges. 4509 proven. 1485 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2019-09-03 20:58:09,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:09,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113, 113, 113] total 113 [2019-09-03 20:58:09,822 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:09,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-09-03 20:58:09,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-09-03 20:58:09,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3193, Invalid=9463, Unknown=0, NotChecked=0, Total=12656 [2019-09-03 20:58:09,824 INFO L87 Difference]: Start difference. First operand 447 states and 448 transitions. Second operand 113 states. [2019-09-03 20:58:13,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:13,496 INFO L93 Difference]: Finished difference Result 612 states and 667 transitions. [2019-09-03 20:58:13,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-09-03 20:58:13,497 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 444 [2019-09-03 20:58:13,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:13,498 INFO L225 Difference]: With dead ends: 612 [2019-09-03 20:58:13,498 INFO L226 Difference]: Without dead ends: 448 [2019-09-03 20:58:13,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1056 GetRequests, 779 SyntacticMatches, 110 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10449 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=6497, Invalid=21895, Unknown=0, NotChecked=0, Total=28392 [2019-09-03 20:58:13,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2019-09-03 20:58:13,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 448. [2019-09-03 20:58:13,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-09-03 20:58:13,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 449 transitions. [2019-09-03 20:58:13,505 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 449 transitions. Word has length 444 [2019-09-03 20:58:13,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:13,505 INFO L475 AbstractCegarLoop]: Abstraction has 448 states and 449 transitions. [2019-09-03 20:58:13,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-09-03 20:58:13,505 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 449 transitions. [2019-09-03 20:58:13,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2019-09-03 20:58:13,507 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:13,507 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 55, 55, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:13,508 INFO L418 AbstractCegarLoop]: === Iteration 110 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:13,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:13,508 INFO L82 PathProgramCache]: Analyzing trace with hash 156172585, now seen corresponding path program 108 times [2019-09-03 20:58:13,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:13,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:13,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:13,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:13,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:13,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:14,868 INFO L134 CoverageAnalysis]: Checked inductivity of 11773 backedges. 1648 proven. 4401 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2019-09-03 20:58:14,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:14,868 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:14,869 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:14,869 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:58:14,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:14,869 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:14,878 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:58:14,878 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:58:15,040 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:58:15,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:15,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 1062 conjuncts, 116 conjunts are in the unsatisfiable core [2019-09-03 20:58:15,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:15,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:15,261 INFO L134 CoverageAnalysis]: Checked inductivity of 11773 backedges. 1648 proven. 4401 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2019-09-03 20:58:15,262 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:17,583 INFO L134 CoverageAnalysis]: Checked inductivity of 11773 backedges. 1648 proven. 4401 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2019-09-03 20:58:17,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:17,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 62 [2019-09-03 20:58:17,587 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:17,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-03 20:58:17,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-03 20:58:17,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1663, Invalid=2119, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 20:58:17,588 INFO L87 Difference]: Start difference. First operand 448 states and 449 transitions. Second operand 62 states. [2019-09-03 20:58:18,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:18,466 INFO L93 Difference]: Finished difference Result 459 states and 461 transitions. [2019-09-03 20:58:18,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-03 20:58:18,467 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 445 [2019-09-03 20:58:18,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:18,469 INFO L225 Difference]: With dead ends: 459 [2019-09-03 20:58:18,469 INFO L226 Difference]: Without dead ends: 459 [2019-09-03 20:58:18,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1004 GetRequests, 833 SyntacticMatches, 110 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3301 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1669, Invalid=2237, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 20:58:18,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-09-03 20:58:18,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 455. [2019-09-03 20:58:18,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-09-03 20:58:18,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 456 transitions. [2019-09-03 20:58:18,474 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 456 transitions. Word has length 445 [2019-09-03 20:58:18,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:18,474 INFO L475 AbstractCegarLoop]: Abstraction has 455 states and 456 transitions. [2019-09-03 20:58:18,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-03 20:58:18,475 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 456 transitions. [2019-09-03 20:58:18,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2019-09-03 20:58:18,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:18,476 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:18,477 INFO L418 AbstractCegarLoop]: === Iteration 111 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:18,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:18,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1492218950, now seen corresponding path program 109 times [2019-09-03 20:58:18,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:18,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:18,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:18,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:18,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:22,130 INFO L134 CoverageAnalysis]: Checked inductivity of 12155 backedges. 4675 proven. 1540 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2019-09-03 20:58:22,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:22,131 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:22,131 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:22,131 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:58:22,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:22,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 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:22,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:22,143 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:58:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:22,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 1076 conjuncts, 114 conjunts are in the unsatisfiable core [2019-09-03 20:58:22,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:22,397 INFO L134 CoverageAnalysis]: Checked inductivity of 12155 backedges. 4675 proven. 1540 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2019-09-03 20:58:22,398 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:25,916 INFO L134 CoverageAnalysis]: Checked inductivity of 12155 backedges. 4675 proven. 1540 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2019-09-03 20:58:25,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:25,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115, 115, 115] total 115 [2019-09-03 20:58:25,920 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:25,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-09-03 20:58:25,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-09-03 20:58:25,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3307, Invalid=9803, Unknown=0, NotChecked=0, Total=13110 [2019-09-03 20:58:25,922 INFO L87 Difference]: Start difference. First operand 455 states and 456 transitions. Second operand 115 states. [2019-09-03 20:58:30,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:30,525 INFO L93 Difference]: Finished difference Result 623 states and 679 transitions. [2019-09-03 20:58:30,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-09-03 20:58:30,526 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 452 [2019-09-03 20:58:30,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:30,528 INFO L225 Difference]: With dead ends: 623 [2019-09-03 20:58:30,528 INFO L226 Difference]: Without dead ends: 456 [2019-09-03 20:58:30,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1075 GetRequests, 793 SyntacticMatches, 112 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10835 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=6727, Invalid=22685, Unknown=0, NotChecked=0, Total=29412 [2019-09-03 20:58:30,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-09-03 20:58:30,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 456. [2019-09-03 20:58:30,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-09-03 20:58:30,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 457 transitions. [2019-09-03 20:58:30,536 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 457 transitions. Word has length 452 [2019-09-03 20:58:30,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:30,536 INFO L475 AbstractCegarLoop]: Abstraction has 456 states and 457 transitions. [2019-09-03 20:58:30,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-09-03 20:58:30,536 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 457 transitions. [2019-09-03 20:58:30,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2019-09-03 20:58:30,538 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:30,538 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 56, 56, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:30,538 INFO L418 AbstractCegarLoop]: === Iteration 112 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:30,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:30,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1999386293, now seen corresponding path program 110 times [2019-09-03 20:58:30,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:30,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:30,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:30,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:30,540 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:30,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:32,143 INFO L134 CoverageAnalysis]: Checked inductivity of 12211 backedges. 1706 proven. 4565 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2019-09-03 20:58:32,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:32,143 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:32,143 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:32,143 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:58:32,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:32,143 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:32,154 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:58:32,154 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:58:32,426 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2019-09-03 20:58:32,427 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:32,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 1081 conjuncts, 118 conjunts are in the unsatisfiable core [2019-09-03 20:58:32,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:32,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:32,582 INFO L134 CoverageAnalysis]: Checked inductivity of 12211 backedges. 1706 proven. 4565 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2019-09-03 20:58:32,582 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:34,930 INFO L134 CoverageAnalysis]: Checked inductivity of 12211 backedges. 1706 proven. 4565 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2019-09-03 20:58:34,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:34,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 63 [2019-09-03 20:58:34,958 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:34,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-03 20:58:34,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-03 20:58:34,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1721, Invalid=2185, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 20:58:34,959 INFO L87 Difference]: Start difference. First operand 456 states and 457 transitions. Second operand 63 states. [2019-09-03 20:58:35,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:35,744 INFO L93 Difference]: Finished difference Result 467 states and 469 transitions. [2019-09-03 20:58:35,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-03 20:58:35,744 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 453 [2019-09-03 20:58:35,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:35,746 INFO L225 Difference]: With dead ends: 467 [2019-09-03 20:58:35,746 INFO L226 Difference]: Without dead ends: 467 [2019-09-03 20:58:35,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1022 GetRequests, 848 SyntacticMatches, 112 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3417 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1727, Invalid=2305, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 20:58:35,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-09-03 20:58:35,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 463. [2019-09-03 20:58:35,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-09-03 20:58:35,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 464 transitions. [2019-09-03 20:58:35,751 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 464 transitions. Word has length 453 [2019-09-03 20:58:35,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:35,752 INFO L475 AbstractCegarLoop]: Abstraction has 463 states and 464 transitions. [2019-09-03 20:58:35,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-03 20:58:35,752 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 464 transitions. [2019-09-03 20:58:35,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2019-09-03 20:58:35,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:35,754 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:35,754 INFO L418 AbstractCegarLoop]: === Iteration 113 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:35,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:35,754 INFO L82 PathProgramCache]: Analyzing trace with hash 570472792, now seen corresponding path program 111 times [2019-09-03 20:58:35,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:35,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:35,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:35,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:35,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:35,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:39,437 INFO L134 CoverageAnalysis]: Checked inductivity of 12600 backedges. 4844 proven. 1596 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2019-09-03 20:58:39,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:39,437 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:39,437 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:39,437 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:58:39,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:39,438 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:39,447 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:58:39,447 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:58:39,607 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:58:39,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:39,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 1095 conjuncts, 116 conjunts are in the unsatisfiable core [2019-09-03 20:58:39,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:39,742 INFO L134 CoverageAnalysis]: Checked inductivity of 12600 backedges. 4844 proven. 1596 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2019-09-03 20:58:39,742 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:43,373 INFO L134 CoverageAnalysis]: Checked inductivity of 12600 backedges. 4844 proven. 1596 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2019-09-03 20:58:43,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:43,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117, 117, 117] total 117 [2019-09-03 20:58:43,378 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:43,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-09-03 20:58:43,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-09-03 20:58:43,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3423, Invalid=10149, Unknown=0, NotChecked=0, Total=13572 [2019-09-03 20:58:43,380 INFO L87 Difference]: Start difference. First operand 463 states and 464 transitions. Second operand 117 states. [2019-09-03 20:58:48,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:48,289 INFO L93 Difference]: Finished difference Result 634 states and 691 transitions. [2019-09-03 20:58:48,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-09-03 20:58:48,289 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 460 [2019-09-03 20:58:48,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:48,290 INFO L225 Difference]: With dead ends: 634 [2019-09-03 20:58:48,291 INFO L226 Difference]: Without dead ends: 464 [2019-09-03 20:58:48,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1094 GetRequests, 807 SyntacticMatches, 114 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11228 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=6961, Invalid=23489, Unknown=0, NotChecked=0, Total=30450 [2019-09-03 20:58:48,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-09-03 20:58:48,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2019-09-03 20:58:48,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-09-03 20:58:48,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 465 transitions. [2019-09-03 20:58:48,297 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 465 transitions. Word has length 460 [2019-09-03 20:58:48,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:48,297 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 465 transitions. [2019-09-03 20:58:48,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-09-03 20:58:48,297 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 465 transitions. [2019-09-03 20:58:48,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2019-09-03 20:58:48,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:48,299 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 57, 57, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:48,299 INFO L418 AbstractCegarLoop]: === Iteration 114 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:48,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:48,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1208232471, now seen corresponding path program 112 times [2019-09-03 20:58:48,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:48,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:48,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:48,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:48,301 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:49,829 INFO L134 CoverageAnalysis]: Checked inductivity of 12657 backedges. 1765 proven. 4732 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2019-09-03 20:58:49,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:49,829 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:49,829 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:49,829 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:58:49,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:49,829 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:49,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:49,839 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:58:49,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:49,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 1100 conjuncts, 120 conjunts are in the unsatisfiable core [2019-09-03 20:58:49,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:49,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:50,137 INFO L134 CoverageAnalysis]: Checked inductivity of 12657 backedges. 1765 proven. 4732 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2019-09-03 20:58:50,137 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:52,671 INFO L134 CoverageAnalysis]: Checked inductivity of 12657 backedges. 1765 proven. 4732 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2019-09-03 20:58:52,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:52,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 64 [2019-09-03 20:58:52,675 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:52,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-03 20:58:52,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-03 20:58:52,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1780, Invalid=2252, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 20:58:52,676 INFO L87 Difference]: Start difference. First operand 464 states and 465 transitions. Second operand 64 states. [2019-09-03 20:58:53,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:53,517 INFO L93 Difference]: Finished difference Result 475 states and 477 transitions. [2019-09-03 20:58:53,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-03 20:58:53,517 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 461 [2019-09-03 20:58:53,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:53,519 INFO L225 Difference]: With dead ends: 475 [2019-09-03 20:58:53,519 INFO L226 Difference]: Without dead ends: 475 [2019-09-03 20:58:53,519 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1040 GetRequests, 863 SyntacticMatches, 114 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3535 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1786, Invalid=2374, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 20:58:53,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2019-09-03 20:58:53,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 471. [2019-09-03 20:58:53,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-09-03 20:58:53,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 472 transitions. [2019-09-03 20:58:53,524 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 472 transitions. Word has length 461 [2019-09-03 20:58:53,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:53,525 INFO L475 AbstractCegarLoop]: Abstraction has 471 states and 472 transitions. [2019-09-03 20:58:53,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-03 20:58:53,525 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 472 transitions. [2019-09-03 20:58:53,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2019-09-03 20:58:53,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:53,527 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 58, 57, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:53,527 INFO L418 AbstractCegarLoop]: === Iteration 115 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:53,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:53,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1058218246, now seen corresponding path program 113 times [2019-09-03 20:58:53,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:53,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:53,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:53,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:53,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:53,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:57,420 INFO L134 CoverageAnalysis]: Checked inductivity of 13053 backedges. 5016 proven. 1653 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2019-09-03 20:58:57,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:57,420 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:57,420 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:57,421 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:58:57,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:57,421 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:57,431 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:58:57,431 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:58:57,734 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2019-09-03 20:58:57,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:57,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 1114 conjuncts, 118 conjunts are in the unsatisfiable core [2019-09-03 20:58:57,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:57,848 INFO L134 CoverageAnalysis]: Checked inductivity of 13053 backedges. 5016 proven. 1653 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2019-09-03 20:58:57,849 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:01,644 INFO L134 CoverageAnalysis]: Checked inductivity of 13053 backedges. 5016 proven. 1653 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2019-09-03 20:59:01,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:01,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119, 119, 119] total 119 [2019-09-03 20:59:01,649 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:01,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-09-03 20:59:01,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-09-03 20:59:01,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3541, Invalid=10501, Unknown=0, NotChecked=0, Total=14042 [2019-09-03 20:59:01,651 INFO L87 Difference]: Start difference. First operand 471 states and 472 transitions. Second operand 119 states. [2019-09-03 20:59:06,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:06,568 INFO L93 Difference]: Finished difference Result 645 states and 703 transitions. [2019-09-03 20:59:06,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-09-03 20:59:06,568 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 468 [2019-09-03 20:59:06,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:06,569 INFO L225 Difference]: With dead ends: 645 [2019-09-03 20:59:06,569 INFO L226 Difference]: Without dead ends: 472 [2019-09-03 20:59:06,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1113 GetRequests, 821 SyntacticMatches, 116 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11628 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=7199, Invalid=24307, Unknown=0, NotChecked=0, Total=31506 [2019-09-03 20:59:06,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-09-03 20:59:06,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2019-09-03 20:59:06,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-09-03 20:59:06,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 473 transitions. [2019-09-03 20:59:06,577 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 473 transitions. Word has length 468 [2019-09-03 20:59:06,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:06,577 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 473 transitions. [2019-09-03 20:59:06,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-09-03 20:59:06,578 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 473 transitions. [2019-09-03 20:59:06,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2019-09-03 20:59:06,580 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:06,580 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 58, 58, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:06,580 INFO L418 AbstractCegarLoop]: === Iteration 116 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:06,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:06,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1563501941, now seen corresponding path program 114 times [2019-09-03 20:59:06,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:06,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:06,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:59:06,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:06,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:08,050 INFO L134 CoverageAnalysis]: Checked inductivity of 13111 backedges. 1825 proven. 4902 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2019-09-03 20:59:08,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:08,050 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:08,050 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:08,050 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:59:08,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:08,051 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:08,061 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:59:08,061 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:59:08,209 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:59:08,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:59:08,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 1119 conjuncts, 122 conjunts are in the unsatisfiable core [2019-09-03 20:59:08,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:08,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:08,417 INFO L134 CoverageAnalysis]: Checked inductivity of 13111 backedges. 1825 proven. 4902 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2019-09-03 20:59:08,417 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:10,953 INFO L134 CoverageAnalysis]: Checked inductivity of 13111 backedges. 1825 proven. 4902 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2019-09-03 20:59:10,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:10,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 65 [2019-09-03 20:59:10,958 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:10,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-03 20:59:10,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-03 20:59:10,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1840, Invalid=2320, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 20:59:10,959 INFO L87 Difference]: Start difference. First operand 472 states and 473 transitions. Second operand 65 states. [2019-09-03 20:59:11,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:11,825 INFO L93 Difference]: Finished difference Result 483 states and 485 transitions. [2019-09-03 20:59:11,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-03 20:59:11,826 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 469 [2019-09-03 20:59:11,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:11,828 INFO L225 Difference]: With dead ends: 483 [2019-09-03 20:59:11,828 INFO L226 Difference]: Without dead ends: 483 [2019-09-03 20:59:11,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1058 GetRequests, 878 SyntacticMatches, 116 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3655 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1846, Invalid=2444, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 20:59:11,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-09-03 20:59:11,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 479. [2019-09-03 20:59:11,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2019-09-03 20:59:11,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 480 transitions. [2019-09-03 20:59:11,833 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 480 transitions. Word has length 469 [2019-09-03 20:59:11,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:11,833 INFO L475 AbstractCegarLoop]: Abstraction has 479 states and 480 transitions. [2019-09-03 20:59:11,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-03 20:59:11,833 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 480 transitions. [2019-09-03 20:59:11,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2019-09-03 20:59:11,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:11,835 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 59, 58, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:11,836 INFO L418 AbstractCegarLoop]: === Iteration 117 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:11,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:11,836 INFO L82 PathProgramCache]: Analyzing trace with hash -739524584, now seen corresponding path program 115 times [2019-09-03 20:59:11,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:11,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:11,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:59:11,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:11,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:15,827 INFO L134 CoverageAnalysis]: Checked inductivity of 13514 backedges. 5191 proven. 1711 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2019-09-03 20:59:15,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:15,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:15,828 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:15,828 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:59:15,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:15,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:15,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:15,839 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:59:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:15,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 1133 conjuncts, 120 conjunts are in the unsatisfiable core [2019-09-03 20:59:15,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:16,107 INFO L134 CoverageAnalysis]: Checked inductivity of 13514 backedges. 5191 proven. 1711 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2019-09-03 20:59:16,107 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:20,045 INFO L134 CoverageAnalysis]: Checked inductivity of 13514 backedges. 5191 proven. 1711 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2019-09-03 20:59:20,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:20,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121, 121, 121] total 121 [2019-09-03 20:59:20,049 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:20,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 121 states [2019-09-03 20:59:20,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2019-09-03 20:59:20,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3661, Invalid=10859, Unknown=0, NotChecked=0, Total=14520 [2019-09-03 20:59:20,051 INFO L87 Difference]: Start difference. First operand 479 states and 480 transitions. Second operand 121 states. [2019-09-03 20:59:25,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:25,315 INFO L93 Difference]: Finished difference Result 656 states and 715 transitions. [2019-09-03 20:59:25,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-09-03 20:59:25,315 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 476 [2019-09-03 20:59:25,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:25,317 INFO L225 Difference]: With dead ends: 656 [2019-09-03 20:59:25,317 INFO L226 Difference]: Without dead ends: 480 [2019-09-03 20:59:25,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1132 GetRequests, 835 SyntacticMatches, 118 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12035 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=7441, Invalid=25139, Unknown=0, NotChecked=0, Total=32580 [2019-09-03 20:59:25,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-09-03 20:59:25,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2019-09-03 20:59:25,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-09-03 20:59:25,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 481 transitions. [2019-09-03 20:59:25,325 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 481 transitions. Word has length 476 [2019-09-03 20:59:25,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:25,326 INFO L475 AbstractCegarLoop]: Abstraction has 480 states and 481 transitions. [2019-09-03 20:59:25,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 121 states. [2019-09-03 20:59:25,326 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 481 transitions. [2019-09-03 20:59:25,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2019-09-03 20:59:25,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:25,329 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 59, 59, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:25,329 INFO L418 AbstractCegarLoop]: === Iteration 118 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:25,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:25,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1483053737, now seen corresponding path program 116 times [2019-09-03 20:59:25,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:25,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:25,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:25,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:25,330 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:26,895 INFO L134 CoverageAnalysis]: Checked inductivity of 13573 backedges. 1886 proven. 5075 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2019-09-03 20:59:26,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:26,895 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:26,895 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:26,896 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:59:26,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:26,896 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:26,907 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:59:26,907 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:59:27,232 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 59 check-sat command(s) [2019-09-03 20:59:27,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:59:27,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 1138 conjuncts, 124 conjunts are in the unsatisfiable core [2019-09-03 20:59:27,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:27,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:27,402 INFO L134 CoverageAnalysis]: Checked inductivity of 13573 backedges. 1886 proven. 5075 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2019-09-03 20:59:27,403 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:30,025 INFO L134 CoverageAnalysis]: Checked inductivity of 13573 backedges. 1886 proven. 5075 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2019-09-03 20:59:30,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:30,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 66 [2019-09-03 20:59:30,030 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:30,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-03 20:59:30,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-03 20:59:30,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1901, Invalid=2389, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 20:59:30,031 INFO L87 Difference]: Start difference. First operand 480 states and 481 transitions. Second operand 66 states. [2019-09-03 20:59:30,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:30,904 INFO L93 Difference]: Finished difference Result 491 states and 493 transitions. [2019-09-03 20:59:30,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-03 20:59:30,905 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 477 [2019-09-03 20:59:30,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:30,907 INFO L225 Difference]: With dead ends: 491 [2019-09-03 20:59:30,907 INFO L226 Difference]: Without dead ends: 491 [2019-09-03 20:59:30,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1076 GetRequests, 893 SyntacticMatches, 118 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3777 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1907, Invalid=2515, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 20:59:30,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2019-09-03 20:59:30,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 487. [2019-09-03 20:59:30,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-09-03 20:59:30,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 488 transitions. [2019-09-03 20:59:30,913 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 488 transitions. Word has length 477 [2019-09-03 20:59:30,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:30,914 INFO L475 AbstractCegarLoop]: Abstraction has 487 states and 488 transitions. [2019-09-03 20:59:30,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-03 20:59:30,914 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 488 transitions. [2019-09-03 20:59:30,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2019-09-03 20:59:30,916 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:30,916 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:30,916 INFO L418 AbstractCegarLoop]: === Iteration 119 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:30,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:30,917 INFO L82 PathProgramCache]: Analyzing trace with hash -677363142, now seen corresponding path program 117 times [2019-09-03 20:59:30,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:30,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:30,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:59:30,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:30,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:35,028 INFO L134 CoverageAnalysis]: Checked inductivity of 13983 backedges. 5369 proven. 1770 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2019-09-03 20:59:35,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:35,028 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:35,029 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:35,029 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:59:35,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:35,029 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:35,038 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:59:35,038 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:59:35,201 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:59:35,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:59:35,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 1152 conjuncts, 122 conjunts are in the unsatisfiable core [2019-09-03 20:59:35,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:35,326 INFO L134 CoverageAnalysis]: Checked inductivity of 13983 backedges. 5369 proven. 1770 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2019-09-03 20:59:35,326 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:39,378 INFO L134 CoverageAnalysis]: Checked inductivity of 13983 backedges. 5369 proven. 1770 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2019-09-03 20:59:39,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:39,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123, 123, 123] total 123 [2019-09-03 20:59:39,382 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:39,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 123 states [2019-09-03 20:59:39,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2019-09-03 20:59:39,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3783, Invalid=11223, Unknown=0, NotChecked=0, Total=15006 [2019-09-03 20:59:39,385 INFO L87 Difference]: Start difference. First operand 487 states and 488 transitions. Second operand 123 states. [2019-09-03 20:59:44,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:44,706 INFO L93 Difference]: Finished difference Result 667 states and 727 transitions. [2019-09-03 20:59:44,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-09-03 20:59:44,707 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 484 [2019-09-03 20:59:44,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:44,708 INFO L225 Difference]: With dead ends: 667 [2019-09-03 20:59:44,708 INFO L226 Difference]: Without dead ends: 488 [2019-09-03 20:59:44,712 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1151 GetRequests, 849 SyntacticMatches, 120 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12449 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=7687, Invalid=25985, Unknown=0, NotChecked=0, Total=33672 [2019-09-03 20:59:44,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-09-03 20:59:44,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2019-09-03 20:59:44,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-09-03 20:59:44,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 489 transitions. [2019-09-03 20:59:44,719 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 489 transitions. Word has length 484 [2019-09-03 20:59:44,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:44,720 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 489 transitions. [2019-09-03 20:59:44,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 123 states. [2019-09-03 20:59:44,720 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 489 transitions. [2019-09-03 20:59:44,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2019-09-03 20:59:44,723 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:44,723 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:44,723 INFO L418 AbstractCegarLoop]: === Iteration 120 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:44,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:44,724 INFO L82 PathProgramCache]: Analyzing trace with hash 342031307, now seen corresponding path program 118 times [2019-09-03 20:59:44,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:44,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:44,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:59:44,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:44,725 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:44,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:46,504 INFO L134 CoverageAnalysis]: Checked inductivity of 14043 backedges. 1948 proven. 5251 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2019-09-03 20:59:46,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:46,505 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:46,505 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:46,505 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:59:46,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:46,505 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:46,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:46,516 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:59:46,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:46,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 1157 conjuncts, 126 conjunts are in the unsatisfiable core [2019-09-03 20:59:46,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:46,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:46,840 INFO L134 CoverageAnalysis]: Checked inductivity of 14043 backedges. 1948 proven. 5251 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2019-09-03 20:59:46,840 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:49,578 INFO L134 CoverageAnalysis]: Checked inductivity of 14043 backedges. 1948 proven. 5251 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2019-09-03 20:59:49,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:49,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 67 [2019-09-03 20:59:49,609 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:49,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-03 20:59:49,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-03 20:59:49,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1963, Invalid=2459, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 20:59:49,610 INFO L87 Difference]: Start difference. First operand 488 states and 489 transitions. Second operand 67 states. [2019-09-03 20:59:50,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:50,407 INFO L93 Difference]: Finished difference Result 499 states and 501 transitions. [2019-09-03 20:59:50,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-03 20:59:50,408 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 485 [2019-09-03 20:59:50,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:50,409 INFO L225 Difference]: With dead ends: 499 [2019-09-03 20:59:50,409 INFO L226 Difference]: Without dead ends: 499 [2019-09-03 20:59:50,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1094 GetRequests, 908 SyntacticMatches, 120 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3901 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1969, Invalid=2587, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 20:59:50,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-09-03 20:59:50,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 495. [2019-09-03 20:59:50,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-03 20:59:50,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 496 transitions. [2019-09-03 20:59:50,415 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 496 transitions. Word has length 485 [2019-09-03 20:59:50,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:50,415 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 496 transitions. [2019-09-03 20:59:50,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-03 20:59:50,416 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 496 transitions. [2019-09-03 20:59:50,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2019-09-03 20:59:50,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:50,418 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 61, 60, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:50,418 INFO L418 AbstractCegarLoop]: === Iteration 121 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:50,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:50,418 INFO L82 PathProgramCache]: Analyzing trace with hash 854308568, now seen corresponding path program 119 times [2019-09-03 20:59:50,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:50,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:50,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:50,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:50,419 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:50,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:54,710 INFO L134 CoverageAnalysis]: Checked inductivity of 14460 backedges. 5550 proven. 1830 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2019-09-03 20:59:54,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:54,711 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:54,711 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:54,711 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:59:54,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:54,711 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:59:54,729 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:59:54,729 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:55,055 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 61 check-sat command(s) [2019-09-03 20:59:55,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:59:55,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 1171 conjuncts, 124 conjunts are in the unsatisfiable core [2019-09-03 20:59:55,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:55,182 INFO L134 CoverageAnalysis]: Checked inductivity of 14460 backedges. 5550 proven. 1830 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2019-09-03 20:59:55,182 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:59,348 INFO L134 CoverageAnalysis]: Checked inductivity of 14460 backedges. 5550 proven. 1830 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2019-09-03 20:59:59,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:59,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125, 125, 125] total 125 [2019-09-03 20:59:59,353 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:59,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 125 states [2019-09-03 20:59:59,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2019-09-03 20:59:59,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3907, Invalid=11593, Unknown=0, NotChecked=0, Total=15500 [2019-09-03 20:59:59,355 INFO L87 Difference]: Start difference. First operand 495 states and 496 transitions. Second operand 125 states. [2019-09-03 21:00:02,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:02,983 INFO L93 Difference]: Finished difference Result 678 states and 739 transitions. [2019-09-03 21:00:02,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-09-03 21:00:02,983 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 492 [2019-09-03 21:00:02,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:02,985 INFO L225 Difference]: With dead ends: 678 [2019-09-03 21:00:02,985 INFO L226 Difference]: Without dead ends: 496 [2019-09-03 21:00:02,986 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1170 GetRequests, 863 SyntacticMatches, 122 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12870 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=7937, Invalid=26845, Unknown=0, NotChecked=0, Total=34782 [2019-09-03 21:00:02,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2019-09-03 21:00:02,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2019-09-03 21:00:02,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2019-09-03 21:00:02,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 497 transitions. [2019-09-03 21:00:02,992 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 497 transitions. Word has length 492 [2019-09-03 21:00:02,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:02,992 INFO L475 AbstractCegarLoop]: Abstraction has 496 states and 497 transitions. [2019-09-03 21:00:02,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 125 states. [2019-09-03 21:00:02,992 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 497 transitions. [2019-09-03 21:00:02,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2019-09-03 21:00:02,994 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:02,994 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 61, 61, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:02,994 INFO L418 AbstractCegarLoop]: === Iteration 122 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:02,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:02,995 INFO L82 PathProgramCache]: Analyzing trace with hash -56078487, now seen corresponding path program 120 times [2019-09-03 21:00:02,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:02,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:02,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:00:02,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:02,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:04,610 INFO L134 CoverageAnalysis]: Checked inductivity of 14521 backedges. 2011 proven. 5430 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2019-09-03 21:00:04,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:04,611 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:04,611 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:04,611 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:00:04,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:04,611 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:04,621 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:00:04,621 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:00:04,845 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:00:04,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:00:04,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 1176 conjuncts, 128 conjunts are in the unsatisfiable core [2019-09-03 21:00:04,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:04,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:05,189 INFO L134 CoverageAnalysis]: Checked inductivity of 14521 backedges. 2011 proven. 5430 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2019-09-03 21:00:05,189 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:08,062 INFO L134 CoverageAnalysis]: Checked inductivity of 14521 backedges. 2011 proven. 5430 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2019-09-03 21:00:08,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:08,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 68 [2019-09-03 21:00:08,066 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:08,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-03 21:00:08,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-03 21:00:08,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2026, Invalid=2530, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 21:00:08,068 INFO L87 Difference]: Start difference. First operand 496 states and 497 transitions. Second operand 68 states. [2019-09-03 21:00:08,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:08,984 INFO L93 Difference]: Finished difference Result 507 states and 509 transitions. [2019-09-03 21:00:08,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-03 21:00:08,985 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 493 [2019-09-03 21:00:08,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:08,987 INFO L225 Difference]: With dead ends: 507 [2019-09-03 21:00:08,987 INFO L226 Difference]: Without dead ends: 507 [2019-09-03 21:00:08,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1112 GetRequests, 923 SyntacticMatches, 122 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4027 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2032, Invalid=2660, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 21:00:08,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-09-03 21:00:08,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 503. [2019-09-03 21:00:08,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2019-09-03 21:00:08,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 504 transitions. [2019-09-03 21:00:08,992 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 504 transitions. Word has length 493 [2019-09-03 21:00:08,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:08,993 INFO L475 AbstractCegarLoop]: Abstraction has 503 states and 504 transitions. [2019-09-03 21:00:08,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-03 21:00:08,993 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 504 transitions. [2019-09-03 21:00:08,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2019-09-03 21:00:08,996 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:08,996 INFO L399 BasicCegarLoop]: trace histogram [62, 62, 62, 61, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:08,996 INFO L418 AbstractCegarLoop]: === Iteration 123 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:08,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:08,997 INFO L82 PathProgramCache]: Analyzing trace with hash -2121484934, now seen corresponding path program 121 times [2019-09-03 21:00:08,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:08,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:08,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:00:08,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:08,998 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:13,542 INFO L134 CoverageAnalysis]: Checked inductivity of 14945 backedges. 5734 proven. 1891 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2019-09-03 21:00:13,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:13,543 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:13,543 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:13,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:00:13,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:13,543 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:13,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:00:13,554 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:00:13,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:13,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 1190 conjuncts, 126 conjunts are in the unsatisfiable core [2019-09-03 21:00:13,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:13,869 INFO L134 CoverageAnalysis]: Checked inductivity of 14945 backedges. 5734 proven. 1891 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2019-09-03 21:00:13,870 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:18,149 INFO L134 CoverageAnalysis]: Checked inductivity of 14945 backedges. 5734 proven. 1891 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2019-09-03 21:00:18,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:18,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127, 127, 127] total 127 [2019-09-03 21:00:18,154 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:18,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-09-03 21:00:18,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-09-03 21:00:18,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4033, Invalid=11969, Unknown=0, NotChecked=0, Total=16002 [2019-09-03 21:00:18,156 INFO L87 Difference]: Start difference. First operand 503 states and 504 transitions. Second operand 127 states. [2019-09-03 21:00:25,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:25,927 INFO L93 Difference]: Finished difference Result 689 states and 751 transitions. [2019-09-03 21:00:25,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2019-09-03 21:00:25,928 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 500 [2019-09-03 21:00:25,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:25,930 INFO L225 Difference]: With dead ends: 689 [2019-09-03 21:00:25,930 INFO L226 Difference]: Without dead ends: 504 [2019-09-03 21:00:25,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1189 GetRequests, 877 SyntacticMatches, 124 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13298 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=8191, Invalid=27719, Unknown=0, NotChecked=0, Total=35910 [2019-09-03 21:00:25,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-09-03 21:00:25,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2019-09-03 21:00:25,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-09-03 21:00:25,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 505 transitions. [2019-09-03 21:00:25,938 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 505 transitions. Word has length 500 [2019-09-03 21:00:25,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:25,938 INFO L475 AbstractCegarLoop]: Abstraction has 504 states and 505 transitions. [2019-09-03 21:00:25,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 127 states. [2019-09-03 21:00:25,938 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 505 transitions. [2019-09-03 21:00:25,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2019-09-03 21:00:25,941 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:25,941 INFO L399 BasicCegarLoop]: trace histogram [62, 62, 62, 62, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:25,941 INFO L418 AbstractCegarLoop]: === Iteration 124 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:25,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:25,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1811164427, now seen corresponding path program 122 times [2019-09-03 21:00:25,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:25,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:25,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:00:25,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:25,943 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:26,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:27,691 INFO L134 CoverageAnalysis]: Checked inductivity of 15007 backedges. 2075 proven. 5612 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2019-09-03 21:00:27,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:27,692 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:27,692 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:27,692 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:00:27,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:27,692 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:27,702 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:00:27,702 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:00:28,024 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 62 check-sat command(s) [2019-09-03 21:00:28,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:00:28,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 1195 conjuncts, 130 conjunts are in the unsatisfiable core [2019-09-03 21:00:28,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:28,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:28,219 INFO L134 CoverageAnalysis]: Checked inductivity of 15007 backedges. 2075 proven. 5612 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2019-09-03 21:00:28,219 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:31,212 INFO L134 CoverageAnalysis]: Checked inductivity of 15007 backedges. 2075 proven. 5612 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2019-09-03 21:00:31,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:31,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 69 [2019-09-03 21:00:31,217 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:31,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-03 21:00:31,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-03 21:00:31,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2090, Invalid=2602, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 21:00:31,218 INFO L87 Difference]: Start difference. First operand 504 states and 505 transitions. Second operand 69 states. [2019-09-03 21:00:32,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:32,060 INFO L93 Difference]: Finished difference Result 515 states and 517 transitions. [2019-09-03 21:00:32,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-03 21:00:32,060 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 501 [2019-09-03 21:00:32,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:32,062 INFO L225 Difference]: With dead ends: 515 [2019-09-03 21:00:32,062 INFO L226 Difference]: Without dead ends: 515 [2019-09-03 21:00:32,062 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1130 GetRequests, 938 SyntacticMatches, 124 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4155 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=2096, Invalid=2734, Unknown=0, NotChecked=0, Total=4830 [2019-09-03 21:00:32,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2019-09-03 21:00:32,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 511. [2019-09-03 21:00:32,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2019-09-03 21:00:32,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 512 transitions. [2019-09-03 21:00:32,067 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 512 transitions. Word has length 501 [2019-09-03 21:00:32,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:32,067 INFO L475 AbstractCegarLoop]: Abstraction has 511 states and 512 transitions. [2019-09-03 21:00:32,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-03 21:00:32,067 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 512 transitions. [2019-09-03 21:00:32,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2019-09-03 21:00:32,069 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:32,069 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 63, 62, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:32,070 INFO L418 AbstractCegarLoop]: === Iteration 125 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:32,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:32,070 INFO L82 PathProgramCache]: Analyzing trace with hash 2015141272, now seen corresponding path program 123 times [2019-09-03 21:00:32,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:32,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:32,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:00:32,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:32,071 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:32,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:36,540 INFO L134 CoverageAnalysis]: Checked inductivity of 15438 backedges. 5921 proven. 1953 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2019-09-03 21:00:36,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:36,540 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:36,540 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:36,540 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:00:36,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:36,541 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:36,551 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:00:36,551 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:00:36,716 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:00:36,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:00:36,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 1209 conjuncts, 128 conjunts are in the unsatisfiable core [2019-09-03 21:00:36,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:36,850 INFO L134 CoverageAnalysis]: Checked inductivity of 15438 backedges. 5921 proven. 1953 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2019-09-03 21:00:36,851 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:41,210 INFO L134 CoverageAnalysis]: Checked inductivity of 15438 backedges. 5921 proven. 1953 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2019-09-03 21:00:41,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:41,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129, 129, 129] total 129 [2019-09-03 21:00:41,215 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:41,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 129 states [2019-09-03 21:00:41,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2019-09-03 21:00:41,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4161, Invalid=12351, Unknown=0, NotChecked=0, Total=16512 [2019-09-03 21:00:41,217 INFO L87 Difference]: Start difference. First operand 511 states and 512 transitions. Second operand 129 states. [2019-09-03 21:00:48,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:48,617 INFO L93 Difference]: Finished difference Result 700 states and 763 transitions. [2019-09-03 21:00:48,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2019-09-03 21:00:48,618 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 508 [2019-09-03 21:00:48,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:48,619 INFO L225 Difference]: With dead ends: 700 [2019-09-03 21:00:48,619 INFO L226 Difference]: Without dead ends: 512 [2019-09-03 21:00:48,621 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1208 GetRequests, 891 SyntacticMatches, 126 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13733 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=8449, Invalid=28607, Unknown=0, NotChecked=0, Total=37056 [2019-09-03 21:00:48,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-09-03 21:00:48,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 512. [2019-09-03 21:00:48,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-09-03 21:00:48,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 513 transitions. [2019-09-03 21:00:48,627 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 513 transitions. Word has length 508 [2019-09-03 21:00:48,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:48,627 INFO L475 AbstractCegarLoop]: Abstraction has 512 states and 513 transitions. [2019-09-03 21:00:48,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 129 states. [2019-09-03 21:00:48,627 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 513 transitions. [2019-09-03 21:00:48,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2019-09-03 21:00:48,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:48,630 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 63, 63, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:48,631 INFO L418 AbstractCegarLoop]: === Iteration 126 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:48,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:48,631 INFO L82 PathProgramCache]: Analyzing trace with hash -706743255, now seen corresponding path program 124 times [2019-09-03 21:00:48,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:48,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:48,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:00:48,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:48,632 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:48,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:50,448 INFO L134 CoverageAnalysis]: Checked inductivity of 15501 backedges. 2140 proven. 5797 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2019-09-03 21:00:50,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:50,448 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:50,448 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:50,448 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:00:50,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:50,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 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:50,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:00:50,459 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:00:50,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:50,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 1214 conjuncts, 132 conjunts are in the unsatisfiable core [2019-09-03 21:00:50,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:50,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:50,835 INFO L134 CoverageAnalysis]: Checked inductivity of 15501 backedges. 2140 proven. 5797 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2019-09-03 21:00:50,835 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:53,900 INFO L134 CoverageAnalysis]: Checked inductivity of 15501 backedges. 2140 proven. 5797 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2019-09-03 21:00:53,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:53,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 70 [2019-09-03 21:00:53,904 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:53,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-03 21:00:53,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-03 21:00:53,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2155, Invalid=2675, Unknown=0, NotChecked=0, Total=4830 [2019-09-03 21:00:53,906 INFO L87 Difference]: Start difference. First operand 512 states and 513 transitions. Second operand 70 states. [2019-09-03 21:00:54,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:54,750 INFO L93 Difference]: Finished difference Result 523 states and 525 transitions. [2019-09-03 21:00:54,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-03 21:00:54,751 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 509 [2019-09-03 21:00:54,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:54,752 INFO L225 Difference]: With dead ends: 523 [2019-09-03 21:00:54,752 INFO L226 Difference]: Without dead ends: 523 [2019-09-03 21:00:54,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1148 GetRequests, 953 SyntacticMatches, 126 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4285 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=2161, Invalid=2809, Unknown=0, NotChecked=0, Total=4970 [2019-09-03 21:00:54,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2019-09-03 21:00:54,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 519. [2019-09-03 21:00:54,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2019-09-03 21:00:54,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 520 transitions. [2019-09-03 21:00:54,759 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 520 transitions. Word has length 509 [2019-09-03 21:00:54,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:54,759 INFO L475 AbstractCegarLoop]: Abstraction has 519 states and 520 transitions. [2019-09-03 21:00:54,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-03 21:00:54,760 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 520 transitions. [2019-09-03 21:00:54,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2019-09-03 21:00:54,762 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:54,762 INFO L399 BasicCegarLoop]: trace histogram [64, 64, 64, 63, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:54,762 INFO L418 AbstractCegarLoop]: === Iteration 127 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:54,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:54,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1444296890, now seen corresponding path program 125 times [2019-09-03 21:00:54,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:54,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:54,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:00:54,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:54,763 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:54,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:59,390 INFO L134 CoverageAnalysis]: Checked inductivity of 15939 backedges. 6111 proven. 2016 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2019-09-03 21:00:59,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:59,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:59,391 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:59,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:00:59,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:59,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 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:59,402 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:00:59,402 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:00:59,727 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2019-09-03 21:00:59,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:00:59,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 1228 conjuncts, 130 conjunts are in the unsatisfiable core [2019-09-03 21:00:59,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:59,862 INFO L134 CoverageAnalysis]: Checked inductivity of 15939 backedges. 6111 proven. 2016 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2019-09-03 21:00:59,863 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:01:04,512 INFO L134 CoverageAnalysis]: Checked inductivity of 15939 backedges. 6111 proven. 2016 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2019-09-03 21:01:04,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:01:04,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131, 131, 131] total 131 [2019-09-03 21:01:04,516 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:01:04,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-09-03 21:01:04,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-09-03 21:01:04,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4291, Invalid=12739, Unknown=0, NotChecked=0, Total=17030 [2019-09-03 21:01:04,518 INFO L87 Difference]: Start difference. First operand 519 states and 520 transitions. Second operand 131 states. [2019-09-03 21:01:10,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:01:10,561 INFO L93 Difference]: Finished difference Result 711 states and 775 transitions. [2019-09-03 21:01:10,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-09-03 21:01:10,562 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 516 [2019-09-03 21:01:10,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:01:10,563 INFO L225 Difference]: With dead ends: 711 [2019-09-03 21:01:10,564 INFO L226 Difference]: Without dead ends: 520 [2019-09-03 21:01:10,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1227 GetRequests, 905 SyntacticMatches, 128 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14175 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=8711, Invalid=29509, Unknown=0, NotChecked=0, Total=38220 [2019-09-03 21:01:10,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2019-09-03 21:01:10,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2019-09-03 21:01:10,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2019-09-03 21:01:10,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 521 transitions. [2019-09-03 21:01:10,574 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 521 transitions. Word has length 516 [2019-09-03 21:01:10,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:01:10,574 INFO L475 AbstractCegarLoop]: Abstraction has 520 states and 521 transitions. [2019-09-03 21:01:10,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-09-03 21:01:10,574 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 521 transitions. [2019-09-03 21:01:10,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2019-09-03 21:01:10,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:01:10,578 INFO L399 BasicCegarLoop]: trace histogram [64, 64, 64, 64, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:01:10,578 INFO L418 AbstractCegarLoop]: === Iteration 128 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:01:10,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:01:10,578 INFO L82 PathProgramCache]: Analyzing trace with hash 954625611, now seen corresponding path program 126 times [2019-09-03 21:01:10,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:01:10,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:10,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:01:10,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:10,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:01:10,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:12,437 INFO L134 CoverageAnalysis]: Checked inductivity of 16003 backedges. 2206 proven. 5985 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2019-09-03 21:01:12,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:12,437 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:01:12,437 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:01:12,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:01:12,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:12,438 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:01:12,449 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:01:12,449 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:01:12,622 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:01:12,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:01:12,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 1233 conjuncts, 139 conjunts are in the unsatisfiable core [2019-09-03 21:01:12,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:01:12,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:13,135 INFO L134 CoverageAnalysis]: Checked inductivity of 16003 backedges. 2205 proven. 6172 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2019-09-03 21:01:13,135 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:01:14,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:14,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:14,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:16,357 INFO L134 CoverageAnalysis]: Checked inductivity of 16003 backedges. 2141 proven. 6236 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2019-09-03 21:01:16,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:01:16,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 71, 71] total 74 [2019-09-03 21:01:16,362 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:01:16,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-03 21:01:16,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-03 21:01:16,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2231, Invalid=3171, Unknown=0, NotChecked=0, Total=5402 [2019-09-03 21:01:16,364 INFO L87 Difference]: Start difference. First operand 520 states and 521 transitions. Second operand 72 states. [2019-09-03 21:01:17,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:01:17,313 INFO L93 Difference]: Finished difference Result 527 states and 528 transitions. [2019-09-03 21:01:17,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-03 21:01:17,313 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 517 [2019-09-03 21:01:17,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:01:17,315 INFO L225 Difference]: With dead ends: 527 [2019-09-03 21:01:17,315 INFO L226 Difference]: Without dead ends: 527 [2019-09-03 21:01:17,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1167 GetRequests, 964 SyntacticMatches, 129 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4680 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=2246, Invalid=3454, Unknown=0, NotChecked=0, Total=5700 [2019-09-03 21:01:17,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-09-03 21:01:17,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2019-09-03 21:01:17,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2019-09-03 21:01:17,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 528 transitions. [2019-09-03 21:01:17,322 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 528 transitions. Word has length 517 [2019-09-03 21:01:17,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:01:17,323 INFO L475 AbstractCegarLoop]: Abstraction has 527 states and 528 transitions. [2019-09-03 21:01:17,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-03 21:01:17,323 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 528 transitions. [2019-09-03 21:01:17,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2019-09-03 21:01:17,326 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:01:17,326 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 65, 64, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:01:17,326 INFO L418 AbstractCegarLoop]: === Iteration 129 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:01:17,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:01:17,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1147505576, now seen corresponding path program 127 times [2019-09-03 21:01:17,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:01:17,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:17,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:01:17,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:17,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:01:17,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:22,266 INFO L134 CoverageAnalysis]: Checked inductivity of 16448 backedges. 6304 proven. 2080 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2019-09-03 21:01:22,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:22,267 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:01:22,267 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:01:22,267 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:01:22,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:22,267 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:01:22,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:01:22,278 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:01:22,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:22,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 1247 conjuncts, 132 conjunts are in the unsatisfiable core [2019-09-03 21:01:22,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:01:22,578 INFO L134 CoverageAnalysis]: Checked inductivity of 16448 backedges. 6304 proven. 2080 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2019-09-03 21:01:22,578 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:01:27,247 INFO L134 CoverageAnalysis]: Checked inductivity of 16448 backedges. 6304 proven. 2080 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2019-09-03 21:01:27,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:01:27,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133, 133, 133] total 133 [2019-09-03 21:01:27,252 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:01:27,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 133 states [2019-09-03 21:01:27,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2019-09-03 21:01:27,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4423, Invalid=13133, Unknown=0, NotChecked=0, Total=17556 [2019-09-03 21:01:27,255 INFO L87 Difference]: Start difference. First operand 527 states and 528 transitions. Second operand 133 states. [2019-09-03 21:01:35,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:01:35,665 INFO L93 Difference]: Finished difference Result 722 states and 787 transitions. [2019-09-03 21:01:35,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2019-09-03 21:01:35,665 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 524 [2019-09-03 21:01:35,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:01:35,667 INFO L225 Difference]: With dead ends: 722 [2019-09-03 21:01:35,667 INFO L226 Difference]: Without dead ends: 528 [2019-09-03 21:01:35,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1246 GetRequests, 919 SyntacticMatches, 130 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14624 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=8977, Invalid=30425, Unknown=0, NotChecked=0, Total=39402 [2019-09-03 21:01:35,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-09-03 21:01:35,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2019-09-03 21:01:35,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-09-03 21:01:35,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 529 transitions. [2019-09-03 21:01:35,677 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 529 transitions. Word has length 524 [2019-09-03 21:01:35,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:01:35,677 INFO L475 AbstractCegarLoop]: Abstraction has 528 states and 529 transitions. [2019-09-03 21:01:35,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 133 states. [2019-09-03 21:01:35,677 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 529 transitions. [2019-09-03 21:01:35,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2019-09-03 21:01:35,680 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:01:35,680 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 65, 65, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:01:35,681 INFO L418 AbstractCegarLoop]: === Iteration 130 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:01:35,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:01:35,681 INFO L82 PathProgramCache]: Analyzing trace with hash -198670103, now seen corresponding path program 128 times [2019-09-03 21:01:35,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:01:35,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:35,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:01:35,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:35,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:01:35,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:37,552 INFO L134 CoverageAnalysis]: Checked inductivity of 16513 backedges. 2273 proven. 6176 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2019-09-03 21:01:37,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:37,552 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:01:37,552 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:01:37,552 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:01:37,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:37,553 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:01:37,564 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:01:37,564 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:01:37,902 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 65 check-sat command(s) [2019-09-03 21:01:37,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:01:37,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 1252 conjuncts, 141 conjunts are in the unsatisfiable core [2019-09-03 21:01:37,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:01:38,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:38,191 INFO L134 CoverageAnalysis]: Checked inductivity of 16513 backedges. 2272 proven. 6366 refuted. 0 times theorem prover too weak. 7875 trivial. 0 not checked. [2019-09-03 21:01:38,191 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:01:39,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:39,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:41,581 INFO L134 CoverageAnalysis]: Checked inductivity of 16513 backedges. 2207 proven. 6431 refuted. 0 times theorem prover too weak. 7875 trivial. 0 not checked. [2019-09-03 21:01:41,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:01:41,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 72, 72] total 75 [2019-09-03 21:01:41,587 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:01:41,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-03 21:01:41,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-03 21:01:41,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2298, Invalid=3252, Unknown=0, NotChecked=0, Total=5550 [2019-09-03 21:01:41,588 INFO L87 Difference]: Start difference. First operand 528 states and 529 transitions. Second operand 73 states. [2019-09-03 21:01:42,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:01:42,362 INFO L93 Difference]: Finished difference Result 535 states and 536 transitions. [2019-09-03 21:01:42,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-03 21:01:42,362 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 525 [2019-09-03 21:01:42,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:01:42,364 INFO L225 Difference]: With dead ends: 535 [2019-09-03 21:01:42,364 INFO L226 Difference]: Without dead ends: 535 [2019-09-03 21:01:42,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1185 GetRequests, 979 SyntacticMatches, 131 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4818 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=2313, Invalid=3539, Unknown=0, NotChecked=0, Total=5852 [2019-09-03 21:01:42,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-03 21:01:42,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2019-09-03 21:01:42,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2019-09-03 21:01:42,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 536 transitions. [2019-09-03 21:01:42,369 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 536 transitions. Word has length 525 [2019-09-03 21:01:42,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:01:42,370 INFO L475 AbstractCegarLoop]: Abstraction has 535 states and 536 transitions. [2019-09-03 21:01:42,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-03 21:01:42,370 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 536 transitions. [2019-09-03 21:01:42,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2019-09-03 21:01:42,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:01:42,372 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 66, 65, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:01:42,372 INFO L418 AbstractCegarLoop]: === Iteration 131 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:01:42,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:01:42,373 INFO L82 PathProgramCache]: Analyzing trace with hash 765512698, now seen corresponding path program 129 times [2019-09-03 21:01:42,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:01:42,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:42,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:01:42,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:42,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:01:42,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:47,229 INFO L134 CoverageAnalysis]: Checked inductivity of 16965 backedges. 6500 proven. 2145 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2019-09-03 21:01:47,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:47,229 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:01:47,229 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:01:47,230 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:01:47,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:47,230 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:01:47,241 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:01:47,241 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:01:47,418 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:01:47,418 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:01:47,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 1266 conjuncts, 134 conjunts are in the unsatisfiable core [2019-09-03 21:01:47,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:01:47,686 INFO L134 CoverageAnalysis]: Checked inductivity of 16965 backedges. 6500 proven. 2145 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2019-09-03 21:01:47,687 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:01:52,850 INFO L134 CoverageAnalysis]: Checked inductivity of 16965 backedges. 6500 proven. 2145 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2019-09-03 21:01:52,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:01:52,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135, 135, 135] total 135 [2019-09-03 21:01:52,855 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:01:52,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 135 states [2019-09-03 21:01:52,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2019-09-03 21:01:52,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4557, Invalid=13533, Unknown=0, NotChecked=0, Total=18090 [2019-09-03 21:01:52,857 INFO L87 Difference]: Start difference. First operand 535 states and 536 transitions. Second operand 135 states. [2019-09-03 21:02:01,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:02:01,509 INFO L93 Difference]: Finished difference Result 733 states and 799 transitions. [2019-09-03 21:02:01,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-09-03 21:02:01,510 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 532 [2019-09-03 21:02:01,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:02:01,511 INFO L225 Difference]: With dead ends: 733 [2019-09-03 21:02:01,511 INFO L226 Difference]: Without dead ends: 536 [2019-09-03 21:02:01,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1265 GetRequests, 933 SyntacticMatches, 132 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15080 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=9247, Invalid=31355, Unknown=0, NotChecked=0, Total=40602 [2019-09-03 21:02:01,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-09-03 21:02:01,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2019-09-03 21:02:01,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-09-03 21:02:01,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 537 transitions. [2019-09-03 21:02:01,521 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 537 transitions. Word has length 532 [2019-09-03 21:02:01,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:02:01,521 INFO L475 AbstractCegarLoop]: Abstraction has 536 states and 537 transitions. [2019-09-03 21:02:01,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 135 states. [2019-09-03 21:02:01,521 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 537 transitions. [2019-09-03 21:02:01,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2019-09-03 21:02:01,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:02:01,525 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 66, 66, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:02:01,525 INFO L418 AbstractCegarLoop]: === Iteration 132 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:02:01,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:02:01,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1268629387, now seen corresponding path program 130 times [2019-09-03 21:02:01,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:02:01,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:01,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:02:01,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:01,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:02:01,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:03,521 INFO L134 CoverageAnalysis]: Checked inductivity of 17031 backedges. 2341 proven. 6370 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2019-09-03 21:02:03,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:03,522 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:02:03,522 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:02:03,522 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:02:03,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:03,522 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:02:03,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:02:03,532 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:02:03,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:03,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 1271 conjuncts, 143 conjunts are in the unsatisfiable core [2019-09-03 21:02:03,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:02:03,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:04,050 INFO L134 CoverageAnalysis]: Checked inductivity of 17031 backedges. 2340 proven. 6563 refuted. 0 times theorem prover too weak. 8128 trivial. 0 not checked. [2019-09-03 21:02:04,051 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:02:05,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:05,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:07,498 INFO L134 CoverageAnalysis]: Checked inductivity of 17031 backedges. 2274 proven. 6629 refuted. 0 times theorem prover too weak. 8128 trivial. 0 not checked. [2019-09-03 21:02:07,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:02:07,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 73, 73] total 76 [2019-09-03 21:02:07,502 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:02:07,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-03 21:02:07,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-03 21:02:07,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2366, Invalid=3334, Unknown=0, NotChecked=0, Total=5700 [2019-09-03 21:02:07,503 INFO L87 Difference]: Start difference. First operand 536 states and 537 transitions. Second operand 74 states. [2019-09-03 21:02:08,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:02:08,495 INFO L93 Difference]: Finished difference Result 543 states and 544 transitions. [2019-09-03 21:02:08,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-03 21:02:08,496 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 533 [2019-09-03 21:02:08,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:02:08,497 INFO L225 Difference]: With dead ends: 543 [2019-09-03 21:02:08,497 INFO L226 Difference]: Without dead ends: 543 [2019-09-03 21:02:08,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1203 GetRequests, 994 SyntacticMatches, 133 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4958 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=2381, Invalid=3625, Unknown=0, NotChecked=0, Total=6006 [2019-09-03 21:02:08,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-09-03 21:02:08,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 543. [2019-09-03 21:02:08,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-09-03 21:02:08,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 544 transitions. [2019-09-03 21:02:08,503 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 544 transitions. Word has length 533 [2019-09-03 21:02:08,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:02:08,504 INFO L475 AbstractCegarLoop]: Abstraction has 543 states and 544 transitions. [2019-09-03 21:02:08,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-03 21:02:08,504 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 544 transitions. [2019-09-03 21:02:08,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2019-09-03 21:02:08,506 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:02:08,506 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 67, 66, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:02:08,507 INFO L418 AbstractCegarLoop]: === Iteration 133 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:02:08,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:02:08,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1266599144, now seen corresponding path program 131 times [2019-09-03 21:02:08,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:02:08,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:08,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:02:08,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:08,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:02:08,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:13,640 INFO L134 CoverageAnalysis]: Checked inductivity of 17490 backedges. 6699 proven. 2211 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2019-09-03 21:02:13,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:13,640 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:02:13,641 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:02:13,641 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:02:13,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:13,641 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:02:13,651 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:02:13,651 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:02:14,015 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 67 check-sat command(s) [2019-09-03 21:02:14,015 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:02:14,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 1285 conjuncts, 136 conjunts are in the unsatisfiable core [2019-09-03 21:02:14,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:02:14,192 INFO L134 CoverageAnalysis]: Checked inductivity of 17490 backedges. 6699 proven. 2211 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2019-09-03 21:02:14,193 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:02:19,151 INFO L134 CoverageAnalysis]: Checked inductivity of 17490 backedges. 6699 proven. 2211 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2019-09-03 21:02:19,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:02:19,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137, 137, 137] total 137 [2019-09-03 21:02:19,157 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:02:19,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 137 states [2019-09-03 21:02:19,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2019-09-03 21:02:19,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4693, Invalid=13939, Unknown=0, NotChecked=0, Total=18632 [2019-09-03 21:02:19,158 INFO L87 Difference]: Start difference. First operand 543 states and 544 transitions. Second operand 137 states. [2019-09-03 21:02:23,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:02:23,759 INFO L93 Difference]: Finished difference Result 744 states and 811 transitions. [2019-09-03 21:02:23,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2019-09-03 21:02:23,759 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 540 [2019-09-03 21:02:23,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:02:23,761 INFO L225 Difference]: With dead ends: 744 [2019-09-03 21:02:23,761 INFO L226 Difference]: Without dead ends: 544 [2019-09-03 21:02:23,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1284 GetRequests, 947 SyntacticMatches, 134 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15543 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=9521, Invalid=32299, Unknown=0, NotChecked=0, Total=41820 [2019-09-03 21:02:23,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-09-03 21:02:23,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 544. [2019-09-03 21:02:23,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-09-03 21:02:23,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 545 transitions. [2019-09-03 21:02:23,770 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 545 transitions. Word has length 540 [2019-09-03 21:02:23,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:02:23,770 INFO L475 AbstractCegarLoop]: Abstraction has 544 states and 545 transitions. [2019-09-03 21:02:23,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 137 states. [2019-09-03 21:02:23,771 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 545 transitions. [2019-09-03 21:02:23,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2019-09-03 21:02:23,773 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:02:23,773 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 67, 67, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:02:23,773 INFO L418 AbstractCegarLoop]: === Iteration 134 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:02:23,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:02:23,773 INFO L82 PathProgramCache]: Analyzing trace with hash 111021481, now seen corresponding path program 132 times [2019-09-03 21:02:23,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:02:23,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:23,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:02:23,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:23,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:02:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:25,719 INFO L134 CoverageAnalysis]: Checked inductivity of 17557 backedges. 2410 proven. 6567 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2019-09-03 21:02:25,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:25,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:02:25,720 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:02:25,720 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:02:25,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:25,720 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:02:25,730 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:02:25,730 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:02:25,920 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:02:25,920 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:02:25,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 1290 conjuncts, 145 conjunts are in the unsatisfiable core [2019-09-03 21:02:25,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:02:26,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:26,202 INFO L134 CoverageAnalysis]: Checked inductivity of 17557 backedges. 2409 proven. 6763 refuted. 0 times theorem prover too weak. 8385 trivial. 0 not checked. [2019-09-03 21:02:26,202 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:02:27,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:27,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:29,678 INFO L134 CoverageAnalysis]: Checked inductivity of 17557 backedges. 2342 proven. 6830 refuted. 0 times theorem prover too weak. 8385 trivial. 0 not checked. [2019-09-03 21:02:29,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:02:29,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 74, 74] total 77 [2019-09-03 21:02:29,683 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:02:29,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-03 21:02:29,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-03 21:02:29,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2435, Invalid=3417, Unknown=0, NotChecked=0, Total=5852 [2019-09-03 21:02:29,685 INFO L87 Difference]: Start difference. First operand 544 states and 545 transitions. Second operand 75 states. [2019-09-03 21:02:30,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:02:30,712 INFO L93 Difference]: Finished difference Result 551 states and 552 transitions. [2019-09-03 21:02:30,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-03 21:02:30,712 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 541 [2019-09-03 21:02:30,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:02:30,714 INFO L225 Difference]: With dead ends: 551 [2019-09-03 21:02:30,714 INFO L226 Difference]: Without dead ends: 551 [2019-09-03 21:02:30,715 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1221 GetRequests, 1009 SyntacticMatches, 135 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5100 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=2450, Invalid=3712, Unknown=0, NotChecked=0, Total=6162 [2019-09-03 21:02:30,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-09-03 21:02:30,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2019-09-03 21:02:30,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-03 21:02:30,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 552 transitions. [2019-09-03 21:02:30,719 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 552 transitions. Word has length 541 [2019-09-03 21:02:30,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:02:30,719 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 552 transitions. [2019-09-03 21:02:30,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-03 21:02:30,720 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 552 transitions. [2019-09-03 21:02:30,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2019-09-03 21:02:30,722 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:02:30,722 INFO L399 BasicCegarLoop]: trace histogram [68, 68, 68, 67, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:02:30,722 INFO L418 AbstractCegarLoop]: === Iteration 135 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:02:30,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:02:30,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1636855610, now seen corresponding path program 133 times [2019-09-03 21:02:30,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:02:30,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:30,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:02:30,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:30,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:02:30,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:35,887 INFO L134 CoverageAnalysis]: Checked inductivity of 18023 backedges. 6901 proven. 2278 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2019-09-03 21:02:35,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:35,887 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:02:35,887 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:02:35,887 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:02:35,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:35,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:02:35,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:02:35,898 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:02:36,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:36,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 1304 conjuncts, 138 conjunts are in the unsatisfiable core [2019-09-03 21:02:36,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:02:36,249 INFO L134 CoverageAnalysis]: Checked inductivity of 18023 backedges. 6901 proven. 2278 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2019-09-03 21:02:36,249 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:02:41,541 INFO L134 CoverageAnalysis]: Checked inductivity of 18023 backedges. 6901 proven. 2278 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2019-09-03 21:02:41,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:02:41,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139, 139, 139] total 139 [2019-09-03 21:02:41,545 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:02:41,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-09-03 21:02:41,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-09-03 21:02:41,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4831, Invalid=14351, Unknown=0, NotChecked=0, Total=19182 [2019-09-03 21:02:41,547 INFO L87 Difference]: Start difference. First operand 551 states and 552 transitions. Second operand 139 states. [2019-09-03 21:02:47,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:02:47,005 INFO L93 Difference]: Finished difference Result 755 states and 823 transitions. [2019-09-03 21:02:47,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-09-03 21:02:47,006 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 548 [2019-09-03 21:02:47,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:02:47,007 INFO L225 Difference]: With dead ends: 755 [2019-09-03 21:02:47,008 INFO L226 Difference]: Without dead ends: 552 [2019-09-03 21:02:47,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1303 GetRequests, 961 SyntacticMatches, 136 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16013 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=9799, Invalid=33257, Unknown=0, NotChecked=0, Total=43056 [2019-09-03 21:02:47,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2019-09-03 21:02:47,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2019-09-03 21:02:47,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2019-09-03 21:02:47,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 553 transitions. [2019-09-03 21:02:47,017 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 553 transitions. Word has length 548 [2019-09-03 21:02:47,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:02:47,018 INFO L475 AbstractCegarLoop]: Abstraction has 552 states and 553 transitions. [2019-09-03 21:02:47,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-09-03 21:02:47,018 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 553 transitions. [2019-09-03 21:02:47,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2019-09-03 21:02:47,020 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:02:47,020 INFO L399 BasicCegarLoop]: trace histogram [68, 68, 68, 68, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:02:47,020 INFO L418 AbstractCegarLoop]: === Iteration 136 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:02:47,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:02:47,021 INFO L82 PathProgramCache]: Analyzing trace with hash -176283445, now seen corresponding path program 134 times [2019-09-03 21:02:47,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:02:47,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:47,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:02:47,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:47,021 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:02:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:49,019 INFO L134 CoverageAnalysis]: Checked inductivity of 18091 backedges. 2480 proven. 6767 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2019-09-03 21:02:49,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:49,019 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:02:49,019 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:02:49,019 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:02:49,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:49,020 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:02:49,029 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:02:49,030 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:02:49,448 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 68 check-sat command(s) [2019-09-03 21:02:49,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:02:49,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 1309 conjuncts, 147 conjunts are in the unsatisfiable core [2019-09-03 21:02:49,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:02:49,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:49,740 INFO L134 CoverageAnalysis]: Checked inductivity of 18091 backedges. 2479 proven. 6966 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2019-09-03 21:02:49,740 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:02:51,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:51,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:53,235 INFO L134 CoverageAnalysis]: Checked inductivity of 18091 backedges. 2411 proven. 7034 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2019-09-03 21:02:53,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:02:53,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 75, 75] total 78 [2019-09-03 21:02:53,241 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:02:53,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-03 21:02:53,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-03 21:02:53,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2505, Invalid=3501, Unknown=0, NotChecked=0, Total=6006 [2019-09-03 21:02:53,242 INFO L87 Difference]: Start difference. First operand 552 states and 553 transitions. Second operand 76 states. [2019-09-03 21:02:54,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:02:54,386 INFO L93 Difference]: Finished difference Result 559 states and 560 transitions. [2019-09-03 21:02:54,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-03 21:02:54,386 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 549 [2019-09-03 21:02:54,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:02:54,387 INFO L225 Difference]: With dead ends: 559 [2019-09-03 21:02:54,387 INFO L226 Difference]: Without dead ends: 559 [2019-09-03 21:02:54,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1239 GetRequests, 1024 SyntacticMatches, 137 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5244 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=2520, Invalid=3800, Unknown=0, NotChecked=0, Total=6320 [2019-09-03 21:02:54,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-09-03 21:02:54,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2019-09-03 21:02:54,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-09-03 21:02:54,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 560 transitions. [2019-09-03 21:02:54,392 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 560 transitions. Word has length 549 [2019-09-03 21:02:54,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:02:54,393 INFO L475 AbstractCegarLoop]: Abstraction has 559 states and 560 transitions. [2019-09-03 21:02:54,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-03 21:02:54,393 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 560 transitions. [2019-09-03 21:02:54,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2019-09-03 21:02:54,396 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:02:54,397 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 69, 68, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:02:54,397 INFO L418 AbstractCegarLoop]: === Iteration 137 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:02:54,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:02:54,397 INFO L82 PathProgramCache]: Analyzing trace with hash 2028794328, now seen corresponding path program 135 times [2019-09-03 21:02:54,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:02:54,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:54,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:02:54,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:54,398 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:02:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:59,855 INFO L134 CoverageAnalysis]: Checked inductivity of 18564 backedges. 7106 proven. 2346 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2019-09-03 21:02:59,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:59,855 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:02:59,855 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:02:59,855 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:02:59,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:59,856 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:02:59,866 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:02:59,866 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:03:00,048 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:03:00,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:03:00,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 1323 conjuncts, 140 conjunts are in the unsatisfiable core [2019-09-03 21:03:00,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:03:00,225 INFO L134 CoverageAnalysis]: Checked inductivity of 18564 backedges. 7106 proven. 2346 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2019-09-03 21:03:00,225 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:03:05,428 INFO L134 CoverageAnalysis]: Checked inductivity of 18564 backedges. 7106 proven. 2346 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2019-09-03 21:03:05,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:03:05,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141, 141, 141] total 141 [2019-09-03 21:03:05,433 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:03:05,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 141 states [2019-09-03 21:03:05,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2019-09-03 21:03:05,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4971, Invalid=14769, Unknown=0, NotChecked=0, Total=19740 [2019-09-03 21:03:05,435 INFO L87 Difference]: Start difference. First operand 559 states and 560 transitions. Second operand 141 states. [2019-09-03 21:03:14,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:03:14,598 INFO L93 Difference]: Finished difference Result 766 states and 835 transitions. [2019-09-03 21:03:14,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2019-09-03 21:03:14,598 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 556 [2019-09-03 21:03:14,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:03:14,600 INFO L225 Difference]: With dead ends: 766 [2019-09-03 21:03:14,600 INFO L226 Difference]: Without dead ends: 560 [2019-09-03 21:03:14,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1322 GetRequests, 975 SyntacticMatches, 138 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16490 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=10081, Invalid=34229, Unknown=0, NotChecked=0, Total=44310 [2019-09-03 21:03:14,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-09-03 21:03:14,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2019-09-03 21:03:14,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2019-09-03 21:03:14,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 561 transitions. [2019-09-03 21:03:14,608 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 561 transitions. Word has length 556 [2019-09-03 21:03:14,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:03:14,608 INFO L475 AbstractCegarLoop]: Abstraction has 560 states and 561 transitions. [2019-09-03 21:03:14,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 141 states. [2019-09-03 21:03:14,608 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 561 transitions. [2019-09-03 21:03:14,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 558 [2019-09-03 21:03:14,610 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:03:14,611 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 69, 69, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:03:14,611 INFO L418 AbstractCegarLoop]: === Iteration 138 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:03:14,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:03:14,611 INFO L82 PathProgramCache]: Analyzing trace with hash 459047529, now seen corresponding path program 136 times [2019-09-03 21:03:14,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:03:14,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:14,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:03:14,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:14,612 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:03:14,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:16,718 INFO L134 CoverageAnalysis]: Checked inductivity of 18633 backedges. 2551 proven. 6970 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2019-09-03 21:03:16,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:16,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:03:16,719 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:03:16,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:03:16,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:16,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:03:16,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:03:16,728 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:03:16,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:16,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 1328 conjuncts, 149 conjunts are in the unsatisfiable core [2019-09-03 21:03:16,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:03:17,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:17,216 INFO L134 CoverageAnalysis]: Checked inductivity of 18633 backedges. 2550 proven. 7172 refuted. 0 times theorem prover too weak. 8911 trivial. 0 not checked. [2019-09-03 21:03:17,216 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:03:19,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:19,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:20,823 INFO L134 CoverageAnalysis]: Checked inductivity of 18633 backedges. 2481 proven. 7241 refuted. 0 times theorem prover too weak. 8911 trivial. 0 not checked. [2019-09-03 21:03:20,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:03:20,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 76, 76] total 79 [2019-09-03 21:03:20,853 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:03:20,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-03 21:03:20,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-03 21:03:20,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2576, Invalid=3586, Unknown=0, NotChecked=0, Total=6162 [2019-09-03 21:03:20,854 INFO L87 Difference]: Start difference. First operand 560 states and 561 transitions. Second operand 77 states. [2019-09-03 21:03:21,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:03:21,799 INFO L93 Difference]: Finished difference Result 567 states and 568 transitions. [2019-09-03 21:03:21,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-03 21:03:21,800 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 557 [2019-09-03 21:03:21,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:03:21,801 INFO L225 Difference]: With dead ends: 567 [2019-09-03 21:03:21,802 INFO L226 Difference]: Without dead ends: 567 [2019-09-03 21:03:21,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1257 GetRequests, 1039 SyntacticMatches, 139 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5390 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=2591, Invalid=3889, Unknown=0, NotChecked=0, Total=6480 [2019-09-03 21:03:21,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-09-03 21:03:21,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2019-09-03 21:03:21,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2019-09-03 21:03:21,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 568 transitions. [2019-09-03 21:03:21,807 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 568 transitions. Word has length 557 [2019-09-03 21:03:21,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:03:21,807 INFO L475 AbstractCegarLoop]: Abstraction has 567 states and 568 transitions. [2019-09-03 21:03:21,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-03 21:03:21,807 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 568 transitions. [2019-09-03 21:03:21,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 565 [2019-09-03 21:03:21,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:03:21,810 INFO L399 BasicCegarLoop]: trace histogram [70, 70, 70, 69, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:03:21,810 INFO L418 AbstractCegarLoop]: === Iteration 139 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:03:21,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:03:21,810 INFO L82 PathProgramCache]: Analyzing trace with hash 206119546, now seen corresponding path program 137 times [2019-09-03 21:03:21,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:03:21,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:21,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:03:21,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:21,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:03:21,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:27,289 INFO L134 CoverageAnalysis]: Checked inductivity of 19113 backedges. 7314 proven. 2415 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2019-09-03 21:03:27,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:27,289 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:03:27,289 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:03:27,289 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:03:27,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:27,289 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:03:27,299 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:03:27,299 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:03:27,672 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2019-09-03 21:03:27,672 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:03:27,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 1342 conjuncts, 142 conjunts are in the unsatisfiable core [2019-09-03 21:03:27,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:03:27,835 INFO L134 CoverageAnalysis]: Checked inductivity of 19113 backedges. 7314 proven. 2415 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2019-09-03 21:03:27,835 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:03:33,257 INFO L134 CoverageAnalysis]: Checked inductivity of 19113 backedges. 7314 proven. 2415 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2019-09-03 21:03:33,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:03:33,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143, 143, 143] total 143 [2019-09-03 21:03:33,262 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:03:33,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 143 states [2019-09-03 21:03:33,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2019-09-03 21:03:33,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5113, Invalid=15193, Unknown=0, NotChecked=0, Total=20306 [2019-09-03 21:03:33,263 INFO L87 Difference]: Start difference. First operand 567 states and 568 transitions. Second operand 143 states. [2019-09-03 21:03:40,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:03:40,696 INFO L93 Difference]: Finished difference Result 777 states and 847 transitions. [2019-09-03 21:03:40,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2019-09-03 21:03:40,697 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 564 [2019-09-03 21:03:40,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:03:40,698 INFO L225 Difference]: With dead ends: 777 [2019-09-03 21:03:40,698 INFO L226 Difference]: Without dead ends: 568 [2019-09-03 21:03:40,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1341 GetRequests, 989 SyntacticMatches, 140 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16974 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=10367, Invalid=35215, Unknown=0, NotChecked=0, Total=45582 [2019-09-03 21:03:40,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-09-03 21:03:40,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2019-09-03 21:03:40,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-09-03 21:03:40,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 569 transitions. [2019-09-03 21:03:40,705 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 569 transitions. Word has length 564 [2019-09-03 21:03:40,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:03:40,705 INFO L475 AbstractCegarLoop]: Abstraction has 568 states and 569 transitions. [2019-09-03 21:03:40,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 143 states. [2019-09-03 21:03:40,706 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 569 transitions. [2019-09-03 21:03:40,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2019-09-03 21:03:40,708 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:03:40,708 INFO L399 BasicCegarLoop]: trace histogram [70, 70, 70, 70, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:03:40,708 INFO L418 AbstractCegarLoop]: === Iteration 140 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:03:40,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:03:40,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1223397899, now seen corresponding path program 138 times [2019-09-03 21:03:40,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:03:40,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:40,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:03:40,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:40,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:03:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:42,878 INFO L134 CoverageAnalysis]: Checked inductivity of 19183 backedges. 2623 proven. 7176 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2019-09-03 21:03:42,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:42,878 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:03:42,879 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:03:42,879 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:03:42,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:42,879 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:03:42,888 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:03:42,889 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:03:43,081 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:03:43,081 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:03:43,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 1347 conjuncts, 151 conjunts are in the unsatisfiable core [2019-09-03 21:03:43,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:03:43,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:43,383 INFO L134 CoverageAnalysis]: Checked inductivity of 19183 backedges. 2622 proven. 7381 refuted. 0 times theorem prover too weak. 9180 trivial. 0 not checked. [2019-09-03 21:03:43,384 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:03:45,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:45,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:45,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:47,117 INFO L134 CoverageAnalysis]: Checked inductivity of 19183 backedges. 2552 proven. 7451 refuted. 0 times theorem prover too weak. 9180 trivial. 0 not checked. [2019-09-03 21:03:47,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:03:47,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 77, 77] total 80 [2019-09-03 21:03:47,122 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:03:47,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-03 21:03:47,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-03 21:03:47,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2648, Invalid=3672, Unknown=0, NotChecked=0, Total=6320 [2019-09-03 21:03:47,123 INFO L87 Difference]: Start difference. First operand 568 states and 569 transitions. Second operand 78 states. [2019-09-03 21:03:47,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:03:47,996 INFO L93 Difference]: Finished difference Result 575 states and 576 transitions. [2019-09-03 21:03:47,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-03 21:03:47,996 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 565 [2019-09-03 21:03:47,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:03:47,998 INFO L225 Difference]: With dead ends: 575 [2019-09-03 21:03:47,998 INFO L226 Difference]: Without dead ends: 575 [2019-09-03 21:03:47,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1275 GetRequests, 1054 SyntacticMatches, 141 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5538 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=2663, Invalid=3979, Unknown=0, NotChecked=0, Total=6642 [2019-09-03 21:03:48,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2019-09-03 21:03:48,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2019-09-03 21:03:48,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-09-03 21:03:48,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 576 transitions. [2019-09-03 21:03:48,005 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 576 transitions. Word has length 565 [2019-09-03 21:03:48,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:03:48,006 INFO L475 AbstractCegarLoop]: Abstraction has 575 states and 576 transitions. [2019-09-03 21:03:48,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-03 21:03:48,006 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 576 transitions. [2019-09-03 21:03:48,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2019-09-03 21:03:48,009 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:03:48,010 INFO L399 BasicCegarLoop]: trace histogram [71, 71, 71, 70, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:03:48,010 INFO L418 AbstractCegarLoop]: === Iteration 141 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:03:48,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:03:48,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1039767704, now seen corresponding path program 139 times [2019-09-03 21:03:48,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:03:48,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:48,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:03:48,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:48,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:03:48,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:53,652 INFO L134 CoverageAnalysis]: Checked inductivity of 19670 backedges. 7525 proven. 2485 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2019-09-03 21:03:53,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:53,652 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:03:53,653 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:03:53,653 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:03:53,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:53,653 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:03:53,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:03:53,663 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:03:53,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:53,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 1361 conjuncts, 144 conjunts are in the unsatisfiable core [2019-09-03 21:03:53,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:03:54,003 INFO L134 CoverageAnalysis]: Checked inductivity of 19670 backedges. 7525 proven. 2485 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2019-09-03 21:03:54,003 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:03:59,617 INFO L134 CoverageAnalysis]: Checked inductivity of 19670 backedges. 7525 proven. 2485 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2019-09-03 21:03:59,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:03:59,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145, 145, 145] total 145 [2019-09-03 21:03:59,621 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:03:59,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 145 states [2019-09-03 21:03:59,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2019-09-03 21:03:59,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5257, Invalid=15623, Unknown=0, NotChecked=0, Total=20880 [2019-09-03 21:03:59,623 INFO L87 Difference]: Start difference. First operand 575 states and 576 transitions. Second operand 145 states. [2019-09-03 21:04:06,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:06,901 INFO L93 Difference]: Finished difference Result 788 states and 859 transitions. [2019-09-03 21:04:06,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-09-03 21:04:06,901 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 572 [2019-09-03 21:04:06,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:06,903 INFO L225 Difference]: With dead ends: 788 [2019-09-03 21:04:06,903 INFO L226 Difference]: Without dead ends: 576 [2019-09-03 21:04:06,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1360 GetRequests, 1003 SyntacticMatches, 142 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17465 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=10657, Invalid=36215, Unknown=0, NotChecked=0, Total=46872 [2019-09-03 21:04:06,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-09-03 21:04:06,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2019-09-03 21:04:06,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-09-03 21:04:06,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 577 transitions. [2019-09-03 21:04:06,913 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 577 transitions. Word has length 572 [2019-09-03 21:04:06,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:06,913 INFO L475 AbstractCegarLoop]: Abstraction has 576 states and 577 transitions. [2019-09-03 21:04:06,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 145 states. [2019-09-03 21:04:06,914 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 577 transitions. [2019-09-03 21:04:06,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2019-09-03 21:04:06,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:06,917 INFO L399 BasicCegarLoop]: trace histogram [71, 71, 71, 71, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:06,917 INFO L418 AbstractCegarLoop]: === Iteration 142 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:06,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:06,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1602217769, now seen corresponding path program 140 times [2019-09-03 21:04:06,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:06,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:06,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:06,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:06,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:09,097 INFO L134 CoverageAnalysis]: Checked inductivity of 19741 backedges. 2696 proven. 7385 refuted. 0 times theorem prover too weak. 9660 trivial. 0 not checked. [2019-09-03 21:04:09,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:09,098 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:09,098 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:09,098 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:09,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:09,098 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:09,108 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:04:09,108 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:04:09,507 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 71 check-sat command(s) [2019-09-03 21:04:09,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:09,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 1366 conjuncts, 153 conjunts are in the unsatisfiable core [2019-09-03 21:04:09,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:09,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:04:09,846 INFO L134 CoverageAnalysis]: Checked inductivity of 19741 backedges. 2695 proven. 7593 refuted. 0 times theorem prover too weak. 9453 trivial. 0 not checked. [2019-09-03 21:04:09,847 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:11,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:04:11,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:04:11,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:04:13,637 INFO L134 CoverageAnalysis]: Checked inductivity of 19741 backedges. 2624 proven. 7664 refuted. 0 times theorem prover too weak. 9453 trivial. 0 not checked. [2019-09-03 21:04:13,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:13,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 78, 78] total 81 [2019-09-03 21:04:13,642 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:13,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-03 21:04:13,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-03 21:04:13,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2721, Invalid=3759, Unknown=0, NotChecked=0, Total=6480 [2019-09-03 21:04:13,643 INFO L87 Difference]: Start difference. First operand 576 states and 577 transitions. Second operand 79 states. [2019-09-03 21:04:14,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:14,611 INFO L93 Difference]: Finished difference Result 583 states and 584 transitions. [2019-09-03 21:04:14,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-09-03 21:04:14,611 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 573 [2019-09-03 21:04:14,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:14,613 INFO L225 Difference]: With dead ends: 583 [2019-09-03 21:04:14,613 INFO L226 Difference]: Without dead ends: 583 [2019-09-03 21:04:14,614 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1293 GetRequests, 1069 SyntacticMatches, 143 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5688 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=2736, Invalid=4070, Unknown=0, NotChecked=0, Total=6806 [2019-09-03 21:04:14,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-09-03 21:04:14,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-09-03 21:04:14,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-09-03 21:04:14,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 584 transitions. [2019-09-03 21:04:14,618 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 584 transitions. Word has length 573 [2019-09-03 21:04:14,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:14,618 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 584 transitions. [2019-09-03 21:04:14,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-03 21:04:14,619 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 584 transitions. [2019-09-03 21:04:14,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 581 [2019-09-03 21:04:14,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:14,621 INFO L399 BasicCegarLoop]: trace histogram [72, 72, 72, 71, 71, 71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:14,621 INFO L418 AbstractCegarLoop]: === Iteration 143 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:14,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:14,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1227810234, now seen corresponding path program 141 times [2019-09-03 21:04:14,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:14,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:14,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:14,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:14,622 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:14,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat