java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-lit/gj2007.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 13:02:10,633 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 13:02:10,635 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 13:02:10,647 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 13:02:10,647 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 13:02:10,648 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 13:02:10,649 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 13:02:10,651 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 13:02:10,653 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 13:02:10,654 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 13:02:10,655 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 13:02:10,656 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 13:02:10,656 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 13:02:10,657 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 13:02:10,658 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 13:02:10,659 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 13:02:10,660 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 13:02:10,661 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 13:02:10,662 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 13:02:10,664 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 13:02:10,665 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 13:02:10,666 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 13:02:10,667 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 13:02:10,668 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 13:02:10,670 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 13:02:10,670 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 13:02:10,670 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 13:02:10,671 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 13:02:10,671 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 13:02:10,672 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 13:02:10,672 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 13:02:10,673 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 13:02:10,674 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 13:02:10,674 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 13:02:10,675 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 13:02:10,675 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 13:02:10,676 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 13:02:10,676 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 13:02:10,677 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 13:02:10,677 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 13:02:10,678 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 13:02:10,679 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-05 13:02:10,693 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 13:02:10,693 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 13:02:10,694 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-05 13:02:10,694 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-05 13:02:10,695 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-05 13:02:10,695 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-05 13:02:10,695 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-05 13:02:10,695 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-05 13:02:10,695 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-05 13:02:10,696 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-05 13:02:10,696 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 13:02:10,696 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 13:02:10,697 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 13:02:10,697 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 13:02:10,697 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 13:02:10,697 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 13:02:10,697 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 13:02:10,697 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 13:02:10,698 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 13:02:10,698 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 13:02:10,698 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 13:02:10,698 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-05 13:02:10,699 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 13:02:10,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 13:02:10,699 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 13:02:10,699 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 13:02:10,699 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-05 13:02:10,699 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 13:02:10,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 13:02:10,700 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-05 13:02:10,727 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 13:02:10,744 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 13:02:10,747 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 13:02:10,749 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 13:02:10,749 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 13:02:10,750 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gj2007.i [2019-09-05 13:02:10,809 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a251cf8ca/006f34c72aad4e7396a3a697d0a37ab1/FLAG3ee682dd1 [2019-09-05 13:02:11,259 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 13:02:11,259 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007.i [2019-09-05 13:02:11,266 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a251cf8ca/006f34c72aad4e7396a3a697d0a37ab1/FLAG3ee682dd1 [2019-09-05 13:02:11,637 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a251cf8ca/006f34c72aad4e7396a3a697d0a37ab1 [2019-09-05 13:02:11,649 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 13:02:11,651 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 13:02:11,654 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 13:02:11,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 13:02:11,657 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 13:02:11,658 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 01:02:11" (1/1) ... [2019-09-05 13:02:11,661 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f78d6b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:02:11, skipping insertion in model container [2019-09-05 13:02:11,662 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 01:02:11" (1/1) ... [2019-09-05 13:02:11,669 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 13:02:11,691 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 13:02:11,911 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 13:02:11,923 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 13:02:11,945 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 13:02:11,960 INFO L192 MainTranslator]: Completed translation [2019-09-05 13:02:11,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:02:11 WrapperNode [2019-09-05 13:02:11,961 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 13:02:11,962 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 13:02:11,962 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 13:02:11,962 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 13:02:11,976 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:02:11" (1/1) ... [2019-09-05 13:02:11,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:02:11" (1/1) ... [2019-09-05 13:02:11,981 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:02:11" (1/1) ... [2019-09-05 13:02:11,982 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:02:11" (1/1) ... [2019-09-05 13:02:12,073 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:02:11" (1/1) ... [2019-09-05 13:02:12,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:02:11" (1/1) ... [2019-09-05 13:02:12,082 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:02:11" (1/1) ... [2019-09-05 13:02:12,083 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 13:02:12,084 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 13:02:12,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 13:02:12,085 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 13:02:12,086 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:02:11" (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-05 13:02:12,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 13:02:12,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 13:02:12,143 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 13:02:12,143 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 13:02:12,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 13:02:12,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-05 13:02:12,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 13:02:12,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-05 13:02:12,144 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 13:02:12,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 13:02:12,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 13:02:12,295 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 13:02:12,296 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-05 13:02:12,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 01:02:12 BoogieIcfgContainer [2019-09-05 13:02:12,297 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 13:02:12,298 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 13:02:12,298 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 13:02:12,301 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 13:02:12,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 01:02:11" (1/3) ... [2019-09-05 13:02:12,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@128486d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 01:02:12, skipping insertion in model container [2019-09-05 13:02:12,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:02:11" (2/3) ... [2019-09-05 13:02:12,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@128486d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 01:02:12, skipping insertion in model container [2019-09-05 13:02:12,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 01:02:12" (3/3) ... [2019-09-05 13:02:12,304 INFO L109 eAbstractionObserver]: Analyzing ICFG gj2007.i [2019-09-05 13:02:12,313 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 13:02:12,320 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 13:02:12,334 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 13:02:12,359 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 13:02:12,360 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-05 13:02:12,360 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 13:02:12,360 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 13:02:12,360 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 13:02:12,360 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 13:02:12,361 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 13:02:12,361 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 13:02:12,376 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-09-05 13:02:12,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 13:02:12,385 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:12,386 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:12,388 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:12,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:12,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1712329921, now seen corresponding path program 1 times [2019-09-05 13:02:12,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:12,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:12,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:12,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:12,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:12,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:12,484 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-05 13:02:12,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:02:12,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-05 13:02:12,487 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:02:12,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-05 13:02:12,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-05 13:02:12,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 13:02:12,508 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-09-05 13:02:12,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:12,521 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-09-05 13:02:12,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-05 13:02:12,523 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-05 13:02:12,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:12,530 INFO L225 Difference]: With dead ends: 19 [2019-09-05 13:02:12,530 INFO L226 Difference]: Without dead ends: 12 [2019-09-05 13:02:12,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 13:02:12,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-05 13:02:12,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-05 13:02:12,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-05 13:02:12,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-09-05 13:02:12,561 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2019-09-05 13:02:12,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:12,561 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-09-05 13:02:12,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-05 13:02:12,561 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-09-05 13:02:12,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 13:02:12,562 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:12,562 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:12,562 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:12,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:12,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1703094711, now seen corresponding path program 1 times [2019-09-05 13:02:12,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:12,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:12,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:12,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:12,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:12,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:12,619 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-05 13:02:12,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:02:12,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 13:02:12,620 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:02:12,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 13:02:12,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 13:02:12,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 13:02:12,623 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 3 states. [2019-09-05 13:02:12,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:12,674 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-09-05 13:02:12,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 13:02:12,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-05 13:02:12,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:12,676 INFO L225 Difference]: With dead ends: 14 [2019-09-05 13:02:12,676 INFO L226 Difference]: Without dead ends: 14 [2019-09-05 13:02:12,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 13:02:12,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-05 13:02:12,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-09-05 13:02:12,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-05 13:02:12,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-09-05 13:02:12,682 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2019-09-05 13:02:12,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:12,682 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-09-05 13:02:12,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 13:02:12,682 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-09-05 13:02:12,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-05 13:02:12,683 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:12,683 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:12,684 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:12,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:12,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1337256884, now seen corresponding path program 1 times [2019-09-05 13:02:12,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:12,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:12,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:12,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:12,686 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:12,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:12,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:02:12,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:12,725 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:12,728 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 13 with the following transitions: [2019-09-05 13:02:12,730 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [16], [26], [29], [31], [37], [38], [39], [41] [2019-09-05 13:02:12,765 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:02:12,765 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:02:12,859 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-05 13:02:12,862 INFO L272 AbstractInterpreter]: Visited 8 different actions 23 times. Merged at 2 different actions 10 times. Widened at 1 different actions 1 times. Performed 42 root evaluator evaluations with a maximum evaluation depth of 4. Performed 42 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 2 variables. [2019-09-05 13:02:12,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:12,865 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-05 13:02:12,895 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-05 13:02:12,896 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-05 13:02:12,904 INFO L420 sIntCurrentIteration]: We unified 11 AI predicates to 11 [2019-09-05 13:02:12,904 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-05 13:02:12,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-05 13:02:12,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-05 13:02:12,909 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:02:12,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 13:02:12,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 13:02:12,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 13:02:12,913 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 3 states. [2019-09-05 13:02:12,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:12,947 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2019-09-05 13:02:12,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 13:02:12,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-09-05 13:02:12,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:12,949 INFO L225 Difference]: With dead ends: 16 [2019-09-05 13:02:12,949 INFO L226 Difference]: Without dead ends: 16 [2019-09-05 13:02:12,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 13:02:12,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-05 13:02:12,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-05 13:02:12,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-05 13:02:12,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-09-05 13:02:12,953 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2019-09-05 13:02:12,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:12,954 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-09-05 13:02:12,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 13:02:12,954 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2019-09-05 13:02:12,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-05 13:02:12,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:12,955 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:12,955 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:12,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:12,956 INFO L82 PathProgramCache]: Analyzing trace with hash 2011681711, now seen corresponding path program 1 times [2019-09-05 13:02:12,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:12,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:12,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:12,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:12,957 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:12,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:13,002 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:02:13,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:13,005 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:13,005 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2019-09-05 13:02:13,005 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [16], [18], [26], [29], [31], [37], [38], [39], [41] [2019-09-05 13:02:13,007 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:02:13,008 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:02:13,040 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:02:13,041 INFO L272 AbstractInterpreter]: Visited 13 different actions 45 times. Merged at 4 different actions 15 times. Widened at 2 different actions 3 times. Performed 84 root evaluator evaluations with a maximum evaluation depth of 4. Performed 84 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 4 fixpoints after 2 different actions. Largest state had 2 variables. [2019-09-05 13:02:13,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:13,042 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:02:13,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:13,043 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 13:02:13,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:13,069 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:02:13,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:13,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-05 13:02:13,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:13,113 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:02:13,113 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:13,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:02:13,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:13,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-09-05 13:02:13,154 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:13,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 13:02:13,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 13:02:13,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-05 13:02:13,155 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 4 states. [2019-09-05 13:02:13,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:13,191 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-09-05 13:02:13,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 13:02:13,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-09-05 13:02:13,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:13,194 INFO L225 Difference]: With dead ends: 18 [2019-09-05 13:02:13,194 INFO L226 Difference]: Without dead ends: 18 [2019-09-05 13:02:13,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-05 13:02:13,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-05 13:02:13,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-05 13:02:13,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-05 13:02:13,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-09-05 13:02:13,198 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2019-09-05 13:02:13,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:13,199 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-09-05 13:02:13,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 13:02:13,199 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-09-05 13:02:13,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-05 13:02:13,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:13,200 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:13,200 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:13,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:13,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1891741908, now seen corresponding path program 2 times [2019-09-05 13:02:13,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:13,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:13,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:13,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:13,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:13,268 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:02:13,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:13,268 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:13,269 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:13,269 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:13,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:13,269 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 13:02:13,286 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:02:13,286 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:02:13,303 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-05 13:02:13,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:13,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-05 13:02:13,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:13,354 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:02:13,355 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:13,409 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:02:13,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:13,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2019-09-05 13:02:13,413 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:13,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 13:02:13,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 13:02:13,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-05 13:02:13,415 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 8 states. [2019-09-05 13:02:13,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:13,471 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2019-09-05 13:02:13,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 13:02:13,471 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-09-05 13:02:13,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:13,474 INFO L225 Difference]: With dead ends: 26 [2019-09-05 13:02:13,475 INFO L226 Difference]: Without dead ends: 26 [2019-09-05 13:02:13,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-05 13:02:13,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-05 13:02:13,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2019-09-05 13:02:13,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-05 13:02:13,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-09-05 13:02:13,480 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 16 [2019-09-05 13:02:13,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:13,481 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-09-05 13:02:13,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 13:02:13,481 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-09-05 13:02:13,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-05 13:02:13,482 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:13,482 INFO L399 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:13,482 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:13,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:13,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1567930911, now seen corresponding path program 3 times [2019-09-05 13:02:13,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:13,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:13,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:13,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:13,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:13,543 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 13:02:13,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:13,544 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:13,544 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:13,544 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:13,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:13,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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:02:13,564 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:02:13,565 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-05 13:02:13,585 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:02:13,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:13,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-05 13:02:13,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:13,603 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 13:02:13,604 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:13,701 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 13:02:13,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:13,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2019-09-05 13:02:13,705 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:13,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 13:02:13,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 13:02:13,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-05 13:02:13,707 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 6 states. [2019-09-05 13:02:13,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:13,748 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-09-05 13:02:13,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 13:02:13,749 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-09-05 13:02:13,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:13,750 INFO L225 Difference]: With dead ends: 25 [2019-09-05 13:02:13,750 INFO L226 Difference]: Without dead ends: 25 [2019-09-05 13:02:13,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-05 13:02:13,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-05 13:02:13,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-09-05 13:02:13,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-05 13:02:13,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-09-05 13:02:13,755 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 22 [2019-09-05 13:02:13,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:13,755 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-09-05 13:02:13,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 13:02:13,756 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-09-05 13:02:13,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-05 13:02:13,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:13,757 INFO L399 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:13,757 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:13,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:13,757 INFO L82 PathProgramCache]: Analyzing trace with hash 92956828, now seen corresponding path program 4 times [2019-09-05 13:02:13,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:13,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:13,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:13,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:13,759 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:13,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:13,864 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 13:02:13,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:13,865 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:13,865 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:13,865 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:13,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:13,865 INFO 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-05 13:02:13,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:13,888 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-05 13:02:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:13,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-05 13:02:13,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:13,919 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 13:02:13,919 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:13,987 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 13:02:13,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:13,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2019-09-05 13:02:13,992 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:13,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 13:02:13,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 13:02:13,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-05 13:02:13,994 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 7 states. [2019-09-05 13:02:14,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:14,027 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2019-09-05 13:02:14,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 13:02:14,027 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-09-05 13:02:14,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:14,028 INFO L225 Difference]: With dead ends: 27 [2019-09-05 13:02:14,029 INFO L226 Difference]: Without dead ends: 27 [2019-09-05 13:02:14,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-05 13:02:14,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-05 13:02:14,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-05 13:02:14,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-05 13:02:14,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-09-05 13:02:14,033 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 24 [2019-09-05 13:02:14,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:14,034 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-09-05 13:02:14,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 13:02:14,034 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-09-05 13:02:14,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-05 13:02:14,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:14,036 INFO L399 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:14,037 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:14,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:14,038 INFO L82 PathProgramCache]: Analyzing trace with hash -17929255, now seen corresponding path program 5 times [2019-09-05 13:02:14,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:14,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:14,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:14,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:14,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:14,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:14,136 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 13:02:14,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:14,137 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:14,137 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:14,137 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:14,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:14,138 INFO 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-05 13:02:14,156 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:02:14,156 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:02:14,172 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-05 13:02:14,172 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:14,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-05 13:02:14,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:14,231 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-05 13:02:14,231 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:14,325 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-05 13:02:14,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:14,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2019-09-05 13:02:14,330 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:14,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-05 13:02:14,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-05 13:02:14,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-05 13:02:14,331 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 12 states. [2019-09-05 13:02:14,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:14,408 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2019-09-05 13:02:14,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-05 13:02:14,409 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-09-05 13:02:14,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:14,410 INFO L225 Difference]: With dead ends: 32 [2019-09-05 13:02:14,410 INFO L226 Difference]: Without dead ends: 32 [2019-09-05 13:02:14,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-05 13:02:14,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-05 13:02:14,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-09-05 13:02:14,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-05 13:02:14,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-09-05 13:02:14,419 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 26 [2019-09-05 13:02:14,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:14,419 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-09-05 13:02:14,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-05 13:02:14,419 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-09-05 13:02:14,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-05 13:02:14,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:14,421 INFO L399 BasicCegarLoop]: trace histogram [10, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:14,421 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:14,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:14,421 INFO L82 PathProgramCache]: Analyzing trace with hash 331873105, now seen corresponding path program 6 times [2019-09-05 13:02:14,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:14,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:14,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:14,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:14,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:14,524 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-05 13:02:14,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:14,524 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:14,524 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:14,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:14,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:14,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:02:14,539 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:02:14,539 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:02:14,555 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:02:14,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:14,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-05 13:02:14,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:14,565 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-05 13:02:14,565 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:14,686 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-05 13:02:14,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:14,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2019-09-05 13:02:14,691 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:14,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-05 13:02:14,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-05 13:02:14,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-05 13:02:14,692 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 9 states. [2019-09-05 13:02:14,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:14,727 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2019-09-05 13:02:14,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-05 13:02:14,728 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-09-05 13:02:14,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:14,729 INFO L225 Difference]: With dead ends: 33 [2019-09-05 13:02:14,729 INFO L226 Difference]: Without dead ends: 33 [2019-09-05 13:02:14,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-05 13:02:14,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-05 13:02:14,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-05 13:02:14,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-05 13:02:14,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-09-05 13:02:14,734 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 30 [2019-09-05 13:02:14,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:14,735 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-09-05 13:02:14,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-05 13:02:14,735 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-09-05 13:02:14,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-05 13:02:14,736 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:14,736 INFO L399 BasicCegarLoop]: trace histogram [11, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:14,736 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:14,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:14,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1078338354, now seen corresponding path program 7 times [2019-09-05 13:02:14,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:14,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:14,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:14,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:14,738 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:14,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:14,838 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-05 13:02:14,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:14,838 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:14,838 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:14,838 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:14,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:14,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:02:14,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:14,853 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:02:14,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:14,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-05 13:02:14,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:14,875 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-05 13:02:14,875 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:15,025 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-05 13:02:15,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:15,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2019-09-05 13:02:15,029 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:15,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-05 13:02:15,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-05 13:02:15,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-05 13:02:15,031 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 10 states. [2019-09-05 13:02:15,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:15,074 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2019-09-05 13:02:15,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-05 13:02:15,075 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-09-05 13:02:15,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:15,076 INFO L225 Difference]: With dead ends: 35 [2019-09-05 13:02:15,076 INFO L226 Difference]: Without dead ends: 35 [2019-09-05 13:02:15,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-05 13:02:15,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-05 13:02:15,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-09-05 13:02:15,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-05 13:02:15,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-09-05 13:02:15,080 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 32 [2019-09-05 13:02:15,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:15,081 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-09-05 13:02:15,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-05 13:02:15,081 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-09-05 13:02:15,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-05 13:02:15,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:15,082 INFO L399 BasicCegarLoop]: trace histogram [12, 8, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:15,082 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:15,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:15,083 INFO L82 PathProgramCache]: Analyzing trace with hash 918115083, now seen corresponding path program 8 times [2019-09-05 13:02:15,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:15,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:15,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:15,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:15,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:15,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:15,184 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 63 proven. 72 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-05 13:02:15,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:15,185 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:15,185 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:15,185 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:15,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:15,185 INFO 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-05 13:02:15,210 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:02:15,210 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:02:15,227 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-05 13:02:15,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:15,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-05 13:02:15,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:15,294 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 16 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-05 13:02:15,295 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:15,387 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 16 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-05 13:02:15,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:15,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 21 [2019-09-05 13:02:15,391 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:15,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-05 13:02:15,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-05 13:02:15,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-05 13:02:15,393 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 16 states. [2019-09-05 13:02:15,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:15,478 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2019-09-05 13:02:15,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-05 13:02:15,479 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2019-09-05 13:02:15,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:15,480 INFO L225 Difference]: With dead ends: 40 [2019-09-05 13:02:15,480 INFO L226 Difference]: Without dead ends: 40 [2019-09-05 13:02:15,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-05 13:02:15,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-05 13:02:15,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-09-05 13:02:15,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-05 13:02:15,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2019-09-05 13:02:15,485 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 34 [2019-09-05 13:02:15,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:15,485 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2019-09-05 13:02:15,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-05 13:02:15,485 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2019-09-05 13:02:15,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-05 13:02:15,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:15,487 INFO L399 BasicCegarLoop]: trace histogram [14, 9, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:15,487 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:15,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:15,487 INFO L82 PathProgramCache]: Analyzing trace with hash 287297795, now seen corresponding path program 9 times [2019-09-05 13:02:15,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:15,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:15,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:15,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:15,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:15,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:15,587 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-05 13:02:15,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:15,587 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:15,587 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:15,587 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:15,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:15,588 INFO 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-05 13:02:15,601 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:02:15,601 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-05 13:02:15,618 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:02:15,618 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:15,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-05 13:02:15,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:15,629 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-05 13:02:15,629 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:15,848 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-05 13:02:15,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:15,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2019-09-05 13:02:15,854 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:15,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-05 13:02:15,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-05 13:02:15,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-05 13:02:15,856 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 12 states. [2019-09-05 13:02:15,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:15,901 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2019-09-05 13:02:15,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-05 13:02:15,901 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2019-09-05 13:02:15,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:15,902 INFO L225 Difference]: With dead ends: 41 [2019-09-05 13:02:15,902 INFO L226 Difference]: Without dead ends: 41 [2019-09-05 13:02:15,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-05 13:02:15,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-05 13:02:15,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-09-05 13:02:15,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-05 13:02:15,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2019-09-05 13:02:15,907 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 38 [2019-09-05 13:02:15,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:15,907 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2019-09-05 13:02:15,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-05 13:02:15,907 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2019-09-05 13:02:15,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-05 13:02:15,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:15,909 INFO L399 BasicCegarLoop]: trace histogram [15, 10, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:15,909 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:15,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:15,909 INFO L82 PathProgramCache]: Analyzing trace with hash -955587200, now seen corresponding path program 10 times [2019-09-05 13:02:15,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:15,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:15,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:15,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:15,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:16,001 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 99 proven. 110 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-05 13:02:16,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:16,001 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:16,002 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:16,002 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:16,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:16,002 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:02:16,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:16,016 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:02:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:16,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-05 13:02:16,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:16,045 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 99 proven. 110 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-05 13:02:16,045 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:16,243 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 99 proven. 110 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-05 13:02:16,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:16,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2019-09-05 13:02:16,248 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:16,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-05 13:02:16,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-05 13:02:16,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-05 13:02:16,250 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 13 states. [2019-09-05 13:02:16,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:16,295 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2019-09-05 13:02:16,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-05 13:02:16,296 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-09-05 13:02:16,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:16,297 INFO L225 Difference]: With dead ends: 43 [2019-09-05 13:02:16,297 INFO L226 Difference]: Without dead ends: 43 [2019-09-05 13:02:16,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-05 13:02:16,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-05 13:02:16,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-09-05 13:02:16,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-05 13:02:16,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2019-09-05 13:02:16,301 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 40 [2019-09-05 13:02:16,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:16,301 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2019-09-05 13:02:16,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-05 13:02:16,302 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2019-09-05 13:02:16,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-05 13:02:16,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:16,303 INFO L399 BasicCegarLoop]: trace histogram [16, 11, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:16,303 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:16,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:16,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1367159107, now seen corresponding path program 11 times [2019-09-05 13:02:16,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:16,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:16,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:16,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:16,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:16,403 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 108 proven. 132 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-05 13:02:16,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:16,404 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:16,404 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:16,404 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:16,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:16,405 INFO 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-05 13:02:16,424 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:02:16,425 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:02:16,446 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-05 13:02:16,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:16,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-05 13:02:16,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:16,567 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 121 proven. 25 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-09-05 13:02:16,567 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:16,689 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 121 proven. 25 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-09-05 13:02:16,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:16,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 8] total 26 [2019-09-05 13:02:16,695 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:16,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-05 13:02:16,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-05 13:02:16,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-05 13:02:16,697 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 20 states. [2019-09-05 13:02:16,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:16,799 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2019-09-05 13:02:16,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-05 13:02:16,799 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2019-09-05 13:02:16,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:16,800 INFO L225 Difference]: With dead ends: 48 [2019-09-05 13:02:16,800 INFO L226 Difference]: Without dead ends: 48 [2019-09-05 13:02:16,801 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-05 13:02:16,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-05 13:02:16,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-09-05 13:02:16,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-05 13:02:16,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2019-09-05 13:02:16,805 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 42 [2019-09-05 13:02:16,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:16,805 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2019-09-05 13:02:16,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-05 13:02:16,805 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2019-09-05 13:02:16,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-05 13:02:16,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:16,806 INFO L399 BasicCegarLoop]: trace histogram [18, 12, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:16,807 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:16,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:16,807 INFO L82 PathProgramCache]: Analyzing trace with hash -2055201995, now seen corresponding path program 12 times [2019-09-05 13:02:16,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:16,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:16,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:16,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:16,808 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:16,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:16,928 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 143 proven. 156 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-05 13:02:16,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:16,929 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:16,929 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:16,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:16,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:16,929 INFO 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-05 13:02:16,939 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:02:16,939 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:02:16,962 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:02:16,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:16,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-05 13:02:16,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:16,982 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 143 proven. 156 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-05 13:02:16,982 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:17,216 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 143 proven. 156 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-05 13:02:17,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:17,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2019-09-05 13:02:17,219 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:17,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-05 13:02:17,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-05 13:02:17,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-05 13:02:17,221 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 15 states. [2019-09-05 13:02:17,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:17,280 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2019-09-05 13:02:17,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-05 13:02:17,280 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2019-09-05 13:02:17,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:17,282 INFO L225 Difference]: With dead ends: 49 [2019-09-05 13:02:17,282 INFO L226 Difference]: Without dead ends: 49 [2019-09-05 13:02:17,283 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-05 13:02:17,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-05 13:02:17,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-09-05 13:02:17,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-05 13:02:17,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2019-09-05 13:02:17,287 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 46 [2019-09-05 13:02:17,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:17,287 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2019-09-05 13:02:17,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-05 13:02:17,287 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2019-09-05 13:02:17,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-05 13:02:17,288 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:17,288 INFO L399 BasicCegarLoop]: trace histogram [19, 13, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:17,289 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:17,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:17,289 INFO L82 PathProgramCache]: Analyzing trace with hash -561945934, now seen corresponding path program 13 times [2019-09-05 13:02:17,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:17,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:17,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:17,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:17,290 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:17,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:17,418 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 154 proven. 182 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-05 13:02:17,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:17,418 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:17,419 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:17,419 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:17,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:17,419 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:02:17,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:17,433 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:02:17,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:17,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-05 13:02:17,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:17,460 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 154 proven. 182 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-05 13:02:17,461 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:17,807 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 154 proven. 182 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-05 13:02:17,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:17,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2019-09-05 13:02:17,810 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:17,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-05 13:02:17,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-05 13:02:17,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-05 13:02:17,812 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 16 states. [2019-09-05 13:02:17,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:17,888 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2019-09-05 13:02:17,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-05 13:02:17,888 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 48 [2019-09-05 13:02:17,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:17,889 INFO L225 Difference]: With dead ends: 51 [2019-09-05 13:02:17,890 INFO L226 Difference]: Without dead ends: 51 [2019-09-05 13:02:17,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-05 13:02:17,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-05 13:02:17,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-09-05 13:02:17,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-05 13:02:17,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2019-09-05 13:02:17,895 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 48 [2019-09-05 13:02:17,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:17,895 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2019-09-05 13:02:17,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-05 13:02:17,896 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2019-09-05 13:02:17,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-05 13:02:17,896 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:17,897 INFO L399 BasicCegarLoop]: trace histogram [20, 14, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:17,897 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:17,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:17,897 INFO L82 PathProgramCache]: Analyzing trace with hash -61948177, now seen corresponding path program 14 times [2019-09-05 13:02:17,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:17,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:17,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:17,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:17,899 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:17,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:18,081 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 165 proven. 210 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-05 13:02:18,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:18,081 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:18,082 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:18,082 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:18,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:18,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:02:18,092 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:02:18,093 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:02:18,117 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-05 13:02:18,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:18,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-05 13:02:18,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:18,236 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 182 proven. 36 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-09-05 13:02:18,236 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:18,390 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 182 proven. 36 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-09-05 13:02:18,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:18,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 9, 9] total 31 [2019-09-05 13:02:18,393 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:18,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-05 13:02:18,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-05 13:02:18,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-05 13:02:18,394 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 24 states. [2019-09-05 13:02:18,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:18,510 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2019-09-05 13:02:18,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-05 13:02:18,510 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2019-09-05 13:02:18,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:18,511 INFO L225 Difference]: With dead ends: 56 [2019-09-05 13:02:18,511 INFO L226 Difference]: Without dead ends: 56 [2019-09-05 13:02:18,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-05 13:02:18,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-05 13:02:18,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-09-05 13:02:18,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-05 13:02:18,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2019-09-05 13:02:18,516 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 50 [2019-09-05 13:02:18,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:18,517 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2019-09-05 13:02:18,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-05 13:02:18,517 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2019-09-05 13:02:18,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-05 13:02:18,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:18,518 INFO L399 BasicCegarLoop]: trace histogram [22, 15, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:18,518 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:18,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:18,518 INFO L82 PathProgramCache]: Analyzing trace with hash -395003417, now seen corresponding path program 15 times [2019-09-05 13:02:18,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:18,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:18,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:18,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:18,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:18,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:18,672 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 208 proven. 240 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-05 13:02:18,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:18,672 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:18,672 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:18,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:18,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:18,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 13:02:18,683 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:02:18,683 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:02:18,705 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:02:18,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:18,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-05 13:02:18,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:18,716 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 208 proven. 240 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-05 13:02:18,716 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:19,108 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 208 proven. 240 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-05 13:02:19,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:19,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2019-09-05 13:02:19,114 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:19,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-05 13:02:19,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-05 13:02:19,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-05 13:02:19,116 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 18 states. [2019-09-05 13:02:19,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:19,196 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2019-09-05 13:02:19,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-05 13:02:19,197 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 54 [2019-09-05 13:02:19,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:19,198 INFO L225 Difference]: With dead ends: 57 [2019-09-05 13:02:19,198 INFO L226 Difference]: Without dead ends: 57 [2019-09-05 13:02:19,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-05 13:02:19,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-05 13:02:19,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-09-05 13:02:19,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-05 13:02:19,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2019-09-05 13:02:19,203 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 54 [2019-09-05 13:02:19,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:19,203 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2019-09-05 13:02:19,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-05 13:02:19,204 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2019-09-05 13:02:19,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-05 13:02:19,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:19,205 INFO L399 BasicCegarLoop]: trace histogram [23, 16, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:19,205 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:19,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:19,206 INFO L82 PathProgramCache]: Analyzing trace with hash 279524452, now seen corresponding path program 16 times [2019-09-05 13:02:19,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:19,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:19,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:19,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:19,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:19,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:19,439 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 221 proven. 272 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-05 13:02:19,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:19,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:19,440 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:19,440 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:19,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:19,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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:02:19,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:19,463 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:02:19,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:19,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-05 13:02:19,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:19,505 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 221 proven. 272 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-05 13:02:19,505 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:20,191 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 221 proven. 272 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-05 13:02:20,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:20,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 36 [2019-09-05 13:02:20,195 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:20,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-05 13:02:20,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-05 13:02:20,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-05 13:02:20,197 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 19 states. [2019-09-05 13:02:20,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:20,272 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2019-09-05 13:02:20,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-05 13:02:20,272 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 56 [2019-09-05 13:02:20,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:20,273 INFO L225 Difference]: With dead ends: 59 [2019-09-05 13:02:20,273 INFO L226 Difference]: Without dead ends: 59 [2019-09-05 13:02:20,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-05 13:02:20,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-05 13:02:20,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-09-05 13:02:20,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-05 13:02:20,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2019-09-05 13:02:20,278 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 56 [2019-09-05 13:02:20,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:20,278 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2019-09-05 13:02:20,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-05 13:02:20,278 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2019-09-05 13:02:20,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-05 13:02:20,279 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:20,279 INFO L399 BasicCegarLoop]: trace histogram [24, 17, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:20,279 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:20,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:20,280 INFO L82 PathProgramCache]: Analyzing trace with hash -39255135, now seen corresponding path program 17 times [2019-09-05 13:02:20,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:20,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:20,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:20,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:20,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:20,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:20,442 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 234 proven. 306 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-05 13:02:20,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:20,442 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:20,442 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:20,442 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:20,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:20,442 INFO 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-05 13:02:20,453 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:02:20,453 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:02:20,474 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-05 13:02:20,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:20,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-05 13:02:20,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:20,664 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 255 proven. 49 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2019-09-05 13:02:20,665 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:20,959 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 255 proven. 49 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2019-09-05 13:02:20,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:20,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10, 10] total 36 [2019-09-05 13:02:20,964 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:20,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-05 13:02:20,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-05 13:02:20,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-05 13:02:20,965 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 28 states. [2019-09-05 13:02:21,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:21,065 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2019-09-05 13:02:21,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-05 13:02:21,066 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 58 [2019-09-05 13:02:21,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:21,067 INFO L225 Difference]: With dead ends: 64 [2019-09-05 13:02:21,067 INFO L226 Difference]: Without dead ends: 64 [2019-09-05 13:02:21,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-05 13:02:21,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-05 13:02:21,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-09-05 13:02:21,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-05 13:02:21,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2019-09-05 13:02:21,077 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 58 [2019-09-05 13:02:21,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:21,078 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2019-09-05 13:02:21,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-05 13:02:21,078 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2019-09-05 13:02:21,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-05 13:02:21,079 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:21,079 INFO L399 BasicCegarLoop]: trace histogram [26, 18, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:21,081 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:21,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:21,081 INFO L82 PathProgramCache]: Analyzing trace with hash 923897113, now seen corresponding path program 18 times [2019-09-05 13:02:21,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:21,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:21,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:21,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:21,082 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:21,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:21,296 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 285 proven. 342 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-05 13:02:21,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:21,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:21,296 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:21,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:21,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:21,297 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:02:21,312 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:02:21,312 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:02:21,332 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:02:21,332 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:21,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-05 13:02:21,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:21,343 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 285 proven. 342 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-05 13:02:21,343 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:21,772 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 285 proven. 342 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-05 13:02:21,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:21,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2019-09-05 13:02:21,776 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:21,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-05 13:02:21,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-05 13:02:21,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-05 13:02:21,777 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand 21 states. [2019-09-05 13:02:21,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:21,844 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2019-09-05 13:02:21,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-05 13:02:21,844 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 62 [2019-09-05 13:02:21,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:21,845 INFO L225 Difference]: With dead ends: 65 [2019-09-05 13:02:21,846 INFO L226 Difference]: Without dead ends: 65 [2019-09-05 13:02:21,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-05 13:02:21,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-05 13:02:21,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-09-05 13:02:21,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-05 13:02:21,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2019-09-05 13:02:21,850 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 62 [2019-09-05 13:02:21,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:21,850 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2019-09-05 13:02:21,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-05 13:02:21,850 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2019-09-05 13:02:21,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-05 13:02:21,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:21,851 INFO L399 BasicCegarLoop]: trace histogram [27, 19, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:21,852 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:21,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:21,852 INFO L82 PathProgramCache]: Analyzing trace with hash -308921706, now seen corresponding path program 19 times [2019-09-05 13:02:21,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:21,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:21,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:21,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:21,853 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:22,086 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 300 proven. 380 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-05 13:02:22,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:22,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:22,087 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:22,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:22,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:22,088 INFO 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-05 13:02:22,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:22,112 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:02:22,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:22,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-05 13:02:22,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:22,141 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 300 proven. 380 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-05 13:02:22,141 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:22,576 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 300 proven. 380 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-05 13:02:22,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:22,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 42 [2019-09-05 13:02:22,580 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:22,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-05 13:02:22,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-05 13:02:22,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-05 13:02:22,582 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand 22 states. [2019-09-05 13:02:22,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:22,656 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2019-09-05 13:02:22,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-05 13:02:22,659 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 64 [2019-09-05 13:02:22,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:22,660 INFO L225 Difference]: With dead ends: 67 [2019-09-05 13:02:22,660 INFO L226 Difference]: Without dead ends: 67 [2019-09-05 13:02:22,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-05 13:02:22,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-05 13:02:22,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-09-05 13:02:22,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-05 13:02:22,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2019-09-05 13:02:22,664 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 64 [2019-09-05 13:02:22,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:22,664 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2019-09-05 13:02:22,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-05 13:02:22,665 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2019-09-05 13:02:22,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-05 13:02:22,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:22,666 INFO L399 BasicCegarLoop]: trace histogram [28, 20, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:22,666 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:22,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:22,666 INFO L82 PathProgramCache]: Analyzing trace with hash 363166931, now seen corresponding path program 20 times [2019-09-05 13:02:22,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:22,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:22,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:22,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:22,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:22,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:22,914 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 315 proven. 420 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-05 13:02:22,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:22,914 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:22,915 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:22,915 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:22,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:22,915 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 13:02:22,927 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:02:22,928 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:02:22,946 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-05 13:02:22,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:22,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-05 13:02:22,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:23,115 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 340 proven. 64 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-09-05 13:02:23,116 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:23,425 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 340 proven. 64 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-09-05 13:02:23,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:23,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 11, 11] total 41 [2019-09-05 13:02:23,428 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:23,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-05 13:02:23,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-05 13:02:23,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-05 13:02:23,430 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand 32 states. [2019-09-05 13:02:23,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:23,556 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2019-09-05 13:02:23,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-05 13:02:23,556 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 66 [2019-09-05 13:02:23,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:23,557 INFO L225 Difference]: With dead ends: 72 [2019-09-05 13:02:23,557 INFO L226 Difference]: Without dead ends: 72 [2019-09-05 13:02:23,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-05 13:02:23,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-05 13:02:23,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-09-05 13:02:23,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-05 13:02:23,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2019-09-05 13:02:23,561 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 66 [2019-09-05 13:02:23,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:23,562 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2019-09-05 13:02:23,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-05 13:02:23,562 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2019-09-05 13:02:23,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-05 13:02:23,563 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:23,563 INFO L399 BasicCegarLoop]: trace histogram [30, 21, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:23,563 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:23,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:23,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1309510453, now seen corresponding path program 21 times [2019-09-05 13:02:23,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:23,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:23,565 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:23,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:23,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:23,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:23,807 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 374 proven. 462 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-05 13:02:23,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:23,807 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:23,807 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:23,808 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:23,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:23,808 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 13:02:23,818 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:02:23,818 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:02:23,872 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:02:23,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:23,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-05 13:02:23,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:23,884 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 374 proven. 462 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-05 13:02:23,884 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:24,403 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 374 proven. 462 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-05 13:02:24,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:24,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 46 [2019-09-05 13:02:24,406 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:24,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-05 13:02:24,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-05 13:02:24,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-05 13:02:24,407 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand 24 states. [2019-09-05 13:02:24,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:24,496 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2019-09-05 13:02:24,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-05 13:02:24,496 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 70 [2019-09-05 13:02:24,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:24,497 INFO L225 Difference]: With dead ends: 73 [2019-09-05 13:02:24,497 INFO L226 Difference]: Without dead ends: 73 [2019-09-05 13:02:24,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-05 13:02:24,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-09-05 13:02:24,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-09-05 13:02:24,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-05 13:02:24,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2019-09-05 13:02:24,503 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 70 [2019-09-05 13:02:24,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:24,504 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2019-09-05 13:02:24,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-05 13:02:24,504 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2019-09-05 13:02:24,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-05 13:02:24,505 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:24,505 INFO L399 BasicCegarLoop]: trace histogram [31, 22, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:24,505 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:24,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:24,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1222923592, now seen corresponding path program 22 times [2019-09-05 13:02:24,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:24,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:24,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:24,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:24,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:24,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:24,774 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 391 proven. 506 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-05 13:02:24,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:24,774 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:24,774 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:24,774 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:24,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:24,775 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:02:24,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:24,785 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:02:24,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:24,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-05 13:02:24,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:24,820 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 391 proven. 506 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-05 13:02:24,820 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:25,414 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 391 proven. 506 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-05 13:02:25,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:25,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2019-09-05 13:02:25,417 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:25,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-05 13:02:25,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-05 13:02:25,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-05 13:02:25,419 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand 25 states. [2019-09-05 13:02:25,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:25,515 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2019-09-05 13:02:25,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-05 13:02:25,515 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 72 [2019-09-05 13:02:25,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:25,516 INFO L225 Difference]: With dead ends: 75 [2019-09-05 13:02:25,516 INFO L226 Difference]: Without dead ends: 75 [2019-09-05 13:02:25,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-05 13:02:25,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-05 13:02:25,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-09-05 13:02:25,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-05 13:02:25,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2019-09-05 13:02:25,520 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 72 [2019-09-05 13:02:25,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:25,520 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2019-09-05 13:02:25,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-05 13:02:25,521 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2019-09-05 13:02:25,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-05 13:02:25,521 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:25,521 INFO L399 BasicCegarLoop]: trace histogram [32, 23, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:25,522 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:25,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:25,522 INFO L82 PathProgramCache]: Analyzing trace with hash -354415995, now seen corresponding path program 23 times [2019-09-05 13:02:25,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:25,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:25,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:25,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:25,523 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:25,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 408 proven. 552 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-05 13:02:25,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:25,787 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:25,787 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:25,787 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:25,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:25,787 INFO 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-05 13:02:25,797 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:02:25,798 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:02:25,819 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-09-05 13:02:25,819 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:25,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-05 13:02:25,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:26,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 437 proven. 81 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2019-09-05 13:02:26,088 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:26,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 437 proven. 81 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2019-09-05 13:02:26,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:26,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 12, 12] total 46 [2019-09-05 13:02:26,372 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:26,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-05 13:02:26,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-05 13:02:26,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-05 13:02:26,374 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand 36 states. [2019-09-05 13:02:26,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:26,557 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2019-09-05 13:02:26,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-05 13:02:26,557 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 74 [2019-09-05 13:02:26,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:26,558 INFO L225 Difference]: With dead ends: 80 [2019-09-05 13:02:26,559 INFO L226 Difference]: Without dead ends: 80 [2019-09-05 13:02:26,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-05 13:02:26,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-05 13:02:26,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-09-05 13:02:26,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-05 13:02:26,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2019-09-05 13:02:26,563 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 74 [2019-09-05 13:02:26,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:26,563 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2019-09-05 13:02:26,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-05 13:02:26,563 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2019-09-05 13:02:26,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-05 13:02:26,564 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:26,564 INFO L399 BasicCegarLoop]: trace histogram [34, 24, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:26,564 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:26,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:26,565 INFO L82 PathProgramCache]: Analyzing trace with hash 456872189, now seen corresponding path program 24 times [2019-09-05 13:02:26,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:26,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:26,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:26,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:26,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:26,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:26,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 475 proven. 600 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-05 13:02:26,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:26,851 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:26,851 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:26,852 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:26,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:26,852 INFO 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-05 13:02:26,862 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:02:26,863 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:02:26,887 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:02:26,888 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:26,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-05 13:02:26,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:26,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 475 proven. 600 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-05 13:02:26,901 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:27,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 475 proven. 600 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-05 13:02:27,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:27,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 52 [2019-09-05 13:02:27,632 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:27,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-05 13:02:27,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-05 13:02:27,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:27,634 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 27 states. [2019-09-05 13:02:27,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:27,726 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2019-09-05 13:02:27,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-05 13:02:27,726 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 78 [2019-09-05 13:02:27,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:27,727 INFO L225 Difference]: With dead ends: 81 [2019-09-05 13:02:27,728 INFO L226 Difference]: Without dead ends: 81 [2019-09-05 13:02:27,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:27,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-09-05 13:02:27,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-09-05 13:02:27,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-05 13:02:27,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2019-09-05 13:02:27,733 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 78 [2019-09-05 13:02:27,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:27,733 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2019-09-05 13:02:27,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-05 13:02:27,733 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2019-09-05 13:02:27,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-05 13:02:27,734 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:27,734 INFO L399 BasicCegarLoop]: trace histogram [35, 25, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:27,734 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:27,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:27,735 INFO L82 PathProgramCache]: Analyzing trace with hash 2008507514, now seen corresponding path program 25 times [2019-09-05 13:02:27,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:27,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:27,736 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:27,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:27,736 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:27,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:28,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 494 proven. 650 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-05 13:02:28,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:28,046 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:28,046 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:28,046 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:28,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:28,046 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:02:28,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:28,058 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:02:28,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:28,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-05 13:02:28,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:28,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 494 proven. 650 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-05 13:02:28,094 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:28,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 494 proven. 650 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-05 13:02:28,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:28,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 52 [2019-09-05 13:02:28,768 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:28,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-05 13:02:28,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-05 13:02:28,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:28,771 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 28 states. [2019-09-05 13:02:28,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:28,888 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2019-09-05 13:02:28,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-05 13:02:28,889 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 80 [2019-09-05 13:02:28,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:28,890 INFO L225 Difference]: With dead ends: 83 [2019-09-05 13:02:28,890 INFO L226 Difference]: Without dead ends: 83 [2019-09-05 13:02:28,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 135 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:28,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-09-05 13:02:28,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-09-05 13:02:28,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-05 13:02:28,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2019-09-05 13:02:28,894 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 80 [2019-09-05 13:02:28,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:28,894 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2019-09-05 13:02:28,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-05 13:02:28,894 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2019-09-05 13:02:28,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-05 13:02:28,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:28,895 INFO L399 BasicCegarLoop]: trace histogram [36, 26, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:28,895 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:28,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:28,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1518564169, now seen corresponding path program 26 times [2019-09-05 13:02:28,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:28,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:28,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:28,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:28,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:29,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 513 proven. 702 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-05 13:02:29,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:29,344 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:29,345 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:29,345 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:29,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:29,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:02:29,372 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:02:29,372 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:02:29,411 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-09-05 13:02:29,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:29,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-05 13:02:29,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:29,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 546 proven. 100 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2019-09-05 13:02:29,787 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:30,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 546 proven. 100 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2019-09-05 13:02:30,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:30,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 13, 13] total 51 [2019-09-05 13:02:30,200 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:30,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-05 13:02:30,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-05 13:02:30,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-05 13:02:30,201 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand 40 states. [2019-09-05 13:02:30,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:30,414 INFO L93 Difference]: Finished difference Result 88 states and 100 transitions. [2019-09-05 13:02:30,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-05 13:02:30,415 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 82 [2019-09-05 13:02:30,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:30,416 INFO L225 Difference]: With dead ends: 88 [2019-09-05 13:02:30,416 INFO L226 Difference]: Without dead ends: 88 [2019-09-05 13:02:30,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-05 13:02:30,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-05 13:02:30,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-09-05 13:02:30,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-05 13:02:30,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2019-09-05 13:02:30,421 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 82 [2019-09-05 13:02:30,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:30,421 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2019-09-05 13:02:30,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-05 13:02:30,421 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2019-09-05 13:02:30,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-05 13:02:30,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:30,422 INFO L399 BasicCegarLoop]: trace histogram [38, 27, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:30,422 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:30,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:30,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1956118959, now seen corresponding path program 27 times [2019-09-05 13:02:30,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:30,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:30,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:30,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:30,424 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:30,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 588 proven. 756 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-05 13:02:30,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:30,855 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:30,855 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:30,856 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:30,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:30,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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:02:30,877 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:02:30,877 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:02:30,910 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:02:30,910 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:30,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-05 13:02:30,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:30,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 588 proven. 756 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-05 13:02:30,935 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:31,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 588 proven. 756 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (28)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 13:02:31,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:31,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 52 [2019-09-05 13:02:31,853 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:31,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-05 13:02:31,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-05 13:02:31,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:31,855 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand 30 states. [2019-09-05 13:02:31,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:31,934 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2019-09-05 13:02:31,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-05 13:02:31,935 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 86 [2019-09-05 13:02:31,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:31,936 INFO L225 Difference]: With dead ends: 89 [2019-09-05 13:02:31,936 INFO L226 Difference]: Without dead ends: 89 [2019-09-05 13:02:31,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 145 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:31,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-09-05 13:02:31,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-09-05 13:02:31,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-09-05 13:02:31,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2019-09-05 13:02:31,941 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 86 [2019-09-05 13:02:31,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:31,941 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2019-09-05 13:02:31,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-05 13:02:31,941 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2019-09-05 13:02:31,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-05 13:02:31,942 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:31,942 INFO L399 BasicCegarLoop]: trace histogram [39, 28, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:31,943 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:31,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:31,943 INFO L82 PathProgramCache]: Analyzing trace with hash 247154732, now seen corresponding path program 28 times [2019-09-05 13:02:31,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:31,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:31,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:31,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:31,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:32,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 609 proven. 812 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-05 13:02:32,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:32,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:32,427 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:32,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:32,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:32,428 INFO 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) [2019-09-05 13:02:32,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:32,443 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:02:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:32,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-05 13:02:32,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:32,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 609 proven. 812 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-05 13:02:32,502 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:33,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 609 proven. 812 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-05 13:02:33,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:33,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 52 [2019-09-05 13:02:33,457 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:33,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-05 13:02:33,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-05 13:02:33,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:33,466 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand 31 states. [2019-09-05 13:02:33,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:33,587 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2019-09-05 13:02:33,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-05 13:02:33,588 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 88 [2019-09-05 13:02:33,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:33,589 INFO L225 Difference]: With dead ends: 91 [2019-09-05 13:02:33,589 INFO L226 Difference]: Without dead ends: 91 [2019-09-05 13:02:33,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 148 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:33,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-05 13:02:33,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-09-05 13:02:33,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-05 13:02:33,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2019-09-05 13:02:33,594 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 88 [2019-09-05 13:02:33,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:33,594 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2019-09-05 13:02:33,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-05 13:02:33,594 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2019-09-05 13:02:33,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-05 13:02:33,595 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:33,595 INFO L399 BasicCegarLoop]: trace histogram [40, 29, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:33,595 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:33,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:33,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1389960343, now seen corresponding path program 29 times [2019-09-05 13:02:33,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:33,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:33,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:33,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:33,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:33,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:34,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 630 proven. 870 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-05 13:02:34,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:34,004 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:34,004 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:34,004 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:34,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:34,005 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:02:34,015 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:02:34,015 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:02:34,041 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-09-05 13:02:34,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:34,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-05 13:02:34,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:34,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 667 proven. 121 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2019-09-05 13:02:34,364 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:34,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 667 proven. 121 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2019-09-05 13:02:34,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:34,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 14, 14] total 56 [2019-09-05 13:02:34,873 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:34,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-05 13:02:34,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-05 13:02:34,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-05 13:02:34,875 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand 44 states. [2019-09-05 13:02:35,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:35,136 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2019-09-05 13:02:35,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-05 13:02:35,136 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 90 [2019-09-05 13:02:35,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:35,138 INFO L225 Difference]: With dead ends: 96 [2019-09-05 13:02:35,138 INFO L226 Difference]: Without dead ends: 96 [2019-09-05 13:02:35,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-05 13:02:35,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-05 13:02:35,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-09-05 13:02:35,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-05 13:02:35,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2019-09-05 13:02:35,141 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 90 [2019-09-05 13:02:35,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:35,142 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2019-09-05 13:02:35,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-05 13:02:35,142 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2019-09-05 13:02:35,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-05 13:02:35,143 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:35,143 INFO L399 BasicCegarLoop]: trace histogram [42, 30, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:35,143 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:35,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:35,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1027368673, now seen corresponding path program 30 times [2019-09-05 13:02:35,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:35,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:35,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:35,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:35,146 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:35,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:35,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 713 proven. 930 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-05 13:02:35,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:35,617 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:35,617 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:35,618 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:35,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:35,618 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:02:35,629 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:02:35,629 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:02:35,657 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:02:35,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:35,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-05 13:02:35,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:35,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 713 proven. 930 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-05 13:02:35,671 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:36,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 713 proven. 930 refuted. 0 times theorem prover too weak. 121 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-05 13:02:36,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:36,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 52 [2019-09-05 13:02:36,425 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:36,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-05 13:02:36,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-05 13:02:36,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:36,426 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 33 states. [2019-09-05 13:02:36,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:36,558 INFO L93 Difference]: Finished difference Result 97 states and 109 transitions. [2019-09-05 13:02:36,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-05 13:02:36,558 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 94 [2019-09-05 13:02:36,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:36,559 INFO L225 Difference]: With dead ends: 97 [2019-09-05 13:02:36,560 INFO L226 Difference]: Without dead ends: 97 [2019-09-05 13:02:36,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 158 SyntacticMatches, 12 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:36,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-09-05 13:02:36,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-09-05 13:02:36,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-05 13:02:36,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2019-09-05 13:02:36,564 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 94 [2019-09-05 13:02:36,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:36,564 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2019-09-05 13:02:36,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-05 13:02:36,564 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2019-09-05 13:02:36,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-05 13:02:36,565 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:36,565 INFO L399 BasicCegarLoop]: trace histogram [43, 31, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:36,565 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:36,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:36,566 INFO L82 PathProgramCache]: Analyzing trace with hash 539222110, now seen corresponding path program 31 times [2019-09-05 13:02:36,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:36,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:36,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:36,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:36,567 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:36,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:37,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 736 proven. 992 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-05 13:02:37,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:37,027 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:37,027 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:37,027 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:37,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:37,027 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:02:37,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:37,037 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:02:37,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:37,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-05 13:02:37,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:37,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 736 proven. 992 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-05 13:02:37,077 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:37,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 736 proven. 992 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-05 13:02:37,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:37,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 52 [2019-09-05 13:02:37,848 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:37,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-05 13:02:37,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-05 13:02:37,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:37,850 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand 34 states. [2019-09-05 13:02:37,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:37,979 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2019-09-05 13:02:37,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-05 13:02:37,979 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 96 [2019-09-05 13:02:37,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:37,980 INFO L225 Difference]: With dead ends: 99 [2019-09-05 13:02:37,980 INFO L226 Difference]: Without dead ends: 99 [2019-09-05 13:02:37,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 161 SyntacticMatches, 14 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:37,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-05 13:02:37,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-09-05 13:02:37,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-09-05 13:02:37,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2019-09-05 13:02:37,984 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 96 [2019-09-05 13:02:37,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:37,984 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2019-09-05 13:02:37,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-05 13:02:37,984 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2019-09-05 13:02:37,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-05 13:02:37,985 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:37,985 INFO L399 BasicCegarLoop]: trace histogram [44, 32, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:37,985 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:37,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:37,986 INFO L82 PathProgramCache]: Analyzing trace with hash -418189669, now seen corresponding path program 32 times [2019-09-05 13:02:37,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:37,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:37,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:37,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:37,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:37,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:38,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 759 proven. 1056 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-05 13:02:38,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:38,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:38,648 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:38,648 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:38,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:38,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:02:38,674 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:02:38,674 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:02:38,717 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-09-05 13:02:38,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:38,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-05 13:02:38,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:39,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 800 proven. 144 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2019-09-05 13:02:39,121 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:39,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 800 proven. 144 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2019-09-05 13:02:39,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:39,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 15, 15] total 61 [2019-09-05 13:02:39,598 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:39,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-05 13:02:39,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-05 13:02:39,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-09-05 13:02:39,599 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 48 states. [2019-09-05 13:02:39,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:39,843 INFO L93 Difference]: Finished difference Result 104 states and 118 transitions. [2019-09-05 13:02:39,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-05 13:02:39,844 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 98 [2019-09-05 13:02:39,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:39,845 INFO L225 Difference]: With dead ends: 104 [2019-09-05 13:02:39,845 INFO L226 Difference]: Without dead ends: 104 [2019-09-05 13:02:39,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-09-05 13:02:39,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-05 13:02:39,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-09-05 13:02:39,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-05 13:02:39,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2019-09-05 13:02:39,849 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 98 [2019-09-05 13:02:39,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:39,850 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2019-09-05 13:02:39,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-05 13:02:39,850 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2019-09-05 13:02:39,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-05 13:02:39,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:39,851 INFO L399 BasicCegarLoop]: trace histogram [46, 33, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:39,851 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:39,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:39,851 INFO L82 PathProgramCache]: Analyzing trace with hash 803496083, now seen corresponding path program 33 times [2019-09-05 13:02:39,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:39,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:39,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:39,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:39,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:39,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:40,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 850 proven. 1122 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-05 13:02:40,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:40,332 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:40,332 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:40,332 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:40,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:40,332 INFO 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-05 13:02:40,342 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:02:40,342 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:02:40,373 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:02:40,374 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:40,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-05 13:02:40,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:40,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 850 proven. 1122 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-05 13:02:40,394 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:41,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 850 proven. 1122 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-05 13:02:41,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:41,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 52 [2019-09-05 13:02:41,180 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:41,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-05 13:02:41,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-05 13:02:41,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:41,184 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand 36 states. [2019-09-05 13:02:41,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:41,320 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2019-09-05 13:02:41,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-05 13:02:41,321 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 102 [2019-09-05 13:02:41,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:41,322 INFO L225 Difference]: With dead ends: 105 [2019-09-05 13:02:41,322 INFO L226 Difference]: Without dead ends: 105 [2019-09-05 13:02:41,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 171 SyntacticMatches, 18 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:41,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-09-05 13:02:41,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-09-05 13:02:41,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-09-05 13:02:41,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2019-09-05 13:02:41,326 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 102 [2019-09-05 13:02:41,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:41,326 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2019-09-05 13:02:41,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-05 13:02:41,326 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2019-09-05 13:02:41,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-05 13:02:41,327 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:41,327 INFO L399 BasicCegarLoop]: trace histogram [47, 34, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:41,327 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:41,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:41,328 INFO L82 PathProgramCache]: Analyzing trace with hash -106099440, now seen corresponding path program 34 times [2019-09-05 13:02:41,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:41,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:41,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:41,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:41,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:41,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 875 proven. 1190 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-05 13:02:41,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:41,821 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:41,821 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:41,821 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:41,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:41,821 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:02:41,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:41,832 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:02:41,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:41,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-05 13:02:41,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:41,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 875 proven. 1190 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-05 13:02:41,878 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:42,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 875 proven. 1190 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (35)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 13:02:42,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:42,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 52 [2019-09-05 13:02:42,689 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:42,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-05 13:02:42,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-05 13:02:42,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:42,690 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand 37 states. [2019-09-05 13:02:42,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:42,802 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2019-09-05 13:02:42,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-05 13:02:42,802 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 104 [2019-09-05 13:02:42,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:42,803 INFO L225 Difference]: With dead ends: 107 [2019-09-05 13:02:42,804 INFO L226 Difference]: Without dead ends: 107 [2019-09-05 13:02:42,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 174 SyntacticMatches, 20 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:42,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-05 13:02:42,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-09-05 13:02:42,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-09-05 13:02:42,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 120 transitions. [2019-09-05 13:02:42,808 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 120 transitions. Word has length 104 [2019-09-05 13:02:42,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:42,808 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 120 transitions. [2019-09-05 13:02:42,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-05 13:02:42,808 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2019-09-05 13:02:42,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-05 13:02:42,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:42,809 INFO L399 BasicCegarLoop]: trace histogram [48, 35, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:42,809 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:42,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:42,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1945931341, now seen corresponding path program 35 times [2019-09-05 13:02:42,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:42,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:42,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:42,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:42,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:42,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:43,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 900 proven. 1260 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-05 13:02:43,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:43,588 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:43,589 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:43,589 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:43,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:43,590 INFO 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-05 13:02:43,604 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:02:43,605 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-05 13:02:43,642 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-09-05 13:02:43,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:43,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-05 13:02:43,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:44,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 945 proven. 169 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2019-09-05 13:02:44,088 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:44,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 945 proven. 169 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (36)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 13:02:44,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:44,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 16, 16] total 66 [2019-09-05 13:02:44,679 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:44,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-05 13:02:44,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-05 13:02:44,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-09-05 13:02:44,684 INFO L87 Difference]: Start difference. First operand 107 states and 120 transitions. Second operand 52 states. [2019-09-05 13:02:44,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:44,928 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2019-09-05 13:02:44,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-05 13:02:44,928 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 106 [2019-09-05 13:02:44,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:44,929 INFO L225 Difference]: With dead ends: 112 [2019-09-05 13:02:44,929 INFO L226 Difference]: Without dead ends: 112 [2019-09-05 13:02:44,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-09-05 13:02:44,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-05 13:02:44,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2019-09-05 13:02:44,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-09-05 13:02:44,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2019-09-05 13:02:44,933 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 106 [2019-09-05 13:02:44,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:44,933 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2019-09-05 13:02:44,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-05 13:02:44,933 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2019-09-05 13:02:44,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-05 13:02:44,934 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:44,934 INFO L399 BasicCegarLoop]: trace histogram [50, 36, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:44,934 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:44,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:44,935 INFO L82 PathProgramCache]: Analyzing trace with hash -2133602619, now seen corresponding path program 36 times [2019-09-05 13:02:44,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:44,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:44,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:44,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:44,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:44,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:45,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 999 proven. 1332 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-05 13:02:45,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:45,555 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:45,555 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:45,555 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:45,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:45,555 INFO 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-05 13:02:45,566 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:02:45,566 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:02:45,600 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:02:45,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:45,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-05 13:02:45,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:45,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 999 proven. 1332 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-05 13:02:45,620 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:46,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 999 proven. 1332 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (37)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 13:02:46,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:46,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 52 [2019-09-05 13:02:46,486 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:46,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-05 13:02:46,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-05 13:02:46,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:46,488 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand 39 states. [2019-09-05 13:02:46,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:46,618 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2019-09-05 13:02:46,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-05 13:02:46,619 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 110 [2019-09-05 13:02:46,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:46,620 INFO L225 Difference]: With dead ends: 113 [2019-09-05 13:02:46,620 INFO L226 Difference]: Without dead ends: 113 [2019-09-05 13:02:46,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 184 SyntacticMatches, 24 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:46,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-09-05 13:02:46,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-09-05 13:02:46,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-09-05 13:02:46,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2019-09-05 13:02:46,623 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 110 [2019-09-05 13:02:46,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:46,624 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2019-09-05 13:02:46,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-05 13:02:46,624 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2019-09-05 13:02:46,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-05 13:02:46,625 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:46,625 INFO L399 BasicCegarLoop]: trace histogram [51, 37, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:46,626 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:46,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:46,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1654304322, now seen corresponding path program 37 times [2019-09-05 13:02:46,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:46,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:46,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:46,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:46,627 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:46,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:47,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1026 proven. 1406 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-05 13:02:47,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:47,242 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:47,242 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:47,243 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:47,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:47,243 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:02:47,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:47,254 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:02:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:47,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-05 13:02:47,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:47,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1026 proven. 1406 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-05 13:02:47,310 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:48,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1026 proven. 1406 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-05 13:02:48,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:48,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 52 [2019-09-05 13:02:48,195 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:48,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-05 13:02:48,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-05 13:02:48,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:48,196 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand 40 states. [2019-09-05 13:02:48,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:48,311 INFO L93 Difference]: Finished difference Result 115 states and 129 transitions. [2019-09-05 13:02:48,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-05 13:02:48,312 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 112 [2019-09-05 13:02:48,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:48,313 INFO L225 Difference]: With dead ends: 115 [2019-09-05 13:02:48,313 INFO L226 Difference]: Without dead ends: 115 [2019-09-05 13:02:48,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 187 SyntacticMatches, 26 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:48,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-09-05 13:02:48,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-09-05 13:02:48,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-05 13:02:48,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2019-09-05 13:02:48,321 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 112 [2019-09-05 13:02:48,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:48,321 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2019-09-05 13:02:48,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-05 13:02:48,322 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2019-09-05 13:02:48,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-05 13:02:48,322 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:48,322 INFO L399 BasicCegarLoop]: trace histogram [52, 38, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:48,323 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:48,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:48,323 INFO L82 PathProgramCache]: Analyzing trace with hash -299392385, now seen corresponding path program 38 times [2019-09-05 13:02:48,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:48,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:48,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:48,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:48,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:48,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1053 proven. 1482 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-05 13:02:48,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:48,928 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:48,928 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:48,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:48,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:48,929 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:02:48,938 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:02:48,939 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:02:48,980 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-09-05 13:02:48,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:48,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-05 13:02:48,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:49,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1102 proven. 196 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2019-09-05 13:02:49,466 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:50,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1102 proven. 196 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2019-09-05 13:02:50,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:50,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 17, 17] total 71 [2019-09-05 13:02:50,109 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:50,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-05 13:02:50,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-05 13:02:50,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-09-05 13:02:50,110 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand 56 states. [2019-09-05 13:02:50,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:50,369 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2019-09-05 13:02:50,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-05 13:02:50,370 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 114 [2019-09-05 13:02:50,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:50,371 INFO L225 Difference]: With dead ends: 120 [2019-09-05 13:02:50,371 INFO L226 Difference]: Without dead ends: 120 [2019-09-05 13:02:50,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-09-05 13:02:50,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-05 13:02:50,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2019-09-05 13:02:50,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-05 13:02:50,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 134 transitions. [2019-09-05 13:02:50,375 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 134 transitions. Word has length 114 [2019-09-05 13:02:50,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:50,376 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 134 transitions. [2019-09-05 13:02:50,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-05 13:02:50,376 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 134 transitions. [2019-09-05 13:02:50,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-05 13:02:50,376 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:50,377 INFO L399 BasicCegarLoop]: trace histogram [54, 39, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:50,377 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:50,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:50,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1680436873, now seen corresponding path program 39 times [2019-09-05 13:02:50,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:50,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:50,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:50,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:50,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:50,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:51,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1160 proven. 1560 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-05 13:02:51,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:51,275 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:51,275 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:51,275 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:51,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:51,275 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 13:02:51,286 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:02:51,286 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:02:51,325 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:02:51,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:51,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-05 13:02:51,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:51,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1160 proven. 1560 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-05 13:02:51,343 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:52,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1160 proven. 1560 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-05 13:02:52,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:52,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 52 [2019-09-05 13:02:52,232 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:52,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-05 13:02:52,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-05 13:02:52,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:52,233 INFO L87 Difference]: Start difference. First operand 119 states and 134 transitions. Second operand 42 states. [2019-09-05 13:02:52,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:52,411 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2019-09-05 13:02:52,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-05 13:02:52,411 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 118 [2019-09-05 13:02:52,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:52,412 INFO L225 Difference]: With dead ends: 121 [2019-09-05 13:02:52,412 INFO L226 Difference]: Without dead ends: 121 [2019-09-05 13:02:52,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 197 SyntacticMatches, 30 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:52,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-09-05 13:02:52,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-09-05 13:02:52,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-09-05 13:02:52,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 136 transitions. [2019-09-05 13:02:52,416 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 136 transitions. Word has length 118 [2019-09-05 13:02:52,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:52,417 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 136 transitions. [2019-09-05 13:02:52,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-05 13:02:52,417 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 136 transitions. [2019-09-05 13:02:52,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-05 13:02:52,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:52,418 INFO L399 BasicCegarLoop]: trace histogram [55, 40, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:52,418 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:52,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:52,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1505272820, now seen corresponding path program 40 times [2019-09-05 13:02:52,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:52,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:52,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:52,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:52,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:53,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1189 proven. 1640 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-05 13:02:53,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:53,075 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:53,076 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:53,076 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:53,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:53,076 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 13:02:53,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:53,087 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:02:53,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:53,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-05 13:02:53,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:53,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1189 proven. 1640 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-05 13:02:53,140 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:53,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1189 proven. 1640 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-05 13:02:53,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:53,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 52 [2019-09-05 13:02:53,996 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:53,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-05 13:02:53,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-05 13:02:53,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:53,997 INFO L87 Difference]: Start difference. First operand 121 states and 136 transitions. Second operand 43 states. [2019-09-05 13:02:54,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:54,132 INFO L93 Difference]: Finished difference Result 123 states and 138 transitions. [2019-09-05 13:02:54,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-05 13:02:54,132 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 120 [2019-09-05 13:02:54,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:54,133 INFO L225 Difference]: With dead ends: 123 [2019-09-05 13:02:54,133 INFO L226 Difference]: Without dead ends: 123 [2019-09-05 13:02:54,134 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 200 SyntacticMatches, 32 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:54,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-09-05 13:02:54,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-09-05 13:02:54,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-09-05 13:02:54,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 138 transitions. [2019-09-05 13:02:54,137 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 138 transitions. Word has length 120 [2019-09-05 13:02:54,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:54,138 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 138 transitions. [2019-09-05 13:02:54,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-05 13:02:54,138 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 138 transitions. [2019-09-05 13:02:54,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-05 13:02:54,139 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:54,139 INFO L399 BasicCegarLoop]: trace histogram [56, 41, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:54,139 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:54,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:54,139 INFO L82 PathProgramCache]: Analyzing trace with hash 660605745, now seen corresponding path program 41 times [2019-09-05 13:02:54,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:54,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:54,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:54,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:54,140 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:54,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:54,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1218 proven. 1722 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-05 13:02:54,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:54,824 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:54,824 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:54,824 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:54,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:54,824 INFO 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-05 13:02:54,835 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:02:54,835 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:02:54,871 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-09-05 13:02:54,871 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:54,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-05 13:02:54,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:55,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1271 proven. 225 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-09-05 13:02:55,431 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:56,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1271 proven. 225 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-09-05 13:02:56,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:56,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 18, 18] total 76 [2019-09-05 13:02:56,153 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:56,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-05 13:02:56,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-05 13:02:56,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-09-05 13:02:56,155 INFO L87 Difference]: Start difference. First operand 123 states and 138 transitions. Second operand 60 states. [2019-09-05 13:02:56,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:56,444 INFO L93 Difference]: Finished difference Result 128 states and 145 transitions. [2019-09-05 13:02:56,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-05 13:02:56,445 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 122 [2019-09-05 13:02:56,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:56,446 INFO L225 Difference]: With dead ends: 128 [2019-09-05 13:02:56,446 INFO L226 Difference]: Without dead ends: 128 [2019-09-05 13:02:56,447 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-09-05 13:02:56,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-05 13:02:56,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-09-05 13:02:56,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-09-05 13:02:56,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 143 transitions. [2019-09-05 13:02:56,452 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 143 transitions. Word has length 122 [2019-09-05 13:02:56,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:56,452 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 143 transitions. [2019-09-05 13:02:56,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-05 13:02:56,453 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 143 transitions. [2019-09-05 13:02:56,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-05 13:02:56,454 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:56,454 INFO L399 BasicCegarLoop]: trace histogram [58, 42, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:56,455 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:56,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:56,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1648396457, now seen corresponding path program 42 times [2019-09-05 13:02:56,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:56,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:56,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:56,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:56,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:56,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:57,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1333 proven. 1806 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-05 13:02:57,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:57,222 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:57,222 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:57,222 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:57,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:57,222 INFO 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-05 13:02:57,232 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:02:57,233 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:02:57,269 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:02:57,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:57,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-05 13:02:57,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:57,290 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1333 proven. 1806 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-05 13:02:57,290 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:58,208 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1333 proven. 1806 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-05 13:02:58,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:58,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 52 [2019-09-05 13:02:58,211 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:58,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-05 13:02:58,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-05 13:02:58,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:58,212 INFO L87 Difference]: Start difference. First operand 127 states and 143 transitions. Second operand 45 states. [2019-09-05 13:02:58,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:58,395 INFO L93 Difference]: Finished difference Result 129 states and 145 transitions. [2019-09-05 13:02:58,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-05 13:02:58,395 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 126 [2019-09-05 13:02:58,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:58,397 INFO L225 Difference]: With dead ends: 129 [2019-09-05 13:02:58,397 INFO L226 Difference]: Without dead ends: 129 [2019-09-05 13:02:58,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 210 SyntacticMatches, 36 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:58,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-09-05 13:02:58,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-09-05 13:02:58,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-09-05 13:02:58,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 145 transitions. [2019-09-05 13:02:58,401 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 145 transitions. Word has length 126 [2019-09-05 13:02:58,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:58,401 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 145 transitions. [2019-09-05 13:02:58,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-05 13:02:58,401 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 145 transitions. [2019-09-05 13:02:58,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-05 13:02:58,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:58,402 INFO L399 BasicCegarLoop]: trace histogram [59, 43, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:02:58,402 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:58,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:58,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1398459942, now seen corresponding path program 43 times [2019-09-05 13:02:58,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:58,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:58,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:58,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:58,404 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:58,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:59,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1364 proven. 1892 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-05 13:02:59,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:59,176 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:59,176 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:59,176 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:59,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:59,176 INFO 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-05 13:02:59,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:59,191 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:02:59,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:59,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-05 13:02:59,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:59,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1364 proven. 1892 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-05 13:02:59,250 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:03:00,129 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1364 proven. 1892 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-05 13:03:00,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:03:00,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 52 [2019-09-05 13:03:00,133 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:03:00,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-05 13:03:00,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-05 13:03:00,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:03:00,135 INFO L87 Difference]: Start difference. First operand 129 states and 145 transitions. Second operand 46 states. [2019-09-05 13:03:00,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:03:00,278 INFO L93 Difference]: Finished difference Result 131 states and 147 transitions. [2019-09-05 13:03:00,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-05 13:03:00,283 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 128 [2019-09-05 13:03:00,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:03:00,284 INFO L225 Difference]: With dead ends: 131 [2019-09-05 13:03:00,284 INFO L226 Difference]: Without dead ends: 131 [2019-09-05 13:03:00,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 213 SyntacticMatches, 38 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:03:00,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-09-05 13:03:00,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-09-05 13:03:00,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-09-05 13:03:00,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 147 transitions. [2019-09-05 13:03:00,287 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 147 transitions. Word has length 128 [2019-09-05 13:03:00,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:03:00,287 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 147 transitions. [2019-09-05 13:03:00,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-05 13:03:00,288 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 147 transitions. [2019-09-05 13:03:00,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-05 13:03:00,288 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:03:00,288 INFO L399 BasicCegarLoop]: trace histogram [60, 44, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:03:00,289 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:03:00,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:03:00,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1727637603, now seen corresponding path program 44 times [2019-09-05 13:03:00,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:03:00,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:00,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:03:00,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:00,290 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:03:00,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:01,090 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1395 proven. 1980 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-05 13:03:01,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:01,091 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:03:01,091 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:03:01,091 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:03:01,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:01,091 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:03:01,102 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:03:01,102 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:03:01,137 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-09-05 13:03:01,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:03:01,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-05 13:03:01,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:03:02,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1452 proven. 256 refuted. 0 times theorem prover too weak. 1892 trivial. 0 not checked. [2019-09-05 13:03:02,077 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:03:02,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1452 proven. 256 refuted. 0 times theorem prover too weak. 1892 trivial. 0 not checked. [2019-09-05 13:03:02,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:03:02,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 19, 19] total 81 [2019-09-05 13:03:02,990 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:03:02,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-05 13:03:02,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-05 13:03:02,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-09-05 13:03:02,991 INFO L87 Difference]: Start difference. First operand 131 states and 147 transitions. Second operand 64 states. [2019-09-05 13:03:03,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:03:03,275 INFO L93 Difference]: Finished difference Result 136 states and 154 transitions. [2019-09-05 13:03:03,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-05 13:03:03,276 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 130 [2019-09-05 13:03:03,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:03:03,277 INFO L225 Difference]: With dead ends: 136 [2019-09-05 13:03:03,277 INFO L226 Difference]: Without dead ends: 136 [2019-09-05 13:03:03,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-09-05 13:03:03,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-05 13:03:03,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2019-09-05 13:03:03,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-05 13:03:03,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 152 transitions. [2019-09-05 13:03:03,280 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 152 transitions. Word has length 130 [2019-09-05 13:03:03,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:03:03,280 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 152 transitions. [2019-09-05 13:03:03,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-05 13:03:03,281 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 152 transitions. [2019-09-05 13:03:03,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-05 13:03:03,281 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:03:03,281 INFO L399 BasicCegarLoop]: trace histogram [62, 45, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:03:03,283 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:03:03,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:03:03,283 INFO L82 PathProgramCache]: Analyzing trace with hash -387083173, now seen corresponding path program 45 times [2019-09-05 13:03:03,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:03:03,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:03,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:03:03,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:03,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:03:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:04,183 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1518 proven. 2070 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-05 13:03:04,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:04,183 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:03:04,183 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:03:04,184 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:03:04,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:04,184 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 13:03:04,194 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:03:04,194 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:03:04,240 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:03:04,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:03:04,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-05 13:03:04,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:03:04,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1518 proven. 2070 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-05 13:03:04,264 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:03:05,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1518 proven. 2070 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-05 13:03:05,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:03:05,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 52 [2019-09-05 13:03:05,151 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:03:05,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-05 13:03:05,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-05 13:03:05,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:03:05,153 INFO L87 Difference]: Start difference. First operand 135 states and 152 transitions. Second operand 48 states. [2019-09-05 13:03:05,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:03:05,351 INFO L93 Difference]: Finished difference Result 137 states and 154 transitions. [2019-09-05 13:03:05,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-05 13:03:05,352 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 134 [2019-09-05 13:03:05,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:03:05,354 INFO L225 Difference]: With dead ends: 137 [2019-09-05 13:03:05,354 INFO L226 Difference]: Without dead ends: 137 [2019-09-05 13:03:05,354 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 223 SyntacticMatches, 42 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:03:05,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-09-05 13:03:05,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-09-05 13:03:05,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-09-05 13:03:05,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 154 transitions. [2019-09-05 13:03:05,358 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 154 transitions. Word has length 134 [2019-09-05 13:03:05,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:03:05,359 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 154 transitions. [2019-09-05 13:03:05,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-05 13:03:05,359 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 154 transitions. [2019-09-05 13:03:05,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-05 13:03:05,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:03:05,361 INFO L399 BasicCegarLoop]: trace histogram [63, 46, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:03:05,361 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:03:05,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:03:05,362 INFO L82 PathProgramCache]: Analyzing trace with hash -144896808, now seen corresponding path program 46 times [2019-09-05 13:03:05,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:03:05,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:05,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:03:05,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:05,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:03:05,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:06,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 1551 proven. 2162 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-05 13:03:06,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:06,470 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:03:06,471 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:03:06,471 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:03:06,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:06,471 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:03:06,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:03:06,480 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:03:06,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:06,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-05 13:03:06,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:03:06,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 1551 proven. 2162 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-05 13:03:06,534 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:03:07,429 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 1551 proven. 2162 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-05 13:03:07,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:03:07,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 52 [2019-09-05 13:03:07,432 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:03:07,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-05 13:03:07,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-05 13:03:07,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:03:07,432 INFO L87 Difference]: Start difference. First operand 137 states and 154 transitions. Second operand 49 states. [2019-09-05 13:03:07,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:03:07,595 INFO L93 Difference]: Finished difference Result 139 states and 156 transitions. [2019-09-05 13:03:07,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-05 13:03:07,596 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 136 [2019-09-05 13:03:07,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:03:07,597 INFO L225 Difference]: With dead ends: 139 [2019-09-05 13:03:07,597 INFO L226 Difference]: Without dead ends: 139 [2019-09-05 13:03:07,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 226 SyntacticMatches, 44 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:03:07,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-09-05 13:03:07,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-09-05 13:03:07,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-09-05 13:03:07,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 156 transitions. [2019-09-05 13:03:07,600 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 156 transitions. Word has length 136 [2019-09-05 13:03:07,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:03:07,601 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 156 transitions. [2019-09-05 13:03:07,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-05 13:03:07,601 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 156 transitions. [2019-09-05 13:03:07,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-05 13:03:07,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:03:07,602 INFO L399 BasicCegarLoop]: trace histogram [64, 47, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:03:07,602 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:03:07,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:03:07,602 INFO L82 PathProgramCache]: Analyzing trace with hash 667965973, now seen corresponding path program 47 times [2019-09-05 13:03:07,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:03:07,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:07,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:03:07,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:07,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:03:07,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:08,637 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 1584 proven. 2256 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-05 13:03:08,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:08,637 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:03:08,637 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:03:08,637 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:03:08,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:08,638 INFO 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-05 13:03:08,651 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:03:08,651 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:03:08,692 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-09-05 13:03:08,693 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:03:08,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-05 13:03:08,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:03:09,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 1645 proven. 289 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2019-09-05 13:03:09,385 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:03:10,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 1645 proven. 289 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2019-09-05 13:03:10,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:03:10,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 20, 20] total 86 [2019-09-05 13:03:10,362 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:03:10,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-05 13:03:10,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-05 13:03:10,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-09-05 13:03:10,364 INFO L87 Difference]: Start difference. First operand 139 states and 156 transitions. Second operand 68 states. [2019-09-05 13:03:10,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:03:10,708 INFO L93 Difference]: Finished difference Result 144 states and 163 transitions. [2019-09-05 13:03:10,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-05 13:03:10,709 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 138 [2019-09-05 13:03:10,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:03:10,710 INFO L225 Difference]: With dead ends: 144 [2019-09-05 13:03:10,710 INFO L226 Difference]: Without dead ends: 144 [2019-09-05 13:03:10,711 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-09-05 13:03:10,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-09-05 13:03:10,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2019-09-05 13:03:10,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-09-05 13:03:10,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 161 transitions. [2019-09-05 13:03:10,715 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 161 transitions. Word has length 138 [2019-09-05 13:03:10,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:03:10,715 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 161 transitions. [2019-09-05 13:03:10,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-05 13:03:10,715 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 161 transitions. [2019-09-05 13:03:10,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-05 13:03:10,716 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:03:10,717 INFO L399 BasicCegarLoop]: trace histogram [66, 48, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:03:10,717 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:03:10,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:03:10,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1237216115, now seen corresponding path program 48 times [2019-09-05 13:03:10,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:03:10,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:10,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:03:10,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:10,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:03:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:12,345 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 1715 proven. 2352 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-05 13:03:12,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:12,346 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:03:12,346 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:03:12,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:03:12,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:12,346 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:03:12,370 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:03:12,371 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:03:12,430 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:03:12,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:03:12,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-05 13:03:12,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:03:12,471 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 1715 proven. 2352 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-05 13:03:12,471 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:03:13,373 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 1715 proven. 2352 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-05 13:03:13,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:03:13,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 52 [2019-09-05 13:03:13,376 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:03:13,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-05 13:03:13,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-05 13:03:13,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:03:13,377 INFO L87 Difference]: Start difference. First operand 143 states and 161 transitions. Second operand 51 states. [2019-09-05 13:03:13,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:03:13,514 INFO L93 Difference]: Finished difference Result 145 states and 163 transitions. [2019-09-05 13:03:13,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-05 13:03:13,515 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 142 [2019-09-05 13:03:13,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:03:13,517 INFO L225 Difference]: With dead ends: 145 [2019-09-05 13:03:13,517 INFO L226 Difference]: Without dead ends: 145 [2019-09-05 13:03:13,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 236 SyntacticMatches, 48 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:03:13,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-09-05 13:03:13,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-09-05 13:03:13,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-09-05 13:03:13,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 163 transitions. [2019-09-05 13:03:13,522 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 163 transitions. Word has length 142 [2019-09-05 13:03:13,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:03:13,522 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 163 transitions. [2019-09-05 13:03:13,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-05 13:03:13,524 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 163 transitions. [2019-09-05 13:03:13,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-05 13:03:13,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:03:13,525 INFO L399 BasicCegarLoop]: trace histogram [67, 49, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:03:13,525 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:03:13,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:03:13,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1596145674, now seen corresponding path program 49 times [2019-09-05 13:03:13,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:03:13,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:13,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:03:13,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:13,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:03:13,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:14,570 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 1750 proven. 2450 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-05 13:03:14,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:14,570 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:03:14,570 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:03:14,570 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:03:14,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:14,570 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 13:03:14,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:03:14,581 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:03:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:14,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-05 13:03:14,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:03:14,640 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 1750 proven. 2450 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-05 13:03:14,640 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:03:15,529 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 1750 proven. 2450 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-05 13:03:15,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:03:15,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 52 [2019-09-05 13:03:15,531 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:03:15,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-05 13:03:15,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-05 13:03:15,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:03:15,533 INFO L87 Difference]: Start difference. First operand 145 states and 163 transitions. Second operand 52 states. [2019-09-05 13:03:15,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:03:15,724 INFO L93 Difference]: Finished difference Result 147 states and 165 transitions. [2019-09-05 13:03:15,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-05 13:03:15,724 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 144 [2019-09-05 13:03:15,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:03:15,726 INFO L225 Difference]: With dead ends: 147 [2019-09-05 13:03:15,726 INFO L226 Difference]: Without dead ends: 147 [2019-09-05 13:03:15,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 239 SyntacticMatches, 50 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:03:15,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-09-05 13:03:15,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2019-09-05 13:03:15,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-09-05 13:03:15,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 165 transitions. [2019-09-05 13:03:15,730 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 165 transitions. Word has length 144 [2019-09-05 13:03:15,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:03:15,731 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 165 transitions. [2019-09-05 13:03:15,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-05 13:03:15,731 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 165 transitions. [2019-09-05 13:03:15,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-05 13:03:15,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:03:15,732 INFO L399 BasicCegarLoop]: trace histogram [68, 50, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:03:15,732 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:03:15,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:03:15,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1447559239, now seen corresponding path program 50 times [2019-09-05 13:03:15,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:03:15,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:15,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:03:15,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:15,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:03:15,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:17,453 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:17,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:17,454 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:03:17,454 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:03:17,454 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:03:17,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:17,454 INFO 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-05 13:03:17,466 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:03:17,466 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:03:17,510 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-09-05 13:03:17,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:03:17,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-05 13:03:17,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:03:17,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 1850 proven. 324 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-05 13:03:17,524 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:03:18,521 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 1850 proven. 324 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-05 13:03:18,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:03:18,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 21, 21] total 90 [2019-09-05 13:03:18,524 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:03:18,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-05 13:03:18,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-05 13:03:18,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-09-05 13:03:18,526 INFO L87 Difference]: Start difference. First operand 147 states and 165 transitions. Second operand 71 states. [2019-09-05 13:03:19,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:03:19,013 INFO L93 Difference]: Finished difference Result 150 states and 170 transitions. [2019-09-05 13:03:19,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-05 13:03:19,013 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 146 [2019-09-05 13:03:19,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:03:19,015 INFO L225 Difference]: With dead ends: 150 [2019-09-05 13:03:19,015 INFO L226 Difference]: Without dead ends: 150 [2019-09-05 13:03:19,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-09-05 13:03:19,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-09-05 13:03:19,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-09-05 13:03:19,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-09-05 13:03:19,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 168 transitions. [2019-09-05 13:03:19,020 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 168 transitions. Word has length 146 [2019-09-05 13:03:19,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:03:19,021 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 168 transitions. [2019-09-05 13:03:19,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-05 13:03:19,021 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 168 transitions. [2019-09-05 13:03:19,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-05 13:03:19,023 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:03:19,023 INFO L399 BasicCegarLoop]: trace histogram [69, 50, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:03:19,024 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:03:19,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:03:19,024 INFO L82 PathProgramCache]: Analyzing trace with hash 638062466, now seen corresponding path program 51 times [2019-09-05 13:03:19,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:03:19,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:19,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:03:19,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:19,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:03:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:20,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:20,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:20,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:03:20,888 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:03:20,888 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:03:20,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:20,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 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-05 13:03:20,901 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:03:20,901 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:03:20,944 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:03:20,944 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:03:20,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-05 13:03:20,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:03:20,978 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:20,979 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:03:24,110 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:24,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:03:24,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 102 [2019-09-05 13:03:24,113 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:03:24,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-05 13:03:24,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-05 13:03:24,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:03:24,115 INFO L87 Difference]: Start difference. First operand 149 states and 168 transitions. Second operand 72 states. [2019-09-05 13:03:24,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:03:24,543 INFO L93 Difference]: Finished difference Result 152 states and 173 transitions. [2019-09-05 13:03:24,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-05 13:03:24,544 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 148 [2019-09-05 13:03:24,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:03:24,545 INFO L225 Difference]: With dead ends: 152 [2019-09-05 13:03:24,545 INFO L226 Difference]: Without dead ends: 152 [2019-09-05 13:03:24,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 227 SyntacticMatches, 40 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1980 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:03:24,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-05 13:03:24,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2019-09-05 13:03:24,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-09-05 13:03:24,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 171 transitions. [2019-09-05 13:03:24,549 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 171 transitions. Word has length 148 [2019-09-05 13:03:24,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:03:24,549 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 171 transitions. [2019-09-05 13:03:24,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-05 13:03:24,550 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 171 transitions. [2019-09-05 13:03:24,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-05 13:03:24,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:03:24,551 INFO L399 BasicCegarLoop]: trace histogram [70, 50, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:03:24,551 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:03:24,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:03:24,551 INFO L82 PathProgramCache]: Analyzing trace with hash 100744189, now seen corresponding path program 52 times [2019-09-05 13:03:24,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:03:24,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:24,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:03:24,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:24,552 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:03:24,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:26,363 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:26,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:26,364 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:03:26,364 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:03:26,364 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:03:26,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:26,364 INFO 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) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:03:26,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:03:26,373 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:03:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:26,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-05 13:03:26,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:03:26,450 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:26,451 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:03:29,690 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:29,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:03:29,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 102 [2019-09-05 13:03:29,693 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:03:29,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-05 13:03:29,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-05 13:03:29,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:03:29,695 INFO L87 Difference]: Start difference. First operand 151 states and 171 transitions. Second operand 73 states. [2019-09-05 13:03:30,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:03:30,158 INFO L93 Difference]: Finished difference Result 154 states and 176 transitions. [2019-09-05 13:03:30,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-05 13:03:30,158 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 150 [2019-09-05 13:03:30,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:03:30,159 INFO L225 Difference]: With dead ends: 154 [2019-09-05 13:03:30,159 INFO L226 Difference]: Without dead ends: 154 [2019-09-05 13:03:30,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 230 SyntacticMatches, 42 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2079 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:03:30,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-09-05 13:03:30,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2019-09-05 13:03:30,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-09-05 13:03:30,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 174 transitions. [2019-09-05 13:03:30,162 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 174 transitions. Word has length 150 [2019-09-05 13:03:30,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:03:30,162 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 174 transitions. [2019-09-05 13:03:30,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-05 13:03:30,163 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 174 transitions. [2019-09-05 13:03:30,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-05 13:03:30,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:03:30,163 INFO L399 BasicCegarLoop]: trace histogram [71, 50, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:03:30,163 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:03:30,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:03:30,164 INFO L82 PathProgramCache]: Analyzing trace with hash -866044488, now seen corresponding path program 53 times [2019-09-05 13:03:30,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:03:30,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:30,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:03:30,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:30,164 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:03:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:33,069 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:33,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:33,069 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:03:33,069 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:03:33,069 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:03:33,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:33,069 INFO 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-05 13:03:33,080 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:03:33,080 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:03:33,137 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-09-05 13:03:33,137 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:03:33,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-05 13:03:33,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:03:33,151 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2150 proven. 441 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-05 13:03:33,151 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:03:34,392 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2150 proven. 441 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-05 13:03:34,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:03:34,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 24, 24] total 96 [2019-09-05 13:03:34,395 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:03:34,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-05 13:03:34,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-05 13:03:34,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-09-05 13:03:34,397 INFO L87 Difference]: Start difference. First operand 153 states and 174 transitions. Second operand 74 states. [2019-09-05 13:03:34,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:03:34,856 INFO L93 Difference]: Finished difference Result 156 states and 179 transitions. [2019-09-05 13:03:34,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-05 13:03:34,856 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 152 [2019-09-05 13:03:34,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:03:34,857 INFO L225 Difference]: With dead ends: 156 [2019-09-05 13:03:34,857 INFO L226 Difference]: Without dead ends: 156 [2019-09-05 13:03:34,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-09-05 13:03:34,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-09-05 13:03:34,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2019-09-05 13:03:34,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-09-05 13:03:34,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 177 transitions. [2019-09-05 13:03:34,861 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 177 transitions. Word has length 152 [2019-09-05 13:03:34,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:03:34,862 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 177 transitions. [2019-09-05 13:03:34,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-05 13:03:34,862 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 177 transitions. [2019-09-05 13:03:34,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-05 13:03:34,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:03:34,863 INFO L399 BasicCegarLoop]: trace histogram [72, 50, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:03:34,863 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:03:34,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:03:34,863 INFO L82 PathProgramCache]: Analyzing trace with hash 2057940147, now seen corresponding path program 54 times [2019-09-05 13:03:34,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:03:34,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:34,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:03:34,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:34,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:03:34,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:36,769 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:36,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:36,769 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:03:36,769 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:03:36,769 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:03:36,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:36,769 INFO 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-05 13:03:36,780 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:03:36,780 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:03:36,825 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:03:36,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:03:36,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-05 13:03:36,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:03:36,861 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:36,861 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:03:40,096 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:40,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:03:40,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 102 [2019-09-05 13:03:40,099 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:03:40,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-05 13:03:40,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-05 13:03:40,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:03:40,101 INFO L87 Difference]: Start difference. First operand 155 states and 177 transitions. Second operand 75 states. [2019-09-05 13:03:40,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:03:40,505 INFO L93 Difference]: Finished difference Result 158 states and 182 transitions. [2019-09-05 13:03:40,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-05 13:03:40,506 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 154 [2019-09-05 13:03:40,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:03:40,506 INFO L225 Difference]: With dead ends: 158 [2019-09-05 13:03:40,507 INFO L226 Difference]: Without dead ends: 158 [2019-09-05 13:03:40,507 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 236 SyntacticMatches, 46 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2277 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:03:40,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-09-05 13:03:40,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2019-09-05 13:03:40,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-09-05 13:03:40,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 180 transitions. [2019-09-05 13:03:40,510 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 180 transitions. Word has length 154 [2019-09-05 13:03:40,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:03:40,510 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 180 transitions. [2019-09-05 13:03:40,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-05 13:03:40,511 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 180 transitions. [2019-09-05 13:03:40,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-05 13:03:40,511 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:03:40,512 INFO L399 BasicCegarLoop]: trace histogram [73, 50, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:03:40,512 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:03:40,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:03:40,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1196404498, now seen corresponding path program 55 times [2019-09-05 13:03:40,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:03:40,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:40,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:03:40,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:40,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:03:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:43,074 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:43,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:43,074 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:03:43,074 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:03:43,074 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:03:43,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:43,075 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 13:03:43,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:03:43,086 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:03:43,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:43,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 75 conjunts are in the unsatisfiable core [2019-09-05 13:03:43,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:03:43,176 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:43,176 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:03:46,425 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:46,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:03:46,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 102 [2019-09-05 13:03:46,428 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:03:46,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-05 13:03:46,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-05 13:03:46,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:03:46,429 INFO L87 Difference]: Start difference. First operand 157 states and 180 transitions. Second operand 76 states. [2019-09-05 13:03:46,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:03:46,907 INFO L93 Difference]: Finished difference Result 160 states and 185 transitions. [2019-09-05 13:03:46,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-05 13:03:46,907 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 156 [2019-09-05 13:03:46,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:03:46,908 INFO L225 Difference]: With dead ends: 160 [2019-09-05 13:03:46,908 INFO L226 Difference]: Without dead ends: 160 [2019-09-05 13:03:46,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 239 SyntacticMatches, 48 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2376 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:03:46,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-09-05 13:03:46,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2019-09-05 13:03:46,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-09-05 13:03:46,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 183 transitions. [2019-09-05 13:03:46,912 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 183 transitions. Word has length 156 [2019-09-05 13:03:46,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:03:46,912 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 183 transitions. [2019-09-05 13:03:46,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-05 13:03:46,912 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 183 transitions. [2019-09-05 13:03:46,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-05 13:03:46,913 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:03:46,913 INFO L399 BasicCegarLoop]: trace histogram [74, 50, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:03:46,913 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:03:46,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:03:46,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1885416855, now seen corresponding path program 56 times [2019-09-05 13:03:46,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:03:46,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:46,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:03:46,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:46,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:03:46,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:48,966 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:48,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:48,966 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:03:48,966 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:03:48,966 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:03:48,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:48,967 INFO 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-05 13:03:48,977 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:03:48,978 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:03:49,031 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-09-05 13:03:49,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:03:49,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-05 13:03:49,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:03:49,051 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2450 proven. 576 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-05 13:03:49,052 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:03:50,517 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2450 proven. 576 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-05 13:03:50,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:03:50,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 27, 27] total 102 [2019-09-05 13:03:50,520 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:03:50,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-05 13:03:50,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-05 13:03:50,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:03:50,522 INFO L87 Difference]: Start difference. First operand 159 states and 183 transitions. Second operand 77 states. [2019-09-05 13:03:50,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:03:50,979 INFO L93 Difference]: Finished difference Result 162 states and 188 transitions. [2019-09-05 13:03:50,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-05 13:03:50,980 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 158 [2019-09-05 13:03:50,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:03:50,981 INFO L225 Difference]: With dead ends: 162 [2019-09-05 13:03:50,981 INFO L226 Difference]: Without dead ends: 162 [2019-09-05 13:03:50,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:03:50,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-05 13:03:50,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2019-09-05 13:03:50,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-09-05 13:03:50,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 186 transitions. [2019-09-05 13:03:50,985 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 186 transitions. Word has length 158 [2019-09-05 13:03:50,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:03:50,985 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 186 transitions. [2019-09-05 13:03:50,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-05 13:03:50,986 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 186 transitions. [2019-09-05 13:03:50,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-05 13:03:50,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:03:50,987 INFO L399 BasicCegarLoop]: trace histogram [75, 50, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:03:50,987 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:03:50,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:03:50,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1693638948, now seen corresponding path program 57 times [2019-09-05 13:03:50,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:03:50,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:50,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:03:50,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:50,988 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:03:51,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:53,985 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:53,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:53,986 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:03:53,986 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:03:53,986 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:03:53,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:53,986 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 13:03:53,996 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:03:53,996 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:03:54,041 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:03:54,041 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:03:54,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-05 13:03:54,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:03:54,077 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:54,077 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:03:57,260 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:57,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:03:57,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 102 [2019-09-05 13:03:57,263 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:03:57,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-05 13:03:57,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-05 13:03:57,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:03:57,264 INFO L87 Difference]: Start difference. First operand 161 states and 186 transitions. Second operand 78 states. [2019-09-05 13:03:57,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:03:57,746 INFO L93 Difference]: Finished difference Result 164 states and 191 transitions. [2019-09-05 13:03:57,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-09-05 13:03:57,747 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 160 [2019-09-05 13:03:57,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:03:57,748 INFO L225 Difference]: With dead ends: 164 [2019-09-05 13:03:57,748 INFO L226 Difference]: Without dead ends: 164 [2019-09-05 13:03:57,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 245 SyntacticMatches, 52 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2574 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:03:57,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-09-05 13:03:57,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2019-09-05 13:03:57,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-09-05 13:03:57,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 189 transitions. [2019-09-05 13:03:57,752 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 189 transitions. Word has length 160 [2019-09-05 13:03:57,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:03:57,752 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 189 transitions. [2019-09-05 13:03:57,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-05 13:03:57,752 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 189 transitions. [2019-09-05 13:03:57,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-05 13:03:57,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:03:57,753 INFO L399 BasicCegarLoop]: trace histogram [76, 50, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:03:57,754 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:03:57,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:03:57,754 INFO L82 PathProgramCache]: Analyzing trace with hash 897461535, now seen corresponding path program 58 times [2019-09-05 13:03:57,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:03:57,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:57,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:03:57,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:57,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:03:57,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:59,951 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:03:59,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:59,951 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:03:59,951 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:03:59,951 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:03:59,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:59,951 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 13:03:59,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:03:59,961 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:04:00,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:04:00,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-05 13:04:00,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:04:00,029 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:04:00,029 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:04:03,185 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:04:03,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:04:03,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 102 [2019-09-05 13:04:03,189 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:04:03,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-05 13:04:03,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-05 13:04:03,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:03,191 INFO L87 Difference]: Start difference. First operand 163 states and 189 transitions. Second operand 79 states. [2019-09-05 13:04:03,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:04:03,723 INFO L93 Difference]: Finished difference Result 166 states and 194 transitions. [2019-09-05 13:04:03,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-05 13:04:03,723 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 162 [2019-09-05 13:04:03,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:04:03,724 INFO L225 Difference]: With dead ends: 166 [2019-09-05 13:04:03,724 INFO L226 Difference]: Without dead ends: 166 [2019-09-05 13:04:03,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 248 SyntacticMatches, 54 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2673 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:03,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-09-05 13:04:03,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2019-09-05 13:04:03,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-09-05 13:04:03,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 192 transitions. [2019-09-05 13:04:03,727 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 192 transitions. Word has length 162 [2019-09-05 13:04:03,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:04:03,728 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 192 transitions. [2019-09-05 13:04:03,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-05 13:04:03,728 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 192 transitions. [2019-09-05 13:04:03,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-05 13:04:03,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:04:03,729 INFO L399 BasicCegarLoop]: trace histogram [77, 50, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:04:03,729 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:04:03,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:04:03,730 INFO L82 PathProgramCache]: Analyzing trace with hash 275146330, now seen corresponding path program 59 times [2019-09-05 13:04:03,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:04:03,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:03,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:04:03,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:03,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:04:03,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:04:06,071 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:04:06,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:06,071 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:04:06,071 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:04:06,072 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:04:06,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:06,072 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 13:04:06,082 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:04:06,082 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:04:06,143 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2019-09-05 13:04:06,144 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:04:06,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-05 13:04:06,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:04:06,161 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2750 proven. 729 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-05 13:04:06,161 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:04:07,796 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2750 proven. 729 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-05 13:04:07,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:04:07,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 30, 30] total 102 [2019-09-05 13:04:07,799 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:04:07,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-09-05 13:04:07,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-09-05 13:04:07,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:07,801 INFO L87 Difference]: Start difference. First operand 165 states and 192 transitions. Second operand 80 states. [2019-09-05 13:04:08,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:04:08,340 INFO L93 Difference]: Finished difference Result 168 states and 197 transitions. [2019-09-05 13:04:08,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-09-05 13:04:08,340 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 164 [2019-09-05 13:04:08,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:04:08,341 INFO L225 Difference]: With dead ends: 168 [2019-09-05 13:04:08,341 INFO L226 Difference]: Without dead ends: 168 [2019-09-05 13:04:08,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 301 SyntacticMatches, 6 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:08,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-05 13:04:08,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2019-09-05 13:04:08,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-05 13:04:08,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 195 transitions. [2019-09-05 13:04:08,345 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 195 transitions. Word has length 164 [2019-09-05 13:04:08,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:04:08,345 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 195 transitions. [2019-09-05 13:04:08,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-09-05 13:04:08,345 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 195 transitions. [2019-09-05 13:04:08,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-05 13:04:08,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:04:08,346 INFO L399 BasicCegarLoop]: trace histogram [78, 50, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:04:08,347 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:04:08,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:04:08,347 INFO L82 PathProgramCache]: Analyzing trace with hash -769311531, now seen corresponding path program 60 times [2019-09-05 13:04:08,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:04:08,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:08,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:04:08,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:08,348 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:04:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:04:10,916 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:04:10,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:10,917 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:04:10,917 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:04:10,917 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:04:10,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:10,917 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:04:10,928 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:04:10,928 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:04:10,980 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:04:10,980 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:04:10,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-05 13:04:10,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:04:11,018 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:04:11,018 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:04:14,389 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:04:14,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:04:14,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 102 [2019-09-05 13:04:14,392 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:04:14,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-05 13:04:14,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-05 13:04:14,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:14,395 INFO L87 Difference]: Start difference. First operand 167 states and 195 transitions. Second operand 81 states. [2019-09-05 13:04:14,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:04:14,939 INFO L93 Difference]: Finished difference Result 170 states and 200 transitions. [2019-09-05 13:04:14,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-05 13:04:14,940 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 166 [2019-09-05 13:04:14,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:04:14,941 INFO L225 Difference]: With dead ends: 170 [2019-09-05 13:04:14,941 INFO L226 Difference]: Without dead ends: 170 [2019-09-05 13:04:14,941 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 254 SyntacticMatches, 58 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2871 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:14,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-09-05 13:04:14,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2019-09-05 13:04:14,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-09-05 13:04:14,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 198 transitions. [2019-09-05 13:04:14,944 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 198 transitions. Word has length 166 [2019-09-05 13:04:14,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:04:14,945 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 198 transitions. [2019-09-05 13:04:14,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-05 13:04:14,945 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 198 transitions. [2019-09-05 13:04:14,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-05 13:04:14,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:04:14,946 INFO L399 BasicCegarLoop]: trace histogram [79, 50, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:04:14,946 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:04:14,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:04:14,946 INFO L82 PathProgramCache]: Analyzing trace with hash 529031312, now seen corresponding path program 61 times [2019-09-05 13:04:14,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:04:14,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:14,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:04:14,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:14,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:04:14,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:04:17,739 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:04:17,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:17,739 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:04:17,739 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:04:17,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:04:17,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:17,740 INFO 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-05 13:04:17,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:04:17,751 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:04:17,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:04:17,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 81 conjunts are in the unsatisfiable core [2019-09-05 13:04:17,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:04:17,842 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:04:17,842 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:04:21,240 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (62)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 13:04:21,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:04:21,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 102 [2019-09-05 13:04:21,244 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:04:21,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-05 13:04:21,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-05 13:04:21,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:21,248 INFO L87 Difference]: Start difference. First operand 169 states and 198 transitions. Second operand 82 states. [2019-09-05 13:04:21,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:04:21,764 INFO L93 Difference]: Finished difference Result 172 states and 203 transitions. [2019-09-05 13:04:21,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-09-05 13:04:21,765 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 168 [2019-09-05 13:04:21,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:04:21,766 INFO L225 Difference]: With dead ends: 172 [2019-09-05 13:04:21,766 INFO L226 Difference]: Without dead ends: 172 [2019-09-05 13:04:21,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 257 SyntacticMatches, 60 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2970 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:21,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-09-05 13:04:21,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2019-09-05 13:04:21,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-09-05 13:04:21,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 201 transitions. [2019-09-05 13:04:21,770 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 201 transitions. Word has length 168 [2019-09-05 13:04:21,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:04:21,770 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 201 transitions. [2019-09-05 13:04:21,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-05 13:04:21,770 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 201 transitions. [2019-09-05 13:04:21,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-05 13:04:21,771 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:04:21,771 INFO L399 BasicCegarLoop]: trace histogram [80, 50, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:04:21,772 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:04:21,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:04:21,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1598979701, now seen corresponding path program 62 times [2019-09-05 13:04:21,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:04:21,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:21,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:04:21,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:21,773 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:04:21,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:04:24,066 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:04:24,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:24,067 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:04:24,067 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:04:24,067 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:04:24,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:24,067 INFO 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-05 13:04:24,079 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:04:24,079 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:04:24,147 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 62 check-sat command(s) [2019-09-05 13:04:24,147 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:04:24,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-05 13:04:24,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:04:24,165 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3050 proven. 900 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-05 13:04:24,165 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:04:25,903 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3050 proven. 900 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-05 13:04:25,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:04:25,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 33, 33] total 102 [2019-09-05 13:04:25,906 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:04:25,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-09-05 13:04:25,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-09-05 13:04:25,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:25,908 INFO L87 Difference]: Start difference. First operand 171 states and 201 transitions. Second operand 83 states. [2019-09-05 13:04:26,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:04:26,474 INFO L93 Difference]: Finished difference Result 174 states and 206 transitions. [2019-09-05 13:04:26,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-05 13:04:26,474 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 170 [2019-09-05 13:04:26,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:04:26,475 INFO L225 Difference]: With dead ends: 174 [2019-09-05 13:04:26,475 INFO L226 Difference]: Without dead ends: 174 [2019-09-05 13:04:26,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 310 SyntacticMatches, 12 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:26,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-09-05 13:04:26,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2019-09-05 13:04:26,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-09-05 13:04:26,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 204 transitions. [2019-09-05 13:04:26,478 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 204 transitions. Word has length 170 [2019-09-05 13:04:26,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:04:26,479 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 204 transitions. [2019-09-05 13:04:26,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-09-05 13:04:26,479 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 204 transitions. [2019-09-05 13:04:26,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-05 13:04:26,480 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:04:26,480 INFO L399 BasicCegarLoop]: trace histogram [81, 50, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:04:26,480 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:04:26,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:04:26,481 INFO L82 PathProgramCache]: Analyzing trace with hash 2081836998, now seen corresponding path program 63 times [2019-09-05 13:04:26,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:04:26,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:26,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:04:26,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:26,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:04:26,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:04:29,224 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:04:29,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:29,225 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:04:29,225 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:04:29,225 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:04:29,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:29,225 INFO 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-05 13:04:29,235 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:04:29,235 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:04:29,284 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:04:29,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:04:29,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 83 conjunts are in the unsatisfiable core [2019-09-05 13:04:29,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:04:29,311 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:04:29,311 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:04:32,573 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:04:32,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:04:32,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 102 [2019-09-05 13:04:32,576 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:04:32,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-09-05 13:04:32,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-09-05 13:04:32,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:32,577 INFO L87 Difference]: Start difference. First operand 173 states and 204 transitions. Second operand 84 states. [2019-09-05 13:04:33,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:04:33,174 INFO L93 Difference]: Finished difference Result 176 states and 209 transitions. [2019-09-05 13:04:33,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-05 13:04:33,174 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 172 [2019-09-05 13:04:33,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:04:33,175 INFO L225 Difference]: With dead ends: 176 [2019-09-05 13:04:33,175 INFO L226 Difference]: Without dead ends: 176 [2019-09-05 13:04:33,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 263 SyntacticMatches, 64 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3168 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:33,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-09-05 13:04:33,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2019-09-05 13:04:33,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-05 13:04:33,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 207 transitions. [2019-09-05 13:04:33,179 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 207 transitions. Word has length 172 [2019-09-05 13:04:33,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:04:33,179 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 207 transitions. [2019-09-05 13:04:33,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-09-05 13:04:33,180 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 207 transitions. [2019-09-05 13:04:33,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-05 13:04:33,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:04:33,181 INFO L399 BasicCegarLoop]: trace histogram [82, 50, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:04:33,181 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:04:33,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:04:33,181 INFO L82 PathProgramCache]: Analyzing trace with hash 293632833, now seen corresponding path program 64 times [2019-09-05 13:04:33,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:04:33,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:33,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:04:33,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:33,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:04:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:04:35,615 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:04:35,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:35,615 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:04:35,615 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:04:35,615 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:04:35,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:35,615 INFO 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-05 13:04:35,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:04:35,626 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:04:35,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:04:35,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 84 conjunts are in the unsatisfiable core [2019-09-05 13:04:35,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:04:35,703 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:04:35,703 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:04:38,976 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:04:38,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:04:38,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 102 [2019-09-05 13:04:38,979 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:04:38,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-09-05 13:04:38,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-09-05 13:04:38,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:38,981 INFO L87 Difference]: Start difference. First operand 175 states and 207 transitions. Second operand 85 states. [2019-09-05 13:04:39,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:04:39,612 INFO L93 Difference]: Finished difference Result 178 states and 212 transitions. [2019-09-05 13:04:39,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-09-05 13:04:39,612 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 174 [2019-09-05 13:04:39,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:04:39,613 INFO L225 Difference]: With dead ends: 178 [2019-09-05 13:04:39,613 INFO L226 Difference]: Without dead ends: 178 [2019-09-05 13:04:39,614 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 266 SyntacticMatches, 66 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3267 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:39,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-09-05 13:04:39,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2019-09-05 13:04:39,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-05 13:04:39,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 210 transitions. [2019-09-05 13:04:39,617 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 210 transitions. Word has length 174 [2019-09-05 13:04:39,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:04:39,617 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 210 transitions. [2019-09-05 13:04:39,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-09-05 13:04:39,617 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 210 transitions. [2019-09-05 13:04:39,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-05 13:04:39,618 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:04:39,618 INFO L399 BasicCegarLoop]: trace histogram [83, 50, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:04:39,619 INFO L418 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:04:39,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:04:39,619 INFO L82 PathProgramCache]: Analyzing trace with hash -183651332, now seen corresponding path program 65 times [2019-09-05 13:04:39,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:04:39,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:39,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:04:39,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:39,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:04:39,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:04:42,128 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:04:42,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:42,128 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:04:42,128 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:04:42,128 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:04:42,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:42,129 INFO 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-05 13:04:42,140 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:04:42,140 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:04:42,220 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 68 check-sat command(s) [2019-09-05 13:04:42,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:04:42,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-05 13:04:42,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:04:42,239 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 3350 proven. 1089 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-05 13:04:42,239 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:04:44,148 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 3350 proven. 1089 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-05 13:04:44,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:04:44,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 36, 36] total 102 [2019-09-05 13:04:44,152 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:04:44,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-09-05 13:04:44,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-09-05 13:04:44,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:44,154 INFO L87 Difference]: Start difference. First operand 177 states and 210 transitions. Second operand 86 states. [2019-09-05 13:04:44,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:04:44,666 INFO L93 Difference]: Finished difference Result 180 states and 215 transitions. [2019-09-05 13:04:44,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-09-05 13:04:44,667 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 176 [2019-09-05 13:04:44,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:04:44,668 INFO L225 Difference]: With dead ends: 180 [2019-09-05 13:04:44,668 INFO L226 Difference]: Without dead ends: 180 [2019-09-05 13:04:44,668 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 319 SyntacticMatches, 18 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:44,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-05 13:04:44,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 179. [2019-09-05 13:04:44,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-09-05 13:04:44,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 213 transitions. [2019-09-05 13:04:44,671 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 213 transitions. Word has length 176 [2019-09-05 13:04:44,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:04:44,671 INFO L475 AbstractCegarLoop]: Abstraction has 179 states and 213 transitions. [2019-09-05 13:04:44,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-09-05 13:04:44,672 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 213 transitions. [2019-09-05 13:04:44,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-05 13:04:44,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:04:44,673 INFO L399 BasicCegarLoop]: trace histogram [84, 50, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:04:44,673 INFO L418 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:04:44,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:04:44,673 INFO L82 PathProgramCache]: Analyzing trace with hash 707766775, now seen corresponding path program 66 times [2019-09-05 13:04:44,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:04:44,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:44,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:04:44,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:44,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:04:44,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:04:47,218 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:04:47,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:47,219 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:04:47,219 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:04:47,219 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:04:47,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:47,219 INFO 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-05 13:04:47,230 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:04:47,230 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:04:47,283 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:04:47,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:04:47,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-05 13:04:47,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:04:47,321 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:04:47,321 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:04:50,617 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:04:50,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:04:50,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 102 [2019-09-05 13:04:50,620 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:04:50,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-09-05 13:04:50,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-09-05 13:04:50,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:50,621 INFO L87 Difference]: Start difference. First operand 179 states and 213 transitions. Second operand 87 states. [2019-09-05 13:04:51,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:04:51,241 INFO L93 Difference]: Finished difference Result 182 states and 218 transitions. [2019-09-05 13:04:51,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-05 13:04:51,242 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 178 [2019-09-05 13:04:51,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:04:51,243 INFO L225 Difference]: With dead ends: 182 [2019-09-05 13:04:51,243 INFO L226 Difference]: Without dead ends: 182 [2019-09-05 13:04:51,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 272 SyntacticMatches, 70 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3465 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:51,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-05 13:04:51,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2019-09-05 13:04:51,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-09-05 13:04:51,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 216 transitions. [2019-09-05 13:04:51,246 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 216 transitions. Word has length 178 [2019-09-05 13:04:51,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:04:51,247 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 216 transitions. [2019-09-05 13:04:51,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-09-05 13:04:51,247 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 216 transitions. [2019-09-05 13:04:51,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-05 13:04:51,248 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:04:51,248 INFO L399 BasicCegarLoop]: trace histogram [85, 50, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:04:51,248 INFO L418 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:04:51,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:04:51,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1632891598, now seen corresponding path program 67 times [2019-09-05 13:04:51,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:04:51,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:51,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:04:51,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:51,250 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:04:51,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:04:53,796 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:04:53,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:53,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:04:53,796 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:04:53,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:04:53,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:53,797 INFO 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-05 13:04:53,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:04:53,806 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:04:53,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:04:53,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 87 conjunts are in the unsatisfiable core [2019-09-05 13:04:53,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:04:53,901 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:04:53,901 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:04:57,303 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:04:57,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:04:57,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 102 [2019-09-05 13:04:57,306 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:04:57,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-09-05 13:04:57,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-09-05 13:04:57,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:57,308 INFO L87 Difference]: Start difference. First operand 181 states and 216 transitions. Second operand 88 states. [2019-09-05 13:04:57,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:04:57,886 INFO L93 Difference]: Finished difference Result 184 states and 221 transitions. [2019-09-05 13:04:57,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-09-05 13:04:57,887 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 180 [2019-09-05 13:04:57,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:04:57,890 INFO L225 Difference]: With dead ends: 184 [2019-09-05 13:04:57,890 INFO L226 Difference]: Without dead ends: 184 [2019-09-05 13:04:57,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 275 SyntacticMatches, 72 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3564 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:57,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-09-05 13:04:57,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2019-09-05 13:04:57,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-09-05 13:04:57,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 219 transitions. [2019-09-05 13:04:57,894 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 219 transitions. Word has length 180 [2019-09-05 13:04:57,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:04:57,894 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 219 transitions. [2019-09-05 13:04:57,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-09-05 13:04:57,895 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 219 transitions. [2019-09-05 13:04:57,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-05 13:04:57,896 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:04:57,896 INFO L399 BasicCegarLoop]: trace histogram [86, 50, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:04:57,896 INFO L418 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:04:57,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:04:57,897 INFO L82 PathProgramCache]: Analyzing trace with hash -442724947, now seen corresponding path program 68 times [2019-09-05 13:04:57,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:04:57,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:57,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:04:57,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:57,898 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:04:57,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:05:00,533 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:00,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:00,533 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:05:00,533 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:05:00,533 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:05:00,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:00,533 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 13:05:00,545 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:05:00,545 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:05:00,632 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 74 check-sat command(s) [2019-09-05 13:05:00,633 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:05:00,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-05 13:05:00,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:05:00,652 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3650 proven. 1296 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-05 13:05:00,652 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:05:02,685 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3650 proven. 1296 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-05 13:05:02,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:05:02,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 39, 39] total 102 [2019-09-05 13:05:02,689 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:05:02,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-09-05 13:05:02,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-09-05 13:05:02,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:05:02,690 INFO L87 Difference]: Start difference. First operand 183 states and 219 transitions. Second operand 89 states. [2019-09-05 13:05:03,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:05:03,338 INFO L93 Difference]: Finished difference Result 186 states and 224 transitions. [2019-09-05 13:05:03,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-05 13:05:03,339 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 182 [2019-09-05 13:05:03,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:05:03,340 INFO L225 Difference]: With dead ends: 186 [2019-09-05 13:05:03,340 INFO L226 Difference]: Without dead ends: 186 [2019-09-05 13:05:03,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 328 SyntacticMatches, 24 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:05:03,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-09-05 13:05:03,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2019-09-05 13:05:03,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-09-05 13:05:03,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 222 transitions. [2019-09-05 13:05:03,342 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 222 transitions. Word has length 182 [2019-09-05 13:05:03,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:05:03,342 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 222 transitions. [2019-09-05 13:05:03,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-09-05 13:05:03,343 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 222 transitions. [2019-09-05 13:05:03,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-05 13:05:03,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:05:03,343 INFO L399 BasicCegarLoop]: trace histogram [87, 50, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:05:03,344 INFO L418 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:05:03,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:05:03,344 INFO L82 PathProgramCache]: Analyzing trace with hash 846125928, now seen corresponding path program 69 times [2019-09-05 13:05:03,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:05:03,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:03,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:05:03,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:03,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:05:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:05:06,037 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:06,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:06,037 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:05:06,037 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:05:06,038 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:05:06,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:06,038 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 13:05:06,048 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:05:06,048 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:05:06,101 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:05:06,101 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:05:06,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 89 conjunts are in the unsatisfiable core [2019-09-05 13:05:06,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:05:06,131 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:06,131 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:05:09,443 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:09,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:05:09,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 102 [2019-09-05 13:05:09,446 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:05:09,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-09-05 13:05:09,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-09-05 13:05:09,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:05:09,448 INFO L87 Difference]: Start difference. First operand 185 states and 222 transitions. Second operand 90 states. [2019-09-05 13:05:10,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:05:10,052 INFO L93 Difference]: Finished difference Result 188 states and 227 transitions. [2019-09-05 13:05:10,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-05 13:05:10,052 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 184 [2019-09-05 13:05:10,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:05:10,054 INFO L225 Difference]: With dead ends: 188 [2019-09-05 13:05:10,054 INFO L226 Difference]: Without dead ends: 188 [2019-09-05 13:05:10,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 281 SyntacticMatches, 76 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3762 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:05:10,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-05 13:05:10,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 187. [2019-09-05 13:05:10,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-09-05 13:05:10,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 225 transitions. [2019-09-05 13:05:10,057 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 225 transitions. Word has length 184 [2019-09-05 13:05:10,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:05:10,058 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 225 transitions. [2019-09-05 13:05:10,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-09-05 13:05:10,058 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 225 transitions. [2019-09-05 13:05:10,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-05 13:05:10,059 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:05:10,059 INFO L399 BasicCegarLoop]: trace histogram [88, 50, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:05:10,059 INFO L418 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:05:10,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:05:10,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1813731741, now seen corresponding path program 70 times [2019-09-05 13:05:10,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:05:10,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:10,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:05:10,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:10,061 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:05:10,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:05:12,795 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:12,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:12,795 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:05:12,796 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:05:12,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:05:12,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:12,796 INFO 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-05 13:05:12,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:05:12,807 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:05:12,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:05:12,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 90 conjunts are in the unsatisfiable core [2019-09-05 13:05:12,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:05:12,893 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:12,893 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:05:16,196 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:16,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:05:16,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 102 [2019-09-05 13:05:16,200 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:05:16,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-09-05 13:05:16,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-09-05 13:05:16,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:05:16,202 INFO L87 Difference]: Start difference. First operand 187 states and 225 transitions. Second operand 91 states. [2019-09-05 13:05:16,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:05:16,967 INFO L93 Difference]: Finished difference Result 190 states and 230 transitions. [2019-09-05 13:05:16,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-05 13:05:16,968 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 186 [2019-09-05 13:05:16,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:05:16,969 INFO L225 Difference]: With dead ends: 190 [2019-09-05 13:05:16,969 INFO L226 Difference]: Without dead ends: 190 [2019-09-05 13:05:16,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 284 SyntacticMatches, 78 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3861 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:05:16,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-09-05 13:05:16,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2019-09-05 13:05:16,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-05 13:05:16,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 228 transitions. [2019-09-05 13:05:16,973 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 228 transitions. Word has length 186 [2019-09-05 13:05:16,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:05:16,973 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 228 transitions. [2019-09-05 13:05:16,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-09-05 13:05:16,973 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 228 transitions. [2019-09-05 13:05:16,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-05 13:05:16,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:05:16,974 INFO L399 BasicCegarLoop]: trace histogram [89, 50, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:05:16,975 INFO L418 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:05:16,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:05:16,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1863556766, now seen corresponding path program 71 times [2019-09-05 13:05:16,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:05:16,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:16,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:05:16,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:16,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:05:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:05:19,833 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:19,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:19,833 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:05:19,834 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:05:19,834 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:05:19,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:19,834 INFO 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-05 13:05:19,844 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:05:19,844 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:05:19,943 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 80 check-sat command(s) [2019-09-05 13:05:19,944 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:05:19,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-05 13:05:19,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:05:19,965 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 3950 proven. 1521 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-05 13:05:19,965 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:05:22,115 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 3950 proven. 1521 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-05 13:05:22,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:05:22,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 42, 42] total 102 [2019-09-05 13:05:22,118 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:05:22,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-09-05 13:05:22,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-09-05 13:05:22,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:05:22,121 INFO L87 Difference]: Start difference. First operand 189 states and 228 transitions. Second operand 92 states. [2019-09-05 13:05:22,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:05:22,811 INFO L93 Difference]: Finished difference Result 192 states and 233 transitions. [2019-09-05 13:05:22,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-09-05 13:05:22,812 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 188 [2019-09-05 13:05:22,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:05:22,813 INFO L225 Difference]: With dead ends: 192 [2019-09-05 13:05:22,813 INFO L226 Difference]: Without dead ends: 192 [2019-09-05 13:05:22,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 337 SyntacticMatches, 30 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:05:22,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-09-05 13:05:22,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 191. [2019-09-05 13:05:22,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-05 13:05:22,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 231 transitions. [2019-09-05 13:05:22,816 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 231 transitions. Word has length 188 [2019-09-05 13:05:22,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:05:22,817 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 231 transitions. [2019-09-05 13:05:22,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-09-05 13:05:22,817 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 231 transitions. [2019-09-05 13:05:22,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-05 13:05:22,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:05:22,818 INFO L399 BasicCegarLoop]: trace histogram [90, 50, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:05:22,818 INFO L418 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:05:22,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:05:22,818 INFO L82 PathProgramCache]: Analyzing trace with hash 979727385, now seen corresponding path program 72 times [2019-09-05 13:05:22,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:05:22,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:22,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:05:22,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:22,819 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:05:22,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:05:25,701 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:25,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:25,701 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:05:25,701 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:05:25,701 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:05:25,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:25,701 INFO 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-05 13:05:25,712 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:05:25,712 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:05:25,770 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:05:25,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:05:25,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 92 conjunts are in the unsatisfiable core [2019-09-05 13:05:25,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:05:25,801 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:25,801 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:05:29,133 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:29,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:05:29,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 102 [2019-09-05 13:05:29,137 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:05:29,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-09-05 13:05:29,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-09-05 13:05:29,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:05:29,139 INFO L87 Difference]: Start difference. First operand 191 states and 231 transitions. Second operand 93 states. [2019-09-05 13:05:29,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:05:29,932 INFO L93 Difference]: Finished difference Result 194 states and 236 transitions. [2019-09-05 13:05:29,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-09-05 13:05:29,933 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 190 [2019-09-05 13:05:29,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:05:29,934 INFO L225 Difference]: With dead ends: 194 [2019-09-05 13:05:29,934 INFO L226 Difference]: Without dead ends: 194 [2019-09-05 13:05:29,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 290 SyntacticMatches, 82 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4059 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:05:29,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-09-05 13:05:29,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2019-09-05 13:05:29,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-09-05 13:05:29,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 234 transitions. [2019-09-05 13:05:29,936 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 234 transitions. Word has length 190 [2019-09-05 13:05:29,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:05:29,937 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 234 transitions. [2019-09-05 13:05:29,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-09-05 13:05:29,937 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 234 transitions. [2019-09-05 13:05:29,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-05 13:05:29,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:05:29,938 INFO L399 BasicCegarLoop]: trace histogram [91, 50, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:05:29,938 INFO L418 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:05:29,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:05:29,938 INFO L82 PathProgramCache]: Analyzing trace with hash 2023216852, now seen corresponding path program 73 times [2019-09-05 13:05:29,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:05:29,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:29,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:05:29,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:29,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:05:29,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:05:32,829 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 8281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:32,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:32,830 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:05:32,830 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:05:32,830 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:05:32,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:32,830 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 13:05:32,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:05:32,841 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:05:32,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:05:32,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 93 conjunts are in the unsatisfiable core [2019-09-05 13:05:32,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:05:32,939 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 8281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:32,939 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:05:36,296 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 8281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:36,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:05:36,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 102 [2019-09-05 13:05:36,299 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:05:36,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-09-05 13:05:36,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-09-05 13:05:36,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:05:36,301 INFO L87 Difference]: Start difference. First operand 193 states and 234 transitions. Second operand 94 states. [2019-09-05 13:05:36,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:05:36,968 INFO L93 Difference]: Finished difference Result 196 states and 239 transitions. [2019-09-05 13:05:36,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-09-05 13:05:36,968 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 192 [2019-09-05 13:05:36,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:05:36,969 INFO L225 Difference]: With dead ends: 196 [2019-09-05 13:05:36,969 INFO L226 Difference]: Without dead ends: 196 [2019-09-05 13:05:36,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 293 SyntacticMatches, 84 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4158 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:05:36,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-09-05 13:05:36,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 195. [2019-09-05 13:05:36,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-05 13:05:36,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 237 transitions. [2019-09-05 13:05:36,973 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 237 transitions. Word has length 192 [2019-09-05 13:05:36,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:05:36,973 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 237 transitions. [2019-09-05 13:05:36,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-09-05 13:05:36,973 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 237 transitions. [2019-09-05 13:05:36,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-05 13:05:36,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:05:36,974 INFO L399 BasicCegarLoop]: trace histogram [92, 50, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:05:36,974 INFO L418 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:05:36,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:05:36,974 INFO L82 PathProgramCache]: Analyzing trace with hash -205752625, now seen corresponding path program 74 times [2019-09-05 13:05:36,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:05:36,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:36,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:05:36,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:36,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:05:36,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:05:40,003 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:40,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:40,003 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:05:40,003 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:05:40,003 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:05:40,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:40,004 INFO 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-05 13:05:40,014 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:05:40,014 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:05:40,140 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 86 check-sat command(s) [2019-09-05 13:05:40,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:05:40,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-05 13:05:40,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:05:40,162 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 4250 proven. 1764 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-05 13:05:40,163 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:05:42,436 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 4250 proven. 1764 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-05 13:05:42,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:05:42,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 45, 45] total 102 [2019-09-05 13:05:42,440 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:05:42,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-09-05 13:05:42,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-09-05 13:05:42,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:05:42,441 INFO L87 Difference]: Start difference. First operand 195 states and 237 transitions. Second operand 95 states. [2019-09-05 13:05:43,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:05:43,108 INFO L93 Difference]: Finished difference Result 198 states and 242 transitions. [2019-09-05 13:05:43,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-05 13:05:43,109 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 194 [2019-09-05 13:05:43,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:05:43,111 INFO L225 Difference]: With dead ends: 198 [2019-09-05 13:05:43,111 INFO L226 Difference]: Without dead ends: 198 [2019-09-05 13:05:43,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 346 SyntacticMatches, 36 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:05:43,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-09-05 13:05:43,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2019-09-05 13:05:43,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-05 13:05:43,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 240 transitions. [2019-09-05 13:05:43,116 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 240 transitions. Word has length 194 [2019-09-05 13:05:43,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:05:43,116 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 240 transitions. [2019-09-05 13:05:43,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-09-05 13:05:43,116 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 240 transitions. [2019-09-05 13:05:43,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-05 13:05:43,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:05:43,117 INFO L399 BasicCegarLoop]: trace histogram [93, 50, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:05:43,118 INFO L418 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:05:43,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:05:43,118 INFO L82 PathProgramCache]: Analyzing trace with hash 943260682, now seen corresponding path program 75 times [2019-09-05 13:05:43,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:05:43,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:43,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:05:43,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:43,119 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:05:43,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:05:46,175 INFO L134 CoverageAnalysis]: Checked inductivity of 8649 backedges. 0 proven. 8649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:46,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:46,176 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:05:46,176 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:05:46,176 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:05:46,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:46,176 INFO 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-05 13:05:46,187 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:05:46,187 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:05:46,242 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:05:46,242 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:05:46,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 95 conjunts are in the unsatisfiable core [2019-09-05 13:05:46,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:05:46,279 INFO L134 CoverageAnalysis]: Checked inductivity of 8649 backedges. 0 proven. 8649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:46,279 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:05:49,710 INFO L134 CoverageAnalysis]: Checked inductivity of 8649 backedges. 0 proven. 8649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:49,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:05:49,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 102 [2019-09-05 13:05:49,713 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:05:49,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-09-05 13:05:49,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-09-05 13:05:49,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:05:49,714 INFO L87 Difference]: Start difference. First operand 197 states and 240 transitions. Second operand 96 states. [2019-09-05 13:05:50,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:05:50,507 INFO L93 Difference]: Finished difference Result 200 states and 245 transitions. [2019-09-05 13:05:50,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-09-05 13:05:50,508 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 196 [2019-09-05 13:05:50,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:05:50,509 INFO L225 Difference]: With dead ends: 200 [2019-09-05 13:05:50,509 INFO L226 Difference]: Without dead ends: 200 [2019-09-05 13:05:50,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 299 SyntacticMatches, 88 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4356 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:05:50,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-09-05 13:05:50,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2019-09-05 13:05:50,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-05 13:05:50,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 243 transitions. [2019-09-05 13:05:50,512 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 243 transitions. Word has length 196 [2019-09-05 13:05:50,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:05:50,512 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 243 transitions. [2019-09-05 13:05:50,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-09-05 13:05:50,512 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 243 transitions. [2019-09-05 13:05:50,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-05 13:05:50,513 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:05:50,513 INFO L399 BasicCegarLoop]: trace histogram [94, 50, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:05:50,514 INFO L418 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:05:50,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:05:50,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1338453637, now seen corresponding path program 76 times [2019-09-05 13:05:50,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:05:50,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:50,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:05:50,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:50,515 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:05:50,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:05:53,690 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:53,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:53,691 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:05:53,691 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:05:53,691 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:05:53,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:53,691 INFO 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-05 13:05:53,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:05:53,713 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:05:53,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:05:53,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 96 conjunts are in the unsatisfiable core [2019-09-05 13:05:53,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:05:53,813 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:53,813 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:05:57,183 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:05:57,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:05:57,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 102 [2019-09-05 13:05:57,186 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:05:57,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-09-05 13:05:57,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-09-05 13:05:57,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:05:57,188 INFO L87 Difference]: Start difference. First operand 199 states and 243 transitions. Second operand 97 states. [2019-09-05 13:05:57,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:05:57,848 INFO L93 Difference]: Finished difference Result 202 states and 248 transitions. [2019-09-05 13:05:57,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-09-05 13:05:57,849 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 198 [2019-09-05 13:05:57,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:05:57,850 INFO L225 Difference]: With dead ends: 202 [2019-09-05 13:05:57,850 INFO L226 Difference]: Without dead ends: 202 [2019-09-05 13:05:57,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 302 SyntacticMatches, 90 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4455 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:05:57,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-05 13:05:57,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2019-09-05 13:05:57,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-09-05 13:05:57,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 246 transitions. [2019-09-05 13:05:57,853 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 246 transitions. Word has length 198 [2019-09-05 13:05:57,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:05:57,854 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 246 transitions. [2019-09-05 13:05:57,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-09-05 13:05:57,854 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 246 transitions. [2019-09-05 13:05:57,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-05 13:05:57,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:05:57,855 INFO L399 BasicCegarLoop]: trace histogram [95, 50, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:05:57,855 INFO L418 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:05:57,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:05:57,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1133205952, now seen corresponding path program 77 times [2019-09-05 13:05:57,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:05:57,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:57,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:05:57,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:57,857 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:05:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:06:01,038 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 0 proven. 9025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:01,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:06:01,039 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:06:01,039 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:06:01,039 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:06:01,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:06:01,039 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 13:06:01,048 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:06:01,048 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:06:01,172 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 92 check-sat command(s) [2019-09-05 13:06:01,172 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:06:01,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-05 13:06:01,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:06:01,196 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 4550 proven. 2025 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-05 13:06:01,196 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:06:03,554 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 4550 proven. 2025 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-05 13:06:03,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:06:03,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 48, 48] total 102 [2019-09-05 13:06:03,558 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:06:03,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-09-05 13:06:03,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-09-05 13:06:03,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:06:03,559 INFO L87 Difference]: Start difference. First operand 201 states and 246 transitions. Second operand 98 states. [2019-09-05 13:06:04,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:06:04,332 INFO L93 Difference]: Finished difference Result 204 states and 251 transitions. [2019-09-05 13:06:04,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-09-05 13:06:04,332 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 200 [2019-09-05 13:06:04,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:06:04,333 INFO L225 Difference]: With dead ends: 204 [2019-09-05 13:06:04,333 INFO L226 Difference]: Without dead ends: 204 [2019-09-05 13:06:04,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 355 SyntacticMatches, 42 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:06:04,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-09-05 13:06:04,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 203. [2019-09-05 13:06:04,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-05 13:06:04,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 249 transitions. [2019-09-05 13:06:04,336 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 249 transitions. Word has length 200 [2019-09-05 13:06:04,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:06:04,336 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 249 transitions. [2019-09-05 13:06:04,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-09-05 13:06:04,336 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 249 transitions. [2019-09-05 13:06:04,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-05 13:06:04,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:06:04,338 INFO L399 BasicCegarLoop]: trace histogram [96, 50, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:06:04,338 INFO L418 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:06:04,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:06:04,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1281156293, now seen corresponding path program 78 times [2019-09-05 13:06:04,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:06:04,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:06:04,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:06:04,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:06:04,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:06:04,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:06:07,579 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 0 proven. 9216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:07,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:06:07,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:06:07,579 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:06:07,579 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:06:07,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:06:07,580 INFO 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-05 13:06:07,589 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:06:07,590 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:06:07,649 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:06:07,649 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:06:07,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 98 conjunts are in the unsatisfiable core [2019-09-05 13:06:07,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:06:07,685 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 0 proven. 9216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:07,685 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:06:11,027 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 0 proven. 9216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:11,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:06:11,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 102 [2019-09-05 13:06:11,030 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:06:11,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-09-05 13:06:11,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-09-05 13:06:11,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:06:11,033 INFO L87 Difference]: Start difference. First operand 203 states and 249 transitions. Second operand 99 states. [2019-09-05 13:06:11,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:06:11,929 INFO L93 Difference]: Finished difference Result 206 states and 254 transitions. [2019-09-05 13:06:11,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-05 13:06:11,929 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 202 [2019-09-05 13:06:11,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:06:11,930 INFO L225 Difference]: With dead ends: 206 [2019-09-05 13:06:11,930 INFO L226 Difference]: Without dead ends: 206 [2019-09-05 13:06:11,931 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 308 SyntacticMatches, 94 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4653 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:06:11,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-09-05 13:06:11,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2019-09-05 13:06:11,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-05 13:06:11,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 252 transitions. [2019-09-05 13:06:11,933 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 252 transitions. Word has length 202 [2019-09-05 13:06:11,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:06:11,934 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 252 transitions. [2019-09-05 13:06:11,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-09-05 13:06:11,934 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 252 transitions. [2019-09-05 13:06:11,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-05 13:06:11,934 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:06:11,935 INFO L399 BasicCegarLoop]: trace histogram [97, 50, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:06:11,935 INFO L418 AbstractCegarLoop]: === Iteration 82 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:06:11,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:06:11,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1727513226, now seen corresponding path program 79 times [2019-09-05 13:06:11,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:06:11,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:06:11,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:06:11,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:06:11,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:06:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:06:15,723 INFO L134 CoverageAnalysis]: Checked inductivity of 9409 backedges. 0 proven. 9409 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:15,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:06:15,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:06:15,724 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:06:15,724 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:06:15,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:06:15,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 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:06:15,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:06:15,745 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:06:15,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:06:15,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 99 conjunts are in the unsatisfiable core [2019-09-05 13:06:15,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:06:15,858 INFO L134 CoverageAnalysis]: Checked inductivity of 9409 backedges. 0 proven. 9409 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:15,859 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:06:19,233 INFO L134 CoverageAnalysis]: Checked inductivity of 9409 backedges. 0 proven. 9409 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:19,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:06:19,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 102 [2019-09-05 13:06:19,236 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:06:19,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-09-05 13:06:19,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-09-05 13:06:19,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:06:19,239 INFO L87 Difference]: Start difference. First operand 205 states and 252 transitions. Second operand 100 states. [2019-09-05 13:06:19,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:06:19,944 INFO L93 Difference]: Finished difference Result 208 states and 257 transitions. [2019-09-05 13:06:19,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-09-05 13:06:19,944 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 204 [2019-09-05 13:06:19,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:06:19,945 INFO L225 Difference]: With dead ends: 208 [2019-09-05 13:06:19,945 INFO L226 Difference]: Without dead ends: 208 [2019-09-05 13:06:19,946 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 311 SyntacticMatches, 96 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4752 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:06:19,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-09-05 13:06:19,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 207. [2019-09-05 13:06:19,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-09-05 13:06:19,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 255 transitions. [2019-09-05 13:06:19,948 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 255 transitions. Word has length 204 [2019-09-05 13:06:19,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:06:19,948 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 255 transitions. [2019-09-05 13:06:19,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-09-05 13:06:19,948 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 255 transitions. [2019-09-05 13:06:19,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-09-05 13:06:19,949 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:06:19,949 INFO L399 BasicCegarLoop]: trace histogram [98, 50, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:06:19,949 INFO L418 AbstractCegarLoop]: === Iteration 83 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:06:19,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:06:19,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1179796239, now seen corresponding path program 80 times [2019-09-05 13:06:19,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:06:19,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:06:19,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:06:19,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:06:19,950 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:06:19,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:06:23,281 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 9604 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:23,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:06:23,282 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:06:23,282 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:06:23,282 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:06:23,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:06:23,282 INFO 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-05 13:06:23,292 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:06:23,292 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:06:23,425 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 98 check-sat command(s) [2019-09-05 13:06:23,425 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:06:23,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-05 13:06:23,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:06:23,451 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 4850 proven. 2304 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-05 13:06:23,451 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:06:25,924 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 4850 proven. 2304 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-05 13:06:25,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:06:25,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 51, 51] total 102 [2019-09-05 13:06:25,927 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:06:25,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-09-05 13:06:25,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-09-05 13:06:25,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:06:25,929 INFO L87 Difference]: Start difference. First operand 207 states and 255 transitions. Second operand 101 states. [2019-09-05 13:06:26,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:06:26,854 INFO L93 Difference]: Finished difference Result 210 states and 260 transitions. [2019-09-05 13:06:26,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-05 13:06:26,854 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 206 [2019-09-05 13:06:26,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:06:26,855 INFO L225 Difference]: With dead ends: 210 [2019-09-05 13:06:26,855 INFO L226 Difference]: Without dead ends: 210 [2019-09-05 13:06:26,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 364 SyntacticMatches, 48 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:06:26,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-05 13:06:26,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2019-09-05 13:06:26,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-09-05 13:06:26,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 258 transitions. [2019-09-05 13:06:26,859 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 258 transitions. Word has length 206 [2019-09-05 13:06:26,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:06:26,859 INFO L475 AbstractCegarLoop]: Abstraction has 209 states and 258 transitions. [2019-09-05 13:06:26,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-09-05 13:06:26,859 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 258 transitions. [2019-09-05 13:06:26,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-05 13:06:26,860 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:06:26,860 INFO L399 BasicCegarLoop]: trace histogram [99, 50, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:06:26,860 INFO L418 AbstractCegarLoop]: === Iteration 84 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:06:26,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:06:26,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1190218156, now seen corresponding path program 81 times [2019-09-05 13:06:26,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:06:26,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:06:26,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:06:26,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:06:26,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:06:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:06:30,332 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:30,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:06:30,332 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:06:30,333 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:06:30,333 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:06:30,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:06:30,333 INFO 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-05 13:06:30,344 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:06:30,344 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:06:30,416 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:06:30,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:06:30,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 101 conjunts are in the unsatisfiable core [2019-09-05 13:06:30,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:06:30,451 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:30,451 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:06:33,844 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:06:33,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:06:33,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 102 [2019-09-05 13:06:33,848 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:06:33,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-09-05 13:06:33,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-09-05 13:06:33,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:06:33,849 INFO L87 Difference]: Start difference. First operand 209 states and 258 transitions. Second operand 102 states. [2019-09-05 13:06:34,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:06:34,740 INFO L93 Difference]: Finished difference Result 211 states and 261 transitions. [2019-09-05 13:06:34,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-09-05 13:06:34,740 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 208 [2019-09-05 13:06:34,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:06:34,741 INFO L225 Difference]: With dead ends: 211 [2019-09-05 13:06:34,741 INFO L226 Difference]: Without dead ends: 211 [2019-09-05 13:06:34,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 317 SyntacticMatches, 100 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4950 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:06:34,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-05 13:06:34,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-09-05 13:06:34,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-09-05 13:06:34,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 261 transitions. [2019-09-05 13:06:34,745 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 261 transitions. Word has length 208 [2019-09-05 13:06:34,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:06:34,745 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 261 transitions. [2019-09-05 13:06:34,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-09-05 13:06:34,745 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 261 transitions. [2019-09-05 13:06:34,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-05 13:06:34,746 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:06:34,746 INFO L399 BasicCegarLoop]: trace histogram [100, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:06:34,747 INFO L418 AbstractCegarLoop]: === Iteration 85 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:06:34,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:06:34,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1853582425, now seen corresponding path program 82 times [2019-09-05 13:06:34,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:06:34,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:06:34,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:06:34,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:06:34,748 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:06:34,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:06:37,225 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2019-09-05 13:06:37,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:06:37,226 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:06:37,226 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:06:37,226 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:06:37,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:06:37,226 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 13:06:37,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:06:37,236 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:06:37,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:06:37,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 108 conjunts are in the unsatisfiable core [2019-09-05 13:06:37,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:06:37,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:06:37,585 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2019-09-05 13:06:37,586 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:06:37,844 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2019-09-05 13:06:37,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:06:37,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 57 [2019-09-05 13:06:37,848 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:06:37,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-05 13:06:37,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-05 13:06:37,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3079, Unknown=0, NotChecked=0, Total=3192 [2019-09-05 13:06:37,850 INFO L87 Difference]: Start difference. First operand 211 states and 261 transitions. Second operand 57 states. [2019-09-05 13:06:39,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:06:39,787 INFO L93 Difference]: Finished difference Result 2865 states and 4240 transitions. [2019-09-05 13:06:39,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-05 13:06:39,788 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 210 [2019-09-05 13:06:39,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:06:39,799 INFO L225 Difference]: With dead ends: 2865 [2019-09-05 13:06:39,799 INFO L226 Difference]: Without dead ends: 2862 [2019-09-05 13:06:39,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 415 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=119, Invalid=3187, Unknown=0, NotChecked=0, Total=3306 [2019-09-05 13:06:39,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2019-09-05 13:06:39,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 213. [2019-09-05 13:06:39,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-09-05 13:06:39,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 264 transitions. [2019-09-05 13:06:39,813 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 264 transitions. Word has length 210 [2019-09-05 13:06:39,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:06:39,813 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 264 transitions. [2019-09-05 13:06:39,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-05 13:06:39,813 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 264 transitions. [2019-09-05 13:06:39,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-05 13:06:39,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:06:39,815 INFO L399 BasicCegarLoop]: trace histogram [101, 51, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:06:39,815 INFO L418 AbstractCegarLoop]: === Iteration 86 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:06:39,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:06:39,815 INFO L82 PathProgramCache]: Analyzing trace with hash -2073212190, now seen corresponding path program 83 times [2019-09-05 13:06:39,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:06:39,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:06:39,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:06:39,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:06:39,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:06:39,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:06:41,177 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 7651 proven. 0 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2019-09-05 13:06:41,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:06:41,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2019-09-05 13:06:41,178 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:06:41,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-05 13:06:41,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-05 13:06:41,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:06:41,179 INFO L87 Difference]: Start difference. First operand 213 states and 264 transitions. Second operand 52 states. [2019-09-05 13:06:41,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:06:41,414 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2019-09-05 13:06:41,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-05 13:06:41,415 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 212 [2019-09-05 13:06:41,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:06:41,415 INFO L225 Difference]: With dead ends: 206 [2019-09-05 13:06:41,416 INFO L226 Difference]: Without dead ends: 0 [2019-09-05 13:06:41,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:06:41,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-05 13:06:41,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-05 13:06:41,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-05 13:06:41,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-05 13:06:41,417 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 212 [2019-09-05 13:06:41,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:06:41,418 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-05 13:06:41,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-05 13:06:41,418 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-05 13:06:41,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-05 13:06:41,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.09 01:06:41 BoogieIcfgContainer [2019-09-05 13:06:41,424 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-05 13:06:41,425 INFO L168 Benchmark]: Toolchain (without parser) took 269774.74 ms. Allocated memory was 131.1 MB in the beginning and 585.6 MB in the end (delta: 454.6 MB). Free memory was 87.4 MB in the beginning and 401.3 MB in the end (delta: -313.9 MB). Peak memory consumption was 140.6 MB. Max. memory is 7.1 GB. [2019-09-05 13:06:41,426 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 131.1 MB. Free memory is still 104.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-05 13:06:41,426 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.84 ms. Allocated memory is still 131.1 MB. Free memory was 87.4 MB in the beginning and 78.3 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2019-09-05 13:06:41,427 INFO L168 Benchmark]: Boogie Preprocessor took 121.86 ms. Allocated memory was 131.1 MB in the beginning and 198.7 MB in the end (delta: 67.6 MB). Free memory was 78.3 MB in the beginning and 175.9 MB in the end (delta: -97.7 MB). Peak memory consumption was 16.9 MB. Max. memory is 7.1 GB. [2019-09-05 13:06:41,427 INFO L168 Benchmark]: RCFGBuilder took 213.21 ms. Allocated memory is still 198.7 MB. Free memory was 175.9 MB in the beginning and 164.9 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2019-09-05 13:06:41,428 INFO L168 Benchmark]: TraceAbstraction took 269125.66 ms. Allocated memory was 198.7 MB in the beginning and 585.6 MB in the end (delta: 386.9 MB). Free memory was 164.0 MB in the beginning and 401.3 MB in the end (delta: -237.3 MB). Peak memory consumption was 149.6 MB. Max. memory is 7.1 GB. [2019-09-05 13:06:41,430 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 131.1 MB. Free memory is still 104.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 307.84 ms. Allocated memory is still 131.1 MB. Free memory was 87.4 MB in the beginning and 78.3 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 121.86 ms. Allocated memory was 131.1 MB in the beginning and 198.7 MB in the end (delta: 67.6 MB). Free memory was 78.3 MB in the beginning and 175.9 MB in the end (delta: -97.7 MB). Peak memory consumption was 16.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 213.21 ms. Allocated memory is still 198.7 MB. Free memory was 175.9 MB in the beginning and 164.9 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 269125.66 ms. Allocated memory was 198.7 MB in the beginning and 585.6 MB in the end (delta: 386.9 MB). Free memory was 164.0 MB in the beginning and 401.3 MB in the end (delta: -237.3 MB). Peak memory consumption was 149.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. SAFE Result, 269.0s OverallTime, 86 OverallIterations, 101 TraceHistogramMax, 28.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1003 SDtfs, 3333 SDslu, 23116 SDs, 0 SdLazy, 15779 SolverSat, 5424 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23762 GetRequests, 16316 SyntacticMatches, 2130 SemanticMatches, 5316 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88588 ImplicationChecksByTransitivity, 225.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=213occurred in iteration=85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 0.36363636363636365 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 86 MinimizatonAttempts, 2698 StatesRemovedByMinimization, 48 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 4.2s SatisfiabilityAnalysisTime, 232.0s InterpolantComputationTime, 19824 NumberOfCodeBlocks, 19022 NumberOfCodeBlocksAsserted, 1250 NumberOfCheckSat, 29364 ConstructedInterpolants, 0 QuantifiedInterpolants, 11411364 SizeOfPredicates, 77 NumberOfNonLiveVariables, 21524 ConjunctsInSsa, 3404 ConjunctsInUnsatCore, 250 InterpolantComputations, 3 PerfectInterpolantSequences, 275404/950081 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...