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/nested3-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 21:04:46,805 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 21:04:46,808 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 21:04:46,822 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 21:04:46,822 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 21:04:46,823 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 21:04:46,824 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 21:04:46,826 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 21:04:46,828 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 21:04:46,829 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 21:04:46,830 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 21:04:46,831 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 21:04:46,831 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 21:04:46,832 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 21:04:46,833 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 21:04:46,834 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 21:04:46,835 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 21:04:46,836 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 21:04:46,838 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 21:04:46,840 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 21:04:46,841 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 21:04:46,842 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 21:04:46,844 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 21:04:46,844 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 21:04:46,847 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 21:04:46,847 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 21:04:46,848 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 21:04:46,849 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 21:04:46,849 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 21:04:46,850 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 21:04:46,851 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 21:04:46,851 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 21:04:46,852 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 21:04:46,853 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 21:04:46,854 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 21:04:46,854 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 21:04:46,855 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 21:04:46,855 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 21:04:46,856 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 21:04:46,856 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 21:04:46,857 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 21:04:46,858 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-03 21:04:46,885 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 21:04:46,885 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 21:04:46,885 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 21:04:46,886 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 21:04:46,887 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 21:04:46,887 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 21:04:46,887 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 21:04:46,888 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 21:04:46,888 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 21:04:46,888 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 21:04:46,889 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 21:04:46,889 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 21:04:46,890 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 21:04:46,890 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 21:04:46,891 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 21:04:46,891 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 21:04:46,891 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 21:04:46,891 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 21:04:46,891 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 21:04:46,892 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 21:04:46,892 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 21:04:46,892 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 21:04:46,893 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 21:04:46,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 21:04:46,893 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 21:04:46,893 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 21:04:46,893 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 21:04:46,894 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 21:04:46,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 21:04:46,894 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 21:04:46,922 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 21:04:46,934 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 21:04:46,938 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 21:04:46,939 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 21:04:46,939 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 21:04:46,940 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/nested3-2.c [2019-09-03 21:04:47,014 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7a748af7/c0155830bd03488c957e6021c0b4efe3/FLAGc8c0b68a2 [2019-09-03 21:04:47,459 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 21:04:47,460 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested3-2.c [2019-09-03 21:04:47,466 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7a748af7/c0155830bd03488c957e6021c0b4efe3/FLAGc8c0b68a2 [2019-09-03 21:04:47,821 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7a748af7/c0155830bd03488c957e6021c0b4efe3 [2019-09-03 21:04:47,831 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 21:04:47,833 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 21:04:47,834 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 21:04:47,834 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 21:04:47,837 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 21:04:47,838 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 09:04:47" (1/1) ... [2019-09-03 21:04:47,841 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c466606 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:47, skipping insertion in model container [2019-09-03 21:04:47,841 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 09:04:47" (1/1) ... [2019-09-03 21:04:47,849 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 21:04:47,865 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 21:04:48,019 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 21:04:48,024 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 21:04:48,054 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 21:04:48,069 INFO L192 MainTranslator]: Completed translation [2019-09-03 21:04:48,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:48 WrapperNode [2019-09-03 21:04:48,069 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 21:04:48,070 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 21:04:48,070 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 21:04:48,071 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 21:04:48,171 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:48" (1/1) ... [2019-09-03 21:04:48,172 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:48" (1/1) ... [2019-09-03 21:04:48,176 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:48" (1/1) ... [2019-09-03 21:04:48,177 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:48" (1/1) ... [2019-09-03 21:04:48,180 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:48" (1/1) ... [2019-09-03 21:04:48,185 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:48" (1/1) ... [2019-09-03 21:04:48,186 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:48" (1/1) ... [2019-09-03 21:04:48,188 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 21:04:48,188 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 21:04:48,188 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 21:04:48,189 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 21:04:48,189 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 21:04:48,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 21:04:48,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 21:04:48,254 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 21:04:48,254 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 21:04:48,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 21:04:48,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 21:04:48,254 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 21:04:48,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 21:04:48,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 21:04:48,434 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 21:04:48,435 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-03 21:04:48,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 09:04:48 BoogieIcfgContainer [2019-09-03 21:04:48,436 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 21:04:48,437 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 21:04:48,437 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 21:04:48,440 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 21:04:48,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 09:04:47" (1/3) ... [2019-09-03 21:04:48,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74990eb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 09:04:48, skipping insertion in model container [2019-09-03 21:04:48,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:04:48" (2/3) ... [2019-09-03 21:04:48,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74990eb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 09:04:48, skipping insertion in model container [2019-09-03 21:04:48,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 09:04:48" (3/3) ... [2019-09-03 21:04:48,444 INFO L109 eAbstractionObserver]: Analyzing ICFG nested3-2.c [2019-09-03 21:04:48,456 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 21:04:48,473 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 21:04:48,517 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 21:04:48,554 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 21:04:48,554 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 21:04:48,554 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 21:04:48,555 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 21:04:48,555 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 21:04:48,555 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 21:04:48,555 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 21:04:48,555 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 21:04:48,571 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-09-03 21:04:48,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 21:04:48,581 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:48,582 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:48,585 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:48,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:48,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1303616190, now seen corresponding path program 1 times [2019-09-03 21:04:48,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:48,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:48,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:48,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:48,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:48,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:48,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 21:04:48,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 21:04:48,696 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 21:04:48,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 21:04:48,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 21:04:48,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 21:04:48,712 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2019-09-03 21:04:48,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:48,728 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-09-03 21:04:48,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 21:04:48,729 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-03 21:04:48,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:48,736 INFO L225 Difference]: With dead ends: 23 [2019-09-03 21:04:48,737 INFO L226 Difference]: Without dead ends: 19 [2019-09-03 21:04:48,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 21:04:48,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-03 21:04:48,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-03 21:04:48,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-03 21:04:48,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-09-03 21:04:48,774 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 10 [2019-09-03 21:04:48,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:48,775 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-09-03 21:04:48,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 21:04:48,776 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2019-09-03 21:04:48,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 21:04:48,777 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:48,778 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:48,778 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:48,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:48,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1274063518, now seen corresponding path program 1 times [2019-09-03 21:04:48,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:48,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:48,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:48,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:48,783 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:48,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:48,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:48,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 21:04:48,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 21:04:48,908 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 21:04:48,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 21:04:48,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 21:04:48,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 21:04:48,911 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 3 states. [2019-09-03 21:04:48,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:48,936 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2019-09-03 21:04:48,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 21:04:48,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-03 21:04:48,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:48,938 INFO L225 Difference]: With dead ends: 26 [2019-09-03 21:04:48,938 INFO L226 Difference]: Without dead ends: 26 [2019-09-03 21:04:48,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 21:04:48,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-03 21:04:48,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2019-09-03 21:04:48,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-03 21:04:48,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-09-03 21:04:48,946 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 10 [2019-09-03 21:04:48,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:48,946 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-09-03 21:04:48,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 21:04:48,946 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-09-03 21:04:48,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-03 21:04:48,947 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:48,947 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:48,947 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:48,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:48,948 INFO L82 PathProgramCache]: Analyzing trace with hash 856543284, now seen corresponding path program 1 times [2019-09-03 21:04:48,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:48,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:48,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:48,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:48,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:49,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:49,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 21:04:49,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 21:04:49,042 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 21:04:49,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 21:04:49,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 21:04:49,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 21:04:49,043 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 3 states. [2019-09-03 21:04:49,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:49,060 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2019-09-03 21:04:49,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 21:04:49,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-09-03 21:04:49,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:49,062 INFO L225 Difference]: With dead ends: 24 [2019-09-03 21:04:49,062 INFO L226 Difference]: Without dead ends: 24 [2019-09-03 21:04:49,063 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 21:04:49,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-03 21:04:49,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-09-03 21:04:49,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-03 21:04:49,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-09-03 21:04:49,068 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 11 [2019-09-03 21:04:49,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:49,069 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-09-03 21:04:49,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 21:04:49,069 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-09-03 21:04:49,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 21:04:49,070 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:49,070 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:49,070 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:49,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:49,071 INFO L82 PathProgramCache]: Analyzing trace with hash 808417067, now seen corresponding path program 1 times [2019-09-03 21:04:49,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:49,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:49,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:49,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:49,072 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:49,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:49,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:49,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 21:04:49,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 21:04:49,153 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 21:04:49,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 21:04:49,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 21:04:49,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 21:04:49,154 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 3 states. [2019-09-03 21:04:49,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:49,166 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-09-03 21:04:49,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 21:04:49,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-09-03 21:04:49,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:49,167 INFO L225 Difference]: With dead ends: 23 [2019-09-03 21:04:49,168 INFO L226 Difference]: Without dead ends: 23 [2019-09-03 21:04:49,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 21:04:49,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-03 21:04:49,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-09-03 21:04:49,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-03 21:04:49,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-09-03 21:04:49,173 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 12 [2019-09-03 21:04:49,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:49,174 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-09-03 21:04:49,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 21:04:49,174 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-09-03 21:04:49,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-03 21:04:49,175 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:49,175 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:49,175 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:49,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:49,176 INFO L82 PathProgramCache]: Analyzing trace with hash -681648618, now seen corresponding path program 1 times [2019-09-03 21:04:49,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:49,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:49,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:49,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:49,178 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:49,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:49,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:49,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:49,277 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2019-09-03 21:04:49,279 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [22], [29], [31], [47], [50], [52], [58], [59], [60], [62] [2019-09-03 21:04:49,314 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 21:04:49,315 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 21:04:49,371 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-03 21:04:49,904 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 21:04:49,908 INFO L272 AbstractInterpreter]: Visited 13 different actions 49 times. Merged at 2 different actions 12 times. Widened at 1 different actions 4 times. Performed 84 root evaluator evaluations with a maximum evaluation depth of 13. Performed 84 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 5 variables. [2019-09-03 21:04:49,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:49,913 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 21:04:49,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:49,915 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:49,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:49,935 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:04:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:49,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 21:04:49,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:50,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:50,005 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:50,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:50,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:50,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-09-03 21:04:50,051 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:50,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 21:04:50,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 21:04:50,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-03 21:04:50,052 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 5 states. [2019-09-03 21:04:50,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:50,089 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2019-09-03 21:04:50,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 21:04:50,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-09-03 21:04:50,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:50,093 INFO L225 Difference]: With dead ends: 24 [2019-09-03 21:04:50,093 INFO L226 Difference]: Without dead ends: 24 [2019-09-03 21:04:50,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-03 21:04:50,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-03 21:04:50,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-09-03 21:04:50,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-03 21:04:50,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-09-03 21:04:50,100 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2019-09-03 21:04:50,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:50,101 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-09-03 21:04:50,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 21:04:50,101 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-09-03 21:04:50,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 21:04:50,102 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:50,102 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:50,103 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:50,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:50,104 INFO L82 PathProgramCache]: Analyzing trace with hash 370955403, now seen corresponding path program 2 times [2019-09-03 21:04:50,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:50,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:50,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:50,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:50,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:50,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:50,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:50,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:50,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:50,235 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:50,236 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:50,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:50,236 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 21:04:50,253 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:04:50,253 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:50,275 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-03 21:04:50,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:50,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-03 21:04:50,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:50,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:50,301 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:50,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:50,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:50,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-09-03 21:04:50,353 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:50,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 21:04:50,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 21:04:50,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-03 21:04:50,354 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2019-09-03 21:04:50,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:50,406 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2019-09-03 21:04:50,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 21:04:50,407 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-09-03 21:04:50,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:50,407 INFO L225 Difference]: With dead ends: 25 [2019-09-03 21:04:50,408 INFO L226 Difference]: Without dead ends: 25 [2019-09-03 21:04:50,408 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-03 21:04:50,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-03 21:04:50,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-09-03 21:04:50,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-03 21:04:50,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-09-03 21:04:50,412 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 14 [2019-09-03 21:04:50,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:50,412 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-09-03 21:04:50,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 21:04:50,412 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2019-09-03 21:04:50,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-03 21:04:50,413 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:50,413 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:50,413 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:50,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:50,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1358058314, now seen corresponding path program 3 times [2019-09-03 21:04:50,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:50,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:50,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:50,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:50,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:50,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:50,507 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:50,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:50,507 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:50,507 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:50,508 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:50,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:50,508 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 21:04:50,532 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:04:50,532 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:50,544 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:04:50,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:50,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 21:04:50,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:50,569 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:50,570 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:50,652 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:50,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:50,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-09-03 21:04:50,656 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:50,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 21:04:50,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 21:04:50,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-09-03 21:04:50,658 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 7 states. [2019-09-03 21:04:50,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:50,710 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2019-09-03 21:04:50,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 21:04:50,711 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-09-03 21:04:50,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:50,712 INFO L225 Difference]: With dead ends: 26 [2019-09-03 21:04:50,712 INFO L226 Difference]: Without dead ends: 26 [2019-09-03 21:04:50,712 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-09-03 21:04:50,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-03 21:04:50,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-09-03 21:04:50,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-03 21:04:50,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-09-03 21:04:50,716 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 15 [2019-09-03 21:04:50,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:50,717 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-09-03 21:04:50,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 21:04:50,717 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-09-03 21:04:50,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 21:04:50,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:50,718 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:50,718 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:50,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:50,718 INFO L82 PathProgramCache]: Analyzing trace with hash 877091307, now seen corresponding path program 4 times [2019-09-03 21:04:50,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:50,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:50,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:50,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:50,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:50,854 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:50,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:50,854 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:50,855 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:50,855 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:50,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:50,855 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 21:04:50,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:50,871 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:50,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:50,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 21:04:50,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:50,917 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:50,917 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:51,014 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:51,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:51,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-09-03 21:04:51,019 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:51,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 21:04:51,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 21:04:51,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-09-03 21:04:51,020 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 8 states. [2019-09-03 21:04:51,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:51,075 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2019-09-03 21:04:51,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 21:04:51,075 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-09-03 21:04:51,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:51,076 INFO L225 Difference]: With dead ends: 27 [2019-09-03 21:04:51,076 INFO L226 Difference]: Without dead ends: 27 [2019-09-03 21:04:51,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-09-03 21:04:51,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-03 21:04:51,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-09-03 21:04:51,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-03 21:04:51,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-09-03 21:04:51,081 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 16 [2019-09-03 21:04:51,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:51,081 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-09-03 21:04:51,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 21:04:51,081 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-09-03 21:04:51,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 21:04:51,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:51,082 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:51,082 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:51,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:51,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1447252822, now seen corresponding path program 5 times [2019-09-03 21:04:51,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:51,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:51,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:51,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:51,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:51,197 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:51,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:51,198 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:51,199 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:51,199 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:51,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:51,199 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:51,215 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:04:51,216 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:04:52,355 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 21:04:52,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:52,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 21:04:52,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:52,393 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:52,393 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:52,524 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:52,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:52,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-09-03 21:04:52,530 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:52,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 21:04:52,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 21:04:52,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-09-03 21:04:52,531 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 9 states. [2019-09-03 21:04:52,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:52,588 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2019-09-03 21:04:52,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 21:04:52,588 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-09-03 21:04:52,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:52,589 INFO L225 Difference]: With dead ends: 28 [2019-09-03 21:04:52,589 INFO L226 Difference]: Without dead ends: 28 [2019-09-03 21:04:52,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-09-03 21:04:52,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-03 21:04:52,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-09-03 21:04:52,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-03 21:04:52,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-09-03 21:04:52,593 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 17 [2019-09-03 21:04:52,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:52,594 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-09-03 21:04:52,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 21:04:52,594 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-09-03 21:04:52,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 21:04:52,595 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:52,595 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:52,595 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:52,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:52,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1942390603, now seen corresponding path program 6 times [2019-09-03 21:04:52,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:52,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:52,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:52,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:52,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:52,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:52,719 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:52,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:52,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:52,720 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:52,720 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:52,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:52,720 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 21:04:52,741 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:04:52,741 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:52,759 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:04:52,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:52,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 21:04:52,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:52,817 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:52,817 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:52,978 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:52,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:52,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-09-03 21:04:52,983 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:52,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 21:04:52,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 21:04:52,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-09-03 21:04:52,984 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 10 states. [2019-09-03 21:04:53,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:53,065 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2019-09-03 21:04:53,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 21:04:53,066 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-09-03 21:04:53,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:53,067 INFO L225 Difference]: With dead ends: 29 [2019-09-03 21:04:53,067 INFO L226 Difference]: Without dead ends: 29 [2019-09-03 21:04:53,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-09-03 21:04:53,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-03 21:04:53,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-09-03 21:04:53,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-03 21:04:53,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-09-03 21:04:53,073 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 18 [2019-09-03 21:04:53,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:53,074 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-09-03 21:04:53,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 21:04:53,077 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-09-03 21:04:53,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-03 21:04:53,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:53,078 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:53,078 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:53,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:53,079 INFO L82 PathProgramCache]: Analyzing trace with hash 111792630, now seen corresponding path program 7 times [2019-09-03 21:04:53,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:53,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:53,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:53,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:53,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:53,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:53,249 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:53,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:53,249 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:53,250 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:53,250 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:53,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:53,250 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 21:04:53,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:53,275 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:53,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:53,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-03 21:04:53,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:53,319 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:53,320 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:53,521 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:53,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:53,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-09-03 21:04:53,525 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:53,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 21:04:53,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 21:04:53,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-09-03 21:04:53,527 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 11 states. [2019-09-03 21:04:53,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:53,616 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2019-09-03 21:04:53,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 21:04:53,617 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-09-03 21:04:53,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:53,618 INFO L225 Difference]: With dead ends: 30 [2019-09-03 21:04:53,618 INFO L226 Difference]: Without dead ends: 30 [2019-09-03 21:04:53,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-09-03 21:04:53,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-03 21:04:53,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-09-03 21:04:53,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-03 21:04:53,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-09-03 21:04:53,622 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 19 [2019-09-03 21:04:53,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:53,623 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-09-03 21:04:53,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 21:04:53,623 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-09-03 21:04:53,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 21:04:53,624 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:53,624 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:53,624 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:53,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:53,625 INFO L82 PathProgramCache]: Analyzing trace with hash -802169685, now seen corresponding path program 8 times [2019-09-03 21:04:53,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:53,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:53,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:53,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:53,626 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:53,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:53,746 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:53,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:53,747 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:53,747 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:53,747 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:53,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:53,748 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 21:04:53,768 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:04:53,768 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:54,579 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-03 21:04:54,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:54,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-03 21:04:54,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:54,606 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:54,606 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:54,834 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:54,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:54,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-09-03 21:04:54,840 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:54,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 21:04:54,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 21:04:54,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-09-03 21:04:54,841 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 12 states. [2019-09-03 21:04:54,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:54,931 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-09-03 21:04:54,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 21:04:54,933 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-09-03 21:04:54,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:54,933 INFO L225 Difference]: With dead ends: 31 [2019-09-03 21:04:54,933 INFO L226 Difference]: Without dead ends: 31 [2019-09-03 21:04:54,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-09-03 21:04:54,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-03 21:04:54,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-09-03 21:04:54,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-03 21:04:54,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-09-03 21:04:54,937 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2019-09-03 21:04:54,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:54,937 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-09-03 21:04:54,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 21:04:54,938 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-09-03 21:04:54,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-03 21:04:54,938 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:54,939 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:54,939 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:54,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:54,939 INFO L82 PathProgramCache]: Analyzing trace with hash 929769622, now seen corresponding path program 9 times [2019-09-03 21:04:54,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:54,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:54,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:54,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:54,941 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:54,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:55,067 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:55,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:55,068 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:55,068 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:55,068 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:55,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:55,068 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:55,091 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:04:55,092 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:04:55,105 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:04:55,105 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:55,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 21:04:55,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:55,133 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:55,133 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:55,424 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:55,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:55,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-09-03 21:04:55,427 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:55,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 21:04:55,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 21:04:55,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-09-03 21:04:55,429 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 13 states. [2019-09-03 21:04:55,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:55,544 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2019-09-03 21:04:55,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 21:04:55,545 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2019-09-03 21:04:55,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:55,546 INFO L225 Difference]: With dead ends: 32 [2019-09-03 21:04:55,546 INFO L226 Difference]: Without dead ends: 32 [2019-09-03 21:04:55,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-09-03 21:04:55,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-03 21:04:55,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-09-03 21:04:55,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-03 21:04:55,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-09-03 21:04:55,549 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 21 [2019-09-03 21:04:55,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:55,550 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-09-03 21:04:55,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 21:04:55,550 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-09-03 21:04:55,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-03 21:04:55,551 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:55,551 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:55,551 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:55,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:55,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1214686709, now seen corresponding path program 10 times [2019-09-03 21:04:55,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:55,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:55,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:55,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:55,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:55,716 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:55,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:55,717 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:55,717 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:55,717 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:55,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:55,718 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:55,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:55,733 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:04:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:55,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 21:04:55,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:55,782 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:55,782 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:56,069 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:56,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:56,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-09-03 21:04:56,073 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:56,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 21:04:56,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 21:04:56,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2019-09-03 21:04:56,074 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 14 states. [2019-09-03 21:04:56,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:56,224 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2019-09-03 21:04:56,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 21:04:56,231 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-09-03 21:04:56,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:56,232 INFO L225 Difference]: With dead ends: 33 [2019-09-03 21:04:56,232 INFO L226 Difference]: Without dead ends: 33 [2019-09-03 21:04:56,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2019-09-03 21:04:56,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-03 21:04:56,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-09-03 21:04:56,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-03 21:04:56,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-09-03 21:04:56,235 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 22 [2019-09-03 21:04:56,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:56,236 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-09-03 21:04:56,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 21:04:56,236 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-09-03 21:04:56,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-03 21:04:56,236 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:56,237 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:56,237 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:56,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:56,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1026643766, now seen corresponding path program 11 times [2019-09-03 21:04:56,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:56,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:56,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:56,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:56,239 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:56,392 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:56,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:56,393 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:56,393 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:56,393 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:56,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:56,394 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:56,412 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:04:56,412 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:05:12,799 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-03 21:05:12,799 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:05:12,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-03 21:05:12,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:05:12,869 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:05:12,869 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:05:13,231 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:05:13,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:05:13,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-09-03 21:05:13,237 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:05:13,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 21:05:13,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 21:05:13,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2019-09-03 21:05:13,239 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 15 states. [2019-09-03 21:05:13,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:05:13,424 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2019-09-03 21:05:13,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 21:05:13,424 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2019-09-03 21:05:13,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:05:13,425 INFO L225 Difference]: With dead ends: 34 [2019-09-03 21:05:13,425 INFO L226 Difference]: Without dead ends: 34 [2019-09-03 21:05:13,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2019-09-03 21:05:13,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-03 21:05:13,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-09-03 21:05:13,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-03 21:05:13,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-09-03 21:05:13,429 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 23 [2019-09-03 21:05:13,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:05:13,429 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-09-03 21:05:13,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 21:05:13,430 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-09-03 21:05:13,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-03 21:05:13,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:05:13,430 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:05:13,431 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:05:13,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:05:13,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1788411755, now seen corresponding path program 12 times [2019-09-03 21:05:13,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:05:13,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:13,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:05:13,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:13,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:05:13,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:13,601 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:05:13,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:13,602 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:05:13,602 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:05:13,602 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:05:13,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:13,602 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:05:13,621 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:05:13,621 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:05:13,644 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:05:13,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:05:13,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 21:05:13,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:05:13,679 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:05:13,679 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:05:14,067 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:05:14,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:05:14,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-09-03 21:05:14,071 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:05:14,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 21:05:14,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 21:05:14,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2019-09-03 21:05:14,072 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 16 states. [2019-09-03 21:05:14,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:05:14,294 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2019-09-03 21:05:14,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 21:05:14,295 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 24 [2019-09-03 21:05:14,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:05:14,296 INFO L225 Difference]: With dead ends: 35 [2019-09-03 21:05:14,296 INFO L226 Difference]: Without dead ends: 35 [2019-09-03 21:05:14,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2019-09-03 21:05:14,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-03 21:05:14,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-09-03 21:05:14,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-03 21:05:14,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-09-03 21:05:14,299 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 24 [2019-09-03 21:05:14,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:05:14,299 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-09-03 21:05:14,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 21:05:14,299 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-09-03 21:05:14,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-03 21:05:14,300 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:05:14,300 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:05:14,300 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:05:14,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:05:14,301 INFO L82 PathProgramCache]: Analyzing trace with hash -366584362, now seen corresponding path program 13 times [2019-09-03 21:05:14,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:05:14,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:14,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:05:14,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:14,302 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:05:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:14,538 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:05:14,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:14,538 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:05:14,538 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:05:14,538 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:05:14,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:14,538 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:05:14,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:05:14,558 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:05:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:14,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-03 21:05:14,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:05:14,630 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:05:14,630 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:05:15,126 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:05:15,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:05:15,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-09-03 21:05:15,130 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:05:15,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 21:05:15,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 21:05:15,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2019-09-03 21:05:15,132 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 17 states. [2019-09-03 21:05:15,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:05:15,321 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2019-09-03 21:05:15,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 21:05:15,321 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2019-09-03 21:05:15,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:05:15,322 INFO L225 Difference]: With dead ends: 36 [2019-09-03 21:05:15,322 INFO L226 Difference]: Without dead ends: 36 [2019-09-03 21:05:15,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2019-09-03 21:05:15,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-03 21:05:15,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-09-03 21:05:15,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-03 21:05:15,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-09-03 21:05:15,327 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 25 [2019-09-03 21:05:15,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:05:15,327 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-09-03 21:05:15,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 21:05:15,327 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-09-03 21:05:15,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-03 21:05:15,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:05:15,328 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:05:15,328 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:05:15,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:05:15,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1548012747, now seen corresponding path program 14 times [2019-09-03 21:05:15,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:05:15,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:15,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:05:15,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:15,330 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:05:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:15,553 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:05:15,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:15,553 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:05:15,553 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:05:15,554 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:05:15,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:15,554 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:05:15,565 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:05:15,565 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:05:58,715 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-03 21:05:58,716 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:05:58,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-03 21:05:58,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:05:58,861 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:05:58,862 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:05:59,343 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:05:59,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:05:59,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-09-03 21:05:59,350 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:05:59,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 21:05:59,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 21:05:59,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 21:05:59,351 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 18 states. [2019-09-03 21:05:59,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:05:59,586 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-09-03 21:05:59,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 21:05:59,586 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2019-09-03 21:05:59,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:05:59,587 INFO L225 Difference]: With dead ends: 37 [2019-09-03 21:05:59,587 INFO L226 Difference]: Without dead ends: 37 [2019-09-03 21:05:59,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 21:05:59,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-03 21:05:59,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-09-03 21:05:59,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-03 21:05:59,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-09-03 21:05:59,593 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 26 [2019-09-03 21:05:59,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:05:59,594 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-09-03 21:05:59,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 21:05:59,594 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-09-03 21:05:59,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-03 21:05:59,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:05:59,595 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:05:59,595 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:05:59,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:05:59,595 INFO L82 PathProgramCache]: Analyzing trace with hash 770980982, now seen corresponding path program 15 times [2019-09-03 21:05:59,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:05:59,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:59,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:05:59,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:59,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:05:59,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:59,853 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:05:59,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:59,853 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:05:59,854 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:05:59,854 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:05:59,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:59,854 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 21:05:59,868 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:05:59,868 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:05:59,885 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:05:59,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:05:59,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 21:05:59,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:05:59,933 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:05:59,933 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:06:00,493 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:06:00,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:06:00,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-09-03 21:06:00,497 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:06:00,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 21:06:00,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 21:06:00,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 21:06:00,498 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 19 states. [2019-09-03 21:06:00,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:06:00,740 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-09-03 21:06:00,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-03 21:06:00,746 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 27 [2019-09-03 21:06:00,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:06:00,747 INFO L225 Difference]: With dead ends: 38 [2019-09-03 21:06:00,747 INFO L226 Difference]: Without dead ends: 38 [2019-09-03 21:06:00,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 21:06:00,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-03 21:06:00,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-09-03 21:06:00,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-03 21:06:00,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-09-03 21:06:00,752 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 27 [2019-09-03 21:06:00,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:06:00,752 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-09-03 21:06:00,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 21:06:00,753 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-09-03 21:06:00,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 21:06:00,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:06:00,753 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:06:00,754 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:06:00,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:06:00,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1842167253, now seen corresponding path program 16 times [2019-09-03 21:06:00,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:06:00,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:00,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:06:00,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:00,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:06:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:06:01,010 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:06:01,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:01,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:06:01,011 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:06:01,011 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:06:01,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:01,012 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:06:01,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:06:01,024 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:06:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:06:01,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-03 21:06:01,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:06:01,075 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:06:01,075 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:06:01,717 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:06:01,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:06:01,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-09-03 21:06:01,720 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:06:01,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 21:06:01,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 21:06:01,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 21:06:01,721 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 20 states. [2019-09-03 21:06:02,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:06:02,032 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2019-09-03 21:06:02,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 21:06:02,032 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 28 [2019-09-03 21:06:02,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:06:02,033 INFO L225 Difference]: With dead ends: 39 [2019-09-03 21:06:02,033 INFO L226 Difference]: Without dead ends: 39 [2019-09-03 21:06:02,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 21:06:02,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-03 21:06:02,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-09-03 21:06:02,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-03 21:06:02,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-09-03 21:06:02,037 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 28 [2019-09-03 21:06:02,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:06:02,037 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-09-03 21:06:02,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 21:06:02,038 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-09-03 21:06:02,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-03 21:06:02,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:06:02,038 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:06:02,039 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:06:02,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:06:02,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1245383914, now seen corresponding path program 17 times [2019-09-03 21:06:02,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:06:02,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:02,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:06:02,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:02,040 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:06:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:06:02,282 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:06:02,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:02,283 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:06:02,283 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:06:02,283 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:06:02,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:02,284 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:06:02,295 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:06:02,295 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:06:02,781 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-03 21:06:02,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:06:02,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-03 21:06:02,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:06:02,831 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:06:02,831 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:06:03,813 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:06:03,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:06:03,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-09-03 21:06:03,818 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:06:03,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 21:06:03,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 21:06:03,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 21:06:03,820 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 21 states. [2019-09-03 21:06:04,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:06:04,135 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-09-03 21:06:04,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 21:06:04,136 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 29 [2019-09-03 21:06:04,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:06:04,136 INFO L225 Difference]: With dead ends: 40 [2019-09-03 21:06:04,136 INFO L226 Difference]: Without dead ends: 40 [2019-09-03 21:06:04,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 21:06:04,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-03 21:06:04,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-09-03 21:06:04,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-03 21:06:04,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-09-03 21:06:04,139 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 29 [2019-09-03 21:06:04,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:06:04,140 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-09-03 21:06:04,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 21:06:04,140 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-09-03 21:06:04,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-03 21:06:04,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:06:04,141 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:06:04,141 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:06:04,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:06:04,142 INFO L82 PathProgramCache]: Analyzing trace with hash 75030411, now seen corresponding path program 18 times [2019-09-03 21:06:04,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:06:04,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:04,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:06:04,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:04,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:06:04,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:06:04,436 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:06:04,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:04,436 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:06:04,437 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:06:04,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:06:04,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:04,437 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:06:04,447 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:06:04,447 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:06:04,461 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:06:04,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:06:04,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-03 21:06:04,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:06:04,498 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:06:04,498 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:06:05,437 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:06:05,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:06:05,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-09-03 21:06:05,440 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:06:05,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 21:06:05,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 21:06:05,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 21:06:05,442 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 22 states. [2019-09-03 21:06:05,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:06:05,785 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2019-09-03 21:06:05,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 21:06:05,788 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2019-09-03 21:06:05,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:06:05,789 INFO L225 Difference]: With dead ends: 41 [2019-09-03 21:06:05,789 INFO L226 Difference]: Without dead ends: 41 [2019-09-03 21:06:05,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 21:06:05,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-03 21:06:05,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-09-03 21:06:05,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-03 21:06:05,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-09-03 21:06:05,793 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 30 [2019-09-03 21:06:05,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:06:05,793 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-09-03 21:06:05,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 21:06:05,793 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-09-03 21:06:05,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-03 21:06:05,794 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:06:05,794 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:06:05,794 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:06:05,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:06:05,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1941798474, now seen corresponding path program 19 times [2019-09-03 21:06:05,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:06:05,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:05,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:06:05,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:05,795 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:06:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:06:06,122 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:06:06,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:06,123 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:06:06,123 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:06:06,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:06:06,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:06,123 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:06:06,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:06:06,137 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:06:06,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:06:06,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-03 21:06:06,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:06:06,191 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:06:06,191 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:06:07,213 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:06:07,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:06:07,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-09-03 21:06:07,217 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:06:07,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 21:06:07,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 21:06:07,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=1283, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 21:06:07,218 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 23 states. [2019-09-03 21:06:07,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:06:07,623 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-09-03 21:06:07,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-03 21:06:07,627 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 31 [2019-09-03 21:06:07,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:06:07,628 INFO L225 Difference]: With dead ends: 42 [2019-09-03 21:06:07,628 INFO L226 Difference]: Without dead ends: 42 [2019-09-03 21:06:07,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=523, Invalid=1283, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 21:06:07,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-03 21:06:07,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-09-03 21:06:07,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-03 21:06:07,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-09-03 21:06:07,632 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 31 [2019-09-03 21:06:07,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:06:07,633 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-09-03 21:06:07,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 21:06:07,633 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-09-03 21:06:07,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-03 21:06:07,634 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:06:07,634 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:06:07,634 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:06:07,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:06:07,634 INFO L82 PathProgramCache]: Analyzing trace with hash -38984469, now seen corresponding path program 20 times [2019-09-03 21:06:07,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:06:07,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:07,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:06:07,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:07,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:06:07,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:06:08,030 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:06:08,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:08,031 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:06:08,031 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:06:08,031 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:06:08,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:08,032 INFO 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) [2019-09-03 21:06:08,050 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:06:08,050 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:07:27,531 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-03 21:07:27,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:07:27,653 WARN L254 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-03 21:07:27,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:07:27,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:07:27,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:07:27,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:07:27,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:07:27,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:07:27,744 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:07:27,744 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:07:27,911 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-03 21:07:27,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:07:27,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25, 8] total 32 [2019-09-03 21:07:27,919 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:07:27,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 21:07:27,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 21:07:27,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=887, Unknown=0, NotChecked=0, Total=992 [2019-09-03 21:07:27,920 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 26 states. [2019-09-03 21:07:28,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:07:28,425 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-09-03 21:07:28,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 21:07:28,425 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 32 [2019-09-03 21:07:28,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:07:28,426 INFO L225 Difference]: With dead ends: 43 [2019-09-03 21:07:28,426 INFO L226 Difference]: Without dead ends: 43 [2019-09-03 21:07:28,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=887, Unknown=0, NotChecked=0, Total=992 [2019-09-03 21:07:28,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-03 21:07:28,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-09-03 21:07:28,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-03 21:07:28,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-09-03 21:07:28,429 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 32 [2019-09-03 21:07:28,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:07:28,431 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-09-03 21:07:28,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 21:07:28,431 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-09-03 21:07:28,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-03 21:07:28,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:07:28,432 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:07:28,432 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:07:28,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:07:28,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1181292458, now seen corresponding path program 21 times [2019-09-03 21:07:28,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:07:28,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:28,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:07:28,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:28,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:07:28,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:07:28,823 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:07:28,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:28,823 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:07:28,823 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:07:28,824 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:07:28,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:28,824 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:07:28,835 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:07:28,835 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:07:28,854 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:07:28,854 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:07:28,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-03 21:07:28,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:07:28,897 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:07:28,898 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:07:30,220 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:07:30,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:07:30,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-09-03 21:07:30,224 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:07:30,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 21:07:30,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 21:07:30,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 21:07:30,225 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 25 states. [2019-09-03 21:07:30,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:07:30,652 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2019-09-03 21:07:30,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 21:07:30,653 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 33 [2019-09-03 21:07:30,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:07:30,654 INFO L225 Difference]: With dead ends: 44 [2019-09-03 21:07:30,654 INFO L226 Difference]: Without dead ends: 44 [2019-09-03 21:07:30,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 21:07:30,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-03 21:07:30,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-09-03 21:07:30,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-03 21:07:30,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-09-03 21:07:30,658 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 33 [2019-09-03 21:07:30,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:07:30,659 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-09-03 21:07:30,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 21:07:30,659 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-09-03 21:07:30,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-03 21:07:30,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:07:30,660 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:07:30,660 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:07:30,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:07:30,660 INFO L82 PathProgramCache]: Analyzing trace with hash 2061865547, now seen corresponding path program 22 times [2019-09-03 21:07:30,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:07:30,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:30,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:07:30,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:30,661 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:07:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:07:31,145 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:07:31,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:31,146 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:07:31,146 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:07:31,146 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:07:31,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:31,146 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 21:07:31,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:07:31,160 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:07:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:07:31,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-03 21:07:31,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:07:31,240 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:07:31,240 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:07:32,571 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:07:32,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:07:32,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-09-03 21:07:32,575 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:07:32,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 21:07:32,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 21:07:32,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=670, Invalid=1682, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 21:07:32,577 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 26 states. [2019-09-03 21:07:33,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:07:33,042 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-09-03 21:07:33,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 21:07:33,042 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 34 [2019-09-03 21:07:33,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:07:33,042 INFO L225 Difference]: With dead ends: 45 [2019-09-03 21:07:33,043 INFO L226 Difference]: Without dead ends: 45 [2019-09-03 21:07:33,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=670, Invalid=1682, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 21:07:33,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-03 21:07:33,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-09-03 21:07:33,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-03 21:07:33,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-09-03 21:07:33,046 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 34 [2019-09-03 21:07:33,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:07:33,047 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-09-03 21:07:33,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 21:07:33,047 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-09-03 21:07:33,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-03 21:07:33,047 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:07:33,047 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:07:33,048 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:07:33,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:07:33,048 INFO L82 PathProgramCache]: Analyzing trace with hash -479451402, now seen corresponding path program 23 times [2019-09-03 21:07:33,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:07:33,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:33,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:07:33,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:33,049 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:07:33,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:07:33,482 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:07:33,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:33,482 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:07:33,482 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:07:33,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:07:33,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:33,483 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:07:33,493 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:07:33,493 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:09:36,090 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-03 21:09:36,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:09:36,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-03 21:09:36,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:09:37,019 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:09:37,019 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:09:38,261 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:09:38,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:09:38,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-09-03 21:09:38,267 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:09:38,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 21:09:38,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 21:09:38,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=723, Invalid=1827, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 21:09:38,269 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 27 states. [2019-09-03 21:09:38,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:09:38,817 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2019-09-03 21:09:38,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 21:09:38,818 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 35 [2019-09-03 21:09:38,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:09:38,819 INFO L225 Difference]: With dead ends: 46 [2019-09-03 21:09:38,819 INFO L226 Difference]: Without dead ends: 46 [2019-09-03 21:09:38,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=723, Invalid=1827, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 21:09:38,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-03 21:09:38,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-09-03 21:09:38,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-03 21:09:38,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-09-03 21:09:38,825 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 35 [2019-09-03 21:09:38,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:09:38,826 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-09-03 21:09:38,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 21:09:38,826 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-09-03 21:09:38,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-03 21:09:38,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:09:38,827 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:09:38,827 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:09:38,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:09:38,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1950865493, now seen corresponding path program 24 times [2019-09-03 21:09:38,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:09:38,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:38,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:09:38,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:38,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:09:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:39,294 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:09:39,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:09:39,295 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:09:39,295 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:09:39,295 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:09:39,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:09:39,295 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:09:39,308 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:09:39,308 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:09:39,336 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:09:39,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:09:39,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-03 21:09:39,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:09:39,388 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:09:39,388 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:09:40,717 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:09:40,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:09:40,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-09-03 21:09:40,721 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:09:40,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 21:09:40,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 21:09:40,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 21:09:40,722 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 28 states. [2019-09-03 21:09:41,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:09:41,282 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2019-09-03 21:09:41,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 21:09:41,283 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 36 [2019-09-03 21:09:41,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:09:41,284 INFO L225 Difference]: With dead ends: 47 [2019-09-03 21:09:41,284 INFO L226 Difference]: Without dead ends: 47 [2019-09-03 21:09:41,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 21:09:41,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-03 21:09:41,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-09-03 21:09:41,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-03 21:09:41,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-09-03 21:09:41,287 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 36 [2019-09-03 21:09:41,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:09:41,287 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-09-03 21:09:41,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 21:09:41,288 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-09-03 21:09:41,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-03 21:09:41,288 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:09:41,288 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:09:41,289 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:09:41,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:09:41,289 INFO L82 PathProgramCache]: Analyzing trace with hash -320062058, now seen corresponding path program 25 times [2019-09-03 21:09:41,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:09:41,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:41,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:09:41,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:41,290 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:09:41,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:41,996 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:09:41,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:09:41,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:09:41,996 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:09:41,996 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:09:41,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:09:41,997 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:09:42,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:42,015 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:09:42,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:42,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-03 21:09:42,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:09:42,074 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:09:42,074 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:09:43,476 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:09:43,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:09:43,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-09-03 21:09:43,479 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:09:43,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 21:09:43,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 21:09:43,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=835, Invalid=2135, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 21:09:43,481 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 29 states. [2019-09-03 21:09:44,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:09:44,056 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2019-09-03 21:09:44,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-03 21:09:44,056 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 37 [2019-09-03 21:09:44,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:09:44,057 INFO L225 Difference]: With dead ends: 48 [2019-09-03 21:09:44,057 INFO L226 Difference]: Without dead ends: 48 [2019-09-03 21:09:44,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=835, Invalid=2135, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 21:09:44,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-03 21:09:44,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-09-03 21:09:44,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-03 21:09:44,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-09-03 21:09:44,061 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 37 [2019-09-03 21:09:44,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:09:44,062 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-09-03 21:09:44,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 21:09:44,062 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-09-03 21:09:44,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-03 21:09:44,062 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:09:44,063 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:09:44,063 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:09:44,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:09:44,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1304763125, now seen corresponding path program 26 times [2019-09-03 21:09:44,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:09:44,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:44,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:44,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:44,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:09:44,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:44,586 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:09:44,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:09:44,587 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:09:44,587 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:09:44,587 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:09:44,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:09:44,587 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:09:44,597 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:09:44,597 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:10:24,723 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-03 21:10:24,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:10:25,283 WARN L254 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-03 21:10:25,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:10:25,337 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:10:25,337 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:12:36,785 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 347 refuted. 4 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:12:36,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:12:36,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-09-03 21:12:36,793 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:12:36,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 21:12:36,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 21:12:36,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=894, Invalid=2254, Unknown=44, NotChecked=0, Total=3192 [2019-09-03 21:12:36,795 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 30 states. [2019-09-03 21:12:37,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:12:37,459 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-09-03 21:12:37,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 21:12:37,460 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 38 [2019-09-03 21:12:37,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:12:37,461 INFO L225 Difference]: With dead ends: 49 [2019-09-03 21:12:37,461 INFO L226 Difference]: Without dead ends: 49 [2019-09-03 21:12:37,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 131.9s TimeCoverageRelationStatistics Valid=894, Invalid=2254, Unknown=44, NotChecked=0, Total=3192 [2019-09-03 21:12:37,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-03 21:12:37,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2019-09-03 21:12:37,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-03 21:12:37,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-09-03 21:12:37,464 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 38 [2019-09-03 21:12:37,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:12:37,465 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-09-03 21:12:37,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 21:12:37,465 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-09-03 21:12:37,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-03 21:12:37,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:12:37,466 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:12:37,466 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:12:37,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:12:37,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1765725130, now seen corresponding path program 27 times [2019-09-03 21:12:37,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:12:37,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:12:37,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:12:37,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:12:37,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:12:37,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:12:37,961 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:12:37,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:12:37,962 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:12:37,962 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:12:37,962 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:12:37,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:12:37,962 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:12:37,978 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:12:37,978 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:12:38,002 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:12:38,002 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:12:38,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-03 21:12:38,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:12:38,054 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:12:38,054 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:12:39,831 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:12:39,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:12:39,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-09-03 21:12:39,837 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:12:39,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 21:12:39,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 21:12:39,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=955, Invalid=2467, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 21:12:39,838 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 31 states. [2019-09-03 21:12:40,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:12:40,561 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2019-09-03 21:12:40,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-03 21:12:40,564 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 39 [2019-09-03 21:12:40,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:12:40,565 INFO L225 Difference]: With dead ends: 50 [2019-09-03 21:12:40,565 INFO L226 Difference]: Without dead ends: 50 [2019-09-03 21:12:40,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=955, Invalid=2467, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 21:12:40,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-03 21:12:40,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-09-03 21:12:40,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-03 21:12:40,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-09-03 21:12:40,569 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 39 [2019-09-03 21:12:40,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:12:40,569 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-09-03 21:12:40,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 21:12:40,569 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-09-03 21:12:40,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-03 21:12:40,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:12:40,570 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:12:40,570 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:12:40,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:12:40,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1124321899, now seen corresponding path program 28 times [2019-09-03 21:12:40,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:12:40,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:12:40,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:12:40,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:12:40,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:12:40,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:12:41,130 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:12:41,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:12:41,130 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:12:41,130 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:12:41,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:12:41,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:12:41,131 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:12:41,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:12:41,142 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:12:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:12:41,167 WARN L254 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-03 21:12:41,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:12:41,214 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:12:41,214 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:12:43,513 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:12:43,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:12:43,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-09-03 21:12:43,517 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:12:43,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 21:12:43,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 21:12:43,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1018, Invalid=2642, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 21:12:43,518 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 32 states. [2019-09-03 21:12:44,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:12:44,267 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2019-09-03 21:12:44,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 21:12:44,268 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 40 [2019-09-03 21:12:44,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:12:44,268 INFO L225 Difference]: With dead ends: 51 [2019-09-03 21:12:44,268 INFO L226 Difference]: Without dead ends: 51 [2019-09-03 21:12:44,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1018, Invalid=2642, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 21:12:44,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-03 21:12:44,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-09-03 21:12:44,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-03 21:12:44,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-09-03 21:12:44,272 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 40 [2019-09-03 21:12:44,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:12:44,273 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-09-03 21:12:44,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 21:12:44,273 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-09-03 21:12:44,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-03 21:12:44,273 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:12:44,273 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:12:44,273 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:12:44,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:12:44,274 INFO L82 PathProgramCache]: Analyzing trace with hash 521466582, now seen corresponding path program 29 times [2019-09-03 21:12:44,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:12:44,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:12:44,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:12:44,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:12:44,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:12:44,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:12:44,863 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:12:44,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:12:44,864 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:12:44,864 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:12:44,864 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:12:44,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:12:44,864 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:12:44,883 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:12:44,883 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:15:11,021 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-03 21:15:11,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:15:11,094 WARN L254 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-03 21:15:11,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:15:11,134 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:15:11,134 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:15:13,098 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:15:13,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:15:13,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-09-03 21:15:13,105 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:15:13,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 21:15:13,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 21:15:13,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=2823, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 21:15:13,106 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 33 states. [2019-09-03 21:15:13,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:15:13,874 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2019-09-03 21:15:13,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-03 21:15:13,875 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 41 [2019-09-03 21:15:13,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:15:13,876 INFO L225 Difference]: With dead ends: 52 [2019-09-03 21:15:13,876 INFO L226 Difference]: Without dead ends: 52 [2019-09-03 21:15:13,877 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1083, Invalid=2823, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 21:15:13,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-03 21:15:13,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-09-03 21:15:13,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-03 21:15:13,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-09-03 21:15:13,880 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 41 [2019-09-03 21:15:13,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:15:13,880 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-09-03 21:15:13,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 21:15:13,880 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-09-03 21:15:13,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-03 21:15:13,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:15:13,881 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:15:13,881 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:15:13,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:15:13,881 INFO L82 PathProgramCache]: Analyzing trace with hash -987179061, now seen corresponding path program 30 times [2019-09-03 21:15:13,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:15:13,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:15:13,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:15:13,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:15:13,883 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:15:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:15:14,478 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:15:14,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:15:14,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:15:14,479 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:15:14,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:15:14,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:15:14,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:15:14,493 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:15:14,494 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:15:14,517 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:15:14,517 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:15:14,518 WARN L254 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-03 21:15:14,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:15:14,561 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:15:14,561 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:15:16,634 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:15:16,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:15:16,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-09-03 21:15:16,638 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:15:16,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-03 21:15:16,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-03 21:15:16,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1150, Invalid=3010, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 21:15:16,639 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 34 states. [2019-09-03 21:15:17,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:15:17,480 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2019-09-03 21:15:17,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 21:15:17,480 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 42 [2019-09-03 21:15:17,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:15:17,481 INFO L225 Difference]: With dead ends: 53 [2019-09-03 21:15:17,481 INFO L226 Difference]: Without dead ends: 53 [2019-09-03 21:15:17,482 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1150, Invalid=3010, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 21:15:17,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-03 21:15:17,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-09-03 21:15:17,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-03 21:15:17,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-09-03 21:15:17,485 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 42 [2019-09-03 21:15:17,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:15:17,486 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-09-03 21:15:17,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-03 21:15:17,486 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-09-03 21:15:17,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-03 21:15:17,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:15:17,490 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:15:17,490 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:15:17,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:15:17,490 INFO L82 PathProgramCache]: Analyzing trace with hash -510553738, now seen corresponding path program 31 times [2019-09-03 21:15:17,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:15:17,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:15:17,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:15:17,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:15:17,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:15:17,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:15:18,195 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:15:18,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:15:18,196 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:15:18,196 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:15:18,196 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:15:18,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:15:18,196 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:15:18,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:15:18,208 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:15:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:15:18,234 WARN L254 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-03 21:15:18,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:15:18,270 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:15:18,271 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:15:20,388 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:15:20,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:15:20,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-09-03 21:15:20,391 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:15:20,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-03 21:15:20,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-03 21:15:20,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1219, Invalid=3203, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 21:15:20,392 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 35 states. [2019-09-03 21:15:21,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:15:21,253 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2019-09-03 21:15:21,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-03 21:15:21,254 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 43 [2019-09-03 21:15:21,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:15:21,254 INFO L225 Difference]: With dead ends: 54 [2019-09-03 21:15:21,255 INFO L226 Difference]: Without dead ends: 54 [2019-09-03 21:15:21,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1219, Invalid=3203, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 21:15:21,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-03 21:15:21,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-09-03 21:15:21,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-03 21:15:21,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-09-03 21:15:21,259 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 43 [2019-09-03 21:15:21,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:15:21,259 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-09-03 21:15:21,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-03 21:15:21,260 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-09-03 21:15:21,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-03 21:15:21,260 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:15:21,260 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:15:21,260 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:15:21,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:15:21,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1379929387, now seen corresponding path program 32 times [2019-09-03 21:15:21,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:15:21,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:15:21,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:15:21,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:15:21,261 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:15:21,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:15:22,041 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:15:22,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:15:22,041 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:15:22,041 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:15:22,041 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:15:22,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:15:22,042 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:15:22,051 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:15:22,051 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:18:05,047 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-03 21:18:05,047 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:18:05,242 WARN L254 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 67 conjunts are in the unsatisfiable core [2019-09-03 21:18:05,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:18:05,286 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:18:05,286 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:18:07,700 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:18:07,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:18:07,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-09-03 21:18:07,707 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:18:07,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 21:18:07,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 21:18:07,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1290, Invalid=3402, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 21:18:07,709 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 36 states. [2019-09-03 21:18:08,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:18:08,608 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2019-09-03 21:18:08,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 21:18:08,610 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 44 [2019-09-03 21:18:08,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:18:08,611 INFO L225 Difference]: With dead ends: 55 [2019-09-03 21:18:08,611 INFO L226 Difference]: Without dead ends: 55 [2019-09-03 21:18:08,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1290, Invalid=3402, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 21:18:08,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-03 21:18:08,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2019-09-03 21:18:08,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-03 21:18:08,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-09-03 21:18:08,615 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 44 [2019-09-03 21:18:08,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:18:08,616 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-09-03 21:18:08,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 21:18:08,616 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-09-03 21:18:08,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-03 21:18:08,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:18:08,617 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:18:08,617 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:18:08,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:18:08,617 INFO L82 PathProgramCache]: Analyzing trace with hash -144635882, now seen corresponding path program 33 times [2019-09-03 21:18:08,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:18:08,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:18:08,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:18:08,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:18:08,618 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:18:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:18:09,410 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:18:09,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:18:09,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:18:09,411 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:18:09,411 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:18:09,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:18:09,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:18:09,421 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:18:09,422 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:18:09,445 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:18:09,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:18:09,447 WARN L254 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-03 21:18:09,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:18:09,502 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:18:09,502 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:18:11,824 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:18:11,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:18:11,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-09-03 21:18:11,828 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:18:11,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 21:18:11,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 21:18:11,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1363, Invalid=3607, Unknown=0, NotChecked=0, Total=4970 [2019-09-03 21:18:11,829 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 37 states. [2019-09-03 21:18:12,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:18:12,781 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2019-09-03 21:18:12,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-03 21:18:12,781 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 45 [2019-09-03 21:18:12,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:18:12,782 INFO L225 Difference]: With dead ends: 56 [2019-09-03 21:18:12,782 INFO L226 Difference]: Without dead ends: 56 [2019-09-03 21:18:12,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1363, Invalid=3607, Unknown=0, NotChecked=0, Total=4970 [2019-09-03 21:18:12,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-03 21:18:12,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-09-03 21:18:12,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-03 21:18:12,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-09-03 21:18:12,786 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 45 [2019-09-03 21:18:12,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:18:12,786 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-09-03 21:18:12,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 21:18:12,786 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-09-03 21:18:12,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-03 21:18:12,787 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:18:12,788 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:18:12,789 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:18:12,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:18:12,789 INFO L82 PathProgramCache]: Analyzing trace with hash -161518965, now seen corresponding path program 34 times [2019-09-03 21:18:12,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:18:12,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:18:12,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:18:12,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:18:12,790 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:18:12,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:18:13,557 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:18:13,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:18:13,557 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:18:13,558 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:18:13,558 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:18:13,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:18:13,558 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:18:13,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:18:13,569 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:18:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:18:13,602 WARN L254 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-03 21:18:13,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:18:13,654 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:18:13,655 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:18:16,213 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:18:16,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:18:16,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-09-03 21:18:16,216 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:18:16,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-03 21:18:16,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-03 21:18:16,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1438, Invalid=3818, Unknown=0, NotChecked=0, Total=5256 [2019-09-03 21:18:16,218 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 38 states. [2019-09-03 21:18:17,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:18:17,213 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2019-09-03 21:18:17,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-03 21:18:17,219 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 46 [2019-09-03 21:18:17,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:18:17,220 INFO L225 Difference]: With dead ends: 57 [2019-09-03 21:18:17,220 INFO L226 Difference]: Without dead ends: 57 [2019-09-03 21:18:17,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1438, Invalid=3818, Unknown=0, NotChecked=0, Total=5256 [2019-09-03 21:18:17,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-03 21:18:17,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-09-03 21:18:17,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-03 21:18:17,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-09-03 21:18:17,222 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 46 [2019-09-03 21:18:17,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:18:17,223 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-09-03 21:18:17,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-03 21:18:17,223 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2019-09-03 21:18:17,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-03 21:18:17,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:18:17,223 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:18:17,224 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:18:17,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:18:17,224 INFO L82 PathProgramCache]: Analyzing trace with hash -684894538, now seen corresponding path program 35 times [2019-09-03 21:18:17,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:18:17,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:18:17,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:18:17,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:18:17,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:18:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:18:18,007 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:18:18,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:18:18,007 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:18:18,008 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:18:18,008 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:18:18,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:18:18,008 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:18:18,022 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:18:18,023 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP)