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-new/count_by_2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 20:56:38,422 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:56:38,425 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:56:38,443 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:56:38,443 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:56:38,445 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:56:38,447 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:56:38,456 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:56:38,460 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:56:38,462 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:56:38,464 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:56:38,466 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:56:38,466 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:56:38,468 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:56:38,470 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:56:38,472 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:56:38,473 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:56:38,474 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:56:38,476 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:56:38,481 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:56:38,485 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:56:38,487 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:56:38,489 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:56:38,490 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:56:38,492 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:56:38,493 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:56:38,493 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:56:38,495 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:56:38,496 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:56:38,497 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:56:38,497 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:56:38,499 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:56:38,499 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:56:38,500 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:56:38,502 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:56:38,502 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:56:38,503 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:56:38,503 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:56:38,503 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:56:38,504 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:56:38,504 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:56:38,506 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-03 20:56:38,541 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:56:38,541 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:56:38,542 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 20:56:38,542 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 20:56:38,545 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 20:56:38,545 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 20:56:38,545 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 20:56:38,545 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 20:56:38,545 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 20:56:38,546 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 20:56:38,547 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:56:38,548 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:56:38,548 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:56:38,548 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:56:38,548 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:56:38,548 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:56:38,549 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:56:38,549 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:56:38,549 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:56:38,549 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:56:38,549 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:56:38,550 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 20:56:38,550 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:56:38,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:56:38,550 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:56:38,550 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:56:38,551 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 20:56:38,551 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:56:38,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:56:38,551 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 20:56:38,580 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:56:38,596 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:56:38,599 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:56:38,601 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:56:38,602 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:56:38,603 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/count_by_2.i [2019-09-03 20:56:38,668 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbde5dad3/57feb5559b464c69b397cafaf733bf46/FLAG4a0d5d2f6 [2019-09-03 20:56:39,090 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:56:39,090 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/count_by_2.i [2019-09-03 20:56:39,096 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbde5dad3/57feb5559b464c69b397cafaf733bf46/FLAG4a0d5d2f6 [2019-09-03 20:56:39,479 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbde5dad3/57feb5559b464c69b397cafaf733bf46 [2019-09-03 20:56:39,489 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:56:39,490 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:56:39,491 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:56:39,491 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:56:39,495 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:56:39,496 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:56:39" (1/1) ... [2019-09-03 20:56:39,498 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19f18e89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:56:39, skipping insertion in model container [2019-09-03 20:56:39,499 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:56:39" (1/1) ... [2019-09-03 20:56:39,506 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:56:39,521 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:56:39,677 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:56:39,684 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:56:39,700 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:56:39,716 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:56:39,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:56:39 WrapperNode [2019-09-03 20:56:39,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:56:39,718 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:56:39,719 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:56:39,719 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:56:39,822 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:56:39" (1/1) ... [2019-09-03 20:56:39,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:56:39" (1/1) ... [2019-09-03 20:56:39,829 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:56:39" (1/1) ... [2019-09-03 20:56:39,831 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:56:39" (1/1) ... [2019-09-03 20:56:39,834 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:56:39" (1/1) ... [2019-09-03 20:56:39,838 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:56:39" (1/1) ... [2019-09-03 20:56:39,839 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:56:39" (1/1) ... [2019-09-03 20:56:39,840 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:56:39,841 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:56:39,841 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:56:39,841 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:56:39,842 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:56:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:56:39,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:56:39,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:56:39,892 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 20:56:39,892 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:56:39,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:56:39,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 20:56:39,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:56:39,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 20:56:39,893 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:56:39,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:56:39,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:56:40,021 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:56:40,021 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-03 20:56:40,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:56:40 BoogieIcfgContainer [2019-09-03 20:56:40,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:56:40,023 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:56:40,023 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:56:40,026 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:56:40,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:56:39" (1/3) ... [2019-09-03 20:56:40,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c2353fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:56:40, skipping insertion in model container [2019-09-03 20:56:40,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:56:39" (2/3) ... [2019-09-03 20:56:40,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c2353fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:56:40, skipping insertion in model container [2019-09-03 20:56:40,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:56:40" (3/3) ... [2019-09-03 20:56:40,029 INFO L109 eAbstractionObserver]: Analyzing ICFG count_by_2.i [2019-09-03 20:56:40,038 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:56:40,045 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 20:56:40,061 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 20:56:40,086 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:56:40,086 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 20:56:40,086 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:56:40,087 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:56:40,087 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:56:40,087 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:56:40,087 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:56:40,087 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:56:40,099 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-09-03 20:56:40,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:56:40,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:40,108 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:40,110 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:40,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:40,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1871509567, now seen corresponding path program 1 times [2019-09-03 20:56:40,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:40,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:40,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:40,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:40,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:40,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:40,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:40,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:56:40,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 20:56:40,209 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:56:40,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 20:56:40,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 20:56:40,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:56:40,228 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-09-03 20:56:40,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:40,241 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-09-03 20:56:40,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 20:56:40,242 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-03 20:56:40,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:40,250 INFO L225 Difference]: With dead ends: 19 [2019-09-03 20:56:40,250 INFO L226 Difference]: Without dead ends: 12 [2019-09-03 20:56:40,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:56:40,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-03 20:56:40,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-03 20:56:40,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-03 20:56:40,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-09-03 20:56:40,277 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-09-03 20:56:40,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:40,277 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-09-03 20:56:40,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 20:56:40,277 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-09-03 20:56:40,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:56:40,278 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:40,278 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:40,278 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:40,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:40,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1877050693, now seen corresponding path program 1 times [2019-09-03 20:56:40,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:40,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:40,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:40,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:40,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:40,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:40,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:40,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:56:40,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:56:40,334 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:56:40,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:56:40,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:56:40,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:56:40,336 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2019-09-03 20:56:40,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:40,376 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-09-03 20:56:40,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:56:40,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-03 20:56:40,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:40,379 INFO L225 Difference]: With dead ends: 14 [2019-09-03 20:56:40,379 INFO L226 Difference]: Without dead ends: 14 [2019-09-03 20:56:40,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:56:40,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-03 20:56:40,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-09-03 20:56:40,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-03 20:56:40,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-09-03 20:56:40,386 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2019-09-03 20:56:40,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:40,386 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-09-03 20:56:40,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:56:40,387 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-09-03 20:56:40,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 20:56:40,388 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:40,388 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:40,388 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:40,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:40,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1175909113, now seen corresponding path program 1 times [2019-09-03 20:56:40,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:40,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:40,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:40,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:40,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:40,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:40,453 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-03 20:56:40,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:40,454 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:40,459 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 13 with the following transitions: [2019-09-03 20:56:40,461 INFO L207 CegarAbsIntRunner]: [0], [4], [10], [12], [14], [21], [24], [26], [32], [33], [34], [36] [2019-09-03 20:56:40,511 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:56:40,511 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:56:40,608 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:56:40,610 INFO L272 AbstractInterpreter]: Visited 12 different actions 33 times. Merged at 3 different actions 12 times. Widened at 1 different actions 2 times. Performed 44 root evaluator evaluations with a maximum evaluation depth of 4. Performed 44 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-03 20:56:40,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:40,614 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:56:40,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:40,614 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:40,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:40,635 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:56:40,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:40,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-03 20:56:40,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:40,688 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-03 20:56:40,689 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:40,728 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-03 20:56:40,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:40,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-09-03 20:56:40,733 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:40,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:56:40,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:56:40,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:56:40,735 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 4 states. [2019-09-03 20:56:40,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:40,755 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-09-03 20:56:40,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:56:40,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-03 20:56:40,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:40,757 INFO L225 Difference]: With dead ends: 16 [2019-09-03 20:56:40,757 INFO L226 Difference]: Without dead ends: 16 [2019-09-03 20:56:40,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:56:40,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-03 20:56:40,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-09-03 20:56:40,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-03 20:56:40,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-09-03 20:56:40,761 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2019-09-03 20:56:40,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:40,762 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-09-03 20:56:40,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:56:40,762 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-09-03 20:56:40,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 20:56:40,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:40,763 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:40,763 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:40,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:40,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1607619511, now seen corresponding path program 2 times [2019-09-03 20:56:40,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:40,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:40,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:40,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:40,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:40,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:40,818 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:40,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:40,818 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:40,819 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:40,819 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:40,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:40,819 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:40,841 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:56:40,842 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:56:40,859 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 20:56:40,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:40,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-03 20:56:40,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:40,869 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:40,869 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:40,905 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:40,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:40,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2019-09-03 20:56:40,909 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:40,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:56:40,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:56:40,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:56:40,911 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 5 states. [2019-09-03 20:56:40,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:40,932 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-09-03 20:56:40,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:56:40,933 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-09-03 20:56:40,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:40,934 INFO L225 Difference]: With dead ends: 18 [2019-09-03 20:56:40,934 INFO L226 Difference]: Without dead ends: 18 [2019-09-03 20:56:40,935 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:56:40,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-03 20:56:40,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-09-03 20:56:40,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-03 20:56:40,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-09-03 20:56:40,938 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2019-09-03 20:56:40,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:40,939 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-09-03 20:56:40,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:56:40,939 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-09-03 20:56:40,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 20:56:40,940 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:40,940 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:40,940 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:40,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:40,941 INFO L82 PathProgramCache]: Analyzing trace with hash -130515723, now seen corresponding path program 3 times [2019-09-03 20:56:40,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:40,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:40,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:40,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:40,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:40,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:41,006 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:41,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:41,006 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:41,007 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:41,007 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:41,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:41,007 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:41,033 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:56:41,033 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:56:41,042 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:56:41,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:41,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 20:56:41,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:41,052 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:41,052 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:41,114 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:41,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:41,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2019-09-03 20:56:41,118 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:41,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:56:41,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:56:41,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:56:41,119 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 6 states. [2019-09-03 20:56:41,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:41,153 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-09-03 20:56:41,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:56:41,153 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-09-03 20:56:41,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:41,154 INFO L225 Difference]: With dead ends: 20 [2019-09-03 20:56:41,154 INFO L226 Difference]: Without dead ends: 20 [2019-09-03 20:56:41,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:56:41,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-03 20:56:41,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-09-03 20:56:41,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-03 20:56:41,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-09-03 20:56:41,159 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2019-09-03 20:56:41,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:41,159 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-09-03 20:56:41,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:56:41,160 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-09-03 20:56:41,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 20:56:41,160 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:41,161 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:41,161 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:41,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:41,161 INFO L82 PathProgramCache]: Analyzing trace with hash 263802547, now seen corresponding path program 4 times [2019-09-03 20:56:41,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:41,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:41,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:41,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:41,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:41,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:41,251 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:41,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:41,251 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:41,251 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:41,252 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:41,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:41,252 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:56:41,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:41,273 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:41,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-03 20:56:41,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:41,294 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:41,295 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:41,385 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:41,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:41,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2019-09-03 20:56:41,391 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:41,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:56:41,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:56:41,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:56:41,392 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 7 states. [2019-09-03 20:56:41,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:41,423 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-09-03 20:56:41,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:56:41,424 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-09-03 20:56:41,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:41,425 INFO L225 Difference]: With dead ends: 22 [2019-09-03 20:56:41,425 INFO L226 Difference]: Without dead ends: 22 [2019-09-03 20:56:41,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:56:41,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-03 20:56:41,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-09-03 20:56:41,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-03 20:56:41,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-09-03 20:56:41,432 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2019-09-03 20:56:41,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:41,432 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-09-03 20:56:41,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:56:41,433 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-09-03 20:56:41,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 20:56:41,433 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:41,434 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:41,434 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:41,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:41,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1246537969, now seen corresponding path program 5 times [2019-09-03 20:56:41,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:41,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:41,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:41,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:41,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:41,517 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:41,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:41,518 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:41,518 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:41,518 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:41,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:41,518 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:56:41,533 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:56:41,533 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:41,546 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-03 20:56:41,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:41,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-03 20:56:41,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:41,556 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:41,556 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:41,655 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:41,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:41,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2019-09-03 20:56:41,660 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:41,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 20:56:41,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 20:56:41,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-03 20:56:41,661 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 8 states. [2019-09-03 20:56:41,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:41,692 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-09-03 20:56:41,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:56:41,692 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-09-03 20:56:41,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:41,693 INFO L225 Difference]: With dead ends: 24 [2019-09-03 20:56:41,693 INFO L226 Difference]: Without dead ends: 24 [2019-09-03 20:56:41,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-03 20:56:41,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-03 20:56:41,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-09-03 20:56:41,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-03 20:56:41,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-09-03 20:56:41,697 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2019-09-03 20:56:41,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:41,698 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-09-03 20:56:41,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 20:56:41,698 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-09-03 20:56:41,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-03 20:56:41,699 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:41,699 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:41,699 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:41,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:41,700 INFO L82 PathProgramCache]: Analyzing trace with hash 762473391, now seen corresponding path program 6 times [2019-09-03 20:56:41,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:41,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:41,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:41,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:41,701 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:41,777 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:41,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:41,778 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:41,778 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:41,778 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:41,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:41,778 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:56:41,799 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:56:41,799 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:41,814 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:56:41,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:41,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 20:56:41,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:41,833 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:41,834 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:41,961 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:41,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:41,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2019-09-03 20:56:41,966 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:41,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 20:56:41,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 20:56:41,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-03 20:56:41,967 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 9 states. [2019-09-03 20:56:41,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:41,997 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-09-03 20:56:41,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:56:41,999 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-09-03 20:56:41,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:42,000 INFO L225 Difference]: With dead ends: 26 [2019-09-03 20:56:42,000 INFO L226 Difference]: Without dead ends: 26 [2019-09-03 20:56:42,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 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-03 20:56:42,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-03 20:56:42,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-09-03 20:56:42,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-03 20:56:42,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-09-03 20:56:42,007 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2019-09-03 20:56:42,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:42,007 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-09-03 20:56:42,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 20:56:42,009 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-09-03 20:56:42,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-03 20:56:42,010 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:42,010 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:42,010 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:42,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:42,011 INFO L82 PathProgramCache]: Analyzing trace with hash -567118099, now seen corresponding path program 7 times [2019-09-03 20:56:42,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:42,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:42,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:42,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:42,012 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:42,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:42,108 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:42,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:42,108 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:42,108 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:42,108 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:42,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:42,109 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:42,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:42,123 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:56:42,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:42,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 20:56:42,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:42,142 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:42,142 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:42,281 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:42,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:42,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2019-09-03 20:56:42,287 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:42,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 20:56:42,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 20:56:42,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-03 20:56:42,289 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 10 states. [2019-09-03 20:56:42,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:42,337 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-09-03 20:56:42,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 20:56:42,338 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-09-03 20:56:42,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:42,338 INFO L225 Difference]: With dead ends: 28 [2019-09-03 20:56:42,339 INFO L226 Difference]: Without dead ends: 28 [2019-09-03 20:56:42,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-03 20:56:42,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-03 20:56:42,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-09-03 20:56:42,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-03 20:56:42,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-09-03 20:56:42,343 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2019-09-03 20:56:42,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:42,343 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-09-03 20:56:42,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 20:56:42,343 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-09-03 20:56:42,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-03 20:56:42,344 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:42,344 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:42,345 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:42,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:42,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1595714219, now seen corresponding path program 8 times [2019-09-03 20:56:42,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:42,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:42,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:42,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:42,346 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:42,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:42,420 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:42,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:42,421 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:42,421 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:42,421 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:42,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:42,421 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:56:42,438 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:56:42,438 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:42,451 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-03 20:56:42,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:42,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 20:56:42,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:42,464 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:42,464 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:42,609 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:56:42,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:42,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2019-09-03 20:56:42,614 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:42,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 20:56:42,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 20:56:42,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-03 20:56:42,615 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 11 states. [2019-09-03 20:56:42,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:42,655 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-09-03 20:56:42,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 20:56:42,656 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2019-09-03 20:56:42,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:42,657 INFO L225 Difference]: With dead ends: 30 [2019-09-03 20:56:42,657 INFO L226 Difference]: Without dead ends: 30 [2019-09-03 20:56:42,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-03 20:56:42,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-03 20:56:42,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-09-03 20:56:42,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-03 20:56:42,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-09-03 20:56:42,661 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2019-09-03 20:56:42,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:42,661 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-09-03 20:56:42,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 20:56:42,661 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-09-03 20:56:42,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 20:56:42,662 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:42,662 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:42,663 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:42,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:42,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1313400553, now seen corresponding path program 9 times [2019-09-03 20:56:42,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:42,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:42,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:42,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:42,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:42,755 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:42,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:42,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:42,755 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:42,755 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:42,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:42,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:42,768 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:56:42,769 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:56:42,779 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:56:42,779 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:42,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 20:56:42,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:42,789 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:42,789 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:42,965 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:42,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:42,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2019-09-03 20:56:42,969 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:42,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 20:56:42,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 20:56:42,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-03 20:56:42,971 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 12 states. [2019-09-03 20:56:43,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:43,014 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-09-03 20:56:43,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 20:56:43,016 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-09-03 20:56:43,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:43,017 INFO L225 Difference]: With dead ends: 32 [2019-09-03 20:56:43,017 INFO L226 Difference]: Without dead ends: 32 [2019-09-03 20:56:43,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 47 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-03 20:56:43,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-03 20:56:43,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-09-03 20:56:43,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-03 20:56:43,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-09-03 20:56:43,022 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2019-09-03 20:56:43,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:43,023 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-09-03 20:56:43,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 20:56:43,023 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-09-03 20:56:43,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-03 20:56:43,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:43,025 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:43,026 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:43,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:43,027 INFO L82 PathProgramCache]: Analyzing trace with hash 592907175, now seen corresponding path program 10 times [2019-09-03 20:56:43,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:43,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:43,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:43,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:43,029 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:43,129 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:43,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:43,129 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:43,129 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:43,129 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:43,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:43,130 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:43,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:43,140 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:56:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:43,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 20:56:43,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:43,188 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:43,189 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:43,395 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:43,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:43,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2019-09-03 20:56:43,399 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:43,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 20:56:43,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 20:56:43,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-03 20:56:43,402 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 13 states. [2019-09-03 20:56:43,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:43,440 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-09-03 20:56:43,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 20:56:43,441 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2019-09-03 20:56:43,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:43,442 INFO L225 Difference]: With dead ends: 34 [2019-09-03 20:56:43,442 INFO L226 Difference]: Without dead ends: 34 [2019-09-03 20:56:43,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-03 20:56:43,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-03 20:56:43,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-09-03 20:56:43,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-03 20:56:43,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-09-03 20:56:43,451 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2019-09-03 20:56:43,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:43,451 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-09-03 20:56:43,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 20:56:43,452 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-09-03 20:56:43,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-03 20:56:43,453 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:43,453 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:43,453 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:43,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:43,454 INFO L82 PathProgramCache]: Analyzing trace with hash -311494427, now seen corresponding path program 11 times [2019-09-03 20:56:43,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:43,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:43,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:43,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:43,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:43,575 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:43,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:43,575 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:43,575 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:43,575 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:43,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:43,576 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:43,598 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:56:43,598 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:56:43,612 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-03 20:56:43,613 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:43,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 20:56:43,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:43,622 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:43,623 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:43,822 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:43,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:43,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 26 [2019-09-03 20:56:43,825 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:43,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 20:56:43,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 20:56:43,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-03 20:56:43,827 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 14 states. [2019-09-03 20:56:43,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:43,881 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-09-03 20:56:43,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 20:56:43,882 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2019-09-03 20:56:43,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:43,882 INFO L225 Difference]: With dead ends: 36 [2019-09-03 20:56:43,883 INFO L226 Difference]: Without dead ends: 36 [2019-09-03 20:56:43,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 53 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-03 20:56:43,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-03 20:56:43,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-09-03 20:56:43,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-03 20:56:43,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-09-03 20:56:43,887 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2019-09-03 20:56:43,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:43,887 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-09-03 20:56:43,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 20:56:43,888 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-09-03 20:56:43,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-03 20:56:43,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:43,888 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:43,889 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:43,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:43,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1858040157, now seen corresponding path program 12 times [2019-09-03 20:56:43,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:43,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:43,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:43,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:43,890 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:44,012 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:44,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:44,013 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:44,013 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:44,013 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:44,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:44,013 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:44,039 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:56:44,039 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:56:44,048 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:56:44,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:44,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 20:56:44,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:44,058 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:44,058 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:44,302 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:44,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:44,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2019-09-03 20:56:44,306 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:44,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 20:56:44,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 20:56:44,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-03 20:56:44,307 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 15 states. [2019-09-03 20:56:44,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:44,361 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-09-03 20:56:44,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 20:56:44,362 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2019-09-03 20:56:44,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:44,363 INFO L225 Difference]: With dead ends: 38 [2019-09-03 20:56:44,363 INFO L226 Difference]: Without dead ends: 38 [2019-09-03 20:56:44,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 56 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-03 20:56:44,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-03 20:56:44,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-09-03 20:56:44,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-03 20:56:44,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-09-03 20:56:44,369 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2019-09-03 20:56:44,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:44,369 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-09-03 20:56:44,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 20:56:44,369 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-09-03 20:56:44,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-03 20:56:44,370 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:44,370 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:44,371 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:44,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:44,371 INFO L82 PathProgramCache]: Analyzing trace with hash -2029802271, now seen corresponding path program 13 times [2019-09-03 20:56:44,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:44,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:44,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:44,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:44,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:44,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:44,488 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:44,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:44,488 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:44,489 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:44,489 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:44,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:44,489 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:44,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:44,502 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:56:44,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:44,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 20:56:44,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:44,531 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:44,531 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:44,828 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:44,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:44,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2019-09-03 20:56:44,831 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:44,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 20:56:44,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 20:56:44,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-03 20:56:44,833 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 16 states. [2019-09-03 20:56:44,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:44,878 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-09-03 20:56:44,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 20:56:44,879 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2019-09-03 20:56:44,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:44,880 INFO L225 Difference]: With dead ends: 40 [2019-09-03 20:56:44,881 INFO L226 Difference]: Without dead ends: 40 [2019-09-03 20:56:44,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-03 20:56:44,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-03 20:56:44,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-09-03 20:56:44,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-03 20:56:44,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-09-03 20:56:44,886 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2019-09-03 20:56:44,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:44,886 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-09-03 20:56:44,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 20:56:44,886 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-09-03 20:56:44,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-03 20:56:44,887 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:44,887 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:44,888 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:44,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:44,888 INFO L82 PathProgramCache]: Analyzing trace with hash 410530719, now seen corresponding path program 14 times [2019-09-03 20:56:44,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:44,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:44,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:44,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:44,889 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:45,023 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:45,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:45,023 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:45,024 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:45,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:45,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:45,024 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:45,036 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:56:45,036 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:56:45,056 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-03 20:56:45,056 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:45,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 20:56:45,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:45,068 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:45,068 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:45,384 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:45,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:45,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2019-09-03 20:56:45,389 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:45,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 20:56:45,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 20:56:45,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-03 20:56:45,391 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 17 states. [2019-09-03 20:56:45,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:45,455 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-09-03 20:56:45,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 20:56:45,455 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2019-09-03 20:56:45,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:45,455 INFO L225 Difference]: With dead ends: 42 [2019-09-03 20:56:45,456 INFO L226 Difference]: Without dead ends: 42 [2019-09-03 20:56:45,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-03 20:56:45,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-03 20:56:45,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-09-03 20:56:45,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-03 20:56:45,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-09-03 20:56:45,460 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2019-09-03 20:56:45,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:45,460 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-09-03 20:56:45,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 20:56:45,461 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-09-03 20:56:45,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-03 20:56:45,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:45,461 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:45,462 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:45,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:45,462 INFO L82 PathProgramCache]: Analyzing trace with hash 518390493, now seen corresponding path program 15 times [2019-09-03 20:56:45,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:45,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:45,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:45,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:45,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:45,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:45,617 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:45,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:45,618 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:45,618 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:45,618 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:45,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:45,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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:45,630 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:56:45,630 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:56:45,656 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:56:45,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:45,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-03 20:56:45,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:45,671 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:45,671 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:45,982 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:45,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:45,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2019-09-03 20:56:45,985 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:45,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 20:56:45,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 20:56:45,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 20:56:45,987 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 18 states. [2019-09-03 20:56:46,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:46,051 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-09-03 20:56:46,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-03 20:56:46,052 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 40 [2019-09-03 20:56:46,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:46,053 INFO L225 Difference]: With dead ends: 44 [2019-09-03 20:56:46,053 INFO L226 Difference]: Without dead ends: 44 [2019-09-03 20:56:46,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 20:56:46,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-03 20:56:46,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-09-03 20:56:46,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-03 20:56:46,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-09-03 20:56:46,057 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2019-09-03 20:56:46,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:46,057 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-09-03 20:56:46,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 20:56:46,058 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-09-03 20:56:46,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-03 20:56:46,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:46,059 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:46,059 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:46,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:46,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1092418203, now seen corresponding path program 16 times [2019-09-03 20:56:46,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:46,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:46,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:46,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:46,060 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:46,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:46,253 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:46,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:46,253 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:46,253 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:46,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:46,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:46,254 INFO 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-03 20:56:46,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:46,276 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-03 20:56:46,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:46,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 20:56:46,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:46,300 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:46,301 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:46,725 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:46,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:46,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 36 [2019-09-03 20:56:46,728 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:46,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 20:56:46,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 20:56:46,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 20:56:46,730 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 19 states. [2019-09-03 20:56:46,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:46,779 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-09-03 20:56:46,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 20:56:46,779 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 42 [2019-09-03 20:56:46,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:46,780 INFO L225 Difference]: With dead ends: 46 [2019-09-03 20:56:46,780 INFO L226 Difference]: Without dead ends: 46 [2019-09-03 20:56:46,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 20:56:46,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-03 20:56:46,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-09-03 20:56:46,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-03 20:56:46,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-09-03 20:56:46,792 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2019-09-03 20:56:46,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:46,792 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-09-03 20:56:46,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 20:56:46,792 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-09-03 20:56:46,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-03 20:56:46,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:46,793 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:46,798 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:46,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:46,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1317733671, now seen corresponding path program 17 times [2019-09-03 20:56:46,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:46,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:46,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:46,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:46,800 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:46,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:47,030 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:47,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:47,031 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:47,031 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:47,031 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:47,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:47,031 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:47,041 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:56:47,041 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:56:47,058 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-03 20:56:47,058 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:47,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-03 20:56:47,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:47,068 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:47,068 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:47,618 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:47,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:47,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 38 [2019-09-03 20:56:47,623 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:47,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 20:56:47,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 20:56:47,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 20:56:47,624 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 20 states. [2019-09-03 20:56:47,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:47,676 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-09-03 20:56:47,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 20:56:47,677 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 44 [2019-09-03 20:56:47,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:47,677 INFO L225 Difference]: With dead ends: 48 [2019-09-03 20:56:47,677 INFO L226 Difference]: Without dead ends: 48 [2019-09-03 20:56:47,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 20:56:47,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-03 20:56:47,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-09-03 20:56:47,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-03 20:56:47,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-09-03 20:56:47,687 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2019-09-03 20:56:47,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:47,687 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-09-03 20:56:47,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 20:56:47,687 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-09-03 20:56:47,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-03 20:56:47,688 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:47,688 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:47,688 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:47,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:47,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1808655255, now seen corresponding path program 18 times [2019-09-03 20:56:47,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:47,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:47,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:47,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:47,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:47,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:47,936 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:47,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:47,937 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:47,937 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:47,937 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:47,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:47,938 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:47,966 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:56:47,967 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:56:47,982 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:56:47,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:47,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 20:56:47,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:47,997 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:47,997 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:48,534 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:48,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:48,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2019-09-03 20:56:48,538 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:48,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 20:56:48,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 20:56:48,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 20:56:48,539 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 21 states. [2019-09-03 20:56:48,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:48,592 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-09-03 20:56:48,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 20:56:48,597 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 46 [2019-09-03 20:56:48,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:48,598 INFO L225 Difference]: With dead ends: 50 [2019-09-03 20:56:48,598 INFO L226 Difference]: Without dead ends: 50 [2019-09-03 20:56:48,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 20:56:48,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-03 20:56:48,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-09-03 20:56:48,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-03 20:56:48,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-09-03 20:56:48,602 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2019-09-03 20:56:48,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:48,603 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-09-03 20:56:48,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 20:56:48,603 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-09-03 20:56:48,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-03 20:56:48,604 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:48,604 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:48,604 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:48,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:48,604 INFO L82 PathProgramCache]: Analyzing trace with hash -208694059, now seen corresponding path program 19 times [2019-09-03 20:56:48,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:48,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:48,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:48,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:48,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:48,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:48,797 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:48,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:48,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:48,797 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:48,797 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:48,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:48,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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:48,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:48,809 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:56:48,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:48,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 20:56:48,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:48,838 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:48,838 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:49,360 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:49,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:49,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 42 [2019-09-03 20:56:49,363 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:49,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 20:56:49,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 20:56:49,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 20:56:49,365 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 22 states. [2019-09-03 20:56:49,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:49,438 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-09-03 20:56:49,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-03 20:56:49,439 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2019-09-03 20:56:49,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:49,439 INFO L225 Difference]: With dead ends: 52 [2019-09-03 20:56:49,439 INFO L226 Difference]: Without dead ends: 52 [2019-09-03 20:56:49,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 20:56:49,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-03 20:56:49,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-09-03 20:56:49,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-03 20:56:49,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-09-03 20:56:49,443 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2019-09-03 20:56:49,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:49,443 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-09-03 20:56:49,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 20:56:49,443 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-09-03 20:56:49,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-03 20:56:49,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:49,444 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:49,444 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:49,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:49,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1851134317, now seen corresponding path program 20 times [2019-09-03 20:56:49,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:49,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:49,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:49,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:49,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:49,669 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:49,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:49,670 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:49,670 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:49,670 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:49,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:49,670 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:49,685 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:56:49,685 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:56:49,726 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-03 20:56:49,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:49,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 20:56:49,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:49,739 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:49,739 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:50,269 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:50,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:50,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 44 [2019-09-03 20:56:50,273 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:50,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 20:56:50,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 20:56:50,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 20:56:50,275 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 23 states. [2019-09-03 20:56:50,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:50,336 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-09-03 20:56:50,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 20:56:50,338 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 50 [2019-09-03 20:56:50,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:50,339 INFO L225 Difference]: With dead ends: 54 [2019-09-03 20:56:50,339 INFO L226 Difference]: Without dead ends: 54 [2019-09-03 20:56:50,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 20:56:50,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-03 20:56:50,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-09-03 20:56:50,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-03 20:56:50,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-09-03 20:56:50,343 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2019-09-03 20:56:50,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:50,345 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-09-03 20:56:50,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 20:56:50,346 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-09-03 20:56:50,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-03 20:56:50,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:50,346 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:50,347 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:50,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:50,347 INFO L82 PathProgramCache]: Analyzing trace with hash 311742673, now seen corresponding path program 21 times [2019-09-03 20:56:50,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:50,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:50,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:50,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:50,350 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:50,574 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:50,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:50,575 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:50,575 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:50,575 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:50,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:50,575 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:50,586 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:56:50,587 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:56:50,597 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:56:50,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:50,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 20:56:50,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:50,608 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:50,608 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:51,187 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (22)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:56:51,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:51,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 46 [2019-09-03 20:56:51,191 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:51,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 20:56:51,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 20:56:51,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 20:56:51,193 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 24 states. [2019-09-03 20:56:51,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:51,250 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-09-03 20:56:51,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 20:56:51,250 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 52 [2019-09-03 20:56:51,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:51,251 INFO L225 Difference]: With dead ends: 56 [2019-09-03 20:56:51,251 INFO L226 Difference]: Without dead ends: 56 [2019-09-03 20:56:51,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 83 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-03 20:56:51,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-03 20:56:51,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-09-03 20:56:51,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-03 20:56:51,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-09-03 20:56:51,256 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2019-09-03 20:56:51,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:51,257 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-09-03 20:56:51,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 20:56:51,257 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-09-03 20:56:51,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-03 20:56:51,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:51,257 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:51,258 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:51,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:51,258 INFO L82 PathProgramCache]: Analyzing trace with hash 72358799, now seen corresponding path program 22 times [2019-09-03 20:56:51,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:51,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:51,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:51,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:51,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:51,528 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:51,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:51,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:51,528 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:51,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:51,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:51,529 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:51,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:51,539 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:56:51,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:51,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 20:56:51,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:51,563 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:51,563 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:52,179 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:52,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:52,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2019-09-03 20:56:52,182 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:52,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 20:56:52,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 20:56:52,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 20:56:52,183 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 25 states. [2019-09-03 20:56:52,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:52,260 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-09-03 20:56:52,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 20:56:52,260 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 54 [2019-09-03 20:56:52,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:52,261 INFO L225 Difference]: With dead ends: 58 [2019-09-03 20:56:52,262 INFO L226 Difference]: Without dead ends: 58 [2019-09-03 20:56:52,263 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 20:56:52,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-03 20:56:52,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-09-03 20:56:52,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-03 20:56:52,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-09-03 20:56:52,266 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2019-09-03 20:56:52,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:52,266 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-09-03 20:56:52,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 20:56:52,267 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-09-03 20:56:52,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-03 20:56:52,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:52,267 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:52,268 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:52,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:52,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1952689869, now seen corresponding path program 23 times [2019-09-03 20:56:52,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:52,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:52,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:52,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:52,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:52,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:52,540 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:52,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:52,541 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:52,541 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:52,541 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:52,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:52,541 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:52,551 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:56:52,552 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:56:52,581 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-09-03 20:56:52,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:52,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-03 20:56:52,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:52,593 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:52,593 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:53,226 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:53,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:53,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 50 [2019-09-03 20:56:53,229 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:53,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 20:56:53,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 20:56:53,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 20:56:53,231 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 26 states. [2019-09-03 20:56:53,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:53,301 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-09-03 20:56:53,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 20:56:53,301 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2019-09-03 20:56:53,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:53,302 INFO L225 Difference]: With dead ends: 60 [2019-09-03 20:56:53,302 INFO L226 Difference]: Without dead ends: 60 [2019-09-03 20:56:53,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 20:56:53,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-03 20:56:53,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-09-03 20:56:53,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-03 20:56:53,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-09-03 20:56:53,307 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2019-09-03 20:56:53,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:53,307 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-09-03 20:56:53,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 20:56:53,307 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-09-03 20:56:53,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-03 20:56:53,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:53,308 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:53,308 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:53,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:53,308 INFO L82 PathProgramCache]: Analyzing trace with hash 769616523, now seen corresponding path program 24 times [2019-09-03 20:56:53,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:53,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:53,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:53,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:53,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:53,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:53,614 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:53,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:53,615 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:53,615 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:53,615 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:53,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:53,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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:53,633 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:56:53,633 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:56:53,646 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:56:53,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:53,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 20:56:53,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:53,658 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:53,658 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:54,327 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:54,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:54,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 52 [2019-09-03 20:56:54,330 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:54,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 20:56:54,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 20:56:54,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:56:54,333 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 27 states. [2019-09-03 20:56:54,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:54,417 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-09-03 20:56:54,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 20:56:54,420 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 58 [2019-09-03 20:56:54,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:54,421 INFO L225 Difference]: With dead ends: 62 [2019-09-03 20:56:54,421 INFO L226 Difference]: Without dead ends: 62 [2019-09-03 20:56:54,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 92 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-03 20:56:54,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-03 20:56:54,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-09-03 20:56:54,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-03 20:56:54,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-09-03 20:56:54,424 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2019-09-03 20:56:54,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:54,424 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-09-03 20:56:54,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 20:56:54,424 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-09-03 20:56:54,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-03 20:56:54,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:54,426 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:54,426 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:54,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:54,426 INFO L82 PathProgramCache]: Analyzing trace with hash 2002464457, now seen corresponding path program 25 times [2019-09-03 20:56:54,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:54,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:54,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:54,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:54,428 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:54,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:54,725 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:54,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:54,725 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:54,725 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:54,725 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:54,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:54,725 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:54,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:54,744 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:56:54,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:54,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 20:56:54,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:54,783 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:54,783 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:55,550 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:55,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:55,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 54 [2019-09-03 20:56:55,553 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:55,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 20:56:55,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 20:56:55,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 20:56:55,556 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 28 states. [2019-09-03 20:56:55,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:55,631 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-09-03 20:56:55,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-03 20:56:55,637 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2019-09-03 20:56:55,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:55,638 INFO L225 Difference]: With dead ends: 64 [2019-09-03 20:56:55,638 INFO L226 Difference]: Without dead ends: 64 [2019-09-03 20:56:55,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 20:56:55,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-03 20:56:55,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-09-03 20:56:55,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-03 20:56:55,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-09-03 20:56:55,642 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2019-09-03 20:56:55,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:55,642 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-09-03 20:56:55,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 20:56:55,642 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-09-03 20:56:55,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-03 20:56:55,643 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:55,643 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:55,643 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:55,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:55,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1358355335, now seen corresponding path program 26 times [2019-09-03 20:56:55,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:55,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:55,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:55,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:55,645 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:55,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:55,972 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:55,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:55,973 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:55,973 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:55,973 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:55,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:55,973 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:55,994 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:56:55,995 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:56:56,029 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-09-03 20:56:56,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:56,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 20:56:56,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:56,041 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:56,041 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:56,847 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:56,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:56,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 56 [2019-09-03 20:56:56,850 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:56,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 20:56:56,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 20:56:56,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 20:56:56,852 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 29 states. [2019-09-03 20:56:56,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:56,943 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-09-03 20:56:56,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 20:56:56,943 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2019-09-03 20:56:56,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:56,944 INFO L225 Difference]: With dead ends: 66 [2019-09-03 20:56:56,944 INFO L226 Difference]: Without dead ends: 66 [2019-09-03 20:56:56,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 20:56:56,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-03 20:56:56,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-09-03 20:56:56,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-03 20:56:56,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-09-03 20:56:56,947 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2019-09-03 20:56:56,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:56,947 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-09-03 20:56:56,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 20:56:56,947 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-09-03 20:56:56,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-03 20:56:56,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:56,948 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:56,948 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:56,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:56,949 INFO L82 PathProgramCache]: Analyzing trace with hash 844779717, now seen corresponding path program 27 times [2019-09-03 20:56:56,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:56,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:56,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:56,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:56,950 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:57,659 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:57,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:57,659 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:57,659 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:57,659 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:57,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:57,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:57,671 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:56:57,672 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:56:57,683 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:56:57,683 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:57,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-03 20:56:57,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:57,696 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:57,696 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:58,535 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 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-03 20:56:58,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:58,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 58 [2019-09-03 20:56:58,539 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:58,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 20:56:58,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 20:56:58,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 20:56:58,544 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 30 states. [2019-09-03 20:56:58,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:58,623 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-09-03 20:56:58,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-03 20:56:58,623 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 64 [2019-09-03 20:56:58,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:58,624 INFO L225 Difference]: With dead ends: 68 [2019-09-03 20:56:58,624 INFO L226 Difference]: Without dead ends: 68 [2019-09-03 20:56:58,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 20:56:58,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-03 20:56:58,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-09-03 20:56:58,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-03 20:56:58,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-09-03 20:56:58,629 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2019-09-03 20:56:58,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:58,629 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-09-03 20:56:58,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 20:56:58,630 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-09-03 20:56:58,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-03 20:56:58,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:58,633 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:58,633 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:58,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:58,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1219849859, now seen corresponding path program 28 times [2019-09-03 20:56:58,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:58,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:58,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:58,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:58,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:59,067 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:59,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:59,069 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:59,069 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:59,070 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:59,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:59,070 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:59,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:59,084 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:56:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:59,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 20:56:59,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:59,108 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:59,108 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:00,010 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:00,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:00,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 60 [2019-09-03 20:57:00,013 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:00,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 20:57:00,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 20:57:00,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-09-03 20:57:00,015 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 31 states. [2019-09-03 20:57:00,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:00,119 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-09-03 20:57:00,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 20:57:00,124 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 66 [2019-09-03 20:57:00,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:00,125 INFO L225 Difference]: With dead ends: 70 [2019-09-03 20:57:00,125 INFO L226 Difference]: Without dead ends: 70 [2019-09-03 20:57:00,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-09-03 20:57:00,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-03 20:57:00,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-09-03 20:57:00,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-03 20:57:00,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-09-03 20:57:00,128 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2019-09-03 20:57:00,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:00,129 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-09-03 20:57:00,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 20:57:00,129 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-09-03 20:57:00,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-03 20:57:00,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:00,130 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:00,130 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:00,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:00,130 INFO L82 PathProgramCache]: Analyzing trace with hash 885003457, now seen corresponding path program 29 times [2019-09-03 20:57:00,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:00,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:00,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:00,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:00,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:00,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:00,695 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:00,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:00,696 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:00,696 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:00,696 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:00,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:00,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:57:00,712 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:57:00,713 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:00,757 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-09-03 20:57:00,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:00,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-03 20:57:00,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:00,772 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:00,772 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:01,764 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:01,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:01,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 62 [2019-09-03 20:57:01,767 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:01,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 20:57:01,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 20:57:01,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 20:57:01,769 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 32 states. [2019-09-03 20:57:01,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:01,873 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-09-03 20:57:01,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-03 20:57:01,874 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 68 [2019-09-03 20:57:01,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:01,875 INFO L225 Difference]: With dead ends: 72 [2019-09-03 20:57:01,875 INFO L226 Difference]: Without dead ends: 72 [2019-09-03 20:57:01,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 20:57:01,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-03 20:57:01,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-09-03 20:57:01,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-03 20:57:01,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-09-03 20:57:01,879 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2019-09-03 20:57:01,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:01,879 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-09-03 20:57:01,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 20:57:01,879 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-09-03 20:57:01,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-03 20:57:01,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:01,880 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:01,880 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:01,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:01,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1220158335, now seen corresponding path program 30 times [2019-09-03 20:57:01,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:01,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:01,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:01,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:01,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:01,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:02,264 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:02,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:02,265 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:02,265 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:02,265 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:02,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:02,265 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:02,275 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:57:02,276 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:57:02,299 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:57:02,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:02,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 20:57:02,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:02,313 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:02,313 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:03,374 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:03,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:03,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 64 [2019-09-03 20:57:03,377 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:03,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 20:57:03,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 20:57:03,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 20:57:03,381 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 33 states. [2019-09-03 20:57:03,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:03,485 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-09-03 20:57:03,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 20:57:03,485 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 70 [2019-09-03 20:57:03,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:03,486 INFO L225 Difference]: With dead ends: 74 [2019-09-03 20:57:03,486 INFO L226 Difference]: Without dead ends: 74 [2019-09-03 20:57:03,487 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 20:57:03,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-03 20:57:03,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-09-03 20:57:03,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-03 20:57:03,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-09-03 20:57:03,491 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2019-09-03 20:57:03,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:03,491 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-09-03 20:57:03,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 20:57:03,492 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-09-03 20:57:03,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-03 20:57:03,492 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:03,492 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:03,493 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:03,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:03,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1181448893, now seen corresponding path program 31 times [2019-09-03 20:57:03,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:03,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:03,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:03,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:03,494 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:03,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:03,908 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:03,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:03,908 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:03,908 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:03,908 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:03,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:03,908 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:03,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:03,918 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:57:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:03,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 20:57:03,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:03,947 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:03,947 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:05,015 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:05,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:05,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 66 [2019-09-03 20:57:05,018 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:05,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-03 20:57:05,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-03 20:57:05,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 20:57:05,020 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 34 states. [2019-09-03 20:57:05,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:05,124 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-09-03 20:57:05,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-03 20:57:05,125 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 72 [2019-09-03 20:57:05,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:05,126 INFO L225 Difference]: With dead ends: 76 [2019-09-03 20:57:05,126 INFO L226 Difference]: Without dead ends: 76 [2019-09-03 20:57:05,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 20:57:05,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-03 20:57:05,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-09-03 20:57:05,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-03 20:57:05,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-09-03 20:57:05,129 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2019-09-03 20:57:05,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:05,129 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-09-03 20:57:05,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-03 20:57:05,130 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-09-03 20:57:05,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-03 20:57:05,130 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:05,130 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:05,131 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:05,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:05,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1658586501, now seen corresponding path program 32 times [2019-09-03 20:57:05,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:05,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:05,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:05,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:05,132 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:05,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:05,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:05,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:05,549 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:05,549 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:05,549 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:05,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:05,550 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:05,564 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:57:05,564 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:57:05,600 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-09-03 20:57:05,600 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:05,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 20:57:05,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:05,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:05,615 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:06,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:06,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:06,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 68 [2019-09-03 20:57:06,725 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:06,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-03 20:57:06,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-03 20:57:06,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 20:57:06,727 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 35 states. [2019-09-03 20:57:06,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:06,860 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-09-03 20:57:06,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 20:57:06,860 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 74 [2019-09-03 20:57:06,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:06,861 INFO L225 Difference]: With dead ends: 78 [2019-09-03 20:57:06,862 INFO L226 Difference]: Without dead ends: 78 [2019-09-03 20:57:06,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 20:57:06,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-03 20:57:06,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-09-03 20:57:06,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-03 20:57:06,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-09-03 20:57:06,865 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2019-09-03 20:57:06,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:06,866 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-09-03 20:57:06,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-03 20:57:06,866 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-09-03 20:57:06,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-03 20:57:06,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:06,867 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:06,867 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:06,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:06,867 INFO L82 PathProgramCache]: Analyzing trace with hash 666600121, now seen corresponding path program 33 times [2019-09-03 20:57:06,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:06,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:06,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:06,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:06,868 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:07,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:07,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:07,351 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:07,351 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:07,351 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:07,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:07,351 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:07,362 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:57:07,362 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:57:07,379 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:57:07,379 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:07,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-03 20:57:07,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:07,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:07,394 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:08,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:08,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:08,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 70 [2019-09-03 20:57:08,702 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:08,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 20:57:08,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 20:57:08,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-09-03 20:57:08,703 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 36 states. [2019-09-03 20:57:08,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:08,803 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-09-03 20:57:08,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-03 20:57:08,803 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 76 [2019-09-03 20:57:08,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:08,804 INFO L225 Difference]: With dead ends: 80 [2019-09-03 20:57:08,804 INFO L226 Difference]: Without dead ends: 80 [2019-09-03 20:57:08,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-09-03 20:57:08,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-03 20:57:08,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-09-03 20:57:08,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-03 20:57:08,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-09-03 20:57:08,807 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2019-09-03 20:57:08,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:08,807 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-09-03 20:57:08,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 20:57:08,808 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-09-03 20:57:08,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-03 20:57:08,808 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:08,808 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:08,808 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:08,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:08,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1787949943, now seen corresponding path program 34 times [2019-09-03 20:57:08,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:08,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:08,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:08,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:08,810 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:08,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:09,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:09,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:09,337 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:09,337 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:09,337 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:09,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:09,337 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:09,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:09,349 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:57:09,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:09,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 20:57:09,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:09,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:09,375 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:10,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:10,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:10,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 72 [2019-09-03 20:57:10,635 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:10,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 20:57:10,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 20:57:10,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-09-03 20:57:10,636 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 37 states. [2019-09-03 20:57:10,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:10,733 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-09-03 20:57:10,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-03 20:57:10,733 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 78 [2019-09-03 20:57:10,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:10,735 INFO L225 Difference]: With dead ends: 82 [2019-09-03 20:57:10,735 INFO L226 Difference]: Without dead ends: 82 [2019-09-03 20:57:10,735 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-09-03 20:57:10,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-03 20:57:10,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-09-03 20:57:10,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-03 20:57:10,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-09-03 20:57:10,739 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2019-09-03 20:57:10,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:10,739 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-09-03 20:57:10,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 20:57:10,739 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-09-03 20:57:10,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-03 20:57:10,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:10,740 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:10,740 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:10,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:10,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1368337589, now seen corresponding path program 35 times [2019-09-03 20:57:10,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:10,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:10,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:10,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:10,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:11,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:11,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:11,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:11,280 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:11,280 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:11,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:11,280 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:11,290 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:57:11,290 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:57:11,331 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-09-03 20:57:11,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:11,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-03 20:57:11,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:11,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:11,345 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:12,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:12,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:12,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 74 [2019-09-03 20:57:12,694 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:12,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-03 20:57:12,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-03 20:57:12,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-09-03 20:57:12,695 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 38 states. [2019-09-03 20:57:12,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:12,795 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-09-03 20:57:12,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-03 20:57:12,795 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 80 [2019-09-03 20:57:12,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:12,796 INFO L225 Difference]: With dead ends: 84 [2019-09-03 20:57:12,796 INFO L226 Difference]: Without dead ends: 84 [2019-09-03 20:57:12,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-09-03 20:57:12,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-09-03 20:57:12,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2019-09-03 20:57:12,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-03 20:57:12,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-09-03 20:57:12,800 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2019-09-03 20:57:12,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:12,800 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-09-03 20:57:12,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-03 20:57:12,801 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-09-03 20:57:12,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-03 20:57:12,801 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:12,801 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:12,802 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:12,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:12,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1847791219, now seen corresponding path program 36 times [2019-09-03 20:57:12,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:12,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:12,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:12,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:12,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:13,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:13,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:13,349 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:13,349 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:13,349 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:13,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:13,349 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:13,360 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:57:13,360 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:57:13,376 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:57:13,377 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:13,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 20:57:13,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:13,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:13,394 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:14,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:14,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:14,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 76 [2019-09-03 20:57:14,927 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:14,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-03 20:57:14,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-03 20:57:14,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-09-03 20:57:14,929 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 39 states. [2019-09-03 20:57:15,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:15,036 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-09-03 20:57:15,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 20:57:15,037 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 82 [2019-09-03 20:57:15,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:15,038 INFO L225 Difference]: With dead ends: 86 [2019-09-03 20:57:15,038 INFO L226 Difference]: Without dead ends: 86 [2019-09-03 20:57:15,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-09-03 20:57:15,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-09-03 20:57:15,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-09-03 20:57:15,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-03 20:57:15,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-09-03 20:57:15,041 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2019-09-03 20:57:15,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:15,041 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-09-03 20:57:15,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-03 20:57:15,041 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-09-03 20:57:15,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-03 20:57:15,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:15,042 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:15,042 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:15,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:15,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1253738319, now seen corresponding path program 37 times [2019-09-03 20:57:15,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:15,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:15,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:15,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:15,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:15,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:15,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:15,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:15,882 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:15,883 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:15,883 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:15,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:15,883 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:57:15,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:15,896 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:15,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:15,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-03 20:57:15,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:15,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:15,935 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:17,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:17,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:17,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 78 [2019-09-03 20:57:17,445 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:17,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-03 20:57:17,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-03 20:57:17,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-09-03 20:57:17,446 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 40 states. [2019-09-03 20:57:17,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:17,588 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-09-03 20:57:17,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-03 20:57:17,589 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 84 [2019-09-03 20:57:17,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:17,590 INFO L225 Difference]: With dead ends: 88 [2019-09-03 20:57:17,590 INFO L226 Difference]: Without dead ends: 88 [2019-09-03 20:57:17,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-09-03 20:57:17,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-03 20:57:17,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-09-03 20:57:17,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-03 20:57:17,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-09-03 20:57:17,594 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2019-09-03 20:57:17,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:17,594 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-09-03 20:57:17,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-03 20:57:17,594 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-09-03 20:57:17,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-03 20:57:17,595 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:17,595 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:17,595 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:17,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:17,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1116320913, now seen corresponding path program 38 times [2019-09-03 20:57:17,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:17,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:17,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:17,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:17,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:17,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:18,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:18,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:18,326 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:18,326 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:18,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:18,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:18,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:18,336 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:57:18,336 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:57:18,379 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-09-03 20:57:18,379 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:18,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 20:57:18,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:18,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:18,397 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:19,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:19,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:19,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 80 [2019-09-03 20:57:19,983 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:19,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-03 20:57:19,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-03 20:57:19,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-09-03 20:57:19,986 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 41 states. [2019-09-03 20:57:20,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:20,121 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-09-03 20:57:20,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-03 20:57:20,122 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 86 [2019-09-03 20:57:20,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:20,123 INFO L225 Difference]: With dead ends: 90 [2019-09-03 20:57:20,123 INFO L226 Difference]: Without dead ends: 90 [2019-09-03 20:57:20,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-09-03 20:57:20,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-03 20:57:20,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-09-03 20:57:20,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-09-03 20:57:20,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-09-03 20:57:20,126 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2019-09-03 20:57:20,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:20,126 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-09-03 20:57:20,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-03 20:57:20,126 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-09-03 20:57:20,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-03 20:57:20,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:20,127 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:20,127 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:20,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:20,128 INFO L82 PathProgramCache]: Analyzing trace with hash 2092787373, now seen corresponding path program 39 times [2019-09-03 20:57:20,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:20,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:20,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:20,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:20,129 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:20,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:20,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:20,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:20,762 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:20,762 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:20,762 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:20,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:20,762 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:20,773 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:57:20,773 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:57:20,792 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:57:20,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:20,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-03 20:57:20,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:20,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:20,811 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:22,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:22,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:22,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 82 [2019-09-03 20:57:22,486 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:22,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-03 20:57:22,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-03 20:57:22,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-09-03 20:57:22,487 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 42 states. [2019-09-03 20:57:22,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:22,618 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-09-03 20:57:22,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-03 20:57:22,619 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 88 [2019-09-03 20:57:22,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:22,620 INFO L225 Difference]: With dead ends: 92 [2019-09-03 20:57:22,620 INFO L226 Difference]: Without dead ends: 92 [2019-09-03 20:57:22,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-09-03 20:57:22,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-09-03 20:57:22,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-09-03 20:57:22,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-03 20:57:22,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-09-03 20:57:22,622 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2019-09-03 20:57:22,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:22,622 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-09-03 20:57:22,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-03 20:57:22,623 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-09-03 20:57:22,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-03 20:57:22,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:22,623 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:22,623 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:22,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:22,624 INFO L82 PathProgramCache]: Analyzing trace with hash -2035635605, now seen corresponding path program 40 times [2019-09-03 20:57:22,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:22,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:22,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:22,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:22,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:22,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:23,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:23,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:23,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:23,272 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:23,272 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:23,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:23,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:23,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:23,283 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:57:23,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:23,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 20:57:23,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:23,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:23,318 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:25,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:25,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:25,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 84 [2019-09-03 20:57:25,075 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:25,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-03 20:57:25,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-03 20:57:25,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-09-03 20:57:25,077 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 43 states. [2019-09-03 20:57:25,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:25,233 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-09-03 20:57:25,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-03 20:57:25,237 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 90 [2019-09-03 20:57:25,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:25,238 INFO L225 Difference]: With dead ends: 94 [2019-09-03 20:57:25,238 INFO L226 Difference]: Without dead ends: 94 [2019-09-03 20:57:25,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-09-03 20:57:25,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-03 20:57:25,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-09-03 20:57:25,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-09-03 20:57:25,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-09-03 20:57:25,241 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2019-09-03 20:57:25,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:25,242 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-09-03 20:57:25,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-03 20:57:25,242 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-09-03 20:57:25,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-03 20:57:25,243 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:25,243 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:25,244 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:25,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:25,245 INFO L82 PathProgramCache]: Analyzing trace with hash -900335959, now seen corresponding path program 41 times [2019-09-03 20:57:25,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:25,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:25,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:25,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:25,249 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:25,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:26,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:26,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:26,021 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:26,021 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:26,021 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:26,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:26,021 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:26,030 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:57:26,030 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:57:26,077 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-09-03 20:57:26,078 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:26,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-03 20:57:26,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:26,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:26,092 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:27,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:27,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:27,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 86 [2019-09-03 20:57:27,884 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:27,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-03 20:57:27,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-03 20:57:27,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-09-03 20:57:27,886 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 44 states. [2019-09-03 20:57:28,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:28,129 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-09-03 20:57:28,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-03 20:57:28,129 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 92 [2019-09-03 20:57:28,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:28,130 INFO L225 Difference]: With dead ends: 96 [2019-09-03 20:57:28,131 INFO L226 Difference]: Without dead ends: 96 [2019-09-03 20:57:28,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-09-03 20:57:28,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-03 20:57:28,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-09-03 20:57:28,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-03 20:57:28,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-09-03 20:57:28,137 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2019-09-03 20:57:28,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:28,138 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-09-03 20:57:28,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-03 20:57:28,138 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-09-03 20:57:28,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-03 20:57:28,138 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:28,139 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:28,139 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:28,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:28,139 INFO L82 PathProgramCache]: Analyzing trace with hash -799069337, now seen corresponding path program 42 times [2019-09-03 20:57:28,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:28,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:28,141 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:28,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:28,141 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:28,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:28,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:28,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:28,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:28,922 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:28,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:28,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:28,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:28,934 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:57:28,934 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:57:28,952 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:57:28,952 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:28,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 20:57:28,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:28,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:28,972 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:30,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (43)] Exception during sending of exit command (exit): Stream closed [2019-09-03 20:57:30,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:30,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 88 [2019-09-03 20:57:30,953 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:30,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-03 20:57:30,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-03 20:57:30,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-09-03 20:57:30,955 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 45 states. [2019-09-03 20:57:31,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:31,122 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-09-03 20:57:31,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-03 20:57:31,122 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 94 [2019-09-03 20:57:31,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:31,123 INFO L225 Difference]: With dead ends: 98 [2019-09-03 20:57:31,123 INFO L226 Difference]: Without dead ends: 98 [2019-09-03 20:57:31,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-09-03 20:57:31,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-03 20:57:31,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-09-03 20:57:31,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-03 20:57:31,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-09-03 20:57:31,127 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2019-09-03 20:57:31,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:31,127 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-09-03 20:57:31,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-03 20:57:31,127 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-09-03 20:57:31,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-03 20:57:31,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:31,128 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:31,129 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:31,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:31,129 INFO L82 PathProgramCache]: Analyzing trace with hash 2028873893, now seen corresponding path program 43 times [2019-09-03 20:57:31,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:31,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:31,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:31,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:31,132 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:31,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:31,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:31,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:31,895 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:31,895 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:31,896 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:31,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:31,896 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:31,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:31,908 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:57:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:31,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-03 20:57:31,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:31,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:31,945 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:33,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (44)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:57:33,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:33,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 90 [2019-09-03 20:57:33,891 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:33,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-03 20:57:33,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-03 20:57:33,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-09-03 20:57:33,892 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 46 states. [2019-09-03 20:57:34,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:34,040 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-09-03 20:57:34,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-03 20:57:34,041 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 96 [2019-09-03 20:57:34,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:34,042 INFO L225 Difference]: With dead ends: 100 [2019-09-03 20:57:34,043 INFO L226 Difference]: Without dead ends: 100 [2019-09-03 20:57:34,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 149 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-03 20:57:34,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-03 20:57:34,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2019-09-03 20:57:34,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-09-03 20:57:34,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-09-03 20:57:34,045 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2019-09-03 20:57:34,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:34,045 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-09-03 20:57:34,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-03 20:57:34,045 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-09-03 20:57:34,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-03 20:57:34,046 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:34,046 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:34,046 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:34,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:34,047 INFO L82 PathProgramCache]: Analyzing trace with hash 968019555, now seen corresponding path program 44 times [2019-09-03 20:57:34,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:34,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:34,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:34,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:34,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:34,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:34,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:34,842 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:34,842 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:34,842 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:34,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:34,843 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:34,853 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:57:34,853 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:57:34,903 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-09-03 20:57:34,904 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:34,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-03 20:57:34,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:34,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:34,919 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:36,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:36,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:36,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 92 [2019-09-03 20:57:36,935 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:36,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-03 20:57:36,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-03 20:57:36,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-09-03 20:57:36,936 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 47 states. [2019-09-03 20:57:37,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:37,069 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-09-03 20:57:37,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-03 20:57:37,069 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 98 [2019-09-03 20:57:37,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:37,070 INFO L225 Difference]: With dead ends: 102 [2019-09-03 20:57:37,071 INFO L226 Difference]: Without dead ends: 102 [2019-09-03 20:57:37,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-09-03 20:57:37,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-09-03 20:57:37,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-09-03 20:57:37,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-03 20:57:37,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-09-03 20:57:37,075 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2019-09-03 20:57:37,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:37,075 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-09-03 20:57:37,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-03 20:57:37,075 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-09-03 20:57:37,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-03 20:57:37,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:37,076 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:37,076 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:37,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:37,077 INFO L82 PathProgramCache]: Analyzing trace with hash -605750111, now seen corresponding path program 45 times [2019-09-03 20:57:37,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:37,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:37,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:37,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:37,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:37,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:37,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:37,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:37,860 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:37,860 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:37,861 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:37,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:37,861 INFO 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) [2019-09-03 20:57:37,893 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:57:37,894 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:37,914 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:57:37,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:37,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-03 20:57:37,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:37,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:37,933 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:40,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:40,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:40,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 94 [2019-09-03 20:57:40,108 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:40,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-03 20:57:40,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-03 20:57:40,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-09-03 20:57:40,111 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 48 states. [2019-09-03 20:57:40,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:40,244 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-09-03 20:57:40,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-03 20:57:40,244 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 100 [2019-09-03 20:57:40,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:40,246 INFO L225 Difference]: With dead ends: 104 [2019-09-03 20:57:40,246 INFO L226 Difference]: Without dead ends: 104 [2019-09-03 20:57:40,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-09-03 20:57:40,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-03 20:57:40,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-09-03 20:57:40,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-03 20:57:40,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-09-03 20:57:40,249 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2019-09-03 20:57:40,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:40,250 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-09-03 20:57:40,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-03 20:57:40,250 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-09-03 20:57:40,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-03 20:57:40,251 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:40,251 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:40,251 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:40,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:40,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1169910945, now seen corresponding path program 46 times [2019-09-03 20:57:40,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:40,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:40,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:40,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:40,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:41,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:41,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:41,101 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:41,101 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:41,101 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:41,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:41,101 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:41,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:41,111 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:57:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:41,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-03 20:57:41,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:41,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:41,151 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:43,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:43,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:43,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 96 [2019-09-03 20:57:43,450 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:43,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-03 20:57:43,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-03 20:57:43,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-09-03 20:57:43,451 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 49 states. [2019-09-03 20:57:43,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:43,623 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-09-03 20:57:43,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-03 20:57:43,623 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 102 [2019-09-03 20:57:43,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:43,624 INFO L225 Difference]: With dead ends: 106 [2019-09-03 20:57:43,624 INFO L226 Difference]: Without dead ends: 106 [2019-09-03 20:57:43,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-09-03 20:57:43,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-09-03 20:57:43,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-09-03 20:57:43,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-09-03 20:57:43,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-09-03 20:57:43,627 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2019-09-03 20:57:43,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:43,627 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-09-03 20:57:43,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-03 20:57:43,628 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-09-03 20:57:43,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-03 20:57:43,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:43,629 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:43,629 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:43,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:43,630 INFO L82 PathProgramCache]: Analyzing trace with hash 2132374173, now seen corresponding path program 47 times [2019-09-03 20:57:43,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:43,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:43,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:43,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:43,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:44,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:44,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:44,757 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:44,757 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:44,757 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:44,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:44,757 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:44,767 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:57:44,768 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:57:44,822 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-09-03 20:57:44,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:44,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-03 20:57:44,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:44,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:44,843 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:47,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:47,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:47,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 98 [2019-09-03 20:57:47,174 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:47,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-03 20:57:47,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-03 20:57:47,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-09-03 20:57:47,176 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 50 states. [2019-09-03 20:57:47,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:47,305 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-09-03 20:57:47,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-03 20:57:47,306 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 104 [2019-09-03 20:57:47,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:47,307 INFO L225 Difference]: With dead ends: 108 [2019-09-03 20:57:47,307 INFO L226 Difference]: Without dead ends: 108 [2019-09-03 20:57:47,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-09-03 20:57:47,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-09-03 20:57:47,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-09-03 20:57:47,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-09-03 20:57:47,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-09-03 20:57:47,311 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2019-09-03 20:57:47,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:47,312 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-09-03 20:57:47,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-03 20:57:47,312 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-09-03 20:57:47,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-03 20:57:47,312 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:47,313 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:47,313 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:47,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:47,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1647540827, now seen corresponding path program 48 times [2019-09-03 20:57:47,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:47,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:47,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:47,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:47,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:47,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:48,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:48,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:48,256 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:48,257 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:48,257 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:48,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:48,257 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:48,269 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:57:48,270 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:57:48,288 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:57:48,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:48,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-03 20:57:48,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:48,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:48,306 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:50,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:50,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:50,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 100 [2019-09-03 20:57:50,749 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:50,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-03 20:57:50,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-03 20:57:50,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-09-03 20:57:50,751 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 51 states. [2019-09-03 20:57:50,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:50,931 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-09-03 20:57:50,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-03 20:57:50,932 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 106 [2019-09-03 20:57:50,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:50,933 INFO L225 Difference]: With dead ends: 110 [2019-09-03 20:57:50,934 INFO L226 Difference]: Without dead ends: 110 [2019-09-03 20:57:50,935 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-09-03 20:57:50,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-03 20:57:50,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-09-03 20:57:50,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-09-03 20:57:50,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-09-03 20:57:50,938 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2019-09-03 20:57:50,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:50,938 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-09-03 20:57:50,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-03 20:57:50,938 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-09-03 20:57:50,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-03 20:57:50,939 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:50,939 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:50,939 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:50,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:50,940 INFO L82 PathProgramCache]: Analyzing trace with hash -420836711, now seen corresponding path program 49 times [2019-09-03 20:57:50,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:50,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:50,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:50,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:50,941 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:51,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:51,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:51,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:51,875 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:51,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:51,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:51,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:51,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:51,887 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:57:51,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:51,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-03 20:57:51,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:51,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:51,928 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:54,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:54,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:54,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 102 [2019-09-03 20:57:54,454 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:54,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-03 20:57:54,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-03 20:57:54,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:57:54,460 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 52 states. [2019-09-03 20:57:54,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:54,654 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-09-03 20:57:54,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-03 20:57:54,655 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 108 [2019-09-03 20:57:54,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:54,656 INFO L225 Difference]: With dead ends: 112 [2019-09-03 20:57:54,656 INFO L226 Difference]: Without dead ends: 112 [2019-09-03 20:57:54,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:57:54,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-03 20:57:54,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2019-09-03 20:57:54,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-09-03 20:57:54,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-09-03 20:57:54,659 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2019-09-03 20:57:54,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:54,660 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-09-03 20:57:54,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-03 20:57:54,660 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-09-03 20:57:54,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-03 20:57:54,660 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:54,661 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:54,661 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:54,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:54,661 INFO L82 PathProgramCache]: Analyzing trace with hash 438207319, now seen corresponding path program 50 times [2019-09-03 20:57:54,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:54,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:54,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:54,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:54,662 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:55,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:55,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:55,748 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:55,748 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:55,748 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:55,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:55,748 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:55,758 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:57:55,758 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:57:55,821 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-09-03 20:57:55,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:55,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-03 20:57:55,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:55,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:55,845 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:58,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:58,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:58,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 104 [2019-09-03 20:57:58,814 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:58,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-03 20:57:58,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-03 20:57:58,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-09-03 20:57:58,816 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 53 states. [2019-09-03 20:57:58,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:58,972 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-09-03 20:57:58,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-03 20:57:58,972 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 110 [2019-09-03 20:57:58,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:58,973 INFO L225 Difference]: With dead ends: 114 [2019-09-03 20:57:58,973 INFO L226 Difference]: Without dead ends: 114 [2019-09-03 20:57:58,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-09-03 20:57:58,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-03 20:57:58,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2019-09-03 20:57:58,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-09-03 20:57:58,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-09-03 20:57:58,978 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2019-09-03 20:57:58,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:58,978 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-09-03 20:57:58,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-03 20:57:58,978 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-09-03 20:57:58,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-03 20:57:58,979 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:58,979 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:58,979 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:58,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:58,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1345799317, now seen corresponding path program 51 times [2019-09-03 20:57:58,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:58,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:58,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:58,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:58,981 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:00,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:00,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:00,054 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:00,055 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:00,055 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:00,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:00,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:00,067 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:58:00,067 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:58:00,091 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:58:00,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:00,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-03 20:58:00,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:00,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:00,108 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:02,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:02,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:02,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 106 [2019-09-03 20:58:02,815 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:02,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-03 20:58:02,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-03 20:58:02,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-09-03 20:58:02,816 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 54 states. [2019-09-03 20:58:03,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:03,004 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-09-03 20:58:03,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-03 20:58:03,004 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 112 [2019-09-03 20:58:03,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:03,005 INFO L225 Difference]: With dead ends: 116 [2019-09-03 20:58:03,005 INFO L226 Difference]: Without dead ends: 116 [2019-09-03 20:58:03,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-09-03 20:58:03,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-03 20:58:03,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-09-03 20:58:03,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-03 20:58:03,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-09-03 20:58:03,008 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2019-09-03 20:58:03,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:03,009 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-09-03 20:58:03,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-03 20:58:03,009 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-09-03 20:58:03,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-03 20:58:03,010 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:03,010 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:03,010 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:03,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:03,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1663348307, now seen corresponding path program 52 times [2019-09-03 20:58:03,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:03,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:03,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:03,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:03,012 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:04,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:04,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:04,048 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:04,048 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:04,048 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:04,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:04,048 INFO 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-03 20:58:04,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:04,058 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:58:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:04,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-03 20:58:04,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:04,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:04,103 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:06,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (53)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:58:06,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:06,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 108 [2019-09-03 20:58:06,975 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:06,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-03 20:58:06,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-03 20:58:06,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-09-03 20:58:06,976 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 55 states. [2019-09-03 20:58:07,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:07,142 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-09-03 20:58:07,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-03 20:58:07,142 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 114 [2019-09-03 20:58:07,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:07,143 INFO L225 Difference]: With dead ends: 118 [2019-09-03 20:58:07,143 INFO L226 Difference]: Without dead ends: 118 [2019-09-03 20:58:07,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-09-03 20:58:07,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-03 20:58:07,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-09-03 20:58:07,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-09-03 20:58:07,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-09-03 20:58:07,148 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2019-09-03 20:58:07,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:07,148 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-09-03 20:58:07,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-03 20:58:07,149 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-09-03 20:58:07,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-03 20:58:07,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:07,149 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:07,150 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:07,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:07,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1885249681, now seen corresponding path program 53 times [2019-09-03 20:58:07,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:07,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:07,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:07,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:07,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:07,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:08,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:08,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:08,363 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:08,363 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:08,363 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:08,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:08,363 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:08,373 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:58:08,373 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:58:08,443 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-09-03 20:58:08,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:08,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-03 20:58:08,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:08,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:08,466 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:11,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:11,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:11,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 110 [2019-09-03 20:58:11,383 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:11,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-03 20:58:11,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-03 20:58:11,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-09-03 20:58:11,385 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 56 states. [2019-09-03 20:58:11,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:11,570 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-09-03 20:58:11,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-03 20:58:11,571 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 116 [2019-09-03 20:58:11,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:11,571 INFO L225 Difference]: With dead ends: 120 [2019-09-03 20:58:11,572 INFO L226 Difference]: Without dead ends: 120 [2019-09-03 20:58:11,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-09-03 20:58:11,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-03 20:58:11,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2019-09-03 20:58:11,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-03 20:58:11,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2019-09-03 20:58:11,574 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2019-09-03 20:58:11,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:11,574 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2019-09-03 20:58:11,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-03 20:58:11,575 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2019-09-03 20:58:11,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-03 20:58:11,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:11,576 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:11,576 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:11,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:11,576 INFO L82 PathProgramCache]: Analyzing trace with hash 384105295, now seen corresponding path program 54 times [2019-09-03 20:58:11,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:11,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:11,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:11,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:11,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:11,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:12,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:12,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:12,863 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:12,863 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:12,863 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:12,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:12,863 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:12,876 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:58:12,877 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:58:12,897 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:58:12,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:12,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-03 20:58:12,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:12,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:12,915 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:15,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:15,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:15,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 112 [2019-09-03 20:58:15,978 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:15,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-03 20:58:15,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-03 20:58:15,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-09-03 20:58:15,980 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 57 states. [2019-09-03 20:58:16,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:16,171 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2019-09-03 20:58:16,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-03 20:58:16,172 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 118 [2019-09-03 20:58:16,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:16,172 INFO L225 Difference]: With dead ends: 122 [2019-09-03 20:58:16,172 INFO L226 Difference]: Without dead ends: 122 [2019-09-03 20:58:16,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-09-03 20:58:16,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-09-03 20:58:16,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-09-03 20:58:16,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-09-03 20:58:16,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-09-03 20:58:16,176 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2019-09-03 20:58:16,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:16,177 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-09-03 20:58:16,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-03 20:58:16,177 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-09-03 20:58:16,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-03 20:58:16,177 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:16,178 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:16,178 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:16,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:16,178 INFO L82 PathProgramCache]: Analyzing trace with hash 893361805, now seen corresponding path program 55 times [2019-09-03 20:58:16,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:16,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:16,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:16,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:16,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:16,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:17,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:17,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:17,346 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:17,347 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:17,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:17,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:17,347 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:17,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:17,357 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:58:17,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:17,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-03 20:58:17,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:17,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:17,405 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:20,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:20,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:20,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 114 [2019-09-03 20:58:20,560 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:20,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-03 20:58:20,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-03 20:58:20,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-09-03 20:58:20,561 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 58 states. [2019-09-03 20:58:20,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:20,724 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2019-09-03 20:58:20,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-03 20:58:20,724 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 120 [2019-09-03 20:58:20,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:20,726 INFO L225 Difference]: With dead ends: 124 [2019-09-03 20:58:20,726 INFO L226 Difference]: Without dead ends: 124 [2019-09-03 20:58:20,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-09-03 20:58:20,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-09-03 20:58:20,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2019-09-03 20:58:20,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-09-03 20:58:20,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2019-09-03 20:58:20,730 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2019-09-03 20:58:20,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:20,730 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2019-09-03 20:58:20,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-03 20:58:20,730 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2019-09-03 20:58:20,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-03 20:58:20,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:20,731 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:20,731 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:20,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:20,731 INFO L82 PathProgramCache]: Analyzing trace with hash 662596171, now seen corresponding path program 56 times [2019-09-03 20:58:20,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:20,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:20,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:20,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:20,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:20,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:21,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:21,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:21,924 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:21,924 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:21,924 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:21,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:21,924 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:21,936 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:58:21,936 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:58:22,005 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-09-03 20:58:22,006 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:22,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-03 20:58:22,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:22,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:22,025 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:25,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:25,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:25,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 116 [2019-09-03 20:58:25,270 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:25,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-03 20:58:25,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-03 20:58:25,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-09-03 20:58:25,272 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 59 states. [2019-09-03 20:58:25,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:25,485 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2019-09-03 20:58:25,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-03 20:58:25,486 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 122 [2019-09-03 20:58:25,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:25,487 INFO L225 Difference]: With dead ends: 126 [2019-09-03 20:58:25,487 INFO L226 Difference]: Without dead ends: 126 [2019-09-03 20:58:25,487 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-09-03 20:58:25,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-09-03 20:58:25,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-09-03 20:58:25,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-09-03 20:58:25,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2019-09-03 20:58:25,490 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2019-09-03 20:58:25,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:25,490 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2019-09-03 20:58:25,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-03 20:58:25,490 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2019-09-03 20:58:25,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-03 20:58:25,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:25,491 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:25,491 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:25,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:25,492 INFO L82 PathProgramCache]: Analyzing trace with hash -2059846007, now seen corresponding path program 57 times [2019-09-03 20:58:25,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:25,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:25,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:25,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:25,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:25,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:27,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:27,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:27,667 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:27,667 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:27,667 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:27,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:27,668 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:27,677 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:58:27,678 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:58:27,699 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:58:27,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:27,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-03 20:58:27,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:27,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:27,718 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:31,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:31,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:31,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 118 [2019-09-03 20:58:31,057 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:31,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-03 20:58:31,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-03 20:58:31,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-09-03 20:58:31,058 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 60 states. [2019-09-03 20:58:31,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:31,234 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2019-09-03 20:58:31,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-03 20:58:31,234 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 124 [2019-09-03 20:58:31,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:31,235 INFO L225 Difference]: With dead ends: 128 [2019-09-03 20:58:31,236 INFO L226 Difference]: Without dead ends: 128 [2019-09-03 20:58:31,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-09-03 20:58:31,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-03 20:58:31,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-09-03 20:58:31,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-09-03 20:58:31,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2019-09-03 20:58:31,239 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2019-09-03 20:58:31,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:31,240 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2019-09-03 20:58:31,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-03 20:58:31,240 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2019-09-03 20:58:31,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-03 20:58:31,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:31,241 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:31,241 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:31,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:31,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1603271495, now seen corresponding path program 58 times [2019-09-03 20:58:31,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:31,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:31,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:31,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:31,242 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:31,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:33,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:33,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:33,621 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:33,621 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:33,622 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:33,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:33,622 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:33,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:33,649 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:58:33,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:33,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-03 20:58:33,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:33,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:33,730 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:37,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:37,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:37,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 120 [2019-09-03 20:58:37,602 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:37,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-03 20:58:37,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-03 20:58:37,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-09-03 20:58:37,604 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 61 states. [2019-09-03 20:58:37,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:37,833 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2019-09-03 20:58:37,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-03 20:58:37,833 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 126 [2019-09-03 20:58:37,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:37,834 INFO L225 Difference]: With dead ends: 130 [2019-09-03 20:58:37,834 INFO L226 Difference]: Without dead ends: 130 [2019-09-03 20:58:37,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-09-03 20:58:37,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-09-03 20:58:37,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2019-09-03 20:58:37,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-09-03 20:58:37,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2019-09-03 20:58:37,837 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 126 [2019-09-03 20:58:37,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:37,837 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2019-09-03 20:58:37,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-03 20:58:37,838 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2019-09-03 20:58:37,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-03 20:58:37,838 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:37,839 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:37,839 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:37,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:37,839 INFO L82 PathProgramCache]: Analyzing trace with hash -13991803, now seen corresponding path program 59 times [2019-09-03 20:58:37,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:37,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:37,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:37,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:37,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:39,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:39,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:39,580 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:39,581 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:39,581 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:39,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:39,581 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:39,591 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:58:39,591 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:58:39,652 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-09-03 20:58:39,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:39,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-03 20:58:39,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:39,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:39,681 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:43,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:43,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:43,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 122 [2019-09-03 20:58:43,353 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:43,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-03 20:58:43,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-03 20:58:43,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-09-03 20:58:43,355 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 62 states. [2019-09-03 20:58:43,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:43,579 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2019-09-03 20:58:43,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-03 20:58:43,579 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 128 [2019-09-03 20:58:43,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:43,580 INFO L225 Difference]: With dead ends: 132 [2019-09-03 20:58:43,580 INFO L226 Difference]: Without dead ends: 132 [2019-09-03 20:58:43,580 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-09-03 20:58:43,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-09-03 20:58:43,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2019-09-03 20:58:43,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-09-03 20:58:43,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2019-09-03 20:58:43,583 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 128 [2019-09-03 20:58:43,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:43,584 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2019-09-03 20:58:43,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-03 20:58:43,584 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2019-09-03 20:58:43,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-03 20:58:43,584 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:43,584 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:43,584 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:43,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:43,585 INFO L82 PathProgramCache]: Analyzing trace with hash 574139971, now seen corresponding path program 60 times [2019-09-03 20:58:43,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:43,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:43,585 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:43,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:43,586 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:43,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:45,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:45,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:45,250 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:45,250 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:45,250 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:45,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:45,250 INFO 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-03 20:58:45,260 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:58:45,260 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:58:45,290 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:58:45,291 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:45,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-03 20:58:45,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:45,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:45,318 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:49,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:49,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:49,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 124 [2019-09-03 20:58:49,112 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:49,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-03 20:58:49,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-03 20:58:49,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-09-03 20:58:49,114 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 63 states. [2019-09-03 20:58:49,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:49,339 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2019-09-03 20:58:49,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-03 20:58:49,339 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 130 [2019-09-03 20:58:49,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:49,340 INFO L225 Difference]: With dead ends: 134 [2019-09-03 20:58:49,340 INFO L226 Difference]: Without dead ends: 134 [2019-09-03 20:58:49,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-09-03 20:58:49,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-09-03 20:58:49,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2019-09-03 20:58:49,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-09-03 20:58:49,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2019-09-03 20:58:49,344 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 130 [2019-09-03 20:58:49,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:49,344 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2019-09-03 20:58:49,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-03 20:58:49,344 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2019-09-03 20:58:49,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-03 20:58:49,345 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:49,345 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:49,345 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:49,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:49,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1166908287, now seen corresponding path program 61 times [2019-09-03 20:58:49,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:49,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:49,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:49,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:49,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:49,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:50,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:50,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:50,722 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:50,722 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:50,722 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:50,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:50,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:50,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:50,735 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:58:50,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:50,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-03 20:58:50,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:50,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:50,779 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:54,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:54,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:54,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 126 [2019-09-03 20:58:54,637 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:54,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-03 20:58:54,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-03 20:58:54,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-09-03 20:58:54,639 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 64 states. [2019-09-03 20:58:54,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:54,878 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2019-09-03 20:58:54,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-03 20:58:54,878 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 132 [2019-09-03 20:58:54,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:54,879 INFO L225 Difference]: With dead ends: 136 [2019-09-03 20:58:54,879 INFO L226 Difference]: Without dead ends: 136 [2019-09-03 20:58:54,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-09-03 20:58:54,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-03 20:58:54,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2019-09-03 20:58:54,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-03 20:58:54,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2019-09-03 20:58:54,883 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 132 [2019-09-03 20:58:54,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:54,883 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2019-09-03 20:58:54,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-03 20:58:54,883 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2019-09-03 20:58:54,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-03 20:58:54,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:54,887 INFO L399 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:54,887 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:54,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:54,887 INFO L82 PathProgramCache]: Analyzing trace with hash 722961215, now seen corresponding path program 62 times [2019-09-03 20:58:54,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:54,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:54,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:54,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:54,890 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:54,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:57,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:57,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:57,204 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:57,204 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:57,204 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:57,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:57,205 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:57,216 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:58:57,216 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:58:57,295 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-09-03 20:58:57,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:57,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-03 20:58:57,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:57,316 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:57,316 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:01,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:01,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:01,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 128 [2019-09-03 20:59:01,286 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:01,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-03 20:59:01,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-03 20:59:01,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-09-03 20:59:01,288 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 65 states. [2019-09-03 20:59:01,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:01,489 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2019-09-03 20:59:01,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-03 20:59:01,489 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 134 [2019-09-03 20:59:01,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:01,491 INFO L225 Difference]: With dead ends: 138 [2019-09-03 20:59:01,491 INFO L226 Difference]: Without dead ends: 138 [2019-09-03 20:59:01,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-09-03 20:59:01,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-09-03 20:59:01,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2019-09-03 20:59:01,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-09-03 20:59:01,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2019-09-03 20:59:01,494 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 134 [2019-09-03 20:59:01,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:01,494 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2019-09-03 20:59:01,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-03 20:59:01,495 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2019-09-03 20:59:01,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-03 20:59:01,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:01,496 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:01,496 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:01,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:01,496 INFO L82 PathProgramCache]: Analyzing trace with hash 116386429, now seen corresponding path program 63 times [2019-09-03 20:59:01,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:01,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:01,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:59:01,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:01,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:03,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:03,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:03,333 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:03,333 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:03,333 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:59:03,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:03,334 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:03,345 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:59:03,346 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:59:03,371 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:59:03,371 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:59:03,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-03 20:59:03,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:03,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:03,392 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:07,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (64)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:59:07,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:07,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 130 [2019-09-03 20:59:07,868 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:07,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-03 20:59:07,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-03 20:59:07,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-09-03 20:59:07,869 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 66 states. [2019-09-03 20:59:08,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:08,110 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2019-09-03 20:59:08,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-03 20:59:08,110 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 136 [2019-09-03 20:59:08,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:08,112 INFO L225 Difference]: With dead ends: 140 [2019-09-03 20:59:08,112 INFO L226 Difference]: Without dead ends: 140 [2019-09-03 20:59:08,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-09-03 20:59:08,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-09-03 20:59:08,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2019-09-03 20:59:08,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-09-03 20:59:08,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2019-09-03 20:59:08,116 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 136 [2019-09-03 20:59:08,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:08,116 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2019-09-03 20:59:08,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-03 20:59:08,116 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2019-09-03 20:59:08,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-03 20:59:08,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:08,117 INFO L399 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:08,118 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:08,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:08,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1313569339, now seen corresponding path program 64 times [2019-09-03 20:59:08,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:08,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:08,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:59:08,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:08,119 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:08,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:09,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:09,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:09,657 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:09,658 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:09,658 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:59:09,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:09,658 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:09,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:09,667 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:59:09,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:09,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 66 conjunts are in the unsatisfiable core [2019-09-03 20:59:09,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:09,725 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:09,725 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:14,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:14,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:14,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 132 [2019-09-03 20:59:14,009 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:14,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-03 20:59:14,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-03 20:59:14,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-09-03 20:59:14,011 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 67 states. [2019-09-03 20:59:14,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:14,260 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2019-09-03 20:59:14,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-03 20:59:14,260 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 138 [2019-09-03 20:59:14,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:14,261 INFO L225 Difference]: With dead ends: 142 [2019-09-03 20:59:14,261 INFO L226 Difference]: Without dead ends: 142 [2019-09-03 20:59:14,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-09-03 20:59:14,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-09-03 20:59:14,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2019-09-03 20:59:14,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-09-03 20:59:14,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-09-03 20:59:14,264 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 138 [2019-09-03 20:59:14,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:14,265 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2019-09-03 20:59:14,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-03 20:59:14,265 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2019-09-03 20:59:14,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-03 20:59:14,266 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:14,266 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:14,266 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:14,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:14,266 INFO L82 PathProgramCache]: Analyzing trace with hash 755110521, now seen corresponding path program 65 times [2019-09-03 20:59:14,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:14,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:14,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:14,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:14,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:14,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:15,858 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:15,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:15,858 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:15,858 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:15,858 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:59:15,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:15,858 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:15,870 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:59:15,870 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:59:15,961 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-09-03 20:59:15,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:59:15,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 67 conjunts are in the unsatisfiable core [2019-09-03 20:59:15,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:15,993 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:15,994 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:20,513 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:20,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:20,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 134 [2019-09-03 20:59:20,516 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:20,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-03 20:59:20,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-03 20:59:20,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-09-03 20:59:20,518 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 68 states. [2019-09-03 20:59:20,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:20,769 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2019-09-03 20:59:20,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-03 20:59:20,770 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 140 [2019-09-03 20:59:20,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:20,770 INFO L225 Difference]: With dead ends: 144 [2019-09-03 20:59:20,770 INFO L226 Difference]: Without dead ends: 144 [2019-09-03 20:59:20,771 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-09-03 20:59:20,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-09-03 20:59:20,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2019-09-03 20:59:20,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-09-03 20:59:20,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2019-09-03 20:59:20,775 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 140 [2019-09-03 20:59:20,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:20,775 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2019-09-03 20:59:20,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-03 20:59:20,775 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2019-09-03 20:59:20,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-03 20:59:20,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:20,776 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:20,776 INFO L418 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:20,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:20,776 INFO L82 PathProgramCache]: Analyzing trace with hash 947098423, now seen corresponding path program 66 times [2019-09-03 20:59:20,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:20,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:20,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:59:20,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:20,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:22,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:22,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:22,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:22,327 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:22,327 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:59:22,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:22,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:22,337 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:59:22,337 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:59:22,361 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:59:22,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:59:22,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-03 20:59:22,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:22,394 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:22,394 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:26,911 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:26,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:26,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 136 [2019-09-03 20:59:26,914 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:26,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-03 20:59:26,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-03 20:59:26,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-09-03 20:59:26,916 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 69 states. [2019-09-03 20:59:27,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:27,208 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2019-09-03 20:59:27,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-03 20:59:27,208 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 142 [2019-09-03 20:59:27,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:27,209 INFO L225 Difference]: With dead ends: 146 [2019-09-03 20:59:27,209 INFO L226 Difference]: Without dead ends: 146 [2019-09-03 20:59:27,210 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-09-03 20:59:27,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-09-03 20:59:27,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-09-03 20:59:27,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-09-03 20:59:27,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2019-09-03 20:59:27,213 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 142 [2019-09-03 20:59:27,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:27,213 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2019-09-03 20:59:27,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-03 20:59:27,213 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2019-09-03 20:59:27,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-03 20:59:27,214 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:27,215 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:27,215 INFO L418 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:27,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:27,215 INFO L82 PathProgramCache]: Analyzing trace with hash 763878517, now seen corresponding path program 67 times [2019-09-03 20:59:27,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:27,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:27,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:59:27,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:27,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:27,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:28,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:28,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:28,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:28,813 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:28,813 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:59:28,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:28,813 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:28,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:28,823 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:59:28,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:28,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-03 20:59:28,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:28,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:28,881 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:33,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:33,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:33,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 138 [2019-09-03 20:59:33,543 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:33,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-03 20:59:33,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-03 20:59:33,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-09-03 20:59:33,545 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 70 states. [2019-09-03 20:59:33,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:33,807 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2019-09-03 20:59:33,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-03 20:59:33,807 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 144 [2019-09-03 20:59:33,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:33,808 INFO L225 Difference]: With dead ends: 148 [2019-09-03 20:59:33,808 INFO L226 Difference]: Without dead ends: 148 [2019-09-03 20:59:33,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-09-03 20:59:33,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-09-03 20:59:33,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2019-09-03 20:59:33,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-09-03 20:59:33,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2019-09-03 20:59:33,813 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 144 [2019-09-03 20:59:33,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:33,813 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2019-09-03 20:59:33,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-03 20:59:33,813 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2019-09-03 20:59:33,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-03 20:59:33,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:33,814 INFO L399 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:33,814 INFO L418 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:33,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:33,815 INFO L82 PathProgramCache]: Analyzing trace with hash 783207987, now seen corresponding path program 68 times [2019-09-03 20:59:33,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:33,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:33,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:33,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:33,816 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:35,545 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-03 20:59:35,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:35,545 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:35,546 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:35,546 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:59:35,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:35,546 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:35,556 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:59:35,556 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:59:35,644 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2019-09-03 20:59:35,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:59:35,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-03 20:59:35,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:35,668 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-03 20:59:35,669 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:40,408 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-03 20:59:40,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:40,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 140 [2019-09-03 20:59:40,411 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:40,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-03 20:59:40,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-03 20:59:40,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-09-03 20:59:40,413 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 71 states. [2019-09-03 20:59:40,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:40,684 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2019-09-03 20:59:40,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-03 20:59:40,685 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 146 [2019-09-03 20:59:40,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:40,686 INFO L225 Difference]: With dead ends: 150 [2019-09-03 20:59:40,686 INFO L226 Difference]: Without dead ends: 150 [2019-09-03 20:59:40,687 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-09-03 20:59:40,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-09-03 20:59:40,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-09-03 20:59:40,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-09-03 20:59:40,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2019-09-03 20:59:40,689 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 146 [2019-09-03 20:59:40,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:40,689 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2019-09-03 20:59:40,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-03 20:59:40,690 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2019-09-03 20:59:40,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-03 20:59:40,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:40,691 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:40,691 INFO L418 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:40,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:40,691 INFO L82 PathProgramCache]: Analyzing trace with hash -2116007823, now seen corresponding path program 69 times [2019-09-03 20:59:40,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:40,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:40,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:59:40,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:40,692 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:42,407 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-03 20:59:42,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:42,407 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:42,407 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:42,408 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:59:42,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:42,408 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:42,417 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:59:42,417 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:59:42,445 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:59:42,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:59:42,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-03 20:59:42,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:42,478 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-03 20:59:42,478 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:47,390 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-03 20:59:47,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:47,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 142 [2019-09-03 20:59:47,394 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:47,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-03 20:59:47,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-03 20:59:47,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-09-03 20:59:47,396 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 72 states. [2019-09-03 20:59:47,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:47,646 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2019-09-03 20:59:47,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-03 20:59:47,646 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 148 [2019-09-03 20:59:47,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:47,647 INFO L225 Difference]: With dead ends: 152 [2019-09-03 20:59:47,647 INFO L226 Difference]: Without dead ends: 152 [2019-09-03 20:59:47,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-09-03 20:59:47,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-03 20:59:47,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2019-09-03 20:59:47,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-09-03 20:59:47,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2019-09-03 20:59:47,650 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 148 [2019-09-03 20:59:47,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:47,651 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2019-09-03 20:59:47,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-03 20:59:47,651 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2019-09-03 20:59:47,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-03 20:59:47,652 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:47,652 INFO L399 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:47,652 INFO L418 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:47,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:47,652 INFO L82 PathProgramCache]: Analyzing trace with hash -828626129, now seen corresponding path program 70 times [2019-09-03 20:59:47,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:47,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:47,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:59:47,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:47,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:49,430 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-03 20:59:49,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:49,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:49,431 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:49,431 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:59:49,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:49,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:49,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:49,441 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:59:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:49,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-03 20:59:49,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:49,502 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-03 20:59:49,502 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:54,637 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-03 20:59:54,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:54,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 144 [2019-09-03 20:59:54,640 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:54,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-03 20:59:54,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-03 20:59:54,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-09-03 20:59:54,642 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 73 states. [2019-09-03 20:59:54,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:54,872 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2019-09-03 20:59:54,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-03 20:59:54,872 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 150 [2019-09-03 20:59:54,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:54,874 INFO L225 Difference]: With dead ends: 154 [2019-09-03 20:59:54,874 INFO L226 Difference]: Without dead ends: 154 [2019-09-03 20:59:54,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-09-03 20:59:54,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-09-03 20:59:54,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2019-09-03 20:59:54,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-09-03 20:59:54,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2019-09-03 20:59:54,877 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 150 [2019-09-03 20:59:54,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:54,877 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2019-09-03 20:59:54,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-03 20:59:54,878 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2019-09-03 20:59:54,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-03 20:59:54,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:54,878 INFO L399 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:54,879 INFO L418 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:54,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:54,879 INFO L82 PathProgramCache]: Analyzing trace with hash -605399443, now seen corresponding path program 71 times [2019-09-03 20:59:54,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:54,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:54,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:54,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:54,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:54,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:56,705 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-03 20:59:56,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:56,705 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:56,705 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:56,705 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:59:56,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:56,706 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:56,716 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:59:56,716 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:59:56,810 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2019-09-03 20:59:56,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:59:56,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 73 conjunts are in the unsatisfiable core [2019-09-03 20:59:56,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:56,843 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-03 20:59:56,843 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:02,340 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-03 21:00:02,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:02,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 146 [2019-09-03 21:00:02,343 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:02,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-03 21:00:02,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-03 21:00:02,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-09-03 21:00:02,345 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 74 states. [2019-09-03 21:00:02,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:02,627 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2019-09-03 21:00:02,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-03 21:00:02,627 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 152 [2019-09-03 21:00:02,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:02,628 INFO L225 Difference]: With dead ends: 156 [2019-09-03 21:00:02,628 INFO L226 Difference]: Without dead ends: 156 [2019-09-03 21:00:02,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-09-03 21:00:02,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-09-03 21:00:02,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2019-09-03 21:00:02,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-09-03 21:00:02,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2019-09-03 21:00:02,630 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 152 [2019-09-03 21:00:02,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:02,630 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2019-09-03 21:00:02,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-03 21:00:02,631 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2019-09-03 21:00:02,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-03 21:00:02,631 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:02,632 INFO L399 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:02,632 INFO L418 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:02,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:02,632 INFO L82 PathProgramCache]: Analyzing trace with hash -832918997, now seen corresponding path program 72 times [2019-09-03 21:00:02,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:02,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:02,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:00:02,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:02,633 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:02,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:04,470 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-03 21:00:04,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:04,470 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:04,470 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:04,470 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:00:04,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:04,470 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:04,482 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:00:04,482 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:00:04,511 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:00:04,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:00:04,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-03 21:00:04,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:04,535 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-03 21:00:04,535 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:09,873 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-03 21:00:09,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:09,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 148 [2019-09-03 21:00:09,876 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:09,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-03 21:00:09,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-03 21:00:09,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-09-03 21:00:09,879 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 75 states. [2019-09-03 21:00:10,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:10,162 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2019-09-03 21:00:10,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-03 21:00:10,162 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 154 [2019-09-03 21:00:10,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:10,164 INFO L225 Difference]: With dead ends: 158 [2019-09-03 21:00:10,164 INFO L226 Difference]: Without dead ends: 158 [2019-09-03 21:00:10,165 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-09-03 21:00:10,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-09-03 21:00:10,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2019-09-03 21:00:10,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-09-03 21:00:10,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2019-09-03 21:00:10,168 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 154 [2019-09-03 21:00:10,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:10,168 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2019-09-03 21:00:10,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-03 21:00:10,168 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2019-09-03 21:00:10,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-03 21:00:10,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:10,169 INFO L399 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:10,169 INFO L418 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:10,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:10,169 INFO L82 PathProgramCache]: Analyzing trace with hash -435878295, now seen corresponding path program 73 times [2019-09-03 21:00:10,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:10,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:10,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:00:10,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:10,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:10,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:12,089 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-03 21:00:12,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:12,090 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:12,090 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:12,090 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:00:12,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:12,090 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:12,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:00:12,100 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:00:12,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:12,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 75 conjunts are in the unsatisfiable core [2019-09-03 21:00:12,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:12,167 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-03 21:00:12,167 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:17,658 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-03 21:00:17,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:17,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 150 [2019-09-03 21:00:17,660 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:17,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-03 21:00:17,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-03 21:00:17,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-09-03 21:00:17,663 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 76 states. [2019-09-03 21:00:17,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:17,921 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2019-09-03 21:00:17,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-03 21:00:17,922 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 156 [2019-09-03 21:00:17,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:17,923 INFO L225 Difference]: With dead ends: 160 [2019-09-03 21:00:17,923 INFO L226 Difference]: Without dead ends: 160 [2019-09-03 21:00:17,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-09-03 21:00:17,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-09-03 21:00:17,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2019-09-03 21:00:17,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-09-03 21:00:17,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2019-09-03 21:00:17,926 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 156 [2019-09-03 21:00:17,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:17,926 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2019-09-03 21:00:17,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-03 21:00:17,926 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2019-09-03 21:00:17,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-03 21:00:17,927 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:17,928 INFO L399 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:17,928 INFO L418 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:17,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:17,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1131853017, now seen corresponding path program 74 times [2019-09-03 21:00:17,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:17,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:17,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:00:17,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:17,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:17,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:19,845 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-03 21:00:19,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:19,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:19,845 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:19,845 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:00:19,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:19,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:19,856 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:00:19,856 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:00:19,957 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2019-09-03 21:00:19,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:00:19,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 76 conjunts are in the unsatisfiable core [2019-09-03 21:00:19,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:19,983 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-03 21:00:19,984 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:25,614 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-03 21:00:25,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:25,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 152 [2019-09-03 21:00:25,617 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:25,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-03 21:00:25,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-03 21:00:25,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-09-03 21:00:25,619 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 77 states. [2019-09-03 21:00:25,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:25,862 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2019-09-03 21:00:25,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-03 21:00:25,862 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 158 [2019-09-03 21:00:25,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:25,863 INFO L225 Difference]: With dead ends: 162 [2019-09-03 21:00:25,863 INFO L226 Difference]: Without dead ends: 162 [2019-09-03 21:00:25,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-09-03 21:00:25,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-03 21:00:25,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2019-09-03 21:00:25,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-09-03 21:00:25,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2019-09-03 21:00:25,867 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 158 [2019-09-03 21:00:25,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:25,867 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2019-09-03 21:00:25,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-03 21:00:25,868 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2019-09-03 21:00:25,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-03 21:00:25,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:25,869 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:25,869 INFO L418 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:25,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:25,869 INFO L82 PathProgramCache]: Analyzing trace with hash 51337317, now seen corresponding path program 75 times [2019-09-03 21:00:25,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:25,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:25,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:00:25,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:25,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:25,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:28,062 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-03 21:00:28,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:28,063 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:28,063 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:28,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:00:28,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:28,063 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:28,073 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:00:28,073 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:00:28,104 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:00:28,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:00:28,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-03 21:00:28,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:28,133 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-03 21:00:28,133 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:33,890 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-03 21:00:33,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:33,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 154 [2019-09-03 21:00:33,893 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:33,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-03 21:00:33,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-03 21:00:33,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-09-03 21:00:33,895 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 78 states. [2019-09-03 21:00:34,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:34,161 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2019-09-03 21:00:34,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-09-03 21:00:34,161 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 160 [2019-09-03 21:00:34,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:34,162 INFO L225 Difference]: With dead ends: 164 [2019-09-03 21:00:34,163 INFO L226 Difference]: Without dead ends: 164 [2019-09-03 21:00:34,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-09-03 21:00:34,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-09-03 21:00:34,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2019-09-03 21:00:34,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-09-03 21:00:34,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2019-09-03 21:00:34,166 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 160 [2019-09-03 21:00:34,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:34,167 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2019-09-03 21:00:34,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-03 21:00:34,167 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2019-09-03 21:00:34,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-03 21:00:34,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:34,168 INFO L399 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:34,168 INFO L418 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:34,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:34,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1069085149, now seen corresponding path program 76 times [2019-09-03 21:00:34,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:34,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:34,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:00:34,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:34,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:34,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:36,227 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-03 21:00:36,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:36,228 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:36,228 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:36,228 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:00:36,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:36,228 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:36,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:00:36,238 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:00:36,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:36,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-03 21:00:36,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:36,307 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-03 21:00:36,307 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:42,193 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-03 21:00:42,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:42,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 156 [2019-09-03 21:00:42,196 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:42,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-03 21:00:42,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-03 21:00:42,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-09-03 21:00:42,198 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 79 states. [2019-09-03 21:00:42,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:42,515 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2019-09-03 21:00:42,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-03 21:00:42,515 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 162 [2019-09-03 21:00:42,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:42,516 INFO L225 Difference]: With dead ends: 166 [2019-09-03 21:00:42,516 INFO L226 Difference]: Without dead ends: 166 [2019-09-03 21:00:42,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-09-03 21:00:42,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-09-03 21:00:42,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2019-09-03 21:00:42,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-09-03 21:00:42,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2019-09-03 21:00:42,519 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 162 [2019-09-03 21:00:42,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:42,519 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2019-09-03 21:00:42,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-03 21:00:42,519 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2019-09-03 21:00:42,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-03 21:00:42,520 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:42,520 INFO L399 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:42,520 INFO L418 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:42,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:42,521 INFO L82 PathProgramCache]: Analyzing trace with hash 241716321, now seen corresponding path program 77 times [2019-09-03 21:00:42,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:42,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:42,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:00:42,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:42,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:44,624 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-03 21:00:44,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:44,624 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:44,625 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:44,625 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:00:44,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:44,625 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:44,635 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:00:44,635 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:00:44,736 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2019-09-03 21:00:44,736 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:00:44,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 79 conjunts are in the unsatisfiable core [2019-09-03 21:00:44,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:44,763 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-03 21:00:44,763 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:50,845 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-03 21:00:50,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:50,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 158 [2019-09-03 21:00:50,849 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:50,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-09-03 21:00:50,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-09-03 21:00:50,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-09-03 21:00:50,850 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 80 states. [2019-09-03 21:00:51,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:51,121 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2019-09-03 21:00:51,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-09-03 21:00:51,122 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 164 [2019-09-03 21:00:51,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:51,123 INFO L225 Difference]: With dead ends: 168 [2019-09-03 21:00:51,123 INFO L226 Difference]: Without dead ends: 168 [2019-09-03 21:00:51,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-09-03 21:00:51,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-03 21:00:51,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2019-09-03 21:00:51,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-03 21:00:51,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2019-09-03 21:00:51,127 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 164 [2019-09-03 21:00:51,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:51,127 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2019-09-03 21:00:51,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-09-03 21:00:51,127 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2019-09-03 21:00:51,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-03 21:00:51,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:51,128 INFO L399 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:51,128 INFO L418 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:51,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:51,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1496511263, now seen corresponding path program 78 times [2019-09-03 21:00:51,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:51,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:51,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:00:51,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:51,129 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:51,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:53,370 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-03 21:00:53,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:53,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:53,370 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:53,370 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:00:53,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:53,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:53,381 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:00:53,381 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:00:53,409 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:00:53,410 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:00:53,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-03 21:00:53,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:53,436 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-03 21:00:53,436 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:59,650 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-03 21:00:59,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:59,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 160 [2019-09-03 21:00:59,653 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:59,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-03 21:00:59,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-03 21:00:59,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-09-03 21:00:59,655 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 81 states. [2019-09-03 21:00:59,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:59,970 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2019-09-03 21:00:59,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-03 21:00:59,971 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 166 [2019-09-03 21:00:59,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:59,971 INFO L225 Difference]: With dead ends: 170 [2019-09-03 21:00:59,971 INFO L226 Difference]: Without dead ends: 170 [2019-09-03 21:00:59,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-09-03 21:00:59,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-09-03 21:00:59,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2019-09-03 21:00:59,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-09-03 21:00:59,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2019-09-03 21:00:59,975 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 166 [2019-09-03 21:00:59,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:59,975 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2019-09-03 21:00:59,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-03 21:00:59,975 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2019-09-03 21:00:59,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-03 21:00:59,976 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:59,976 INFO L399 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:59,976 INFO L418 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:59,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:59,976 INFO L82 PathProgramCache]: Analyzing trace with hash 468640349, now seen corresponding path program 79 times [2019-09-03 21:00:59,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:59,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:59,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:00:59,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:59,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:02,165 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-03 21:01:02,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:02,165 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:01:02,166 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:01:02,166 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:01:02,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:02,166 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:01:02,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:01:02,176 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:01:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:02,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 81 conjunts are in the unsatisfiable core [2019-09-03 21:01:02,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:01:02,234 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-03 21:01:02,234 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:01:08,603 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-03 21:01:08,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:01:08,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 162 [2019-09-03 21:01:08,606 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:01:08,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-03 21:01:08,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-03 21:01:08,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-09-03 21:01:08,607 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 82 states. [2019-09-03 21:01:08,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:01:08,869 INFO L93 Difference]: Finished difference Result 172 states and 172 transitions. [2019-09-03 21:01:08,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-09-03 21:01:08,870 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 168 [2019-09-03 21:01:08,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:01:08,871 INFO L225 Difference]: With dead ends: 172 [2019-09-03 21:01:08,871 INFO L226 Difference]: Without dead ends: 172 [2019-09-03 21:01:08,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-09-03 21:01:08,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-09-03 21:01:08,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2019-09-03 21:01:08,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-09-03 21:01:08,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2019-09-03 21:01:08,875 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 168 [2019-09-03 21:01:08,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:01:08,875 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2019-09-03 21:01:08,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-03 21:01:08,876 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2019-09-03 21:01:08,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-03 21:01:08,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:01:08,877 INFO L399 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:01:08,877 INFO L418 AbstractCegarLoop]: === Iteration 82 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:01:08,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:01:08,877 INFO L82 PathProgramCache]: Analyzing trace with hash 527170075, now seen corresponding path program 80 times [2019-09-03 21:01:08,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:01:08,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:08,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:01:08,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:08,878 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:01:08,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:11,131 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-03 21:01:11,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:11,132 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:01:11,132 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:01:11,132 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:01:11,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:11,132 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:01:11,142 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:01:11,143 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:01:11,253 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2019-09-03 21:01:11,253 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:01:11,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 82 conjunts are in the unsatisfiable core [2019-09-03 21:01:11,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:01:11,295 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-03 21:01:11,295 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:01:17,793 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-03 21:01:17,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:01:17,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 164 [2019-09-03 21:01:17,796 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:01:17,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-09-03 21:01:17,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-09-03 21:01:17,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-09-03 21:01:17,799 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 83 states. [2019-09-03 21:01:18,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:01:18,130 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2019-09-03 21:01:18,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-03 21:01:18,130 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 170 [2019-09-03 21:01:18,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:01:18,131 INFO L225 Difference]: With dead ends: 174 [2019-09-03 21:01:18,131 INFO L226 Difference]: Without dead ends: 174 [2019-09-03 21:01:18,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-09-03 21:01:18,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-09-03 21:01:18,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2019-09-03 21:01:18,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-09-03 21:01:18,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2019-09-03 21:01:18,135 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 170 [2019-09-03 21:01:18,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:01:18,135 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2019-09-03 21:01:18,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-09-03 21:01:18,135 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2019-09-03 21:01:18,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-03 21:01:18,136 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:01:18,136 INFO L399 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:01:18,136 INFO L418 AbstractCegarLoop]: === Iteration 83 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:01:18,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:01:18,137 INFO L82 PathProgramCache]: Analyzing trace with hash 939661913, now seen corresponding path program 81 times [2019-09-03 21:01:18,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:01:18,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:18,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:01:18,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:18,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:01:18,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:20,473 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-03 21:01:20,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:20,473 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:01:20,473 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:01:20,473 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:01:20,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:20,473 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:01:20,484 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:01:20,484 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:01:20,519 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:01:20,519 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:01:20,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 83 conjunts are in the unsatisfiable core [2019-09-03 21:01:20,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:01:20,560 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-03 21:01:20,561 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:01:27,313 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-03 21:01:27,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:01:27,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 166 [2019-09-03 21:01:27,316 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:01:27,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-09-03 21:01:27,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-09-03 21:01:27,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-09-03 21:01:27,318 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 84 states. [2019-09-03 21:01:27,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:01:27,669 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2019-09-03 21:01:27,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-03 21:01:27,669 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 172 [2019-09-03 21:01:27,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:01:27,670 INFO L225 Difference]: With dead ends: 176 [2019-09-03 21:01:27,670 INFO L226 Difference]: Without dead ends: 176 [2019-09-03 21:01:27,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-09-03 21:01:27,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-09-03 21:01:27,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2019-09-03 21:01:27,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-03 21:01:27,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2019-09-03 21:01:27,674 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 172 [2019-09-03 21:01:27,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:01:27,674 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2019-09-03 21:01:27,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-09-03 21:01:27,675 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2019-09-03 21:01:27,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-03 21:01:27,675 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:01:27,676 INFO L399 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:01:27,676 INFO L418 AbstractCegarLoop]: === Iteration 84 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:01:27,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:01:27,676 INFO L82 PathProgramCache]: Analyzing trace with hash -2087640297, now seen corresponding path program 82 times [2019-09-03 21:01:27,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:01:27,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:27,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:01:27,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:27,677 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:01:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:30,099 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-03 21:01:30,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:30,100 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:01:30,100 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:01:30,100 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:01:30,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:30,100 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:01:30,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:01:30,111 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:01:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:30,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 84 conjunts are in the unsatisfiable core [2019-09-03 21:01:30,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:01:30,170 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-03 21:01:30,170 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:01:37,080 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-03 21:01:37,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:01:37,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 168 [2019-09-03 21:01:37,083 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:01:37,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-09-03 21:01:37,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-09-03 21:01:37,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-09-03 21:01:37,084 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 85 states. [2019-09-03 21:01:37,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:01:37,376 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2019-09-03 21:01:37,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-09-03 21:01:37,377 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 174 [2019-09-03 21:01:37,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:01:37,378 INFO L225 Difference]: With dead ends: 178 [2019-09-03 21:01:37,378 INFO L226 Difference]: Without dead ends: 178 [2019-09-03 21:01:37,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-09-03 21:01:37,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-09-03 21:01:37,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2019-09-03 21:01:37,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-03 21:01:37,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2019-09-03 21:01:37,382 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 174 [2019-09-03 21:01:37,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:01:37,382 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2019-09-03 21:01:37,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-09-03 21:01:37,382 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2019-09-03 21:01:37,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-03 21:01:37,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:01:37,383 INFO L399 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:01:37,383 INFO L418 AbstractCegarLoop]: === Iteration 85 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:01:37,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:01:37,384 INFO L82 PathProgramCache]: Analyzing trace with hash 662762581, now seen corresponding path program 83 times [2019-09-03 21:01:37,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:01:37,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:37,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:01:37,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:37,385 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:01:37,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:39,820 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-03 21:01:39,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:39,821 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:01:39,821 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:01:39,821 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:01:39,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:39,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 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:01:39,830 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:01:39,830 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:01:39,929 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2019-09-03 21:01:39,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:01:39,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 85 conjunts are in the unsatisfiable core [2019-09-03 21:01:39,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:01:39,958 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-03 21:01:39,958 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:01:46,992 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-03 21:01:46,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:01:46,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 170 [2019-09-03 21:01:46,995 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:01:46,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-09-03 21:01:46,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-09-03 21:01:46,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-09-03 21:01:46,997 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 86 states. [2019-09-03 21:01:47,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:01:47,275 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2019-09-03 21:01:47,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-09-03 21:01:47,275 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 176 [2019-09-03 21:01:47,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:01:47,276 INFO L225 Difference]: With dead ends: 180 [2019-09-03 21:01:47,276 INFO L226 Difference]: Without dead ends: 180 [2019-09-03 21:01:47,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-09-03 21:01:47,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-03 21:01:47,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 179. [2019-09-03 21:01:47,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-09-03 21:01:47,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2019-09-03 21:01:47,280 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 176 [2019-09-03 21:01:47,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:01:47,280 INFO L475 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2019-09-03 21:01:47,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-09-03 21:01:47,280 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2019-09-03 21:01:47,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-03 21:01:47,281 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:01:47,281 INFO L399 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:01:47,281 INFO L418 AbstractCegarLoop]: === Iteration 86 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:01:47,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:01:47,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1899925997, now seen corresponding path program 84 times [2019-09-03 21:01:47,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:01:47,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:47,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:01:47,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:47,283 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:01:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:49,749 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-03 21:01:49,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:49,749 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:01:49,749 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:01:49,750 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:01:49,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:49,750 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:01:49,761 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:01:49,761 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:01:49,795 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:01:49,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:01:49,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-03 21:01:49,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:01:49,826 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-03 21:01:49,826 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:01:57,110 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-03 21:01:57,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:01:57,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 172 [2019-09-03 21:01:57,113 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:01:57,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-09-03 21:01:57,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-09-03 21:01:57,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-09-03 21:01:57,115 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 87 states. [2019-09-03 21:01:57,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:01:57,465 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2019-09-03 21:01:57,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-03 21:01:57,465 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 178 [2019-09-03 21:01:57,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:01:57,466 INFO L225 Difference]: With dead ends: 182 [2019-09-03 21:01:57,466 INFO L226 Difference]: Without dead ends: 182 [2019-09-03 21:01:57,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-09-03 21:01:57,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-03 21:01:57,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2019-09-03 21:01:57,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-09-03 21:01:57,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2019-09-03 21:01:57,470 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 178 [2019-09-03 21:01:57,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:01:57,470 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2019-09-03 21:01:57,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-09-03 21:01:57,470 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2019-09-03 21:01:57,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-03 21:01:57,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:01:57,471 INFO L399 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:01:57,471 INFO L418 AbstractCegarLoop]: === Iteration 87 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:01:57,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:01:57,471 INFO L82 PathProgramCache]: Analyzing trace with hash 667578449, now seen corresponding path program 85 times [2019-09-03 21:01:57,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:01:57,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:57,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:01:57,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:57,472 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:01:57,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:59,992 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-03 21:01:59,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:59,992 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:01:59,993 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:01:59,993 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:01:59,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:59,993 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:02:00,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:02:00,005 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:02:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:00,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 87 conjunts are in the unsatisfiable core [2019-09-03 21:02:00,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:02:00,070 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-03 21:02:00,070 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:02:07,408 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-03 21:02:07,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:02:07,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 174 [2019-09-03 21:02:07,411 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:02:07,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-09-03 21:02:07,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-09-03 21:02:07,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-09-03 21:02:07,413 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 88 states. [2019-09-03 21:02:07,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:02:07,710 INFO L93 Difference]: Finished difference Result 184 states and 184 transitions. [2019-09-03 21:02:07,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-09-03 21:02:07,710 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 180 [2019-09-03 21:02:07,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:02:07,712 INFO L225 Difference]: With dead ends: 184 [2019-09-03 21:02:07,712 INFO L226 Difference]: Without dead ends: 184 [2019-09-03 21:02:07,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-09-03 21:02:07,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-09-03 21:02:07,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2019-09-03 21:02:07,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-09-03 21:02:07,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2019-09-03 21:02:07,716 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 180 [2019-09-03 21:02:07,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:02:07,716 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2019-09-03 21:02:07,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-09-03 21:02:07,716 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2019-09-03 21:02:07,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-03 21:02:07,716 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:02:07,717 INFO L399 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:02:07,717 INFO L418 AbstractCegarLoop]: === Iteration 88 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:02:07,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:02:07,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1566844145, now seen corresponding path program 86 times [2019-09-03 21:02:07,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:02:07,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:07,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:02:07,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:07,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:02:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:10,290 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-03 21:02:10,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:10,291 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:02:10,291 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:02:10,291 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:02:10,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:10,291 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:02:10,302 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:02:10,302 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:02:10,427 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 87 check-sat command(s) [2019-09-03 21:02:10,427 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:02:10,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 88 conjunts are in the unsatisfiable core [2019-09-03 21:02:10,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:02:10,460 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-03 21:02:10,460 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:02:18,028 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-03 21:02:18,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:02:18,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 176 [2019-09-03 21:02:18,032 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:02:18,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-09-03 21:02:18,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-09-03 21:02:18,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-09-03 21:02:18,035 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 89 states. [2019-09-03 21:02:18,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:02:18,404 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2019-09-03 21:02:18,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-03 21:02:18,404 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 182 [2019-09-03 21:02:18,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:02:18,405 INFO L225 Difference]: With dead ends: 186 [2019-09-03 21:02:18,405 INFO L226 Difference]: Without dead ends: 186 [2019-09-03 21:02:18,406 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-09-03 21:02:18,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-09-03 21:02:18,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2019-09-03 21:02:18,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-09-03 21:02:18,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2019-09-03 21:02:18,408 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 182 [2019-09-03 21:02:18,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:02:18,409 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2019-09-03 21:02:18,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-09-03 21:02:18,409 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2019-09-03 21:02:18,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-03 21:02:18,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:02:18,410 INFO L399 BasicCegarLoop]: trace histogram [87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:02:18,410 INFO L418 AbstractCegarLoop]: === Iteration 89 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:02:18,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:02:18,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1363308979, now seen corresponding path program 87 times [2019-09-03 21:02:18,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:02:18,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:18,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:02:18,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:18,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:02:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:21,017 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-03 21:02:21,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:21,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:02:21,018 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:02:21,018 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:02:21,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:21,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:02:21,028 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:02:21,028 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:02:21,064 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:02:21,064 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:02:21,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 89 conjunts are in the unsatisfiable core [2019-09-03 21:02:21,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:02:21,096 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-03 21:02:21,096 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:02:28,776 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-03 21:02:28,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:02:28,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 178 [2019-09-03 21:02:28,779 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:02:28,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-09-03 21:02:28,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-09-03 21:02:28,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-09-03 21:02:28,781 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 90 states. [2019-09-03 21:02:29,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:02:29,127 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2019-09-03 21:02:29,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-03 21:02:29,127 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 184 [2019-09-03 21:02:29,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:02:29,128 INFO L225 Difference]: With dead ends: 188 [2019-09-03 21:02:29,128 INFO L226 Difference]: Without dead ends: 188 [2019-09-03 21:02:29,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-09-03 21:02:29,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-03 21:02:29,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 187. [2019-09-03 21:02:29,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-09-03 21:02:29,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2019-09-03 21:02:29,132 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 184 [2019-09-03 21:02:29,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:02:29,132 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2019-09-03 21:02:29,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-09-03 21:02:29,132 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2019-09-03 21:02:29,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-03 21:02:29,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:02:29,133 INFO L399 BasicCegarLoop]: trace histogram [88, 88, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:02:29,134 INFO L418 AbstractCegarLoop]: === Iteration 90 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:02:29,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:02:29,134 INFO L82 PathProgramCache]: Analyzing trace with hash 960457227, now seen corresponding path program 88 times [2019-09-03 21:02:29,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:02:29,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:29,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:02:29,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:29,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:02:29,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:31,808 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-03 21:02:31,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:31,809 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:02:31,809 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:02:31,809 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:02:31,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:31,809 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:02:31,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:02:31,819 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:02:31,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:31,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 90 conjunts are in the unsatisfiable core [2019-09-03 21:02:31,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:02:31,886 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-03 21:02:31,886 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:02:39,807 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-03 21:02:39,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:02:39,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 180 [2019-09-03 21:02:39,810 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:02:39,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-09-03 21:02:39,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-09-03 21:02:39,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-09-03 21:02:39,811 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 91 states. [2019-09-03 21:02:40,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:02:40,126 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2019-09-03 21:02:40,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-03 21:02:40,126 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 186 [2019-09-03 21:02:40,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:02:40,127 INFO L225 Difference]: With dead ends: 190 [2019-09-03 21:02:40,127 INFO L226 Difference]: Without dead ends: 190 [2019-09-03 21:02:40,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-09-03 21:02:40,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-09-03 21:02:40,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2019-09-03 21:02:40,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-03 21:02:40,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2019-09-03 21:02:40,131 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 186 [2019-09-03 21:02:40,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:02:40,132 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2019-09-03 21:02:40,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-09-03 21:02:40,132 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2019-09-03 21:02:40,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-03 21:02:40,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:02:40,133 INFO L399 BasicCegarLoop]: trace histogram [89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:02:40,133 INFO L418 AbstractCegarLoop]: === Iteration 91 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:02:40,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:02:40,133 INFO L82 PathProgramCache]: Analyzing trace with hash 716787273, now seen corresponding path program 89 times [2019-09-03 21:02:40,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:02:40,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:40,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:02:40,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:40,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:02:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:42,906 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-03 21:02:42,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:42,907 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:02:42,907 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:02:42,907 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:02:42,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:42,907 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:02:42,917 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:02:42,917 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:02:43,039 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 90 check-sat command(s) [2019-09-03 21:02:43,039 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:02:43,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 91 conjunts are in the unsatisfiable core [2019-09-03 21:02:43,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:02:43,073 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-03 21:02:43,073 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:02:51,201 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-03 21:02:51,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:02:51,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 182 [2019-09-03 21:02:51,205 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:02:51,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-09-03 21:02:51,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-09-03 21:02:51,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-09-03 21:02:51,206 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 92 states. [2019-09-03 21:02:51,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:02:51,573 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2019-09-03 21:02:51,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-09-03 21:02:51,574 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 188 [2019-09-03 21:02:51,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:02:51,575 INFO L225 Difference]: With dead ends: 192 [2019-09-03 21:02:51,575 INFO L226 Difference]: Without dead ends: 192 [2019-09-03 21:02:51,575 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-09-03 21:02:51,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-09-03 21:02:51,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 191. [2019-09-03 21:02:51,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-03 21:02:51,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2019-09-03 21:02:51,577 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 188 [2019-09-03 21:02:51,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:02:51,578 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2019-09-03 21:02:51,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-09-03 21:02:51,578 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2019-09-03 21:02:51,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-03 21:02:51,578 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:02:51,579 INFO L399 BasicCegarLoop]: trace histogram [90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:02:51,579 INFO L418 AbstractCegarLoop]: === Iteration 92 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:02:51,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:02:51,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1521804537, now seen corresponding path program 90 times [2019-09-03 21:02:51,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:02:51,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:51,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:02:51,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:51,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:02:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:54,344 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-03 21:02:54,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:54,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:02:54,345 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:02:54,345 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:02:54,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:54,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 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:02:54,356 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:02:54,356 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:02:54,391 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:02:54,391 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:02:54,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 92 conjunts are in the unsatisfiable core [2019-09-03 21:02:54,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:02:54,424 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-03 21:02:54,424 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:03:02,646 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-03 21:03:02,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:03:02,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 184 [2019-09-03 21:03:02,650 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:03:02,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-09-03 21:03:02,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-09-03 21:03:02,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-09-03 21:03:02,652 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 93 states. [2019-09-03 21:03:03,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:03:03,051 INFO L93 Difference]: Finished difference Result 194 states and 194 transitions. [2019-09-03 21:03:03,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-09-03 21:03:03,052 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 190 [2019-09-03 21:03:03,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:03:03,052 INFO L225 Difference]: With dead ends: 194 [2019-09-03 21:03:03,053 INFO L226 Difference]: Without dead ends: 194 [2019-09-03 21:03:03,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-09-03 21:03:03,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-09-03 21:03:03,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2019-09-03 21:03:03,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-09-03 21:03:03,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2019-09-03 21:03:03,056 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 190 [2019-09-03 21:03:03,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:03:03,056 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2019-09-03 21:03:03,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-09-03 21:03:03,056 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2019-09-03 21:03:03,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-03 21:03:03,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:03:03,057 INFO L399 BasicCegarLoop]: trace histogram [91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:03:03,057 INFO L418 AbstractCegarLoop]: === Iteration 93 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:03:03,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:03:03,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1029918651, now seen corresponding path program 91 times [2019-09-03 21:03:03,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:03:03,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:03,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:03:03,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:03,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:03:03,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:05,922 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-03 21:03:05,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:05,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:03:05,922 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:03:05,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:03:05,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:05,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:03:05,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:03:05,934 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:03:05,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:05,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 93 conjunts are in the unsatisfiable core [2019-09-03 21:03:05,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:03:06,003 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-03 21:03:06,003 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:03:14,390 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-03 21:03:14,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:03:14,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 186 [2019-09-03 21:03:14,393 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:03:14,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-09-03 21:03:14,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-09-03 21:03:14,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-09-03 21:03:14,395 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 94 states. [2019-09-03 21:03:14,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:03:14,676 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2019-09-03 21:03:14,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-09-03 21:03:14,677 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 192 [2019-09-03 21:03:14,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:03:14,678 INFO L225 Difference]: With dead ends: 196 [2019-09-03 21:03:14,678 INFO L226 Difference]: Without dead ends: 196 [2019-09-03 21:03:14,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-09-03 21:03:14,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-09-03 21:03:14,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 195. [2019-09-03 21:03:14,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-03 21:03:14,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2019-09-03 21:03:14,681 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 192 [2019-09-03 21:03:14,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:03:14,681 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2019-09-03 21:03:14,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-09-03 21:03:14,681 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2019-09-03 21:03:14,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-03 21:03:14,682 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:03:14,682 INFO L399 BasicCegarLoop]: trace histogram [92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:03:14,682 INFO L418 AbstractCegarLoop]: === Iteration 94 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:03:14,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:03:14,682 INFO L82 PathProgramCache]: Analyzing trace with hash -773984765, now seen corresponding path program 92 times [2019-09-03 21:03:14,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:03:14,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:14,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:03:14,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:14,683 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:03:14,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:17,624 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-03 21:03:17,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:17,625 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:03:17,625 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:03:17,625 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:03:17,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:17,625 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:03:17,635 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:03:17,636 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:03:17,770 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 93 check-sat command(s) [2019-09-03 21:03:17,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:03:17,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 94 conjunts are in the unsatisfiable core [2019-09-03 21:03:17,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:03:17,805 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-03 21:03:17,805 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:03:26,453 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-03 21:03:26,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:03:26,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 188 [2019-09-03 21:03:26,456 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:03:26,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-09-03 21:03:26,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-09-03 21:03:26,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-09-03 21:03:26,459 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 95 states. [2019-09-03 21:03:26,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:03:26,809 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2019-09-03 21:03:26,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-03 21:03:26,809 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 194 [2019-09-03 21:03:26,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:03:26,810 INFO L225 Difference]: With dead ends: 198 [2019-09-03 21:03:26,810 INFO L226 Difference]: Without dead ends: 198 [2019-09-03 21:03:26,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-09-03 21:03:26,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-09-03 21:03:26,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2019-09-03 21:03:26,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-03 21:03:26,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2019-09-03 21:03:26,814 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 194 [2019-09-03 21:03:26,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:03:26,815 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2019-09-03 21:03:26,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-09-03 21:03:26,815 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2019-09-03 21:03:26,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-03 21:03:26,816 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:03:26,816 INFO L399 BasicCegarLoop]: trace histogram [93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:03:26,816 INFO L418 AbstractCegarLoop]: === Iteration 95 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:03:26,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:03:26,816 INFO L82 PathProgramCache]: Analyzing trace with hash 365343809, now seen corresponding path program 93 times [2019-09-03 21:03:26,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:03:26,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:26,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:03:26,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:26,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:03:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:29,847 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-03 21:03:29,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:29,847 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:03:29,847 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:03:29,847 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:03:29,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:29,848 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:03:29,858 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:03:29,858 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:03:29,896 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:03:29,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:03:29,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 95 conjunts are in the unsatisfiable core [2019-09-03 21:03:29,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:03:29,931 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-03 21:03:29,931 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:03:38,773 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-03 21:03:38,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:03:38,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 190 [2019-09-03 21:03:38,776 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:03:38,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-09-03 21:03:38,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-09-03 21:03:38,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-09-03 21:03:38,778 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 96 states. [2019-09-03 21:03:39,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:03:39,127 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2019-09-03 21:03:39,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-09-03 21:03:39,128 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 196 [2019-09-03 21:03:39,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:03:39,129 INFO L225 Difference]: With dead ends: 200 [2019-09-03 21:03:39,129 INFO L226 Difference]: Without dead ends: 200 [2019-09-03 21:03:39,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-09-03 21:03:39,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-09-03 21:03:39,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2019-09-03 21:03:39,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-03 21:03:39,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2019-09-03 21:03:39,133 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 196 [2019-09-03 21:03:39,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:03:39,133 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2019-09-03 21:03:39,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-09-03 21:03:39,133 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2019-09-03 21:03:39,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-03 21:03:39,134 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:03:39,134 INFO L399 BasicCegarLoop]: trace histogram [94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:03:39,134 INFO L418 AbstractCegarLoop]: === Iteration 96 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:03:39,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:03:39,134 INFO L82 PathProgramCache]: Analyzing trace with hash 43442943, now seen corresponding path program 94 times [2019-09-03 21:03:39,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:03:39,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:39,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:03:39,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:39,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:03:39,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:42,156 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-03 21:03:42,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:42,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:03:42,157 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:03:42,157 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:03:42,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:42,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:03:42,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:03:42,167 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:03:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:42,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 96 conjunts are in the unsatisfiable core [2019-09-03 21:03:42,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:03:42,248 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-03 21:03:42,248 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:03:51,226 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-03 21:03:51,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:03:51,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 192 [2019-09-03 21:03:51,229 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:03:51,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-09-03 21:03:51,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-09-03 21:03:51,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-09-03 21:03:51,232 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 97 states. [2019-09-03 21:03:51,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:03:51,613 INFO L93 Difference]: Finished difference Result 202 states and 202 transitions. [2019-09-03 21:03:51,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-09-03 21:03:51,614 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 198 [2019-09-03 21:03:51,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:03:51,615 INFO L225 Difference]: With dead ends: 202 [2019-09-03 21:03:51,615 INFO L226 Difference]: Without dead ends: 202 [2019-09-03 21:03:51,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-09-03 21:03:51,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-03 21:03:51,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2019-09-03 21:03:51,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-09-03 21:03:51,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2019-09-03 21:03:51,619 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 198 [2019-09-03 21:03:51,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:03:51,619 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2019-09-03 21:03:51,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-09-03 21:03:51,620 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2019-09-03 21:03:51,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-03 21:03:51,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:03:51,620 INFO L399 BasicCegarLoop]: trace histogram [95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:03:51,621 INFO L418 AbstractCegarLoop]: === Iteration 97 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:03:51,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:03:51,621 INFO L82 PathProgramCache]: Analyzing trace with hash -65643971, now seen corresponding path program 95 times [2019-09-03 21:03:51,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:03:51,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:51,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:03:51,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:51,622 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:03:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:54,678 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-03 21:03:54,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:54,679 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:03:54,679 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:03:54,679 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:03:54,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:54,679 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:03:54,702 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:03:54,702 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:03:54,838 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 96 check-sat command(s) [2019-09-03 21:03:54,838 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:03:54,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 97 conjunts are in the unsatisfiable core [2019-09-03 21:03:54,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:03:54,873 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-03 21:03:54,874 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:03,970 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-03 21:04:03,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:03,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 194 [2019-09-03 21:04:03,973 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:03,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-09-03 21:04:03,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-09-03 21:04:03,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-09-03 21:04:03,977 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 98 states. [2019-09-03 21:04:04,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:04,415 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2019-09-03 21:04:04,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-09-03 21:04:04,415 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 200 [2019-09-03 21:04:04,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:04,416 INFO L225 Difference]: With dead ends: 204 [2019-09-03 21:04:04,416 INFO L226 Difference]: Without dead ends: 204 [2019-09-03 21:04:04,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-09-03 21:04:04,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-09-03 21:04:04,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 203. [2019-09-03 21:04:04,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-03 21:04:04,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2019-09-03 21:04:04,420 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 200 [2019-09-03 21:04:04,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:04,420 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2019-09-03 21:04:04,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-09-03 21:04:04,420 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2019-09-03 21:04:04,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-03 21:04:04,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:04,421 INFO L399 BasicCegarLoop]: trace histogram [96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:04,421 INFO L418 AbstractCegarLoop]: === Iteration 98 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:04,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:04,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1818953221, now seen corresponding path program 96 times [2019-09-03 21:04:04,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:04,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:04,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:04,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:04,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:04,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:07,588 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-03 21:04:07,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:07,589 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:07,589 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:07,589 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:07,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:07,589 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:07,600 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:04:07,600 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:04:07,640 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:04:07,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:07,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 98 conjunts are in the unsatisfiable core [2019-09-03 21:04:07,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:07,688 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-03 21:04:07,688 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:16,993 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-03 21:04:16,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:16,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 196 [2019-09-03 21:04:16,996 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:16,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-09-03 21:04:16,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-09-03 21:04:16,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-09-03 21:04:16,999 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 99 states. [2019-09-03 21:04:17,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:17,440 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2019-09-03 21:04:17,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-03 21:04:17,440 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 202 [2019-09-03 21:04:17,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:17,441 INFO L225 Difference]: With dead ends: 206 [2019-09-03 21:04:17,441 INFO L226 Difference]: Without dead ends: 206 [2019-09-03 21:04:17,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-09-03 21:04:17,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-09-03 21:04:17,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2019-09-03 21:04:17,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-03 21:04:17,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2019-09-03 21:04:17,445 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 202 [2019-09-03 21:04:17,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:17,445 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2019-09-03 21:04:17,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-09-03 21:04:17,445 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2019-09-03 21:04:17,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-03 21:04:17,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:17,446 INFO L399 BasicCegarLoop]: trace histogram [97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:17,446 INFO L418 AbstractCegarLoop]: === Iteration 99 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:17,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:17,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1173004857, now seen corresponding path program 97 times [2019-09-03 21:04:17,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:17,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:17,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:17,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:17,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:17,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:20,700 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-03 21:04:20,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:20,700 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:20,700 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:20,700 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:20,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:20,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 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:20,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:20,712 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:04:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:20,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 99 conjunts are in the unsatisfiable core [2019-09-03 21:04:20,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:20,788 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-03 21:04:20,789 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:30,320 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-03 21:04:30,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:30,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 198 [2019-09-03 21:04:30,323 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:30,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-09-03 21:04:30,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-09-03 21:04:30,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-09-03 21:04:30,326 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 100 states. [2019-09-03 21:04:30,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:30,677 INFO L93 Difference]: Finished difference Result 208 states and 208 transitions. [2019-09-03 21:04:30,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-09-03 21:04:30,678 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 204 [2019-09-03 21:04:30,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:30,679 INFO L225 Difference]: With dead ends: 208 [2019-09-03 21:04:30,679 INFO L226 Difference]: Without dead ends: 208 [2019-09-03 21:04:30,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-09-03 21:04:30,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-09-03 21:04:30,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 207. [2019-09-03 21:04:30,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-09-03 21:04:30,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2019-09-03 21:04:30,684 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 204 [2019-09-03 21:04:30,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:30,684 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2019-09-03 21:04:30,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-09-03 21:04:30,684 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2019-09-03 21:04:30,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-09-03 21:04:30,685 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:30,685 INFO L399 BasicCegarLoop]: trace histogram [98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:30,686 INFO L418 AbstractCegarLoop]: === Iteration 100 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:30,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:30,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1183370505, now seen corresponding path program 98 times [2019-09-03 21:04:30,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:30,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:30,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:30,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:30,687 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:30,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:34,004 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-03 21:04:34,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:34,004 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:34,004 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04: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-03 21:04:34,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04: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 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:34,021 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:04:34,021 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:04:34,157 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 99 check-sat command(s) [2019-09-03 21:04:34,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:34,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 100 conjunts are in the unsatisfiable core [2019-09-03 21:04:34,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:34,196 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-03 21:04:34,197 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:43,989 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-03 21:04:43,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:43,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 200 [2019-09-03 21:04:43,992 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:43,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-09-03 21:04:43,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-09-03 21:04:43,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-09-03 21:04:43,994 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 101 states. [2019-09-03 21:04:44,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:44,374 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2019-09-03 21:04:44,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-03 21:04:44,375 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 206 [2019-09-03 21:04:44,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:44,376 INFO L225 Difference]: With dead ends: 210 [2019-09-03 21:04:44,376 INFO L226 Difference]: Without dead ends: 210 [2019-09-03 21:04:44,377 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-09-03 21:04:44,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-03 21:04:44,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2019-09-03 21:04:44,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-09-03 21:04:44,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2019-09-03 21:04:44,378 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 206 [2019-09-03 21:04:44,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:44,379 INFO L475 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2019-09-03 21:04:44,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-09-03 21:04:44,379 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2019-09-03 21:04:44,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-03 21:04:44,380 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:44,380 INFO L399 BasicCegarLoop]: trace histogram [99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:44,380 INFO L418 AbstractCegarLoop]: === Iteration 101 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:44,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:44,381 INFO L82 PathProgramCache]: Analyzing trace with hash 2082638901, now seen corresponding path program 99 times [2019-09-03 21:04:44,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:44,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:44,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:44,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:44,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:47,813 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-03 21:04:47,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:47,813 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:47,813 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:47,814 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:47,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:47,814 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:47,824 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:04:47,824 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:04:47,868 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:04:47,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:47,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 101 conjunts are in the unsatisfiable core [2019-09-03 21:04:47,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:47,906 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-03 21:04:47,907 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:57,854 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-03 21:04:57,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:57,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 202 [2019-09-03 21:04:57,857 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:57,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-09-03 21:04:57,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-09-03 21:04:57,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-09-03 21:04:57,860 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 102 states. [2019-09-03 21:04:58,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:58,334 INFO L93 Difference]: Finished difference Result 212 states and 212 transitions. [2019-09-03 21:04:58,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-09-03 21:04:58,334 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 208 [2019-09-03 21:04:58,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:58,335 INFO L225 Difference]: With dead ends: 212 [2019-09-03 21:04:58,335 INFO L226 Difference]: Without dead ends: 212 [2019-09-03 21:04:58,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-09-03 21:04:58,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-09-03 21:04:58,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 211. [2019-09-03 21:04:58,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-09-03 21:04:58,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2019-09-03 21:04:58,340 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 208 [2019-09-03 21:04:58,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:58,340 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2019-09-03 21:04:58,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-09-03 21:04:58,340 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2019-09-03 21:04:58,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-03 21:04:58,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:58,341 INFO L399 BasicCegarLoop]: trace histogram [100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:58,342 INFO L418 AbstractCegarLoop]: === Iteration 102 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:58,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:58,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1096584691, now seen corresponding path program 100 times [2019-09-03 21:04:58,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:58,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:58,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:58,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:58,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:58,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:01,775 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 10000 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:05:01,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:01,776 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:05:01,776 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:05:01,776 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:05:01,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:01,776 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:05:01,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:05:01,787 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:05:01,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:01,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 102 conjunts are in the unsatisfiable core [2019-09-03 21:05:01,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:05:01,867 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 10000 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:05:01,867 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:05:12,070 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 10000 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:05:12,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:05:12,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 204 [2019-09-03 21:05:12,073 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:05:12,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-09-03 21:05:12,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-09-03 21:05:12,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-09-03 21:05:12,077 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 103 states. [2019-09-03 21:05:12,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:05:12,540 INFO L93 Difference]: Finished difference Result 214 states and 214 transitions. [2019-09-03 21:05:12,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-09-03 21:05:12,541 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 210 [2019-09-03 21:05:12,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:05:12,542 INFO L225 Difference]: With dead ends: 214 [2019-09-03 21:05:12,543 INFO L226 Difference]: Without dead ends: 214 [2019-09-03 21:05:12,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-09-03 21:05:12,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-03 21:05:12,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2019-09-03 21:05:12,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-09-03 21:05:12,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2019-09-03 21:05:12,547 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 210 [2019-09-03 21:05:12,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:05:12,547 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2019-09-03 21:05:12,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-09-03 21:05:12,547 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2019-09-03 21:05:12,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-03 21:05:12,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:05:12,549 INFO L399 BasicCegarLoop]: trace histogram [101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:05:12,549 INFO L418 AbstractCegarLoop]: === Iteration 103 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:05:12,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:05:12,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1608705999, now seen corresponding path program 101 times [2019-09-03 21:05:12,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:05:12,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:12,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:05:12,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:12,551 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:05:12,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:16,070 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 0 proven. 10201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:05:16,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:16,070 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:05:16,071 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:05:16,071 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:05:16,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:16,071 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:05:16,081 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:05:16,081 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:05:16,233 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 102 check-sat command(s) [2019-09-03 21:05:16,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:05:16,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 103 conjunts are in the unsatisfiable core [2019-09-03 21:05:16,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:05:16,274 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 0 proven. 10201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:05:16,275 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:05:26,763 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 0 proven. 10201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:05:26,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:05:26,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 206 [2019-09-03 21:05:26,766 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:05:26,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-09-03 21:05:26,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-09-03 21:05:26,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-09-03 21:05:26,769 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 104 states. [2019-09-03 21:05:27,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:05:27,158 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2019-09-03 21:05:27,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-09-03 21:05:27,158 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 212 [2019-09-03 21:05:27,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:05:27,159 INFO L225 Difference]: With dead ends: 216 [2019-09-03 21:05:27,159 INFO L226 Difference]: Without dead ends: 216 [2019-09-03 21:05:27,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-09-03 21:05:27,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-09-03 21:05:27,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 215. [2019-09-03 21:05:27,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-09-03 21:05:27,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2019-09-03 21:05:27,164 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 212 [2019-09-03 21:05:27,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:05:27,164 INFO L475 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2019-09-03 21:05:27,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-09-03 21:05:27,164 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2019-09-03 21:05:27,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-09-03 21:05:27,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:05:27,165 INFO L399 BasicCegarLoop]: trace histogram [102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:05:27,166 INFO L418 AbstractCegarLoop]: === Iteration 104 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:05:27,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:05:27,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1357122287, now seen corresponding path program 102 times [2019-09-03 21:05:27,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:05:27,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:27,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:05:27,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:27,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:05:27,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:30,700 INFO L134 CoverageAnalysis]: Checked inductivity of 10404 backedges. 0 proven. 10404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:05:30,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:30,700 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:05:30,700 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:05:30,700 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:05:30,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:30,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 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:05:30,711 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:05:30,711 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:05:30,749 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:05:30,750 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:05:30,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 104 conjunts are in the unsatisfiable core [2019-09-03 21:05:30,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:05:30,789 INFO L134 CoverageAnalysis]: Checked inductivity of 10404 backedges. 0 proven. 10404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:05:30,790 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:05:41,319 INFO L134 CoverageAnalysis]: Checked inductivity of 10404 backedges. 0 proven. 10404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:05:41,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:05:41,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 208 [2019-09-03 21:05:41,322 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:05:41,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-09-03 21:05:41,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-09-03 21:05:41,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-09-03 21:05:41,325 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 105 states. [2019-09-03 21:05:41,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:05:41,728 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2019-09-03 21:05:41,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-09-03 21:05:41,728 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 214 [2019-09-03 21:05:41,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:05:41,729 INFO L225 Difference]: With dead ends: 218 [2019-09-03 21:05:41,729 INFO L226 Difference]: Without dead ends: 218 [2019-09-03 21:05:41,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-09-03 21:05:41,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-09-03 21:05:41,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2019-09-03 21:05:41,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-09-03 21:05:41,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2019-09-03 21:05:41,733 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 214 [2019-09-03 21:05:41,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:05:41,733 INFO L475 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2019-09-03 21:05:41,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-09-03 21:05:41,734 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2019-09-03 21:05:41,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-03 21:05:41,734 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:05:41,735 INFO L399 BasicCegarLoop]: trace histogram [103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:05:41,735 INFO L418 AbstractCegarLoop]: === Iteration 105 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:05:41,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:05:41,735 INFO L82 PathProgramCache]: Analyzing trace with hash -340179411, now seen corresponding path program 103 times [2019-09-03 21:05:41,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:05:41,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:41,736 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:05:41,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:41,736 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:05:41,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:45,374 INFO L134 CoverageAnalysis]: Checked inductivity of 10609 backedges. 0 proven. 10609 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:05:45,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:45,374 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:05:45,375 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:05:45,375 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:05:45,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:45,375 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 21:05:45,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:05:45,392 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:05:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:45,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 105 conjunts are in the unsatisfiable core [2019-09-03 21:05:45,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:05:45,474 INFO L134 CoverageAnalysis]: Checked inductivity of 10609 backedges. 0 proven. 10609 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:05:45,474 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:05:56,201 INFO L134 CoverageAnalysis]: Checked inductivity of 10609 backedges. 0 proven. 10609 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:05:56,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:05:56,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 210 [2019-09-03 21:05:56,204 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:05:56,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-09-03 21:05:56,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-09-03 21:05:56,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-09-03 21:05:56,208 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 106 states. [2019-09-03 21:05:56,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:05:56,615 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2019-09-03 21:05:56,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-09-03 21:05:56,615 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 216 [2019-09-03 21:05:56,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:05:56,617 INFO L225 Difference]: With dead ends: 220 [2019-09-03 21:05:56,617 INFO L226 Difference]: Without dead ends: 220 [2019-09-03 21:05:56,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-09-03 21:05:56,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-09-03 21:05:56,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 219. [2019-09-03 21:05:56,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-09-03 21:05:56,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2019-09-03 21:05:56,621 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 216 [2019-09-03 21:05:56,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:05:56,622 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 219 transitions. [2019-09-03 21:05:56,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-09-03 21:05:56,622 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 219 transitions. [2019-09-03 21:05:56,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-03 21:05:56,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:05:56,623 INFO L399 BasicCegarLoop]: trace histogram [104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:05:56,623 INFO L418 AbstractCegarLoop]: === Iteration 106 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:05:56,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:05:56,624 INFO L82 PathProgramCache]: Analyzing trace with hash 640461291, now seen corresponding path program 104 times [2019-09-03 21:05:56,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:05:56,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:56,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:05:56,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:56,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:05:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:06:00,316 INFO L134 CoverageAnalysis]: Checked inductivity of 10816 backedges. 0 proven. 10816 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:06:00,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:00,316 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:06:00,316 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:06:00,316 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:06:00,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:00,317 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:06:00,327 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:06:00,327 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:06:00,480 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 105 check-sat command(s) [2019-09-03 21:06:00,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:06:00,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 106 conjunts are in the unsatisfiable core [2019-09-03 21:06:00,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:06:00,526 INFO L134 CoverageAnalysis]: Checked inductivity of 10816 backedges. 0 proven. 10816 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:06:00,526 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:06:11,473 INFO L134 CoverageAnalysis]: Checked inductivity of 10816 backedges. 0 proven. 10816 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:06:11,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:06:11,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 212 [2019-09-03 21:06:11,476 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:06:11,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-09-03 21:06:11,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-09-03 21:06:11,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-09-03 21:06:11,479 INFO L87 Difference]: Start difference. First operand 219 states and 219 transitions. Second operand 107 states. [2019-09-03 21:06:11,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:06:11,960 INFO L93 Difference]: Finished difference Result 222 states and 222 transitions. [2019-09-03 21:06:11,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-09-03 21:06:11,960 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 218 [2019-09-03 21:06:11,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:06:11,964 INFO L225 Difference]: With dead ends: 222 [2019-09-03 21:06:11,964 INFO L226 Difference]: Without dead ends: 222 [2019-09-03 21:06:11,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 542 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-09-03 21:06:11,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-09-03 21:06:11,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2019-09-03 21:06:11,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-09-03 21:06:11,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2019-09-03 21:06:11,969 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 218 [2019-09-03 21:06:11,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:06:11,969 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2019-09-03 21:06:11,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-09-03 21:06:11,970 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2019-09-03 21:06:11,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-03 21:06:11,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:06:11,972 INFO L399 BasicCegarLoop]: trace histogram [105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:06:11,973 INFO L418 AbstractCegarLoop]: === Iteration 107 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:06:11,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:06:11,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1856629207, now seen corresponding path program 105 times [2019-09-03 21:06:11,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:06:11,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:11,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:06:11,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:11,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:06:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:06:15,730 INFO L134 CoverageAnalysis]: Checked inductivity of 11025 backedges. 0 proven. 11025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:06:15,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:15,731 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:06:15,731 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:06:15,731 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:06:15,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:15,731 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:06:15,742 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:06:15,742 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:06:15,785 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:06:15,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:06:15,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 107 conjunts are in the unsatisfiable core [2019-09-03 21:06:15,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:06:15,824 INFO L134 CoverageAnalysis]: Checked inductivity of 11025 backedges. 0 proven. 11025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:06:15,824 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:06:26,894 INFO L134 CoverageAnalysis]: Checked inductivity of 11025 backedges. 0 proven. 11025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:06:26,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:06:26,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 214 [2019-09-03 21:06:26,897 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:06:26,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-09-03 21:06:26,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-09-03 21:06:26,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2019-09-03 21:06:26,900 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 108 states. [2019-09-03 21:06:27,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:06:27,408 INFO L93 Difference]: Finished difference Result 224 states and 224 transitions. [2019-09-03 21:06:27,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-09-03 21:06:27,408 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 220 [2019-09-03 21:06:27,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:06:27,409 INFO L225 Difference]: With dead ends: 224 [2019-09-03 21:06:27,409 INFO L226 Difference]: Without dead ends: 224 [2019-09-03 21:06:27,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2019-09-03 21:06:27,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-09-03 21:06:27,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 223. [2019-09-03 21:06:27,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-09-03 21:06:27,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2019-09-03 21:06:27,412 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 220 [2019-09-03 21:06:27,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:06:27,412 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2019-09-03 21:06:27,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-09-03 21:06:27,412 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2019-09-03 21:06:27,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-03 21:06:27,413 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:06:27,414 INFO L399 BasicCegarLoop]: trace histogram [106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:06:27,414 INFO L418 AbstractCegarLoop]: === Iteration 108 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:06:27,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:06:27,414 INFO L82 PathProgramCache]: Analyzing trace with hash -673879321, now seen corresponding path program 106 times [2019-09-03 21:06:27,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:06:27,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:27,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:06:27,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:27,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:06:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:06:31,205 INFO L134 CoverageAnalysis]: Checked inductivity of 11236 backedges. 0 proven. 11236 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:06:31,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:31,206 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:06:31,206 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:06:31,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:06:31,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:31,206 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:06:31,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:06:31,216 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:06:31,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:06:31,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 108 conjunts are in the unsatisfiable core [2019-09-03 21:06:31,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:06:31,300 INFO L134 CoverageAnalysis]: Checked inductivity of 11236 backedges. 0 proven. 11236 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:06:31,300 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:06:42,578 INFO L134 CoverageAnalysis]: Checked inductivity of 11236 backedges. 0 proven. 11236 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:06:42,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:06:42,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 216 [2019-09-03 21:06:42,581 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:06:42,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-09-03 21:06:42,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-09-03 21:06:42,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2019-09-03 21:06:42,583 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 109 states. [2019-09-03 21:06:42,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:06:42,977 INFO L93 Difference]: Finished difference Result 226 states and 226 transitions. [2019-09-03 21:06:42,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-09-03 21:06:42,978 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 222 [2019-09-03 21:06:42,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:06:42,978 INFO L225 Difference]: With dead ends: 226 [2019-09-03 21:06:42,979 INFO L226 Difference]: Without dead ends: 226 [2019-09-03 21:06:42,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2019-09-03 21:06:42,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-09-03 21:06:42,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2019-09-03 21:06:42,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-09-03 21:06:42,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2019-09-03 21:06:42,983 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 222 [2019-09-03 21:06:42,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:06:42,984 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2019-09-03 21:06:42,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-09-03 21:06:42,984 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2019-09-03 21:06:42,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-09-03 21:06:42,985 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:06:42,985 INFO L399 BasicCegarLoop]: trace histogram [107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:06:42,985 INFO L418 AbstractCegarLoop]: === Iteration 109 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:06:42,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:06:42,985 INFO L82 PathProgramCache]: Analyzing trace with hash 2077394981, now seen corresponding path program 107 times [2019-09-03 21:06:42,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:06:42,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:42,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:06:42,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:42,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:06:42,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:06:46,858 INFO L134 CoverageAnalysis]: Checked inductivity of 11449 backedges. 0 proven. 11449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:06:46,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:46,858 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:06:46,858 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:06:46,858 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:06:46,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:46,859 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:06:46,868 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:06:46,869 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:06:47,030 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 108 check-sat command(s) [2019-09-03 21:06:47,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:06:47,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 109 conjunts are in the unsatisfiable core [2019-09-03 21:06:47,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:06:47,073 INFO L134 CoverageAnalysis]: Checked inductivity of 11449 backedges. 0 proven. 11449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:06:47,073 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:06:58,634 INFO L134 CoverageAnalysis]: Checked inductivity of 11449 backedges. 0 proven. 11449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:06:58,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:06:58,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110, 110] total 218 [2019-09-03 21:06:58,637 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:06:58,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-09-03 21:06:58,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-09-03 21:06:58,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2019-09-03 21:06:58,641 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 110 states. [2019-09-03 21:06:59,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:06:59,211 INFO L93 Difference]: Finished difference Result 228 states and 228 transitions. [2019-09-03 21:06:59,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-09-03 21:06:59,211 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 224 [2019-09-03 21:06:59,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:06:59,212 INFO L225 Difference]: With dead ends: 228 [2019-09-03 21:06:59,212 INFO L226 Difference]: Without dead ends: 228 [2019-09-03 21:06:59,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 557 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2019-09-03 21:06:59,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-09-03 21:06:59,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 227. [2019-09-03 21:06:59,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-09-03 21:06:59,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2019-09-03 21:06:59,216 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 224 [2019-09-03 21:06:59,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:06:59,216 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2019-09-03 21:06:59,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-09-03 21:06:59,216 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2019-09-03 21:06:59,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-09-03 21:06:59,217 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:06:59,217 INFO L399 BasicCegarLoop]: trace histogram [108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:06:59,217 INFO L418 AbstractCegarLoop]: === Iteration 110 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:06:59,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:06:59,218 INFO L82 PathProgramCache]: Analyzing trace with hash 352144867, now seen corresponding path program 108 times [2019-09-03 21:06:59,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:06:59,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:59,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:06:59,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:59,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:06:59,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:07:03,204 INFO L134 CoverageAnalysis]: Checked inductivity of 11664 backedges. 0 proven. 11664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:07:03,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:03,204 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:07:03,204 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:07:03,205 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:07:03,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:03,205 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:07:03,214 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:07:03,215 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:07:03,259 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:07:03,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:07:03,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 110 conjunts are in the unsatisfiable core [2019-09-03 21:07:03,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:07:03,299 INFO L134 CoverageAnalysis]: Checked inductivity of 11664 backedges. 0 proven. 11664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:07:03,299 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:07:15,051 INFO L134 CoverageAnalysis]: Checked inductivity of 11664 backedges. 0 proven. 11664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:07:15,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:07:15,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 220 [2019-09-03 21:07:15,054 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:07:15,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-09-03 21:07:15,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-09-03 21:07:15,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2019-09-03 21:07:15,058 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 111 states. [2019-09-03 21:07:15,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:07:15,570 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2019-09-03 21:07:15,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-09-03 21:07:15,570 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 226 [2019-09-03 21:07:15,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:07:15,571 INFO L225 Difference]: With dead ends: 230 [2019-09-03 21:07:15,571 INFO L226 Difference]: Without dead ends: 230 [2019-09-03 21:07:15,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 562 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2019-09-03 21:07:15,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-09-03 21:07:15,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2019-09-03 21:07:15,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-09-03 21:07:15,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2019-09-03 21:07:15,574 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 226 [2019-09-03 21:07:15,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:07:15,574 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2019-09-03 21:07:15,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-09-03 21:07:15,575 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2019-09-03 21:07:15,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-03 21:07:15,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:07:15,575 INFO L399 BasicCegarLoop]: trace histogram [109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:07:15,575 INFO L418 AbstractCegarLoop]: === Iteration 111 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:07:15,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:07:15,575 INFO L82 PathProgramCache]: Analyzing trace with hash 244161569, now seen corresponding path program 109 times [2019-09-03 21:07:15,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:07:15,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:15,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:07:15,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:15,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:07:15,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:07:19,564 INFO L134 CoverageAnalysis]: Checked inductivity of 11881 backedges. 0 proven. 11881 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:07:19,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:19,565 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:07:19,565 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:07:19,566 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:07:19,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:19,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:07:19,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:07:19,575 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:07:19,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:07:19,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 111 conjunts are in the unsatisfiable core [2019-09-03 21:07:19,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:07:19,658 INFO L134 CoverageAnalysis]: Checked inductivity of 11881 backedges. 0 proven. 11881 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:07:19,658 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:07:31,636 INFO L134 CoverageAnalysis]: Checked inductivity of 11881 backedges. 0 proven. 11881 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:07:31,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:07:31,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 112, 112] total 222 [2019-09-03 21:07:31,639 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:07:31,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-09-03 21:07:31,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-09-03 21:07:31,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2019-09-03 21:07:31,643 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 112 states. [2019-09-03 21:07:32,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:07:32,141 INFO L93 Difference]: Finished difference Result 232 states and 232 transitions. [2019-09-03 21:07:32,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-09-03 21:07:32,141 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 228 [2019-09-03 21:07:32,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:07:32,142 INFO L225 Difference]: With dead ends: 232 [2019-09-03 21:07:32,142 INFO L226 Difference]: Without dead ends: 232 [2019-09-03 21:07:32,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2019-09-03 21:07:32,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-09-03 21:07:32,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 231. [2019-09-03 21:07:32,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-09-03 21:07:32,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2019-09-03 21:07:32,145 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 228 [2019-09-03 21:07:32,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:07:32,145 INFO L475 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2019-09-03 21:07:32,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-09-03 21:07:32,145 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2019-09-03 21:07:32,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-03 21:07:32,146 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:07:32,146 INFO L399 BasicCegarLoop]: trace histogram [110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:07:32,146 INFO L418 AbstractCegarLoop]: === Iteration 112 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:07:32,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:07:32,146 INFO L82 PathProgramCache]: Analyzing trace with hash -448572705, now seen corresponding path program 110 times [2019-09-03 21:07:32,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:07:32,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:32,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:07:32,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:32,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:07:32,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:07:36,280 INFO L134 CoverageAnalysis]: Checked inductivity of 12100 backedges. 0 proven. 12100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:07:36,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:36,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:07:36,281 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:07:36,281 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:07:36,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:36,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:07:36,291 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:07:36,291 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:07:36,459 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 111 check-sat command(s) [2019-09-03 21:07:36,460 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:07:36,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 112 conjunts are in the unsatisfiable core [2019-09-03 21:07:36,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:07:36,503 INFO L134 CoverageAnalysis]: Checked inductivity of 12100 backedges. 0 proven. 12100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:07:36,503 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:07:48,699 INFO L134 CoverageAnalysis]: Checked inductivity of 12100 backedges. 0 proven. 12100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:07:48,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:07:48,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113, 113, 113] total 224 [2019-09-03 21:07:48,702 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:07:48,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-09-03 21:07:48,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-09-03 21:07:48,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2019-09-03 21:07:48,704 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 113 states. [2019-09-03 21:07:49,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:07:49,224 INFO L93 Difference]: Finished difference Result 234 states and 234 transitions. [2019-09-03 21:07:49,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-09-03 21:07:49,224 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 230 [2019-09-03 21:07:49,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:07:49,225 INFO L225 Difference]: With dead ends: 234 [2019-09-03 21:07:49,225 INFO L226 Difference]: Without dead ends: 234 [2019-09-03 21:07:49,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2019-09-03 21:07:49,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-09-03 21:07:49,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2019-09-03 21:07:49,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-09-03 21:07:49,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2019-09-03 21:07:49,227 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 230 [2019-09-03 21:07:49,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:07:49,227 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2019-09-03 21:07:49,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-09-03 21:07:49,227 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2019-09-03 21:07:49,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-03 21:07:49,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:07:49,228 INFO L399 BasicCegarLoop]: trace histogram [111, 111, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:07:49,228 INFO L418 AbstractCegarLoop]: === Iteration 113 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:07:49,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:07:49,228 INFO L82 PathProgramCache]: Analyzing trace with hash -446279139, now seen corresponding path program 111 times [2019-09-03 21:07:49,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:07:49,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:49,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:07:49,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:49,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:07:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:07:53,406 INFO L134 CoverageAnalysis]: Checked inductivity of 12321 backedges. 0 proven. 12321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:07:53,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:53,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:07:53,406 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:07:53,406 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:07:53,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:53,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:07:53,416 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:07:53,416 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:07:53,461 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:07:53,461 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:07:53,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 113 conjunts are in the unsatisfiable core [2019-09-03 21:07:53,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:07:53,503 INFO L134 CoverageAnalysis]: Checked inductivity of 12321 backedges. 0 proven. 12321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:07:53,503 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:08:05,879 INFO L134 CoverageAnalysis]: Checked inductivity of 12321 backedges. 0 proven. 12321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:08:05,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:08:05,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114, 114, 114] total 226 [2019-09-03 21:08:05,882 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:08:05,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-09-03 21:08:05,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-09-03 21:08:05,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25425, Invalid=25425, Unknown=0, NotChecked=0, Total=50850 [2019-09-03 21:08:05,885 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 114 states. [2019-09-03 21:08:06,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:08:06,462 INFO L93 Difference]: Finished difference Result 236 states and 236 transitions. [2019-09-03 21:08:06,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-09-03 21:08:06,462 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 232 [2019-09-03 21:08:06,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:08:06,463 INFO L225 Difference]: With dead ends: 236 [2019-09-03 21:08:06,463 INFO L226 Difference]: Without dead ends: 236 [2019-09-03 21:08:06,464 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=25425, Invalid=25425, Unknown=0, NotChecked=0, Total=50850 [2019-09-03 21:08:06,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-09-03 21:08:06,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 235. [2019-09-03 21:08:06,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-09-03 21:08:06,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2019-09-03 21:08:06,465 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 232 [2019-09-03 21:08:06,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:08:06,466 INFO L475 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2019-09-03 21:08:06,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-09-03 21:08:06,466 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2019-09-03 21:08:06,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-09-03 21:08:06,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:08:06,466 INFO L399 BasicCegarLoop]: trace histogram [112, 112, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:08:06,467 INFO L418 AbstractCegarLoop]: === Iteration 114 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:08:06,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:08:06,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1757837787, now seen corresponding path program 112 times [2019-09-03 21:08:06,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:08:06,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:08:06,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:08:06,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:08:06,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:08:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:08:10,690 INFO L134 CoverageAnalysis]: Checked inductivity of 12544 backedges. 0 proven. 12544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:08:10,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:08:10,691 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:08:10,691 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:08:10,691 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:08:10,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:08:10,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 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:08:10,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:08:10,700 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:08:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:08:10,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 114 conjunts are in the unsatisfiable core [2019-09-03 21:08:10,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:08:10,788 INFO L134 CoverageAnalysis]: Checked inductivity of 12544 backedges. 0 proven. 12544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:08:10,788 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:08:23,412 INFO L134 CoverageAnalysis]: Checked inductivity of 12544 backedges. 0 proven. 12544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:08:23,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:08:23,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115, 115, 115] total 228 [2019-09-03 21:08:23,415 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:08:23,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-09-03 21:08:23,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-09-03 21:08:23,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25878, Invalid=25878, Unknown=0, NotChecked=0, Total=51756 [2019-09-03 21:08:23,417 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 115 states. [2019-09-03 21:08:24,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:08:24,067 INFO L93 Difference]: Finished difference Result 238 states and 238 transitions. [2019-09-03 21:08:24,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-09-03 21:08:24,067 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 234 [2019-09-03 21:08:24,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:08:24,068 INFO L225 Difference]: With dead ends: 238 [2019-09-03 21:08:24,068 INFO L226 Difference]: Without dead ends: 238 [2019-09-03 21:08:24,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 582 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=25878, Invalid=25878, Unknown=0, NotChecked=0, Total=51756 [2019-09-03 21:08:24,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-09-03 21:08:24,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2019-09-03 21:08:24,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-09-03 21:08:24,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2019-09-03 21:08:24,072 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 234 [2019-09-03 21:08:24,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:08:24,072 INFO L475 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2019-09-03 21:08:24,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-09-03 21:08:24,073 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2019-09-03 21:08:24,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-03 21:08:24,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:08:24,073 INFO L399 BasicCegarLoop]: trace histogram [113, 113, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:08:24,074 INFO L418 AbstractCegarLoop]: === Iteration 115 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:08:24,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:08:24,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1799640551, now seen corresponding path program 113 times [2019-09-03 21:08:24,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:08:24,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:08:24,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:08:24,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:08:24,075 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:08:24,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:08:28,393 INFO L134 CoverageAnalysis]: Checked inductivity of 12769 backedges. 0 proven. 12769 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:08:28,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:08:28,393 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:08:28,393 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:08:28,393 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:08:28,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:08:28,393 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:08:28,403 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:08:28,403 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:08:28,577 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 114 check-sat command(s) [2019-09-03 21:08:28,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:08:28,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 115 conjunts are in the unsatisfiable core [2019-09-03 21:08:28,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:08:28,626 INFO L134 CoverageAnalysis]: Checked inductivity of 12769 backedges. 0 proven. 12769 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:08:28,626 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:08:41,472 INFO L134 CoverageAnalysis]: Checked inductivity of 12769 backedges. 0 proven. 12769 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:08:41,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:08:41,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116, 116, 116] total 230 [2019-09-03 21:08:41,475 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:08:41,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-09-03 21:08:41,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-09-03 21:08:41,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26335, Invalid=26335, Unknown=0, NotChecked=0, Total=52670 [2019-09-03 21:08:41,477 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 116 states. [2019-09-03 21:08:41,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:08:41,935 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2019-09-03 21:08:41,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-09-03 21:08:41,935 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 236 [2019-09-03 21:08:41,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:08:41,936 INFO L225 Difference]: With dead ends: 240 [2019-09-03 21:08:41,936 INFO L226 Difference]: Without dead ends: 240 [2019-09-03 21:08:41,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 587 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=26335, Invalid=26335, Unknown=0, NotChecked=0, Total=52670 [2019-09-03 21:08:41,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-09-03 21:08:41,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 239. [2019-09-03 21:08:41,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-09-03 21:08:41,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2019-09-03 21:08:41,938 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 236 [2019-09-03 21:08:41,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:08:41,939 INFO L475 AbstractCegarLoop]: Abstraction has 239 states and 239 transitions. [2019-09-03 21:08:41,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-09-03 21:08:41,939 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 239 transitions. [2019-09-03 21:08:41,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-03 21:08:41,939 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:08:41,939 INFO L399 BasicCegarLoop]: trace histogram [114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:08:41,940 INFO L418 AbstractCegarLoop]: === Iteration 116 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:08:41,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:08:41,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1742355753, now seen corresponding path program 114 times [2019-09-03 21:08:41,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:08:41,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:08:41,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:08:41,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:08:41,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:08:41,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:08:46,289 INFO L134 CoverageAnalysis]: Checked inductivity of 12996 backedges. 0 proven. 12996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:08:46,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:08:46,289 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:08:46,289 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:08:46,289 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:08:46,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:08:46,289 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:08:46,299 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:08:46,299 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:08:46,346 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:08:46,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:08:46,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 116 conjunts are in the unsatisfiable core [2019-09-03 21:08:46,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:08:46,413 INFO L134 CoverageAnalysis]: Checked inductivity of 12996 backedges. 0 proven. 12996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:08:46,414 INFO L322 TraceCheckSpWp]: Computing backward predicates...