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/loops-crafted-1/Mono1_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 13:09:21,441 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 13:09:21,443 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 13:09:21,461 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 13:09:21,462 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 13:09:21,463 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 13:09:21,466 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 13:09:21,477 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 13:09:21,479 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 13:09:21,481 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 13:09:21,482 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 13:09:21,483 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 13:09:21,483 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 13:09:21,484 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 13:09:21,487 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 13:09:21,488 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 13:09:21,489 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 13:09:21,490 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 13:09:21,494 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 13:09:21,499 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 13:09:21,501 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 13:09:21,504 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 13:09:21,506 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 13:09:21,508 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 13:09:21,512 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 13:09:21,512 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 13:09:21,512 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 13:09:21,514 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 13:09:21,516 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 13:09:21,517 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 13:09:21,517 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 13:09:21,520 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 13:09:21,521 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 13:09:21,522 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 13:09:21,525 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 13:09:21,526 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 13:09:21,526 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 13:09:21,526 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 13:09:21,527 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 13:09:21,528 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 13:09:21,529 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 13:09:21,530 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-05 13:09:21,548 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 13:09:21,549 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 13:09:21,549 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-05 13:09:21,549 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-05 13:09:21,550 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-05 13:09:21,550 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-05 13:09:21,550 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-05 13:09:21,551 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-05 13:09:21,551 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-05 13:09:21,551 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-05 13:09:21,552 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 13:09:21,552 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 13:09:21,552 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 13:09:21,552 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 13:09:21,552 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 13:09:21,552 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 13:09:21,553 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 13:09:21,553 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 13:09:21,553 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 13:09:21,553 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 13:09:21,553 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 13:09:21,554 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-05 13:09:21,554 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 13:09:21,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 13:09:21,554 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 13:09:21,554 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 13:09:21,555 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-05 13:09:21,555 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 13:09:21,555 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 13:09:21,555 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-05 13:09:21,583 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 13:09:21,596 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 13:09:21,599 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 13:09:21,600 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 13:09:21,601 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 13:09:21,601 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono1_1-1.c [2019-09-05 13:09:21,659 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f13c9bf4/c1802c52887b400b92400c5a2ba61f14/FLAGa67fa93e7 [2019-09-05 13:09:22,104 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 13:09:22,105 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono1_1-1.c [2019-09-05 13:09:22,110 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f13c9bf4/c1802c52887b400b92400c5a2ba61f14/FLAGa67fa93e7 [2019-09-05 13:09:22,509 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f13c9bf4/c1802c52887b400b92400c5a2ba61f14 [2019-09-05 13:09:22,518 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 13:09:22,520 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 13:09:22,521 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 13:09:22,521 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 13:09:22,525 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 13:09:22,525 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 01:09:22" (1/1) ... [2019-09-05 13:09:22,528 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@679e3444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:09:22, skipping insertion in model container [2019-09-05 13:09:22,528 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 01:09:22" (1/1) ... [2019-09-05 13:09:22,536 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 13:09:22,551 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 13:09:22,708 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 13:09:22,712 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 13:09:22,725 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 13:09:22,738 INFO L192 MainTranslator]: Completed translation [2019-09-05 13:09:22,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:09:22 WrapperNode [2019-09-05 13:09:22,739 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 13:09:22,739 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 13:09:22,740 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 13:09:22,740 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 13:09:22,835 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:09:22" (1/1) ... [2019-09-05 13:09:22,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:09:22" (1/1) ... [2019-09-05 13:09:22,841 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:09:22" (1/1) ... [2019-09-05 13:09:22,841 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:09:22" (1/1) ... [2019-09-05 13:09:22,844 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:09:22" (1/1) ... [2019-09-05 13:09:22,851 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:09:22" (1/1) ... [2019-09-05 13:09:22,852 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:09:22" (1/1) ... [2019-09-05 13:09:22,853 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 13:09:22,854 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 13:09:22,854 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 13:09:22,854 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 13:09:22,855 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:09:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 13:09:22,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 13:09:22,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 13:09:22,903 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 13:09:22,904 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 13:09:22,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 13:09:22,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 13:09:22,904 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 13:09:22,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 13:09:22,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 13:09:23,054 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 13:09:23,054 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-05 13:09:23,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 01:09:23 BoogieIcfgContainer [2019-09-05 13:09:23,056 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 13:09:23,057 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 13:09:23,057 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 13:09:23,060 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 13:09:23,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 01:09:22" (1/3) ... [2019-09-05 13:09:23,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5725b522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 01:09:23, skipping insertion in model container [2019-09-05 13:09:23,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:09:22" (2/3) ... [2019-09-05 13:09:23,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5725b522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 01:09:23, skipping insertion in model container [2019-09-05 13:09:23,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 01:09:23" (3/3) ... [2019-09-05 13:09:23,063 INFO L109 eAbstractionObserver]: Analyzing ICFG Mono1_1-1.c [2019-09-05 13:09:23,073 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 13:09:23,080 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 13:09:23,097 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 13:09:23,120 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 13:09:23,121 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-05 13:09:23,121 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 13:09:23,121 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 13:09:23,121 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 13:09:23,121 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 13:09:23,121 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 13:09:23,122 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 13:09:23,134 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-09-05 13:09:23,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 13:09:23,143 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:09:23,143 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:09:23,146 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:09:23,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:09:23,150 INFO L82 PathProgramCache]: Analyzing trace with hash -721501374, now seen corresponding path program 1 times [2019-09-05 13:09:23,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:09:23,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:23,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:09:23,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:23,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:09:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:09:23,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:09:23,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:09:23,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-05 13:09:23,248 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:09:23,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-05 13:09:23,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-05 13:09:23,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 13:09:23,266 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-09-05 13:09:23,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:09:23,280 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2019-09-05 13:09:23,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-05 13:09:23,281 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-05 13:09:23,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:09:23,289 INFO L225 Difference]: With dead ends: 18 [2019-09-05 13:09:23,289 INFO L226 Difference]: Without dead ends: 12 [2019-09-05 13:09:23,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 13:09:23,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-05 13:09:23,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-05 13:09:23,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-05 13:09:23,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-09-05 13:09:23,327 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2019-09-05 13:09:23,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:09:23,328 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-09-05 13:09:23,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-05 13:09:23,328 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-09-05 13:09:23,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 13:09:23,329 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:09:23,329 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:09:23,329 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:09:23,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:09:23,330 INFO L82 PathProgramCache]: Analyzing trace with hash -730736584, now seen corresponding path program 1 times [2019-09-05 13:09:23,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:09:23,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:23,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:09:23,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:23,332 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:09:23,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:09:23,574 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 5 [2019-09-05 13:09:23,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:09:23,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:09:23,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 13:09:23,585 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:09:23,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 13:09:23,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 13:09:23,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 13:09:23,593 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 3 states. [2019-09-05 13:09:23,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:09:23,614 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-09-05 13:09:23,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 13:09:23,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-05 13:09:23,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:09:23,615 INFO L225 Difference]: With dead ends: 14 [2019-09-05 13:09:23,615 INFO L226 Difference]: Without dead ends: 14 [2019-09-05 13:09:23,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 13:09:23,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-05 13:09:23,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-09-05 13:09:23,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-05 13:09:23,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-09-05 13:09:23,620 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2019-09-05 13:09:23,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:09:23,621 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-09-05 13:09:23,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 13:09:23,621 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-09-05 13:09:23,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-05 13:09:23,622 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:09:23,622 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:09:23,623 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:09:23,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:09:23,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1082855947, now seen corresponding path program 1 times [2019-09-05 13:09:23,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:09:23,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:23,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:09:23,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:23,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:09:23,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:09:23,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:09:23,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:23,734 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:09:23,737 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 13 with the following transitions: [2019-09-05 13:09:23,739 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [16], [25], [28], [30], [36], [37], [38], [40] [2019-09-05 13:09:23,779 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:09:23,780 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:09:23,850 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-05 13:09:23,922 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:09:23,925 INFO L272 AbstractInterpreter]: Visited 12 different actions 54 times. Merged at 3 different actions 18 times. Widened at 1 different actions 4 times. Performed 88 root evaluator evaluations with a maximum evaluation depth of 5. Performed 88 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 2 variables. [2019-09-05 13:09:23,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:09:23,930 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:09:23,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:23,931 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:09:23,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:09:23,961 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:09:23,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:09:23,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-05 13:09:23,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:09:24,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:09:24,026 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:09:24,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:09:24,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:09:24,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 7] total 10 [2019-09-05 13:09:24,124 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:09:24,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:09:24,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:09:24,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-05 13:09:24,126 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2019-09-05 13:09:24,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:09:24,167 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2019-09-05 13:09:24,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 13:09:24,169 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-09-05 13:09:24,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:09:24,170 INFO L225 Difference]: With dead ends: 16 [2019-09-05 13:09:24,170 INFO L226 Difference]: Without dead ends: 16 [2019-09-05 13:09:24,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-05 13:09:24,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-05 13:09:24,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-05 13:09:24,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-05 13:09:24,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-09-05 13:09:24,178 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2019-09-05 13:09:24,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:09:24,178 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-09-05 13:09:24,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:09:24,179 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-09-05 13:09:24,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-05 13:09:24,179 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:09:24,179 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:09:24,180 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:09:24,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:09:24,180 INFO L82 PathProgramCache]: Analyzing trace with hash -167147406, now seen corresponding path program 2 times [2019-09-05 13:09:24,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:09:24,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:24,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:09:24,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:24,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:09:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:09:24,303 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-05 13:09:24,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:24,304 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:09:24,304 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:09:24,304 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:09:24,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:24,305 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:09:24,319 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:09:24,320 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:09:24,337 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-05 13:09:24,338 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:09:24,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-05 13:09:24,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:09:24,367 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:09:24,367 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:09:24,456 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:09:24,460 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-05 13:09:24,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 6] imperfect sequences [5] total 10 [2019-09-05 13:09:24,460 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:09:24,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 13:09:24,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 13:09:24,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-05 13:09:24,462 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 3 states. [2019-09-05 13:09:24,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:09:24,486 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-09-05 13:09:24,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 13:09:24,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-09-05 13:09:24,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:09:24,488 INFO L225 Difference]: With dead ends: 18 [2019-09-05 13:09:24,488 INFO L226 Difference]: Without dead ends: 18 [2019-09-05 13:09:24,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-05 13:09:24,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-05 13:09:24,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-09-05 13:09:24,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-05 13:09:24,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-09-05 13:09:24,496 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-09-05 13:09:24,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:09:24,496 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-09-05 13:09:24,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 13:09:24,496 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-09-05 13:09:24,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-05 13:09:24,497 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:09:24,498 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:09:24,498 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:09:24,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:09:24,499 INFO L82 PathProgramCache]: Analyzing trace with hash -582276883, now seen corresponding path program 1 times [2019-09-05 13:09:24,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:09:24,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:24,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:09:24,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:24,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:09:24,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:09:24,593 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:09:24,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:24,594 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:09:24,594 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2019-09-05 13:09:24,595 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [16], [18], [25], [28], [30], [36], [37], [38], [40] [2019-09-05 13:09:24,596 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:09:24,596 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:09:24,599 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-05 13:09:24,643 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:09:24,643 INFO L272 AbstractInterpreter]: Visited 13 different actions 61 times. Merged at 4 different actions 18 times. Widened at 2 different actions 4 times. Performed 104 root evaluator evaluations with a maximum evaluation depth of 5. Performed 104 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 8 fixpoints after 2 different actions. Largest state had 2 variables. [2019-09-05 13:09:24,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:09:24,644 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:09:24,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:24,644 INFO 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-05 13:09:24,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:09:24,673 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:09:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:09:24,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-05 13:09:24,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:09:24,735 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:09:24,735 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:09:24,879 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:09:24,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:09:24,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 10 [2019-09-05 13:09:24,883 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:09:24,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 13:09:24,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 13:09:24,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-09-05 13:09:24,885 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 6 states. [2019-09-05 13:09:24,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:09:24,926 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-09-05 13:09:24,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:09:24,926 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-09-05 13:09:24,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:09:24,927 INFO L225 Difference]: With dead ends: 19 [2019-09-05 13:09:24,927 INFO L226 Difference]: Without dead ends: 19 [2019-09-05 13:09:24,928 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-09-05 13:09:24,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-05 13:09:24,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-05 13:09:24,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-05 13:09:24,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-09-05 13:09:24,931 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-09-05 13:09:24,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:09:24,932 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-09-05 13:09:24,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 13:09:24,932 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-09-05 13:09:24,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-05 13:09:24,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:09:24,933 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:09:24,933 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:09:24,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:09:24,933 INFO L82 PathProgramCache]: Analyzing trace with hash 719600874, now seen corresponding path program 2 times [2019-09-05 13:09:24,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:09:24,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:24,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:09:24,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:24,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:09:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:09:25,051 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:09:25,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:25,052 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:09:25,052 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:09:25,052 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:09:25,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:25,053 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:09:25,071 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:09:25,071 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:09:25,081 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-05 13:09:25,082 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:09:25,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-05 13:09:25,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:09:25,300 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-05 13:09:25,300 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:09:25,467 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-05 13:09:25,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:09:25,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 8] total 14 [2019-09-05 13:09:25,471 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:09:25,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 13:09:25,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 13:09:25,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-09-05 13:09:25,472 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 8 states. [2019-09-05 13:09:28,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:09:28,210 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-09-05 13:09:28,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 13:09:28,211 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-09-05 13:09:28,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:09:28,212 INFO L225 Difference]: With dead ends: 24 [2019-09-05 13:09:28,212 INFO L226 Difference]: Without dead ends: 24 [2019-09-05 13:09:28,212 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-09-05 13:09:28,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-05 13:09:28,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-05 13:09:28,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-05 13:09:28,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-09-05 13:09:28,216 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 18 [2019-09-05 13:09:28,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:09:28,217 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-09-05 13:09:28,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 13:09:28,217 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-09-05 13:09:28,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-05 13:09:28,218 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:09:28,218 INFO L399 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:09:28,218 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:09:28,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:09:28,219 INFO L82 PathProgramCache]: Analyzing trace with hash 957312226, now seen corresponding path program 3 times [2019-09-05 13:09:28,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:09:28,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:28,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:09:28,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:28,220 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:09:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:09:28,344 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 13:09:28,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:28,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:09:28,345 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:09:28,345 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:09:28,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:28,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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:09:28,358 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:09:28,358 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:09:28,369 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:09:28,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:09:28,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-05 13:09:28,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:09:28,407 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 13:09:28,408 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:09:28,613 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 13:09:28,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:09:28,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 14 [2019-09-05 13:09:28,619 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:09:28,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 13:09:28,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 13:09:28,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-09-05 13:09:28,621 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 8 states. [2019-09-05 13:09:28,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:09:28,719 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2019-09-05 13:09:28,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 13:09:28,719 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-09-05 13:09:28,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:09:28,720 INFO L225 Difference]: With dead ends: 26 [2019-09-05 13:09:28,720 INFO L226 Difference]: Without dead ends: 26 [2019-09-05 13:09:28,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-09-05 13:09:28,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-05 13:09:28,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-09-05 13:09:28,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-05 13:09:28,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-09-05 13:09:28,725 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 22 [2019-09-05 13:09:28,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:09:28,725 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-09-05 13:09:28,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 13:09:28,726 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-09-05 13:09:28,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-05 13:09:28,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:09:28,727 INFO L399 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:09:28,727 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:09:28,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:09:28,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1915302113, now seen corresponding path program 4 times [2019-09-05 13:09:28,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:09:28,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:28,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:09:28,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:28,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:09:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:09:28,868 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 13:09:28,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:28,868 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:09:28,869 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:09:28,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:09:28,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:28,869 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:09:28,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:09:28,884 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:09:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:09:28,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-05 13:09:28,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:09:28,947 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 13:09:28,947 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:09:30,494 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 13:09:30,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:09:30,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 16 [2019-09-05 13:09:30,497 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:09:30,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-05 13:09:30,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-05 13:09:30,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-09-05 13:09:30,498 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 9 states. [2019-09-05 13:09:30,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:09:30,600 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2019-09-05 13:09:30,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 13:09:30,602 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-09-05 13:09:30,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:09:30,603 INFO L225 Difference]: With dead ends: 28 [2019-09-05 13:09:30,603 INFO L226 Difference]: Without dead ends: 28 [2019-09-05 13:09:30,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-09-05 13:09:30,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-05 13:09:30,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-09-05 13:09:30,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-05 13:09:30,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-09-05 13:09:30,607 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 24 [2019-09-05 13:09:30,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:09:30,608 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-09-05 13:09:30,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-05 13:09:30,608 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-09-05 13:09:30,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-05 13:09:30,609 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:09:30,609 INFO L399 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:09:30,609 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:09:30,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:09:30,609 INFO L82 PathProgramCache]: Analyzing trace with hash -833710564, now seen corresponding path program 5 times [2019-09-05 13:09:30,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:09:30,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:30,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:09:30,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:30,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:09:30,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:09:30,727 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 13:09:30,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:30,728 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:09:30,728 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:09:30,728 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:09:30,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:30,728 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:09:30,754 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:09:30,755 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:09:30,769 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-05 13:09:30,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:09:30,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-05 13:09:30,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:09:30,846 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 30 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-05 13:09:30,847 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:09:30,986 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 30 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-05 13:09:30,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:09:30,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 8] total 18 [2019-09-05 13:09:30,989 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:09:30,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-05 13:09:30,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-05 13:09:30,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2019-09-05 13:09:30,991 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 12 states. [2019-09-05 13:09:31,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:09:31,462 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2019-09-05 13:09:31,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-05 13:09:31,463 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-09-05 13:09:31,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:09:31,463 INFO L225 Difference]: With dead ends: 34 [2019-09-05 13:09:31,463 INFO L226 Difference]: Without dead ends: 34 [2019-09-05 13:09:31,464 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2019-09-05 13:09:31,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-05 13:09:31,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2019-09-05 13:09:31,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-05 13:09:31,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-09-05 13:09:31,468 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 26 [2019-09-05 13:09:31,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:09:31,468 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-09-05 13:09:31,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-05 13:09:31,468 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-09-05 13:09:31,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-05 13:09:31,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:09:31,469 INFO L399 BasicCegarLoop]: trace histogram [10, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:09:31,470 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:09:31,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:09:31,470 INFO L82 PathProgramCache]: Analyzing trace with hash -644516716, now seen corresponding path program 6 times [2019-09-05 13:09:31,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:09:31,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:31,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:09:31,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:31,472 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:09:31,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:09:31,632 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 40 proven. 56 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 13:09:31,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:31,633 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:09:31,633 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:09:31,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:09:31,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:31,634 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:09:31,663 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:09:31,663 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:09:31,677 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:09:31,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:09:31,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-05 13:09:31,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:09:31,714 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 40 proven. 56 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 13:09:31,715 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:09:32,123 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 40 proven. 56 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 13:09:32,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:09:32,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 20 [2019-09-05 13:09:32,126 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:09:32,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-05 13:09:32,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-05 13:09:32,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2019-09-05 13:09:32,128 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 11 states. [2019-09-05 13:09:32,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:09:32,276 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-09-05 13:09:32,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-05 13:09:32,278 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2019-09-05 13:09:32,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:09:32,278 INFO L225 Difference]: With dead ends: 33 [2019-09-05 13:09:32,278 INFO L226 Difference]: Without dead ends: 33 [2019-09-05 13:09:32,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2019-09-05 13:09:32,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-05 13:09:32,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-05 13:09:32,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-05 13:09:32,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-09-05 13:09:32,284 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 30 [2019-09-05 13:09:32,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:09:32,284 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-09-05 13:09:32,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-05 13:09:32,284 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-09-05 13:09:32,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-05 13:09:32,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:09:32,285 INFO L399 BasicCegarLoop]: trace histogram [11, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:09:32,285 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:09:32,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:09:32,286 INFO L82 PathProgramCache]: Analyzing trace with hash -30848559, now seen corresponding path program 7 times [2019-09-05 13:09:32,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:09:32,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:32,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:09:32,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:32,287 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:09:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:09:32,439 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 45 proven. 72 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 13:09:32,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:32,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:09:32,440 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:09:32,440 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:09:32,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:32,441 INFO 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-05 13:09:32,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:09:32,463 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:09:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:09:32,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-05 13:09:32,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:09:32,515 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 45 proven. 72 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 13:09:32,515 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:09:32,873 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 45 proven. 72 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 13:09:32,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:09:32,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 22 [2019-09-05 13:09:32,876 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:09:32,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-05 13:09:32,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-05 13:09:32,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2019-09-05 13:09:32,877 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 12 states. [2019-09-05 13:09:33,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:09:33,064 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2019-09-05 13:09:33,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-05 13:09:33,065 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2019-09-05 13:09:33,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:09:33,066 INFO L225 Difference]: With dead ends: 35 [2019-09-05 13:09:33,066 INFO L226 Difference]: Without dead ends: 35 [2019-09-05 13:09:33,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2019-09-05 13:09:33,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-05 13:09:33,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-09-05 13:09:33,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-05 13:09:33,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-09-05 13:09:33,074 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 32 [2019-09-05 13:09:33,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:09:33,074 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-09-05 13:09:33,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-05 13:09:33,074 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-09-05 13:09:33,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-05 13:09:33,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:09:33,075 INFO L399 BasicCegarLoop]: trace histogram [12, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:09:33,076 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:09:33,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:09:33,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1293730766, now seen corresponding path program 8 times [2019-09-05 13:09:33,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:09:33,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:33,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:09:33,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:33,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:09:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:09:33,254 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 50 proven. 90 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 13:09:33,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:33,254 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:09:33,255 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:09:33,255 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:09:33,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:33,255 INFO 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-05 13:09:33,279 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:09:33,280 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:09:33,312 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-05 13:09:33,312 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:09:33,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-05 13:09:33,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:09:33,393 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 63 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-09-05 13:09:33,394 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:09:33,570 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 63 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-09-05 13:09:33,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:09:33,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 9] total 23 [2019-09-05 13:09:33,574 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:09:33,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-05 13:09:33,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-05 13:09:33,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2019-09-05 13:09:33,576 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 16 states. [2019-09-05 13:09:34,519 WARN L188 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-05 13:09:44,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:09:44,228 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2019-09-05 13:09:44,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-05 13:09:44,228 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2019-09-05 13:09:44,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:09:44,230 INFO L225 Difference]: With dead ends: 42 [2019-09-05 13:09:44,230 INFO L226 Difference]: Without dead ends: 42 [2019-09-05 13:09:44,231 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=181, Invalid=520, Unknown=1, NotChecked=0, Total=702 [2019-09-05 13:09:44,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-05 13:09:44,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2019-09-05 13:09:44,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-05 13:09:44,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-09-05 13:09:44,237 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 34 [2019-09-05 13:09:44,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:09:44,237 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-09-05 13:09:44,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-05 13:09:44,237 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-09-05 13:09:44,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-05 13:09:44,238 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:09:44,238 INFO L399 BasicCegarLoop]: trace histogram [14, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:09:44,239 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:09:44,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:09:44,239 INFO L82 PathProgramCache]: Analyzing trace with hash 284766406, now seen corresponding path program 9 times [2019-09-05 13:09:44,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:09:44,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:44,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:09:44,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:44,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:09:44,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:09:44,463 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 77 proven. 110 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-05 13:09:44,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:44,464 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:09:44,464 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:09:44,464 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:09:44,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:44,465 INFO 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) [2019-09-05 13:09:44,489 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:09:44,489 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:09:44,505 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:09:44,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:09:44,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-05 13:09:44,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:09:44,560 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 77 proven. 110 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-05 13:09:44,560 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:09:45,143 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 77 proven. 110 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 13:09:45,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:09:45,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 26 [2019-09-05 13:09:45,147 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:09:45,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-05 13:09:45,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-05 13:09:45,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=445, Unknown=0, NotChecked=0, Total=650 [2019-09-05 13:09:45,149 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 14 states. [2019-09-05 13:09:45,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:09:45,405 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2019-09-05 13:09:45,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-05 13:09:45,406 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2019-09-05 13:09:45,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:09:45,407 INFO L225 Difference]: With dead ends: 41 [2019-09-05 13:09:45,407 INFO L226 Difference]: Without dead ends: 41 [2019-09-05 13:09:45,408 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=205, Invalid=445, Unknown=0, NotChecked=0, Total=650 [2019-09-05 13:09:45,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-05 13:09:45,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-09-05 13:09:45,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-05 13:09:45,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2019-09-05 13:09:45,412 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 38 [2019-09-05 13:09:45,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:09:45,413 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2019-09-05 13:09:45,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-05 13:09:45,413 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2019-09-05 13:09:45,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-05 13:09:45,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:09:45,416 INFO L399 BasicCegarLoop]: trace histogram [15, 11, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:09:45,430 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:09:45,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:09:45,430 INFO L82 PathProgramCache]: Analyzing trace with hash 926316803, now seen corresponding path program 10 times [2019-09-05 13:09:45,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:09:45,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:45,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:09:45,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:45,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:09:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:09:45,631 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 84 proven. 132 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-05 13:09:45,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:45,632 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:09:45,632 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:09:45,632 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:09:45,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:45,633 INFO 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) [2019-09-05 13:09:45,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:09:45,653 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:09:45,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:09:45,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-05 13:09:45,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:09:45,726 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 84 proven. 132 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-05 13:09:45,726 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:09:46,307 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 84 proven. 132 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-05 13:09:46,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:09:46,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 28 [2019-09-05 13:09:46,312 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:09:46,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-05 13:09:46,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-05 13:09:46,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=521, Unknown=0, NotChecked=0, Total=756 [2019-09-05 13:09:46,313 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 15 states. [2019-09-05 13:09:46,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:09:46,622 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-09-05 13:09:46,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-05 13:09:46,623 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2019-09-05 13:09:46,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:09:46,623 INFO L225 Difference]: With dead ends: 43 [2019-09-05 13:09:46,624 INFO L226 Difference]: Without dead ends: 43 [2019-09-05 13:09:46,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=235, Invalid=521, Unknown=0, NotChecked=0, Total=756 [2019-09-05 13:09:46,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-05 13:09:46,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-09-05 13:09:46,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-05 13:09:46,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-09-05 13:09:46,628 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 40 [2019-09-05 13:09:46,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:09:46,628 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-09-05 13:09:46,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-05 13:09:46,629 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-09-05 13:09:46,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-05 13:09:46,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:09:46,629 INFO L399 BasicCegarLoop]: trace histogram [16, 12, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:09:46,630 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:09:46,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:09:46,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1019042304, now seen corresponding path program 11 times [2019-09-05 13:09:46,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:09:46,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:46,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:09:46,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:09:46,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:09:46,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:09:46,850 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 91 proven. 156 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-05 13:09:46,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:46,851 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:09:46,851 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:09:46,851 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:09:46,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:09:46,851 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:09:46,872 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:09:46,872 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:09:46,893 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-05 13:09:46,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:09:46,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-05 13:09:46,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:09:48,924 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 108 proven. 16 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-09-05 13:09:48,925 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:09:49,449 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 108 proven. 16 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-09-05 13:09:49,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:09:49,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7, 11] total 29 [2019-09-05 13:09:49,453 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:09:49,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-05 13:09:49,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-05 13:09:49,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=599, Unknown=0, NotChecked=0, Total=812 [2019-09-05 13:09:49,458 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 20 states. [2019-09-05 13:09:50,392 WARN L188 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-05 13:09:52,880 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967289) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967291) 4294967296) 10000000) (<= 10000000 (mod (+ c_main_~x~0 4294967294) 4294967296)) (< (mod (+ c_main_~x~0 4294967293) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967287) 4294967296) 10000000)) is different from false [2019-09-05 13:10:02,938 WARN L188 SmtUtils]: Spent 3.44 s on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-05 13:10:09,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:10:09,734 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2019-09-05 13:10:09,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-05 13:10:09,734 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2019-09-05 13:10:09,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:10:09,735 INFO L225 Difference]: With dead ends: 50 [2019-09-05 13:10:09,735 INFO L226 Difference]: Without dead ends: 50 [2019-09-05 13:10:09,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=290, Invalid=834, Unknown=2, NotChecked=64, Total=1190 [2019-09-05 13:10:09,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-05 13:10:09,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2019-09-05 13:10:09,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-05 13:10:09,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2019-09-05 13:10:09,739 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 42 [2019-09-05 13:10:09,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:10:09,740 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2019-09-05 13:10:09,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-05 13:10:09,740 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2019-09-05 13:10:09,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-05 13:10:09,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:10:09,741 INFO L399 BasicCegarLoop]: trace histogram [18, 13, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:10:09,742 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:10:09,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:10:09,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1622573432, now seen corresponding path program 12 times [2019-09-05 13:10:09,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:10:09,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:10:09,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:10:09,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:10:09,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:10:09,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:10:09,960 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 126 proven. 182 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-05 13:10:09,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:10:09,960 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:10:09,960 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:10:09,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:10:09,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:10:09,961 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:10:09,976 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:10:09,976 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:10:10,002 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:10:10,002 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:10:10,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-05 13:10:10,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:10:10,056 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 126 proven. 182 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-05 13:10:10,056 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:10:13,023 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 126 proven. 180 refuted. 2 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-05 13:10:13,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:10:13,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 17] total 32 [2019-09-05 13:10:13,026 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:10:13,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-05 13:10:13,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-05 13:10:13,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=690, Unknown=1, NotChecked=0, Total=992 [2019-09-05 13:10:13,028 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 17 states. [2019-09-05 13:10:13,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:10:13,341 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2019-09-05 13:10:13,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-05 13:10:13,342 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2019-09-05 13:10:13,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:10:13,343 INFO L225 Difference]: With dead ends: 50 [2019-09-05 13:10:13,343 INFO L226 Difference]: Without dead ends: 50 [2019-09-05 13:10:13,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=301, Invalid=690, Unknown=1, NotChecked=0, Total=992 [2019-09-05 13:10:13,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-05 13:10:13,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-09-05 13:10:13,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-05 13:10:13,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2019-09-05 13:10:13,347 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 46 [2019-09-05 13:10:13,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:10:13,348 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2019-09-05 13:10:13,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-05 13:10:13,348 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2019-09-05 13:10:13,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-05 13:10:13,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:10:13,349 INFO L399 BasicCegarLoop]: trace histogram [19, 14, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:10:13,349 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:10:13,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:10:13,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1921368907, now seen corresponding path program 13 times [2019-09-05 13:10:13,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:10:13,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:10:13,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:10:13,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:10:13,351 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:10:13,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:10:13,626 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 135 proven. 210 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-05 13:10:13,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:10:13,627 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:10:13,627 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:10:13,627 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:10:13,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:10:13,627 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:10:13,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:10:13,641 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:10:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:10:13,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-05 13:10:13,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:10:13,720 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 135 proven. 210 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-05 13:10:13,721 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:10:15,084 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 135 proven. 210 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-05 13:10:15,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:10:15,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 34 [2019-09-05 13:10:15,087 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:10:15,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-05 13:10:15,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-05 13:10:15,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=785, Unknown=0, NotChecked=0, Total=1122 [2019-09-05 13:10:15,088 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 18 states. [2019-09-05 13:10:15,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:10:15,504 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2019-09-05 13:10:15,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-05 13:10:15,508 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2019-09-05 13:10:15,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:10:15,509 INFO L225 Difference]: With dead ends: 52 [2019-09-05 13:10:15,509 INFO L226 Difference]: Without dead ends: 52 [2019-09-05 13:10:15,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=337, Invalid=785, Unknown=0, NotChecked=0, Total=1122 [2019-09-05 13:10:15,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-05 13:10:15,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-09-05 13:10:15,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-05 13:10:15,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-09-05 13:10:15,521 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 48 [2019-09-05 13:10:15,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:10:15,522 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-09-05 13:10:15,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-05 13:10:15,522 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-09-05 13:10:15,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-05 13:10:15,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:10:15,525 INFO L399 BasicCegarLoop]: trace histogram [20, 15, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:10:15,526 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:10:15,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:10:15,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1740890958, now seen corresponding path program 14 times [2019-09-05 13:10:15,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:10:15,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:10:15,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:10:15,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:10:15,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:10:15,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:10:15,835 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 144 proven. 240 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-05 13:10:15,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:10:15,836 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:10:15,836 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:10:15,836 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:10:15,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:10:15,837 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:10:15,859 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:10:15,859 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:10:15,919 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-05 13:10:15,919 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:10:15,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-05 13:10:15,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:10:16,570 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 165 proven. 25 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-05 13:10:16,570 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:10:19,237 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 165 proven. 25 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-05 13:10:19,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:10:19,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8, 12] total 34 [2019-09-05 13:10:19,241 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:10:19,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-05 13:10:19,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-05 13:10:19,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=830, Unknown=1, NotChecked=0, Total=1122 [2019-09-05 13:10:19,242 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 24 states. [2019-09-05 13:10:20,524 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-05 13:10:28,583 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967289) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967291) 4294967296) 10000000) (<= 10000000 (mod (+ c_main_~x~0 4294967294) 4294967296)) (< (mod (+ c_main_~x~0 4294967293) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967287) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967285) 4294967296) 10000000)) is different from false [2019-09-05 13:10:33,677 WARN L188 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-05 13:10:40,764 WARN L188 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-05 13:10:55,476 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2019-09-05 13:11:02,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:11:02,439 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-09-05 13:11:02,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-05 13:11:02,439 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2019-09-05 13:11:02,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:11:02,440 INFO L225 Difference]: With dead ends: 65 [2019-09-05 13:11:02,440 INFO L226 Difference]: Without dead ends: 65 [2019-09-05 13:11:02,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 88 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 31.4s TimeCoverageRelationStatistics Valid=487, Invalid=1401, Unknown=8, NotChecked=84, Total=1980 [2019-09-05 13:11:02,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-05 13:11:02,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2019-09-05 13:11:02,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-05 13:11:02,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-09-05 13:11:02,445 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 50 [2019-09-05 13:11:02,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:11:02,446 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-09-05 13:11:02,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-05 13:11:02,446 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-09-05 13:11:02,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-05 13:11:02,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:11:02,447 INFO L399 BasicCegarLoop]: trace histogram [22, 16, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:11:02,447 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:11:02,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:11:02,447 INFO L82 PathProgramCache]: Analyzing trace with hash -741259606, now seen corresponding path program 15 times [2019-09-05 13:11:02,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:11:02,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:11:02,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:11:02,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:11:02,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:11:02,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:11:02,710 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 187 proven. 272 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-05 13:11:02,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:11:02,710 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:11:02,710 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:11:02,710 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:11:02,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:11:02,710 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:11:02,722 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:11:02,722 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:11:02,750 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:11:02,750 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:11:02,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-05 13:11:02,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:11:02,820 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 187 proven. 272 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-05 13:11:02,820 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:11:04,172 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 187 proven. 272 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-05 13:11:04,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:11:04,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 20] total 38 [2019-09-05 13:11:04,176 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:11:04,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-05 13:11:04,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-05 13:11:04,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=415, Invalid=991, Unknown=0, NotChecked=0, Total=1406 [2019-09-05 13:11:04,178 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 20 states. [2019-09-05 13:11:04,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:11:04,699 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2019-09-05 13:11:04,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-05 13:11:04,703 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 54 [2019-09-05 13:11:04,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:11:04,704 INFO L225 Difference]: With dead ends: 58 [2019-09-05 13:11:04,704 INFO L226 Difference]: Without dead ends: 58 [2019-09-05 13:11:04,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 88 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=415, Invalid=991, Unknown=0, NotChecked=0, Total=1406 [2019-09-05 13:11:04,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-05 13:11:04,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-09-05 13:11:04,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-05 13:11:04,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-09-05 13:11:04,708 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 54 [2019-09-05 13:11:04,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:11:04,709 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-09-05 13:11:04,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-05 13:11:04,709 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-09-05 13:11:04,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-05 13:11:04,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:11:04,710 INFO L399 BasicCegarLoop]: trace histogram [23, 17, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:11:04,710 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:11:04,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:11:04,710 INFO L82 PathProgramCache]: Analyzing trace with hash -554142489, now seen corresponding path program 16 times [2019-09-05 13:11:04,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:11:04,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:11:04,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:11:04,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:11:04,711 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:11:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:11:05,005 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 198 proven. 306 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-05 13:11:05,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:11:05,006 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:11:05,006 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:11:05,006 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:11:05,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:11:05,006 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:11:05,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:11:05,023 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:11:05,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:11:05,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-05 13:11:05,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:11:05,093 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 198 proven. 306 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-05 13:11:05,094 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:11:08,215 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 198 proven. 306 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-05 13:11:08,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:11:08,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 21] total 40 [2019-09-05 13:11:08,219 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:11:08,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-05 13:11:08,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-05 13:11:08,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=1103, Unknown=0, NotChecked=0, Total=1560 [2019-09-05 13:11:08,220 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 21 states. [2019-09-05 13:11:08,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:11:08,793 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-09-05 13:11:08,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-05 13:11:08,794 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 56 [2019-09-05 13:11:08,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:11:08,794 INFO L225 Difference]: With dead ends: 60 [2019-09-05 13:11:08,795 INFO L226 Difference]: Without dead ends: 60 [2019-09-05 13:11:08,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 91 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=457, Invalid=1103, Unknown=0, NotChecked=0, Total=1560 [2019-09-05 13:11:08,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-05 13:11:08,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-09-05 13:11:08,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-05 13:11:08,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-09-05 13:11:08,800 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 56 [2019-09-05 13:11:08,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:11:08,800 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-09-05 13:11:08,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-05 13:11:08,800 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-09-05 13:11:08,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-05 13:11:08,801 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:11:08,801 INFO L399 BasicCegarLoop]: trace histogram [24, 18, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:11:08,801 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:11:08,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:11:08,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1123219484, now seen corresponding path program 17 times [2019-09-05 13:11:08,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:11:08,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:11:08,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:11:08,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:11:08,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:11:08,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:11:09,132 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 209 proven. 342 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-05 13:11:09,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:11:09,133 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:11:09,133 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:11:09,133 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:11:09,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:11:09,133 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:11:09,143 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:11:09,143 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:11:09,199 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-05 13:11:09,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:11:09,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-05 13:11:09,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:11:11,548 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 234 proven. 35 refuted. 1 times theorem prover too weak. 306 trivial. 0 not checked. [2019-09-05 13:11:11,549 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:11:12,513 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 234 proven. 36 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2019-09-05 13:11:12,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:11:12,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 9, 13] total 39 [2019-09-05 13:11:12,517 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:11:12,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-05 13:11:12,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-05 13:11:12,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=1100, Unknown=1, NotChecked=0, Total=1482 [2019-09-05 13:11:12,519 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 28 states. [2019-09-05 13:11:24,417 WARN L188 SmtUtils]: Spent 6.58 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-05 13:11:38,062 WARN L188 SmtUtils]: Spent 2.90 s on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-05 13:11:46,567 WARN L188 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-05 13:12:05,794 WARN L188 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-05 13:12:15,991 WARN L188 SmtUtils]: Spent 4.19 s on a formula simplification that was a NOOP. DAG size: 16 [2019-09-05 13:12:28,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:12:28,819 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2019-09-05 13:12:28,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-05 13:12:28,820 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 58 [2019-09-05 13:12:28,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:12:28,820 INFO L225 Difference]: With dead ends: 66 [2019-09-05 13:12:28,820 INFO L226 Difference]: Without dead ends: 66 [2019-09-05 13:12:28,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 102 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 65.0s TimeCoverageRelationStatistics Valid=506, Invalid=1557, Unknown=7, NotChecked=0, Total=2070 [2019-09-05 13:12:28,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-05 13:12:28,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-09-05 13:12:28,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-05 13:12:28,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2019-09-05 13:12:28,826 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 58 [2019-09-05 13:12:28,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:12:28,826 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2019-09-05 13:12:28,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-05 13:12:28,826 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2019-09-05 13:12:28,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-05 13:12:28,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:12:28,827 INFO L399 BasicCegarLoop]: trace histogram [26, 19, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:12:28,827 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:12:28,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:12:28,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1126866852, now seen corresponding path program 18 times [2019-09-05 13:12:28,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:12:28,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:12:28,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:12:28,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:12:28,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:12:28,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:12:29,181 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 260 proven. 380 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-05 13:12:29,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:12:29,181 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:12:29,182 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:12:29,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:12:29,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:12:29,182 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:12:29,194 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:12:29,194 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:12:29,215 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:12:29,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:12:29,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-05 13:12:29,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:12:29,309 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 260 proven. 380 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-05 13:12:29,310 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:12:31,968 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 260 proven. 380 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (21)] Exception during sending of exit command (exit): Stream closed [2019-09-05 13:12:31,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:12:31,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 23] total 44 [2019-09-05 13:12:31,978 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:12:31,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-05 13:12:31,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-05 13:12:31,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=547, Invalid=1345, Unknown=0, NotChecked=0, Total=1892 [2019-09-05 13:12:31,979 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 23 states. [2019-09-05 13:12:32,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:12:32,684 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2019-09-05 13:12:32,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-05 13:12:32,687 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 62 [2019-09-05 13:12:32,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:12:32,688 INFO L225 Difference]: With dead ends: 66 [2019-09-05 13:12:32,688 INFO L226 Difference]: Without dead ends: 66 [2019-09-05 13:12:32,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 101 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=547, Invalid=1345, Unknown=0, NotChecked=0, Total=1892 [2019-09-05 13:12:32,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-05 13:12:32,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-09-05 13:12:32,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-05 13:12:32,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-09-05 13:12:32,697 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 62 [2019-09-05 13:12:32,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:12:32,698 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-09-05 13:12:32,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-05 13:12:32,702 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-09-05 13:12:32,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-05 13:12:32,703 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:12:32,704 INFO L399 BasicCegarLoop]: trace histogram [27, 20, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:12:32,704 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:12:32,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:12:32,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1362952601, now seen corresponding path program 19 times [2019-09-05 13:12:32,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:12:32,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:12:32,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:12:32,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:12:32,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:12:32,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:12:33,162 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 273 proven. 420 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-05 13:12:33,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:12:33,163 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:12:33,163 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:12:33,163 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:12:33,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:12:33,163 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:12:33,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:12:33,177 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:12:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:12:33,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-05 13:12:33,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:12:33,275 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 273 proven. 420 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-05 13:12:33,275 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:12:39,725 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 273 proven. 418 refuted. 2 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-05 13:12:39,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:12:39,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 24] total 46 [2019-09-05 13:12:39,729 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:12:39,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-05 13:12:39,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-05 13:12:39,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=1474, Unknown=1, NotChecked=0, Total=2070 [2019-09-05 13:12:39,730 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 24 states. [2019-09-05 13:12:40,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:12:40,421 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2019-09-05 13:12:40,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-05 13:12:40,421 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 64 [2019-09-05 13:12:40,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:12:40,422 INFO L225 Difference]: With dead ends: 68 [2019-09-05 13:12:40,423 INFO L226 Difference]: Without dead ends: 68 [2019-09-05 13:12:40,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 104 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=595, Invalid=1474, Unknown=1, NotChecked=0, Total=2070 [2019-09-05 13:12:40,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-05 13:12:40,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-09-05 13:12:40,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-05 13:12:40,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2019-09-05 13:12:40,427 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 64 [2019-09-05 13:12:40,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:12:40,428 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2019-09-05 13:12:40,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-05 13:12:40,428 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2019-09-05 13:12:40,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-05 13:12:40,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:12:40,429 INFO L399 BasicCegarLoop]: trace histogram [28, 21, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:12:40,429 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:12:40,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:12:40,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1782663062, now seen corresponding path program 20 times [2019-09-05 13:12:40,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:12:40,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:12:40,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:12:40,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:12:40,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:12:40,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:12:40,849 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 286 proven. 462 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-05 13:12:40,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:12:40,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:12:40,849 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:12:40,850 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:12:40,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:12:40,850 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:12:40,859 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:12:40,860 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:12:40,928 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-05 13:12:40,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:12:40,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-05 13:12:40,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:12:41,413 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 315 proven. 49 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-05 13:12:41,413 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:12:42,216 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 315 proven. 49 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-05 13:12:42,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:12:42,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 10, 14] total 44 [2019-09-05 13:12:42,220 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:12:42,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-05 13:12:42,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-05 13:12:42,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1409, Unknown=0, NotChecked=0, Total=1892 [2019-09-05 13:12:42,222 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 32 states. [2019-09-05 13:12:50,153 WARN L188 SmtUtils]: Spent 6.41 s on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-05 13:13:06,319 WARN L188 SmtUtils]: Spent 4.73 s on a formula simplification. DAG size of input: 36 DAG size of output: 12 [2019-09-05 13:13:16,647 WARN L188 SmtUtils]: Spent 2.45 s on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-05 13:13:18,965 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967289) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967283) 4294967296) 10000000) (<= 10000000 (mod (+ c_main_~x~0 4294967294) 4294967296)) (< (mod (+ c_main_~x~0 4294967281) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967287) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967285) 4294967296) 10000000)) is different from false [2019-09-05 13:13:28,395 WARN L188 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-05 13:13:43,563 WARN L188 SmtUtils]: Spent 5.48 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-05 13:13:50,412 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-05 13:14:20,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:14:20,249 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2019-09-05 13:14:20,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-05 13:14:20,250 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 66 [2019-09-05 13:14:20,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:14:20,250 INFO L225 Difference]: With dead ends: 74 [2019-09-05 13:14:20,250 INFO L226 Difference]: Without dead ends: 74 [2019-09-05 13:14:20,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 116 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 85.7s TimeCoverageRelationStatistics Valid=652, Invalid=1998, Unknown=6, NotChecked=100, Total=2756 [2019-09-05 13:14:20,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-05 13:14:20,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2019-09-05 13:14:20,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-05 13:14:20,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2019-09-05 13:14:20,254 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 66 [2019-09-05 13:14:20,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:14:20,254 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2019-09-05 13:14:20,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-05 13:14:20,254 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2019-09-05 13:14:20,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-05 13:14:20,255 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:14:20,255 INFO L399 BasicCegarLoop]: trace histogram [30, 22, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:14:20,255 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:14:20,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:14:20,256 INFO L82 PathProgramCache]: Analyzing trace with hash -204034418, now seen corresponding path program 21 times [2019-09-05 13:14:20,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:14:20,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:20,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:14:20,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:20,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:14:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:20,729 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 345 proven. 506 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-05 13:14:20,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:20,729 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:14:20,730 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:14:20,730 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:14:20,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:20,730 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:14:20,741 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:14:20,742 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:14:20,767 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:14:20,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:14:20,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-05 13:14:20,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:14:20,843 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 345 proven. 506 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-05 13:14:20,844 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:14:26,126 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 345 proven. 504 refuted. 2 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-05 13:14:26,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:14:26,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 26] total 50 [2019-09-05 13:14:26,130 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:14:26,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-05 13:14:26,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-05 13:14:26,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=697, Invalid=1752, Unknown=1, NotChecked=0, Total=2450 [2019-09-05 13:14:26,131 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 26 states. [2019-09-05 13:14:27,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:14:27,039 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2019-09-05 13:14:27,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-05 13:14:27,040 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 70 [2019-09-05 13:14:27,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:14:27,041 INFO L225 Difference]: With dead ends: 74 [2019-09-05 13:14:27,041 INFO L226 Difference]: Without dead ends: 74 [2019-09-05 13:14:27,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 114 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=697, Invalid=1752, Unknown=1, NotChecked=0, Total=2450 [2019-09-05 13:14:27,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-05 13:14:27,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-09-05 13:14:27,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-09-05 13:14:27,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2019-09-05 13:14:27,045 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 70 [2019-09-05 13:14:27,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:14:27,045 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2019-09-05 13:14:27,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-05 13:14:27,046 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2019-09-05 13:14:27,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-05 13:14:27,046 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:14:27,046 INFO L399 BasicCegarLoop]: trace histogram [31, 23, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:14:27,046 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:14:27,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:14:27,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1889811765, now seen corresponding path program 22 times [2019-09-05 13:14:27,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:14:27,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:27,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:14:27,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:27,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:14:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:27,702 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 360 proven. 552 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-05 13:14:27,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:27,703 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:14:27,703 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:14:27,703 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:14:27,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:27,704 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:14:27,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:14:27,735 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:14:27,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:27,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-05 13:14:27,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:14:27,879 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 360 proven. 552 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-05 13:14:27,880 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:14:34,029 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 360 proven. 550 refuted. 2 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-05 13:14:34,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:14:34,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 27] total 52 [2019-09-05 13:14:34,032 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:14:34,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-05 13:14:34,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-05 13:14:34,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=751, Invalid=1900, Unknown=1, NotChecked=0, Total=2652 [2019-09-05 13:14:34,034 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand 27 states. [2019-09-05 13:14:35,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:14:35,034 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2019-09-05 13:14:35,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-05 13:14:35,035 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 72 [2019-09-05 13:14:35,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:14:35,036 INFO L225 Difference]: With dead ends: 76 [2019-09-05 13:14:35,036 INFO L226 Difference]: Without dead ends: 76 [2019-09-05 13:14:35,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 117 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=751, Invalid=1900, Unknown=1, NotChecked=0, Total=2652 [2019-09-05 13:14:35,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-05 13:14:35,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-09-05 13:14:35,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-05 13:14:35,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2019-09-05 13:14:35,040 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 72 [2019-09-05 13:14:35,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:14:35,040 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2019-09-05 13:14:35,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-05 13:14:35,041 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2019-09-05 13:14:35,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-05 13:14:35,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:14:35,042 INFO L399 BasicCegarLoop]: trace histogram [32, 24, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:14:35,042 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:14:35,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:14:35,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1575795656, now seen corresponding path program 23 times [2019-09-05 13:14:35,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:14:35,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:35,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:14:35,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:35,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:14:35,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:35,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 375 proven. 600 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-05 13:14:35,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:35,676 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:14:35,676 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:14:35,676 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:14:35,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:35,677 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:14:35,698 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:14:35,699 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:14:35,839 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-05 13:14:35,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:14:35,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-05 13:14:35,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:14:37,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 408 proven. 64 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2019-09-05 13:14:37,654 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:14:40,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 408 proven. 64 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2019-09-05 13:14:40,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:14:40,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 11, 15] total 49 [2019-09-05 13:14:40,720 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:14:40,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-05 13:14:40,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-05 13:14:40,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=597, Invalid=1754, Unknown=1, NotChecked=0, Total=2352 [2019-09-05 13:14:40,722 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 36 states. [2019-09-05 13:15:04,796 WARN L188 SmtUtils]: Spent 14.60 s on a formula simplification. DAG size of input: 36 DAG size of output: 12 [2019-09-05 13:15:14,547 WARN L188 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-05 13:15:38,046 WARN L188 SmtUtils]: Spent 9.20 s on a formula simplification. DAG size of input: 40 DAG size of output: 12 [2019-09-05 13:15:51,937 WARN L188 SmtUtils]: Spent 3.00 s on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-05 13:16:05,601 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-05 13:16:31,687 WARN L188 SmtUtils]: Spent 7.54 s on a formula simplification. DAG size of input: 36 DAG size of output: 12 [2019-09-05 13:16:37,090 WARN L188 SmtUtils]: Spent 2.62 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-05 13:16:54,345 WARN L188 SmtUtils]: Spent 2.49 s on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-05 13:17:07,804 WARN L188 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-05 13:17:24,800 WARN L188 SmtUtils]: Spent 1.90 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-05 13:17:39,006 WARN L188 SmtUtils]: Spent 4.40 s on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2019-09-05 13:17:55,966 WARN L188 SmtUtils]: Spent 2.62 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-05 13:18:20,999 WARN L188 SmtUtils]: Spent 767.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2019-09-05 13:18:21,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:18:21,272 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2019-09-05 13:18:21,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-05 13:18:21,272 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 74 [2019-09-05 13:18:21,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:18:21,273 INFO L225 Difference]: With dead ends: 84 [2019-09-05 13:18:21,273 INFO L226 Difference]: Without dead ends: 84 [2019-09-05 13:18:21,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 125 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 215.6s TimeCoverageRelationStatistics Valid=1053, Invalid=3216, Unknown=21, NotChecked=0, Total=4290 [2019-09-05 13:18:21,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-09-05 13:18:21,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 79. [2019-09-05 13:18:21,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-05 13:18:21,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2019-09-05 13:18:21,276 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 74 [2019-09-05 13:18:21,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:18:21,277 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2019-09-05 13:18:21,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-05 13:18:21,277 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2019-09-05 13:18:21,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-05 13:18:21,278 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:18:21,278 INFO L399 BasicCegarLoop]: trace histogram [34, 25, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:18:21,278 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:18:21,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:18:21,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1804529344, now seen corresponding path program 24 times [2019-09-05 13:18:21,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:18:21,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:21,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:18:21,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:21,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:18:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:18:21,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 442 proven. 650 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-05 13:18:21,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:18:21,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:18:21,954 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:18:21,955 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:18:21,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:18:21,955 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:18:21,977 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:18:21,977 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:18:22,004 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:18:22,004 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:18:22,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-05 13:18:22,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:18:22,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 442 proven. 650 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-05 13:18:22,098 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:18:27,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 442 proven. 650 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-05 13:18:27,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:18:27,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 29] total 56 [2019-09-05 13:18:27,096 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:18:27,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-05 13:18:27,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-05 13:18:27,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=865, Invalid=2215, Unknown=0, NotChecked=0, Total=3080 [2019-09-05 13:18:27,098 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand 29 states. [2019-09-05 13:18:28,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:18:28,239 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2019-09-05 13:18:28,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-05 13:18:28,239 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 78 [2019-09-05 13:18:28,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:18:28,241 INFO L225 Difference]: With dead ends: 81 [2019-09-05 13:18:28,241 INFO L226 Difference]: Without dead ends: 81 [2019-09-05 13:18:28,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 127 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=865, Invalid=2215, Unknown=0, NotChecked=0, Total=3080 [2019-09-05 13:18:28,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-09-05 13:18:28,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-09-05 13:18:28,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-05 13:18:28,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2019-09-05 13:18:28,246 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 78 [2019-09-05 13:18:28,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:18:28,246 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2019-09-05 13:18:28,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-05 13:18:28,247 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2019-09-05 13:18:28,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-05 13:18:28,247 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:18:28,247 INFO L399 BasicCegarLoop]: trace histogram [35, 26, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:18:28,248 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:18:28,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:18:28,248 INFO L82 PathProgramCache]: Analyzing trace with hash -2014275459, now seen corresponding path program 25 times [2019-09-05 13:18:28,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:18:28,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:28,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:18:28,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:28,249 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:18:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:18:28,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 459 proven. 702 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-05 13:18:28,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:18:28,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:18:28,797 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:18:28,797 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:18:28,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:18:28,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 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-05 13:18:28,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:18:28,812 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:18:28,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:18:28,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-05 13:18:28,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:18:28,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 459 proven. 702 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-05 13:18:28,909 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:18:34,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 459 proven. 702 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-05 13:18:34,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:18:34,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 30] total 58 [2019-09-05 13:18:34,501 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:18:34,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-05 13:18:34,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-05 13:18:34,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=925, Invalid=2381, Unknown=0, NotChecked=0, Total=3306 [2019-09-05 13:18:34,503 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand 30 states. [2019-09-05 13:18:35,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:18:35,742 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2019-09-05 13:18:35,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-05 13:18:35,742 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 80 [2019-09-05 13:18:35,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:18:35,744 INFO L225 Difference]: With dead ends: 83 [2019-09-05 13:18:35,744 INFO L226 Difference]: Without dead ends: 83 [2019-09-05 13:18:35,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 130 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=925, Invalid=2381, Unknown=0, NotChecked=0, Total=3306 [2019-09-05 13:18:35,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-09-05 13:18:35,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-09-05 13:18:35,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-05 13:18:35,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2019-09-05 13:18:35,748 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 80 [2019-09-05 13:18:35,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:18:35,748 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2019-09-05 13:18:35,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-05 13:18:35,748 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2019-09-05 13:18:35,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-05 13:18:35,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:18:35,749 INFO L399 BasicCegarLoop]: trace histogram [36, 27, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:18:35,749 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:18:35,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:18:35,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1716829062, now seen corresponding path program 26 times [2019-09-05 13:18:35,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:18:35,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:35,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:18:35,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:35,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:18:35,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:18:36,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 476 proven. 756 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-05 13:18:36,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:18:36,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:18:36,370 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:18:36,371 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:18:36,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:18:36,371 INFO 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-05 13:18:36,381 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:18:36,381 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:18:36,506 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-09-05 13:18:36,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:18:36,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-05 13:18:36,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:18:36,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 513 proven. 81 refuted. 0 times theorem prover too weak. 702 trivial. 0 not checked. [2019-09-05 13:18:36,891 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:18:37,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 513 proven. 81 refuted. 0 times theorem prover too weak. 702 trivial. 0 not checked. [2019-09-05 13:18:37,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:18:37,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 12, 15] total 53 [2019-09-05 13:18:37,655 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:18:37,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-05 13:18:37,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-05 13:18:37,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=681, Invalid=2075, Unknown=0, NotChecked=0, Total=2756 [2019-09-05 13:18:37,656 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand 40 states. [2019-09-05 13:19:00,945 WARN L188 SmtUtils]: Spent 4.90 s on a formula simplification. DAG size of input: 44 DAG size of output: 12 [2019-09-05 13:19:18,170 WARN L188 SmtUtils]: Spent 8.95 s on a formula simplification. DAG size of input: 40 DAG size of output: 12 [2019-09-05 13:19:33,422 WARN L188 SmtUtils]: Spent 6.59 s on a formula simplification. DAG size of input: 36 DAG size of output: 12 [2019-09-05 13:19:56,294 WARN L188 SmtUtils]: Spent 9.22 s on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-05 13:20:05,805 WARN L188 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-05 13:20:48,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:20:48,306 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2019-09-05 13:20:48,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-05 13:20:48,306 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 82 [2019-09-05 13:20:48,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:20:48,307 INFO L225 Difference]: With dead ends: 90 [2019-09-05 13:20:48,307 INFO L226 Difference]: Without dead ends: 90 [2019-09-05 13:20:48,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 149 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 120.8s TimeCoverageRelationStatistics Valid=979, Invalid=2909, Unknown=18, NotChecked=0, Total=3906 [2019-09-05 13:20:48,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-05 13:20:48,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2019-09-05 13:20:48,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-05 13:20:48,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2019-09-05 13:20:48,310 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 82 [2019-09-05 13:20:48,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:20:48,311 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2019-09-05 13:20:48,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-05 13:20:48,311 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2019-09-05 13:20:48,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-05 13:20:48,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:20:48,312 INFO L399 BasicCegarLoop]: trace histogram [38, 28, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:20:48,312 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:20:48,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:20:48,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1002989682, now seen corresponding path program 27 times [2019-09-05 13:20:48,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:20:48,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:20:48,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:20:48,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:20:48,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:20:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:20:48,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 551 proven. 812 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-05 13:20:48,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:20:48,923 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:20:48,923 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:20:48,924 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:20:48,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:20:48,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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:20:48,933 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:20:48,933 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:20:48,962 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:20:48,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:20:48,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-05 13:20:48,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:20:49,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 551 proven. 812 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-05 13:20:49,049 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:20:58,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 551 proven. 806 refuted. 6 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-05 13:20:58,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:20:58,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 32] total 62 [2019-09-05 13:20:58,323 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:20:58,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-05 13:20:58,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-05 13:20:58,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1051, Invalid=2728, Unknown=3, NotChecked=0, Total=3782 [2019-09-05 13:20:58,325 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand 32 states. [2019-09-05 13:20:59,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:20:59,756 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2019-09-05 13:20:59,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-05 13:20:59,757 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 86 [2019-09-05 13:20:59,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:20:59,758 INFO L225 Difference]: With dead ends: 89 [2019-09-05 13:20:59,758 INFO L226 Difference]: Without dead ends: 89 [2019-09-05 13:20:59,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 140 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=1051, Invalid=2728, Unknown=3, NotChecked=0, Total=3782 [2019-09-05 13:20:59,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-09-05 13:20:59,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-09-05 13:20:59,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-09-05 13:20:59,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2019-09-05 13:20:59,762 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 86 [2019-09-05 13:20:59,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:20:59,762 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2019-09-05 13:20:59,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-05 13:20:59,762 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2019-09-05 13:20:59,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-05 13:20:59,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:20:59,763 INFO L399 BasicCegarLoop]: trace histogram [39, 29, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:20:59,763 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:20:59,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:20:59,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1424006481, now seen corresponding path program 28 times [2019-09-05 13:20:59,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:20:59,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:20:59,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:20:59,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:20:59,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:20:59,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:21:00,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 570 proven. 870 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-05 13:21:00,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:21:00,563 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:21:00,563 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:21:00,563 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:21:00,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:21:00,564 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:21:00,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:21:00,574 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:21:00,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:21:00,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-05 13:21:00,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:21:00,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 570 proven. 870 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-05 13:21:00,683 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:21:06,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 570 proven. 868 refuted. 2 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-05 13:21:06,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:21:06,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 33] total 64 [2019-09-05 13:21:06,925 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:21:06,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-05 13:21:06,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-05 13:21:06,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1117, Invalid=2914, Unknown=1, NotChecked=0, Total=4032 [2019-09-05 13:21:06,926 INFO L87 Difference]: Start difference. First operand 89 states and 92 transitions. Second operand 33 states. [2019-09-05 13:21:08,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:21:08,443 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2019-09-05 13:21:08,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-05 13:21:08,444 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 88 [2019-09-05 13:21:08,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:21:08,445 INFO L225 Difference]: With dead ends: 91 [2019-09-05 13:21:08,445 INFO L226 Difference]: Without dead ends: 91 [2019-09-05 13:21:08,446 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 143 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=1117, Invalid=2914, Unknown=1, NotChecked=0, Total=4032 [2019-09-05 13:21:08,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-05 13:21:08,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-09-05 13:21:08,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-05 13:21:08,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 94 transitions. [2019-09-05 13:21:08,449 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 94 transitions. Word has length 88 [2019-09-05 13:21:08,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:21:08,450 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 94 transitions. [2019-09-05 13:21:08,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-05 13:21:08,450 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 94 transitions. [2019-09-05 13:21:08,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-05 13:21:08,450 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:21:08,451 INFO L399 BasicCegarLoop]: trace histogram [40, 30, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:21:08,451 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:21:08,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:21:08,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1600077396, now seen corresponding path program 29 times [2019-09-05 13:21:08,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:21:08,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:21:08,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:21:08,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:21:08,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:21:08,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:21:09,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 589 proven. 930 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-05 13:21:09,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:21:09,134 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:21:09,134 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:21:09,134 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:21:09,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:21:09,134 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:21:09,145 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:21:09,145 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:21:09,451 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-09-05 13:21:09,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:21:09,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-05 13:21:09,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:21:12,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 630 proven. 99 refuted. 1 times theorem prover too weak. 870 trivial. 0 not checked. [2019-09-05 13:21:12,334 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:21:16,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 630 proven. 98 refuted. 2 times theorem prover too weak. 870 trivial. 0 not checked. [2019-09-05 13:21:16,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:21:16,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 13, 17] total 59 [2019-09-05 13:21:16,900 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:21:16,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-05 13:21:16,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-05 13:21:16,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=2559, Unknown=2, NotChecked=0, Total=3422 [2019-09-05 13:21:16,902 INFO L87 Difference]: Start difference. First operand 91 states and 94 transitions. Second operand 44 states. [2019-09-05 13:21:28,922 WARN L188 SmtUtils]: Spent 4.99 s on a formula simplification. DAG size of input: 44 DAG size of output: 12 [2019-09-05 13:21:35,311 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967283) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967291) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967279) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967277) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967295) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967281) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967287) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967285) 4294967296) 10000000)) is different from false [2019-09-05 13:22:05,629 WARN L188 SmtUtils]: Spent 5.84 s on a formula simplification. DAG size of input: 48 DAG size of output: 12 [2019-09-05 13:22:51,836 WARN L188 SmtUtils]: Spent 5.78 s on a formula simplification. DAG size of input: 44 DAG size of output: 12 [2019-09-05 13:23:29,607 WARN L188 SmtUtils]: Spent 9.75 s on a formula simplification. DAG size of input: 40 DAG size of output: 12 [2019-09-05 13:23:31,667 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967283) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967279) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967277) 4294967296) 10000000) (<= 10000000 (mod (+ c_main_~x~0 4294967294) 4294967296)) (< (mod (+ c_main_~x~0 4294967281) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967287) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967285) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967275) 4294967296) 10000000)) is different from false [2019-09-05 13:23:43,787 WARN L188 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-05 13:23:46,183 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967283) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967279) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967277) 4294967296) 10000000) (<= 10000000 (mod (+ c_main_~x~0 4294967294) 4294967296)) (< (mod (+ c_main_~x~0 4294967281) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967285) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967275) 4294967296) 10000000)) is different from false