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/nested5-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:17:30,199 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:17:30,201 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:17:30,213 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:17:30,213 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:17:30,214 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:17:30,216 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:17:30,217 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:17:30,219 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:17:30,220 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:17:30,221 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:17:30,222 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:17:30,222 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:17:30,223 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:17:30,224 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:17:30,225 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:17:30,226 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:17:30,226 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:17:30,228 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:17:30,230 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:17:30,231 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:17:30,232 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:17:30,233 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:17:30,233 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:17:30,235 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:17:30,236 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:17:30,236 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:17:30,236 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:17:30,237 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:17:30,238 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:17:30,238 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:17:30,238 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:17:30,239 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:17:30,240 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:17:30,241 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:17:30,241 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:17:30,242 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:17:30,242 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:17:30,242 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:17:30,243 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:17:30,243 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:17:30,244 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-10 02:17:30,258 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:17:30,258 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:17:30,259 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:17:30,259 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:17:30,260 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:17:30,260 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:17:30,260 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:17:30,260 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:17:30,260 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:17:30,260 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:17:30,261 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:17:30,261 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:17:30,261 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:17:30,262 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:17:30,262 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:17:30,262 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:17:30,262 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:17:30,262 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:17:30,262 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:17:30,263 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:17:30,263 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:17:30,263 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:17:30,263 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:17:30,263 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:17:30,264 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:17:30,264 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:17:30,264 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:17:30,264 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:17:30,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:17:30,265 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:17:30,291 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:17:30,304 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:17:30,307 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:17:30,309 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:17:30,309 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:17:30,310 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/nested5-2.c [2019-09-10 02:17:30,374 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ea4acf68/0bf085d528ee40089950a06c6d0d811a/FLAG84bb8e584 [2019-09-10 02:17:30,834 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:17:30,835 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested5-2.c [2019-09-10 02:17:30,841 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ea4acf68/0bf085d528ee40089950a06c6d0d811a/FLAG84bb8e584 [2019-09-10 02:17:31,243 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ea4acf68/0bf085d528ee40089950a06c6d0d811a [2019-09-10 02:17:31,255 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:17:31,257 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:17:31,259 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:17:31,259 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:17:31,263 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:17:31,264 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:17:31" (1/1) ... [2019-09-10 02:17:31,267 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63f255d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:17:31, skipping insertion in model container [2019-09-10 02:17:31,268 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:17:31" (1/1) ... [2019-09-10 02:17:31,275 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:17:31,296 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:17:31,514 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:17:31,529 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:17:31,548 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:17:31,562 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:17:31,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:17:31 WrapperNode [2019-09-10 02:17:31,563 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:17:31,564 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:17:31,564 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:17:31,564 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:17:31,660 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:17:31" (1/1) ... [2019-09-10 02:17:31,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:17:31" (1/1) ... [2019-09-10 02:17:31,667 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:17:31" (1/1) ... [2019-09-10 02:17:31,667 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:17:31" (1/1) ... [2019-09-10 02:17:31,677 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:17:31" (1/1) ... [2019-09-10 02:17:31,684 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:17:31" (1/1) ... [2019-09-10 02:17:31,685 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:17:31" (1/1) ... [2019-09-10 02:17:31,687 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:17:31,687 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:17:31,688 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:17:31,688 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:17:31,689 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:17:31" (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-10 02:17:31,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:17:31,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:17:31,744 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-10 02:17:31,744 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:17:31,744 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:17:31,744 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 02:17:31,744 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:17:31,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:17:31,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:17:31,936 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:17:31,936 INFO L283 CfgBuilder]: Removed 5 assume(true) statements. [2019-09-10 02:17:31,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:17:31 BoogieIcfgContainer [2019-09-10 02:17:31,937 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:17:31,938 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:17:31,938 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:17:31,941 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:17:31,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:17:31" (1/3) ... [2019-09-10 02:17:31,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2df0da98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:17:31, skipping insertion in model container [2019-09-10 02:17:31,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:17:31" (2/3) ... [2019-09-10 02:17:31,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2df0da98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:17:31, skipping insertion in model container [2019-09-10 02:17:31,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:17:31" (3/3) ... [2019-09-10 02:17:31,945 INFO L109 eAbstractionObserver]: Analyzing ICFG nested5-2.c [2019-09-10 02:17:31,955 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:17:31,963 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:17:31,980 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:17:32,039 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:17:32,042 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:17:32,042 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:17:32,043 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:17:32,043 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:17:32,043 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:17:32,043 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:17:32,043 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:17:32,065 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2019-09-10 02:17:32,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-10 02:17:32,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:32,076 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:32,079 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:32,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:32,084 INFO L82 PathProgramCache]: Analyzing trace with hash -84144223, now seen corresponding path program 1 times [2019-09-10 02:17:32,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:32,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:32,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:32,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:32,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:32,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:32,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:17:32,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-10 02:17:32,210 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:17:32,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:17:32,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:17:32,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:17:32,228 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2019-09-10 02:17:32,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:32,244 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2019-09-10 02:17:32,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:17:32,245 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-09-10 02:17:32,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:32,254 INFO L225 Difference]: With dead ends: 26 [2019-09-10 02:17:32,254 INFO L226 Difference]: Without dead ends: 22 [2019-09-10 02:17:32,256 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-10 02:17:32,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-10 02:17:32,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-10 02:17:32,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-10 02:17:32,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-09-10 02:17:32,286 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 14 [2019-09-10 02:17:32,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:32,286 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-09-10 02:17:32,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:17:32,287 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-09-10 02:17:32,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-10 02:17:32,287 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:32,287 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:32,288 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:32,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:32,288 INFO L82 PathProgramCache]: Analyzing trace with hash -89685349, now seen corresponding path program 1 times [2019-09-10 02:17:32,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:32,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:32,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:32,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:32,290 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:32,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:32,406 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-10 02:17:32,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:17:32,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:17:32,407 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:17:32,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:17:32,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:17:32,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:17:32,409 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 3 states. [2019-09-10 02:17:32,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:32,437 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2019-09-10 02:17:32,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:17:32,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-09-10 02:17:32,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:32,438 INFO L225 Difference]: With dead ends: 31 [2019-09-10 02:17:32,439 INFO L226 Difference]: Without dead ends: 31 [2019-09-10 02:17:32,440 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-10 02:17:32,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-10 02:17:32,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2019-09-10 02:17:32,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-10 02:17:32,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-09-10 02:17:32,445 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 14 [2019-09-10 02:17:32,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:32,446 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-09-10 02:17:32,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:17:32,446 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-09-10 02:17:32,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-10 02:17:32,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:32,447 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:32,447 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:32,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:32,448 INFO L82 PathProgramCache]: Analyzing trace with hash 374245081, now seen corresponding path program 1 times [2019-09-10 02:17:32,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:32,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:32,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:32,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:32,449 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:32,563 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-10 02:17:32,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:32,564 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:32,565 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2019-09-10 02:17:32,567 INFO L207 CegarAbsIntRunner]: [0], [4], [12], [20], [28], [36], [42], [44], [46], [69], [72], [74], [80], [81], [82], [84] [2019-09-10 02:17:32,596 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:17:32,597 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:17:32,668 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 02:17:33,215 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 02:17:33,218 INFO L272 AbstractInterpreter]: Visited 16 different actions 65 times. Merged at 3 different actions 21 times. Widened at 1 different actions 5 times. Performed 98 root evaluator evaluations with a maximum evaluation depth of 13. Performed 98 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 6 variables. [2019-09-10 02:17:33,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:33,223 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 02:17:33,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:33,223 INFO 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) [2019-09-10 02:17:33,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:33,242 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:17:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:33,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-10 02:17:33,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:33,314 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-10 02:17:33,315 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:33,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 02:17:33,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:33,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-09-10 02:17:33,370 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:33,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:17:33,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:17:33,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:17:33,374 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 5 states. [2019-09-10 02:17:33,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:33,406 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-09-10 02:17:33,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:17:33,406 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-09-10 02:17:33,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:33,407 INFO L225 Difference]: With dead ends: 33 [2019-09-10 02:17:33,407 INFO L226 Difference]: Without dead ends: 33 [2019-09-10 02:17:33,408 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:17:33,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-10 02:17:33,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2019-09-10 02:17:33,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-10 02:17:33,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-09-10 02:17:33,413 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 16 [2019-09-10 02:17:33,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:33,413 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-09-10 02:17:33,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:17:33,414 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-09-10 02:17:33,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-10 02:17:33,415 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:33,415 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:33,415 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:33,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:33,416 INFO L82 PathProgramCache]: Analyzing trace with hash -465210473, now seen corresponding path program 2 times [2019-09-10 02:17:33,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:33,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:33,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:33,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:33,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:33,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:33,523 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:33,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:33,524 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:33,525 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:33,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:33,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:33,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:17:33,552 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:17:33,553 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-10 02:17:33,584 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-10 02:17:33,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:17:33,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-10 02:17:33,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:33,624 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:33,624 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:33,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:33,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:33,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-09-10 02:17:33,717 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:33,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:17:33,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:17:33,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:17:33,720 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 6 states. [2019-09-10 02:17:33,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:33,798 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2019-09-10 02:17:33,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:17:33,800 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-09-10 02:17:33,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:33,802 INFO L225 Difference]: With dead ends: 35 [2019-09-10 02:17:33,802 INFO L226 Difference]: Without dead ends: 35 [2019-09-10 02:17:33,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 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-10 02:17:33,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-10 02:17:33,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2019-09-10 02:17:33,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-10 02:17:33,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-09-10 02:17:33,814 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 18 [2019-09-10 02:17:33,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:33,815 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-09-10 02:17:33,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:17:33,816 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-09-10 02:17:33,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-10 02:17:33,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:33,820 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:33,820 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:33,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:33,821 INFO L82 PathProgramCache]: Analyzing trace with hash 271853781, now seen corresponding path program 3 times [2019-09-10 02:17:33,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:33,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:33,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:17:33,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:33,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:33,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:34,002 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:34,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:34,003 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:34,003 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:34,003 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:34,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:34,004 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:17:34,032 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:17:34,032 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-10 02:17:34,050 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:17:34,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:17:34,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-10 02:17:34,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:34,094 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:34,095 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:34,200 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:34,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:34,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-09-10 02:17:34,206 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:34,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:17:34,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:17:34,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:17:34,208 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 7 states. [2019-09-10 02:17:34,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:34,286 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2019-09-10 02:17:34,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:17:34,287 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-09-10 02:17:34,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:34,290 INFO L225 Difference]: With dead ends: 37 [2019-09-10 02:17:34,290 INFO L226 Difference]: Without dead ends: 37 [2019-09-10 02:17:34,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 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-10 02:17:34,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-10 02:17:34,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2019-09-10 02:17:34,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-10 02:17:34,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-09-10 02:17:34,297 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 20 [2019-09-10 02:17:34,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:34,298 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-09-10 02:17:34,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:17:34,298 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-09-10 02:17:34,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-10 02:17:34,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:34,299 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:34,300 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:34,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:34,305 INFO L82 PathProgramCache]: Analyzing trace with hash -79001965, now seen corresponding path program 4 times [2019-09-10 02:17:34,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:34,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:34,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:17:34,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:34,307 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:34,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:34,445 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:34,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:34,445 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:34,445 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:34,446 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:34,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:34,446 INFO 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-10 02:17:34,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:34,462 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-10 02:17:34,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:34,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-10 02:17:34,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:34,502 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:34,502 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:34,607 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:34,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:34,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-09-10 02:17:34,612 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:34,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:17:34,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:17:34,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:17:34,613 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 8 states. [2019-09-10 02:17:34,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:34,690 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2019-09-10 02:17:34,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:17:34,691 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-09-10 02:17:34,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:34,692 INFO L225 Difference]: With dead ends: 39 [2019-09-10 02:17:34,692 INFO L226 Difference]: Without dead ends: 39 [2019-09-10 02:17:34,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 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-10 02:17:34,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-10 02:17:34,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2019-09-10 02:17:34,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-10 02:17:34,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-09-10 02:17:34,698 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 22 [2019-09-10 02:17:34,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:34,698 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-09-10 02:17:34,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:17:34,698 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-09-10 02:17:34,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-10 02:17:34,699 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:34,699 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:34,699 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:34,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:34,700 INFO L82 PathProgramCache]: Analyzing trace with hash 2051042513, now seen corresponding path program 5 times [2019-09-10 02:17:34,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:34,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:34,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:34,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:34,701 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:34,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:34,828 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:34,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:34,829 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:34,829 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:34,829 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:34,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:34,829 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:17:34,849 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:17:34,849 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:17:46,937 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-10 02:17:46,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:17:46,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 02:17:46,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:46,984 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:46,985 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:47,120 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:47,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:47,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-09-10 02:17:47,128 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:47,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:17:47,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:17:47,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-09-10 02:17:47,129 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 9 states. [2019-09-10 02:17:47,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:47,233 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2019-09-10 02:17:47,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:17:47,234 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-09-10 02:17:47,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:47,235 INFO L225 Difference]: With dead ends: 41 [2019-09-10 02:17:47,235 INFO L226 Difference]: Without dead ends: 41 [2019-09-10 02:17:47,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 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-10 02:17:47,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-10 02:17:47,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2019-09-10 02:17:47,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-10 02:17:47,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-09-10 02:17:47,244 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 24 [2019-09-10 02:17:47,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:47,245 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-09-10 02:17:47,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:17:47,245 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-09-10 02:17:47,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-10 02:17:47,246 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:47,246 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:47,246 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:47,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:47,247 INFO L82 PathProgramCache]: Analyzing trace with hash 324385679, now seen corresponding path program 6 times [2019-09-10 02:17:47,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:47,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:47,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:17:47,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:47,251 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:47,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:47,394 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-10 02:17:47,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:47,394 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:47,394 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:47,394 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:47,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:47,395 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:17:47,410 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:17:47,410 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:17:47,426 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:17:47,426 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:17:47,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-10 02:17:47,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:47,471 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-10 02:17:47,471 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:47,660 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-10 02:17:47,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:47,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-09-10 02:17:47,664 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:47,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:17:47,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:17:47,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-09-10 02:17:47,665 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 10 states. [2019-09-10 02:17:47,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:47,792 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2019-09-10 02:17:47,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:17:47,795 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-09-10 02:17:47,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:47,795 INFO L225 Difference]: With dead ends: 43 [2019-09-10 02:17:47,796 INFO L226 Difference]: Without dead ends: 43 [2019-09-10 02:17:47,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 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-10 02:17:47,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-10 02:17:47,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2019-09-10 02:17:47,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-10 02:17:47,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-09-10 02:17:47,802 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 26 [2019-09-10 02:17:47,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:47,803 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-09-10 02:17:47,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:17:47,803 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-09-10 02:17:47,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-10 02:17:47,804 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:47,804 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:47,806 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:47,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:47,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1135455539, now seen corresponding path program 7 times [2019-09-10 02:17:47,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:47,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:47,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:17:47,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:47,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:47,945 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:47,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:47,945 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:47,945 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:47,945 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:47,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:47,946 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:17:47,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:47,961 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:17:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:47,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 02:17:47,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:48,001 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:48,001 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:48,203 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:48,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:48,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-09-10 02:17:48,207 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:48,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 02:17:48,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 02:17:48,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-09-10 02:17:48,209 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 11 states. [2019-09-10 02:17:48,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:48,322 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2019-09-10 02:17:48,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 02:17:48,322 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2019-09-10 02:17:48,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:48,323 INFO L225 Difference]: With dead ends: 45 [2019-09-10 02:17:48,323 INFO L226 Difference]: Without dead ends: 45 [2019-09-10 02:17:48,324 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-09-10 02:17:48,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-10 02:17:48,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2019-09-10 02:17:48,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-10 02:17:48,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-09-10 02:17:48,327 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 28 [2019-09-10 02:17:48,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:48,328 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-09-10 02:17:48,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 02:17:48,328 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-09-10 02:17:48,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-10 02:17:48,329 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:48,329 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:48,329 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:48,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:48,330 INFO L82 PathProgramCache]: Analyzing trace with hash 411439755, now seen corresponding path program 8 times [2019-09-10 02:17:48,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:48,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:48,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:48,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:48,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:48,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:48,468 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:17:48,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:48,468 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:48,469 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:48,469 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:48,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:48,469 INFO 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-10 02:17:48,493 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:17:48,494 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-10 02:18:03,361 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-10 02:18:03,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:18:03,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 02:18:03,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:18:03,426 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:18:03,426 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:18:03,687 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:18:03,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:18:03,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-09-10 02:18:03,696 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:18:03,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 02:18:03,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 02:18:03,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-09-10 02:18:03,698 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 12 states. [2019-09-10 02:18:03,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:18:03,864 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2019-09-10 02:18:03,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:18:03,865 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2019-09-10 02:18:03,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:18:03,865 INFO L225 Difference]: With dead ends: 47 [2019-09-10 02:18:03,866 INFO L226 Difference]: Without dead ends: 47 [2019-09-10 02:18:03,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-09-10 02:18:03,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-10 02:18:03,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 39. [2019-09-10 02:18:03,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-10 02:18:03,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-09-10 02:18:03,870 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 30 [2019-09-10 02:18:03,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:18:03,870 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-09-10 02:18:03,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 02:18:03,871 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-09-10 02:18:03,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-10 02:18:03,872 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:18:03,872 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:18:03,872 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:18:03,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:18:03,872 INFO L82 PathProgramCache]: Analyzing trace with hash 919132873, now seen corresponding path program 9 times [2019-09-10 02:18:03,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:18:03,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:03,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:18:03,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:03,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:18:03,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:04,006 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:18:04,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:04,006 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:18:04,007 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:18:04,007 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:18:04,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:04,007 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:18:04,035 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:18:04,035 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:18:04,049 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:18:04,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:18:04,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 02:18:04,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:18:04,085 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:18:04,085 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:18:04,369 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:18:04,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:18:04,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-09-10 02:18:04,373 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:18:04,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 02:18:04,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 02:18:04,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-09-10 02:18:04,374 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 13 states. [2019-09-10 02:18:04,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:18:04,538 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2019-09-10 02:18:04,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 02:18:04,538 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2019-09-10 02:18:04,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:18:04,539 INFO L225 Difference]: With dead ends: 49 [2019-09-10 02:18:04,539 INFO L226 Difference]: Without dead ends: 49 [2019-09-10 02:18:04,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-09-10 02:18:04,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-10 02:18:04,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2019-09-10 02:18:04,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-10 02:18:04,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-09-10 02:18:04,543 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 32 [2019-09-10 02:18:04,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:18:04,544 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-09-10 02:18:04,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 02:18:04,544 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-09-10 02:18:04,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-10 02:18:04,545 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:18:04,545 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:18:04,545 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:18:04,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:18:04,546 INFO L82 PathProgramCache]: Analyzing trace with hash -814052473, now seen corresponding path program 10 times [2019-09-10 02:18:04,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:18:04,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:04,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:18:04,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:04,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:18:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:04,717 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:18:04,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:04,718 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:18:04,718 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:18:04,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:18:04,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:04,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-10 02:18:04,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:18:04,731 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:18:04,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:04,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-10 02:18:04,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:18:04,777 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:18:04,777 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:18:05,115 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:18:05,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:18:05,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-09-10 02:18:05,124 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:18:05,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 02:18:05,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 02:18:05,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2019-09-10 02:18:05,126 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 14 states. [2019-09-10 02:18:05,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:18:05,353 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2019-09-10 02:18:05,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 02:18:05,353 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2019-09-10 02:18:05,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:18:05,354 INFO L225 Difference]: With dead ends: 51 [2019-09-10 02:18:05,354 INFO L226 Difference]: Without dead ends: 51 [2019-09-10 02:18:05,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 56 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-10 02:18:05,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-10 02:18:05,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2019-09-10 02:18:05,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-10 02:18:05,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-09-10 02:18:05,358 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 34 [2019-09-10 02:18:05,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:18:05,359 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-09-10 02:18:05,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 02:18:05,359 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-09-10 02:18:05,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-10 02:18:05,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:18:05,360 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:18:05,360 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:18:05,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:18:05,360 INFO L82 PathProgramCache]: Analyzing trace with hash 42140869, now seen corresponding path program 11 times [2019-09-10 02:18:05,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:18:05,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:05,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:18:05,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:05,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:18:05,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:05,520 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:18:05,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:05,520 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:18:05,521 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:18:05,521 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:18:05,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:05,521 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10 02:18:05,534 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:18:05,534 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:18:17,740 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-10 02:18:17,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:18:17,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-10 02:18:17,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:18:17,773 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:18:17,774 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:18:18,100 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:18:18,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:18:18,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-09-10 02:18:18,106 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:18:18,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 02:18:18,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 02:18:18,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2019-09-10 02:18:18,107 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 15 states. [2019-09-10 02:18:18,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:18:18,395 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2019-09-10 02:18:18,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:18:18,395 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2019-09-10 02:18:18,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:18:18,396 INFO L225 Difference]: With dead ends: 53 [2019-09-10 02:18:18,396 INFO L226 Difference]: Without dead ends: 53 [2019-09-10 02:18:18,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2019-09-10 02:18:18,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-10 02:18:18,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 45. [2019-09-10 02:18:18,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-10 02:18:18,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-09-10 02:18:18,404 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 36 [2019-09-10 02:18:18,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:18:18,405 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-09-10 02:18:18,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 02:18:18,405 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-09-10 02:18:18,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-10 02:18:18,405 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:18:18,406 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:18:18,406 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:18:18,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:18:18,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1789778301, now seen corresponding path program 12 times [2019-09-10 02:18:18,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:18:18,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:18,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:18:18,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:18,407 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:18:18,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:18,591 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:18:18,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:18,591 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:18:18,592 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:18:18,592 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:18:18,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:18,592 INFO 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-10 02:18:18,602 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:18:18,602 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:18:18,617 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:18:18,617 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:18:18,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-10 02:18:18,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:18:18,663 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:18:18,663 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:18:19,062 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:18:19,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:18:19,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-09-10 02:18:19,065 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:18:19,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 02:18:19,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 02:18:19,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2019-09-10 02:18:19,068 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 16 states. [2019-09-10 02:18:19,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:18:19,371 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2019-09-10 02:18:19,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 02:18:19,372 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2019-09-10 02:18:19,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:18:19,372 INFO L225 Difference]: With dead ends: 55 [2019-09-10 02:18:19,372 INFO L226 Difference]: Without dead ends: 55 [2019-09-10 02:18:19,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 62 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-10 02:18:19,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-10 02:18:19,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2019-09-10 02:18:19,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-10 02:18:19,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-09-10 02:18:19,381 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 38 [2019-09-10 02:18:19,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:18:19,381 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-09-10 02:18:19,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 02:18:19,384 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-09-10 02:18:19,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-10 02:18:19,384 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:18:19,385 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:18:19,385 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:18:19,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:18:19,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1327509311, now seen corresponding path program 13 times [2019-09-10 02:18:19,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:18:19,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:19,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:18:19,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:19,388 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:18:19,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:19,614 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:18:19,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:19,614 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:18:19,614 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:18:19,614 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:18:19,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:19,615 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10 02:18:19,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:18:19,629 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:18:19,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:19,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-10 02:18:19,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:18:19,682 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:18:19,682 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:18:20,117 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:18:20,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:18:20,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-09-10 02:18:20,120 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:18:20,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 02:18:20,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 02:18:20,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2019-09-10 02:18:20,123 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 17 states. [2019-09-10 02:18:20,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:18:20,464 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2019-09-10 02:18:20,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 02:18:20,465 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2019-09-10 02:18:20,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:18:20,466 INFO L225 Difference]: With dead ends: 57 [2019-09-10 02:18:20,466 INFO L226 Difference]: Without dead ends: 57 [2019-09-10 02:18:20,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2019-09-10 02:18:20,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-10 02:18:20,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2019-09-10 02:18:20,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-10 02:18:20,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-09-10 02:18:20,480 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 40 [2019-09-10 02:18:20,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:18:20,481 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-09-10 02:18:20,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 02:18:20,481 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-09-10 02:18:20,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-10 02:18:20,482 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:18:20,482 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:18:20,483 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:18:20,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:18:20,483 INFO L82 PathProgramCache]: Analyzing trace with hash 531358591, now seen corresponding path program 14 times [2019-09-10 02:18:20,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:18:20,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:20,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:18:20,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:18:20,487 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:18:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:18:20,712 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:18:20,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:20,712 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:18:20,713 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:18:20,713 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:18:20,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:18:20,713 INFO 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-10 02:18:20,724 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:18:20,724 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:20:28,721 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-10 02:20:28,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:20:29,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-10 02:20:29,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:20:29,181 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:20:29,181 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:20:51,986 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 188 refuted. 8 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:20:51,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:20:51,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 34 [2019-09-10 02:20:51,994 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:20:51,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 02:20:51,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 02:20:51,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=776, Unknown=9, NotChecked=0, Total=1122 [2019-09-10 02:20:51,995 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 18 states. [2019-09-10 02:20:52,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:20:52,411 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2019-09-10 02:20:52,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 02:20:52,411 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 42 [2019-09-10 02:20:52,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:20:52,412 INFO L225 Difference]: With dead ends: 59 [2019-09-10 02:20:52,412 INFO L226 Difference]: Without dead ends: 59 [2019-09-10 02:20:52,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 23.0s TimeCoverageRelationStatistics Valid=337, Invalid=776, Unknown=9, NotChecked=0, Total=1122 [2019-09-10 02:20:52,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-10 02:20:52,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2019-09-10 02:20:52,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-10 02:20:52,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-09-10 02:20:52,416 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 42 [2019-09-10 02:20:52,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:20:52,416 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-09-10 02:20:52,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 02:20:52,416 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-09-10 02:20:52,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-10 02:20:52,417 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:20:52,417 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:20:52,417 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:20:52,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:20:52,418 INFO L82 PathProgramCache]: Analyzing trace with hash 197017277, now seen corresponding path program 15 times [2019-09-10 02:20:52,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:20:52,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:20:52,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:20:52,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:20:52,419 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:20:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:20:52,646 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:20:52,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:20:52,646 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:20:52,646 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:20:52,647 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:20:52,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:20:52,647 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:20:52,657 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:20:52,657 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:20:52,673 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:20:52,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:20:52,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-10 02:20:52,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:20:52,712 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:20:52,712 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:20:53,290 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:20:53,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:20:53,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-09-10 02:20:53,294 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:20:53,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 02:20:53,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 02:20:53,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 02:20:53,295 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 19 states. [2019-09-10 02:20:53,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:20:53,721 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2019-09-10 02:20:53,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 02:20:53,722 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 44 [2019-09-10 02:20:53,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:20:53,723 INFO L225 Difference]: With dead ends: 61 [2019-09-10 02:20:53,723 INFO L226 Difference]: Without dead ends: 61 [2019-09-10 02:20:53,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 02:20:53,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-10 02:20:53,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2019-09-10 02:20:53,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-10 02:20:53,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-09-10 02:20:53,727 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 44 [2019-09-10 02:20:53,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:20:53,728 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-09-10 02:20:53,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 02:20:53,728 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-09-10 02:20:53,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-10 02:20:53,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:20:53,729 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:20:53,729 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:20:53,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:20:53,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1017561723, now seen corresponding path program 16 times [2019-09-10 02:20:53,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:20:53,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:20:53,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:20:53,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:20:53,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:20:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:20:53,962 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:20:53,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:20:53,962 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:20:53,962 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:20:53,962 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:20:53,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:20:53,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 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-10 02:20:53,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:20:53,974 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:20:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:20:53,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-10 02:20:53,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:20:54,030 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:20:54,031 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:20:54,848 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:20:54,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:20:54,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-09-10 02:20:54,852 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:20:54,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 02:20:54,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 02:20:54,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 02:20:54,853 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 20 states. [2019-09-10 02:20:55,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:20:55,314 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2019-09-10 02:20:55,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 02:20:55,314 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 46 [2019-09-10 02:20:55,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:20:55,315 INFO L225 Difference]: With dead ends: 63 [2019-09-10 02:20:55,315 INFO L226 Difference]: Without dead ends: 63 [2019-09-10 02:20:55,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 02:20:55,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-10 02:20:55,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 55. [2019-09-10 02:20:55,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-10 02:20:55,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-09-10 02:20:55,325 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 46 [2019-09-10 02:20:55,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:20:55,326 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-09-10 02:20:55,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 02:20:55,326 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-09-10 02:20:55,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-10 02:20:55,327 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:20:55,327 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:20:55,329 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:20:55,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:20:55,330 INFO L82 PathProgramCache]: Analyzing trace with hash -713208135, now seen corresponding path program 17 times [2019-09-10 02:20:55,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:20:55,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:20:55,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:20:55,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:20:55,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:20:55,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:20:55,614 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:20:55,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:20:55,615 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:20:55,615 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:20:55,615 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:20:55,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:20:55,615 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:20:55,639 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:20:55,639 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:22:52,102 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-10 02:22:52,102 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:22:52,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-10 02:22:52,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:22:52,340 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:22:52,340 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:22:53,158 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:22:53,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:22:53,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-09-10 02:22:53,168 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:22:53,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 02:22:53,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 02:22:53,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 02:22:53,169 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 21 states. [2019-09-10 02:22:53,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:22:53,731 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2019-09-10 02:22:53,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 02:22:53,731 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 48 [2019-09-10 02:22:53,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:22:53,732 INFO L225 Difference]: With dead ends: 65 [2019-09-10 02:22:53,732 INFO L226 Difference]: Without dead ends: 65 [2019-09-10 02:22:53,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 02:22:53,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-10 02:22:53,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2019-09-10 02:22:53,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-10 02:22:53,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2019-09-10 02:22:53,736 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 48 [2019-09-10 02:22:53,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:22:53,736 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2019-09-10 02:22:53,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 02:22:53,736 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2019-09-10 02:22:53,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-10 02:22:53,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:22:53,737 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:22:53,737 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:22:53,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:22:53,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1830698121, now seen corresponding path program 18 times [2019-09-10 02:22:53,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:22:53,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:22:53,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:22:53,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:22:53,739 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:22:53,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:22:54,040 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:22:54,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:22:54,040 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:22:54,041 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:22:54,041 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:22:54,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:22:54,041 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:22:54,070 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:22:54,071 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:22:54,090 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:22:54,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:22:54,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-10 02:22:54,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:22:54,156 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:22:54,156 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:22:55,030 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:22:55,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:22:55,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-09-10 02:22:55,033 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:22:55,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 02:22:55,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 02:22:55,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 02:22:55,034 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 22 states. [2019-09-10 02:22:55,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:22:55,628 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2019-09-10 02:22:55,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 02:22:55,628 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 50 [2019-09-10 02:22:55,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:22:55,629 INFO L225 Difference]: With dead ends: 67 [2019-09-10 02:22:55,629 INFO L226 Difference]: Without dead ends: 67 [2019-09-10 02:22:55,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 80 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-10 02:22:55,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-10 02:22:55,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 59. [2019-09-10 02:22:55,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-10 02:22:55,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-09-10 02:22:55,634 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 50 [2019-09-10 02:22:55,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:22:55,635 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-09-10 02:22:55,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 02:22:55,635 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-09-10 02:22:55,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-10 02:22:55,636 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:22:55,636 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:22:55,636 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:22:55,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:22:55,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1996750667, now seen corresponding path program 19 times [2019-09-10 02:22:55,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:22:55,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:22:55,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:22:55,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:22:55,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:22:55,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:22:56,056 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:22:56,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:22:56,056 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:22:56,057 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:22:56,057 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:22:56,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:22:56,057 INFO 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) [2019-09-10 02:22:56,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:22:56,070 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:22:56,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:22:56,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-10 02:22:56,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:22:56,132 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:22:56,132 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:22:56,964 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (20)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 02:22:56,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:22:56,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-09-10 02:22:56,969 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:22:56,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 02:22:56,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 02:22:56,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=1283, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 02:22:56,971 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 23 states. [2019-09-10 02:22:57,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:22:57,615 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2019-09-10 02:22:57,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 02:22:57,615 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 52 [2019-09-10 02:22:57,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:22:57,616 INFO L225 Difference]: With dead ends: 69 [2019-09-10 02:22:57,616 INFO L226 Difference]: Without dead ends: 69 [2019-09-10 02:22:57,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=523, Invalid=1283, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 02:22:57,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-10 02:22:57,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 61. [2019-09-10 02:22:57,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-10 02:22:57,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2019-09-10 02:22:57,619 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 52 [2019-09-10 02:22:57,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:22:57,620 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2019-09-10 02:22:57,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 02:22:57,620 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2019-09-10 02:22:57,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-10 02:22:57,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:22:57,620 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:22:57,621 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:22:57,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:22:57,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1635509875, now seen corresponding path program 20 times [2019-09-10 02:22:57,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:22:57,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:22:57,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:22:57,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:22:57,622 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:22:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:22:57,959 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:22:57,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:22:57,959 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:22:57,959 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:22:57,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:22:57,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:22:57,960 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:22:57,975 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:22:57,975 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:25:01,743 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-10 02:25:01,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:25:02,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-10 02:25:02,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:25:02,147 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:25:02,147 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:25:03,352 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:25:03,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:25:03,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-09-10 02:25:03,360 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:25:03,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 02:25:03,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 02:25:03,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=1410, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 02:25:03,362 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 24 states. [2019-09-10 02:25:04,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:25:04,082 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2019-09-10 02:25:04,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 02:25:04,084 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 54 [2019-09-10 02:25:04,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:25:04,085 INFO L225 Difference]: With dead ends: 71 [2019-09-10 02:25:04,085 INFO L226 Difference]: Without dead ends: 71 [2019-09-10 02:25:04,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=570, Invalid=1410, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 02:25:04,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-10 02:25:04,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 63. [2019-09-10 02:25:04,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-10 02:25:04,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-09-10 02:25:04,089 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 54 [2019-09-10 02:25:04,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:25:04,089 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-09-10 02:25:04,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 02:25:04,089 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-09-10 02:25:04,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 02:25:04,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:25:04,090 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:25:04,090 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:25:04,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:25:04,091 INFO L82 PathProgramCache]: Analyzing trace with hash 429479089, now seen corresponding path program 21 times [2019-09-10 02:25:04,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:25:04,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:25:04,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:25:04,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:25:04,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:25:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:25:04,540 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:25:04,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:25:04,541 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:25:04,541 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:25:04,541 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:25:04,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:25:04,542 INFO 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) [2019-09-10 02:25:04,569 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:25:04,569 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:25:04,591 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:25:04,592 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:25:04,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-10 02:25:04,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:25:04,668 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:25:04,668 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:25:05,987 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:25:05,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:25:05,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-09-10 02:25:05,993 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:25:05,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 02:25:05,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 02:25:05,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 02:25:05,996 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 25 states. [2019-09-10 02:25:06,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:25:06,771 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2019-09-10 02:25:06,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 02:25:06,771 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 56 [2019-09-10 02:25:06,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:25:06,773 INFO L225 Difference]: With dead ends: 73 [2019-09-10 02:25:06,773 INFO L226 Difference]: Without dead ends: 73 [2019-09-10 02:25:06,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 02:25:06,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-09-10 02:25:06,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 65. [2019-09-10 02:25:06,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-10 02:25:06,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-09-10 02:25:06,777 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 56 [2019-09-10 02:25:06,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:25:06,777 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-09-10 02:25:06,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 02:25:06,777 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-09-10 02:25:06,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 02:25:06,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:25:06,778 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:25:06,778 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:25:06,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:25:06,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1075063663, now seen corresponding path program 22 times [2019-09-10 02:25:06,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:25:06,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:25:06,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:25:06,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:25:06,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:25:06,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:25:07,157 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:25:07,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:25:07,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:25:07,158 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:25:07,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:25:07,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:25:07,159 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:25:07,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:25:07,170 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:25:07,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:25:07,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-10 02:25:07,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:25:07,228 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:25:07,228 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:25:08,333 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:25:08,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:25:08,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-09-10 02:25:08,336 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:25:08,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 02:25:08,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 02:25:08,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=670, Invalid=1682, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 02:25:08,338 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 26 states. [2019-09-10 02:25:09,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:25:09,172 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2019-09-10 02:25:09,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 02:25:09,173 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 58 [2019-09-10 02:25:09,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:25:09,174 INFO L225 Difference]: With dead ends: 75 [2019-09-10 02:25:09,175 INFO L226 Difference]: Without dead ends: 75 [2019-09-10 02:25:09,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=670, Invalid=1682, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 02:25:09,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-10 02:25:09,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2019-09-10 02:25:09,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-10 02:25:09,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-09-10 02:25:09,178 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 58 [2019-09-10 02:25:09,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:25:09,178 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-09-10 02:25:09,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 02:25:09,179 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-09-10 02:25:09,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 02:25:09,179 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:25:09,180 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:25:09,180 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:25:09,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:25:09,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1288418643, now seen corresponding path program 23 times [2019-09-10 02:25:09,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:25:09,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:25:09,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:25:09,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:25:09,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:25:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:25:09,669 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:25:09,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:25:09,669 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:25:09,669 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:25:09,669 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:25:09,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:25:09,670 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10 02:25:09,690 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:25:09,691 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:27:49,525 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-09-10 02:27:49,526 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:27:50,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-10 02:27:50,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:27:50,251 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:27:50,252 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:29:38,618 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-09-10 02:29:50,096 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 521 refuted. 8 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:29:50,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:29:50,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 27] total 52 [2019-09-10 02:29:50,107 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:29:50,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-10 02:29:50,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-10 02:29:50,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=751, Invalid=1857, Unknown=44, NotChecked=0, Total=2652 [2019-09-10 02:29:50,108 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 27 states. [2019-09-10 02:29:51,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:29:51,043 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2019-09-10 02:29:51,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 02:29:51,044 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 60 [2019-09-10 02:29:51,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:29:51,045 INFO L225 Difference]: With dead ends: 77 [2019-09-10 02:29:51,045 INFO L226 Difference]: Without dead ends: 77 [2019-09-10 02:29:51,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 93 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 120.3s TimeCoverageRelationStatistics Valid=751, Invalid=1857, Unknown=44, NotChecked=0, Total=2652 [2019-09-10 02:29:51,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-10 02:29:51,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 69. [2019-09-10 02:29:51,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-10 02:29:51,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-09-10 02:29:51,049 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 60 [2019-09-10 02:29:51,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:29:51,049 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-09-10 02:29:51,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-10 02:29:51,050 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-09-10 02:29:51,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-10 02:29:51,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:29:51,050 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:29:51,051 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:29:51,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:29:51,051 INFO L82 PathProgramCache]: Analyzing trace with hash -557215125, now seen corresponding path program 24 times [2019-09-10 02:29:51,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:29:51,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:29:51,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:29:51,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:29:51,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:29:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:29:51,500 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:29:51,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:29:51,500 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:29:51,500 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:29:51,501 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:29:51,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:29:51,501 INFO 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-10 02:29:51,511 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:29:51,511 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:29:51,531 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:29:51,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:29:51,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-10 02:29:51,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:29:51,594 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:29:51,594 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:29:52,964 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:29:52,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:29:52,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-09-10 02:29:52,967 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:29:52,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 02:29:52,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 02:29:52,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 02:29:52,970 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 28 states. [2019-09-10 02:29:53,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:29:53,977 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2019-09-10 02:29:53,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 02:29:53,977 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 62 [2019-09-10 02:29:53,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:29:53,978 INFO L225 Difference]: With dead ends: 79 [2019-09-10 02:29:53,979 INFO L226 Difference]: Without dead ends: 79 [2019-09-10 02:29:53,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 02:29:53,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-09-10 02:29:53,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 71. [2019-09-10 02:29:53,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-10 02:29:53,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-09-10 02:29:53,983 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 62 [2019-09-10 02:29:53,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:29:53,983 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-09-10 02:29:53,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 02:29:53,983 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-09-10 02:29:53,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 02:29:53,984 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:29:53,984 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:29:53,984 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:29:53,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:29:53,984 INFO L82 PathProgramCache]: Analyzing trace with hash 2049696425, now seen corresponding path program 25 times [2019-09-10 02:29:53,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:29:53,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:29:53,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:29:53,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:29:53,985 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:29:53,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:29:54,437 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:29:54,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:29:54,437 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:29:54,437 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:29:54,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:29:54,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:29:54,438 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10 02:29:54,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:29:54,448 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:29:54,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:29:54,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-10 02:29:54,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:29:54,519 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:29:54,519 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:29:56,359 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:29:56,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:29:56,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-09-10 02:29:56,363 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:29:56,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-10 02:29:56,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-10 02:29:56,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=835, Invalid=2135, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 02:29:56,364 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 29 states. [2019-09-10 02:29:57,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:29:57,436 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2019-09-10 02:29:57,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 02:29:57,436 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 64 [2019-09-10 02:29:57,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:29:57,437 INFO L225 Difference]: With dead ends: 81 [2019-09-10 02:29:57,437 INFO L226 Difference]: Without dead ends: 81 [2019-09-10 02:29:57,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=835, Invalid=2135, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 02:29:57,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-09-10 02:29:57,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 73. [2019-09-10 02:29:57,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-10 02:29:57,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2019-09-10 02:29:57,442 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 64 [2019-09-10 02:29:57,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:29:57,442 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2019-09-10 02:29:57,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-10 02:29:57,442 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2019-09-10 02:29:57,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 02:29:57,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:29:57,443 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:29:57,443 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:29:57,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:29:57,443 INFO L82 PathProgramCache]: Analyzing trace with hash -969204889, now seen corresponding path program 26 times [2019-09-10 02:29:57,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:29:57,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:29:57,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:29:57,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:29:57,444 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:29:57,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:29:58,027 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:29:58,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:29:58,028 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:29:58,028 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:29:58,028 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:29:58,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:29:58,029 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:29:58,048 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:29:58,049 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000