java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-invgen/fragtest_simple.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 20:52:02,297 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:52:02,299 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:52:02,311 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:52:02,311 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:52:02,312 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:52:02,313 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:52:02,315 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:52:02,316 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:52:02,317 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:52:02,318 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:52:02,319 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:52:02,320 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:52:02,320 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:52:02,321 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:52:02,322 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:52:02,323 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:52:02,324 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:52:02,326 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:52:02,328 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:52:02,329 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:52:02,330 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:52:02,331 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:52:02,332 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:52:02,334 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:52:02,334 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:52:02,334 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:52:02,335 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:52:02,335 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:52:02,336 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:52:02,337 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:52:02,337 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:52:02,338 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:52:02,339 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:52:02,340 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:52:02,340 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:52:02,340 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:52:02,341 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:52:02,341 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:52:02,342 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:52:02,342 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:52:02,343 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-03 20:52:02,357 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:52:02,358 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:52:02,358 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 20:52:02,358 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 20:52:02,359 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 20:52:02,359 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 20:52:02,359 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 20:52:02,359 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 20:52:02,360 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 20:52:02,360 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 20:52:02,360 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:52:02,361 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:52:02,361 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:52:02,361 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:52:02,361 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:52:02,361 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:52:02,362 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:52:02,362 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:52:02,362 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:52:02,362 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:52:02,362 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:52:02,363 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 20:52:02,363 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:52:02,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:52:02,363 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:52:02,363 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:52:02,364 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 20:52:02,364 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:52:02,364 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:52:02,364 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 20:52:02,391 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:52:02,403 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:52:02,407 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:52:02,408 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:52:02,408 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:52:02,409 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/fragtest_simple.i [2019-09-03 20:52:02,467 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e838c77cb/54f3f3b57bd341ef8ba78ad7acd4b237/FLAG9d6037a11 [2019-09-03 20:52:02,857 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:52:02,858 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/fragtest_simple.i [2019-09-03 20:52:02,864 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e838c77cb/54f3f3b57bd341ef8ba78ad7acd4b237/FLAG9d6037a11 [2019-09-03 20:52:03,288 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e838c77cb/54f3f3b57bd341ef8ba78ad7acd4b237 [2019-09-03 20:52:03,302 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:52:03,304 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:52:03,310 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:52:03,310 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:52:03,314 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:52:03,315 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:52:03" (1/1) ... [2019-09-03 20:52:03,317 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e03091e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:03, skipping insertion in model container [2019-09-03 20:52:03,318 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:52:03" (1/1) ... [2019-09-03 20:52:03,325 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:52:03,345 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:52:03,500 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:52:03,509 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:52:03,527 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:52:03,538 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:52:03,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:03 WrapperNode [2019-09-03 20:52:03,539 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:52:03,539 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:52:03,539 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:52:03,539 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:52:03,637 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:03" (1/1) ... [2019-09-03 20:52:03,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:03" (1/1) ... [2019-09-03 20:52:03,645 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:03" (1/1) ... [2019-09-03 20:52:03,646 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:03" (1/1) ... [2019-09-03 20:52:03,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:03" (1/1) ... [2019-09-03 20:52:03,660 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:03" (1/1) ... [2019-09-03 20:52:03,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:03" (1/1) ... [2019-09-03 20:52:03,663 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:52:03,663 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:52:03,663 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:52:03,663 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:52:03,664 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:52:03,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:52:03,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:52:03,711 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 20:52:03,711 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:52:03,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:52:03,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 20:52:03,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:52:03,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 20:52:03,711 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:52:03,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:52:03,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:52:03,915 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:52:03,916 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-03 20:52:03,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:52:03 BoogieIcfgContainer [2019-09-03 20:52:03,917 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:52:03,920 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:52:03,921 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:52:03,926 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:52:03,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:52:03" (1/3) ... [2019-09-03 20:52:03,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ea211a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:52:03, skipping insertion in model container [2019-09-03 20:52:03,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:52:03" (2/3) ... [2019-09-03 20:52:03,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ea211a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:52:03, skipping insertion in model container [2019-09-03 20:52:03,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:52:03" (3/3) ... [2019-09-03 20:52:03,930 INFO L109 eAbstractionObserver]: Analyzing ICFG fragtest_simple.i [2019-09-03 20:52:03,940 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:52:03,952 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 20:52:03,973 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 20:52:04,007 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:52:04,007 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 20:52:04,007 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:52:04,008 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:52:04,008 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:52:04,008 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:52:04,008 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:52:04,009 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:52:04,025 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-09-03 20:52:04,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-03 20:52:04,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:04,036 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:04,038 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:04,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:04,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1300308331, now seen corresponding path program 1 times [2019-09-03 20:52:04,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:04,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:04,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:04,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:04,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:04,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:04,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:04,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:04,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 20:52:04,162 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:04,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 20:52:04,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 20:52:04,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:52:04,178 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2019-09-03 20:52:04,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:04,191 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2019-09-03 20:52:04,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 20:52:04,193 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-09-03 20:52:04,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:04,200 INFO L225 Difference]: With dead ends: 27 [2019-09-03 20:52:04,200 INFO L226 Difference]: Without dead ends: 22 [2019-09-03 20:52:04,202 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:52:04,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-03 20:52:04,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-03 20:52:04,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-03 20:52:04,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-09-03 20:52:04,234 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 15 [2019-09-03 20:52:04,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:04,235 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-09-03 20:52:04,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 20:52:04,235 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-09-03 20:52:04,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 20:52:04,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:04,237 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:04,237 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:04,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:04,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1822971279, now seen corresponding path program 1 times [2019-09-03 20:52:04,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:04,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:04,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:04,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:04,241 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:04,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:04,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:04,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:04,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:52:04,342 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:04,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:52:04,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:52:04,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:52:04,346 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 5 states. [2019-09-03 20:52:04,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:04,419 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2019-09-03 20:52:04,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:52:04,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-03 20:52:04,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:04,421 INFO L225 Difference]: With dead ends: 29 [2019-09-03 20:52:04,421 INFO L226 Difference]: Without dead ends: 29 [2019-09-03 20:52:04,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:52:04,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-03 20:52:04,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-09-03 20:52:04,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-03 20:52:04,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-09-03 20:52:04,428 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 17 [2019-09-03 20:52:04,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:04,429 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-09-03 20:52:04,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:52:04,429 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-09-03 20:52:04,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-03 20:52:04,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:04,430 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:04,430 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:04,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:04,431 INFO L82 PathProgramCache]: Analyzing trace with hash -800300032, now seen corresponding path program 1 times [2019-09-03 20:52:04,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:04,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:04,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:04,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:04,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:04,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:04,521 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:04,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:04,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:52:04,522 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:04,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:52:04,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:52:04,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:52:04,524 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 5 states. [2019-09-03 20:52:04,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:04,597 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2019-09-03 20:52:04,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:52:04,598 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-09-03 20:52:04,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:04,601 INFO L225 Difference]: With dead ends: 39 [2019-09-03 20:52:04,601 INFO L226 Difference]: Without dead ends: 34 [2019-09-03 20:52:04,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:52:04,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-03 20:52:04,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2019-09-03 20:52:04,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-03 20:52:04,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-09-03 20:52:04,614 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 25 [2019-09-03 20:52:04,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:04,615 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-09-03 20:52:04,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:52:04,615 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-09-03 20:52:04,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-03 20:52:04,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:04,617 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:04,617 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:04,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:04,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1153269339, now seen corresponding path program 1 times [2019-09-03 20:52:04,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:04,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:04,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:04,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:04,619 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:04,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:04,728 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:04,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:04,729 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:04,730 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2019-09-03 20:52:04,732 INFO L207 CegarAbsIntRunner]: [0], [4], [9], [12], [20], [24], [29], [32], [34], [38], [47], [49], [54], [60], [63], [65], [68], [70], [71], [72], [73], [75], [76] [2019-09-03 20:52:04,764 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:52:04,764 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:52:05,027 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:52:05,030 INFO L272 AbstractInterpreter]: Visited 23 different actions 151 times. Merged at 8 different actions 61 times. Widened at 3 different actions 9 times. Performed 319 root evaluator evaluations with a maximum evaluation depth of 6. Performed 319 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 7 fixpoints after 3 different actions. Largest state had 9 variables. [2019-09-03 20:52:05,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:05,036 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:52:05,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:05,036 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:05,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:05,054 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:52:05,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:05,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-03 20:52:05,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:05,181 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:05,181 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:05,255 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:05,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:05,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2019-09-03 20:52:05,260 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:05,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 20:52:05,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 20:52:05,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:52:05,273 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 10 states. [2019-09-03 20:52:05,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:05,501 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2019-09-03 20:52:05,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 20:52:05,502 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-09-03 20:52:05,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:05,503 INFO L225 Difference]: With dead ends: 54 [2019-09-03 20:52:05,503 INFO L226 Difference]: Without dead ends: 49 [2019-09-03 20:52:05,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-09-03 20:52:05,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-03 20:52:05,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 40. [2019-09-03 20:52:05,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-03 20:52:05,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2019-09-03 20:52:05,512 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 27 [2019-09-03 20:52:05,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:05,512 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2019-09-03 20:52:05,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 20:52:05,512 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2019-09-03 20:52:05,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-03 20:52:05,513 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:05,514 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:05,514 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:05,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:05,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1962487163, now seen corresponding path program 2 times [2019-09-03 20:52:05,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:05,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:05,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:05,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:05,518 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:05,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:05,622 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:52:05,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:05,622 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:05,623 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:05,623 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:05,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:05,623 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:05,647 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:05,648 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:52:05,675 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 20:52:05,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:05,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 20:52:05,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:05,754 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:52:05,755 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:05,797 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:52:05,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:05,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 11 [2019-09-03 20:52:05,802 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:05,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 20:52:05,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 20:52:05,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:52:05,803 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 11 states. [2019-09-03 20:52:05,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:05,914 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2019-09-03 20:52:05,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:52:05,915 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2019-09-03 20:52:05,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:05,918 INFO L225 Difference]: With dead ends: 63 [2019-09-03 20:52:05,918 INFO L226 Difference]: Without dead ends: 54 [2019-09-03 20:52:05,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 67 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-09-03 20:52:05,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-03 20:52:05,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 42. [2019-09-03 20:52:05,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-03 20:52:05,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-09-03 20:52:05,933 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 37 [2019-09-03 20:52:05,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:05,933 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-09-03 20:52:05,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 20:52:05,934 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-09-03 20:52:05,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-03 20:52:05,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:05,938 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:05,938 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:05,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:05,938 INFO L82 PathProgramCache]: Analyzing trace with hash 824114080, now seen corresponding path program 3 times [2019-09-03 20:52:05,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:05,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:05,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:05,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:05,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:05,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:06,076 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:52:06,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:06,077 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:06,077 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:06,078 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:06,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:06,078 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:52:06,107 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:06,108 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:06,137 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:06,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:06,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 20:52:06,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:06,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:52:06,200 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:52:06,200 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:06,256 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:52:06,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:06,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 12 [2019-09-03 20:52:06,260 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:06,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 20:52:06,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 20:52:06,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:52:06,262 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 11 states. [2019-09-03 20:52:06,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:06,403 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2019-09-03 20:52:06,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 20:52:06,403 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2019-09-03 20:52:06,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:06,405 INFO L225 Difference]: With dead ends: 59 [2019-09-03 20:52:06,405 INFO L226 Difference]: Without dead ends: 59 [2019-09-03 20:52:06,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 73 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-09-03 20:52:06,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-03 20:52:06,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 54. [2019-09-03 20:52:06,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-03 20:52:06,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-09-03 20:52:06,412 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 39 [2019-09-03 20:52:06,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:06,412 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-09-03 20:52:06,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 20:52:06,413 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-09-03 20:52:06,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-03 20:52:06,415 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:06,415 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:06,415 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:06,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:06,416 INFO L82 PathProgramCache]: Analyzing trace with hash 434754946, now seen corresponding path program 4 times [2019-09-03 20:52:06,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:06,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:06,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:06,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:06,417 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:06,527 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 38 proven. 12 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-03 20:52:06,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:06,527 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:06,527 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:06,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:06,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:06,528 INFO 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:06,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:06,538 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:52:06,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:06,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 20:52:06,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:06,664 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 48 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-03 20:52:06,664 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:06,728 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 38 proven. 12 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-03 20:52:06,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:06,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 14 [2019-09-03 20:52:06,732 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:06,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 20:52:06,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 20:52:06,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-09-03 20:52:06,736 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 14 states. [2019-09-03 20:52:06,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:06,890 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2019-09-03 20:52:06,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 20:52:06,891 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2019-09-03 20:52:06,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:06,892 INFO L225 Difference]: With dead ends: 85 [2019-09-03 20:52:06,892 INFO L226 Difference]: Without dead ends: 72 [2019-09-03 20:52:06,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 100 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-09-03 20:52:06,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-03 20:52:06,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 56. [2019-09-03 20:52:06,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-03 20:52:06,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-09-03 20:52:06,899 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 55 [2019-09-03 20:52:06,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:06,899 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-09-03 20:52:06,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 20:52:06,900 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2019-09-03 20:52:06,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-03 20:52:06,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:06,901 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:06,901 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:06,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:06,902 INFO L82 PathProgramCache]: Analyzing trace with hash -887602073, now seen corresponding path program 5 times [2019-09-03 20:52:06,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:06,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:06,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:06,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:06,903 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:06,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:06,976 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 28 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 20:52:06,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:06,976 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:06,976 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:06,976 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:06,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:06,977 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:06,987 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:06,988 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:52:07,019 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-03 20:52:07,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:07,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 20:52:07,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:07,157 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 40 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 20:52:07,158 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:07,307 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 40 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 20:52:07,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:07,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 24 [2019-09-03 20:52:07,311 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:07,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 20:52:07,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 20:52:07,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2019-09-03 20:52:07,312 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 19 states. [2019-09-03 20:52:07,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:07,753 INFO L93 Difference]: Finished difference Result 104 states and 122 transitions. [2019-09-03 20:52:07,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 20:52:07,754 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 57 [2019-09-03 20:52:07,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:07,756 INFO L225 Difference]: With dead ends: 104 [2019-09-03 20:52:07,756 INFO L226 Difference]: Without dead ends: 87 [2019-09-03 20:52:07,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 104 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=275, Invalid=1207, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 20:52:07,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-09-03 20:52:07,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 66. [2019-09-03 20:52:07,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-03 20:52:07,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-09-03 20:52:07,764 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 57 [2019-09-03 20:52:07,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:07,764 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-09-03 20:52:07,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 20:52:07,764 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-09-03 20:52:07,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-03 20:52:07,765 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:07,766 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:07,766 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:07,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:07,766 INFO L82 PathProgramCache]: Analyzing trace with hash 230477693, now seen corresponding path program 6 times [2019-09-03 20:52:07,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:07,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:07,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:07,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:07,768 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:07,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:07,851 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 40 proven. 50 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 20:52:07,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:07,852 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:07,852 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:07,852 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:07,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:07,852 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 20:52:07,869 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:07,869 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:52:07,896 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:07,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:07,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 20:52:07,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:08,106 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 60 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 20:52:08,106 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:08,304 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 60 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:52:08,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:08,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 14] total 28 [2019-09-03 20:52:08,309 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:08,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 20:52:08,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 20:52:08,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2019-09-03 20:52:08,310 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 22 states. [2019-09-03 20:52:08,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:08,764 INFO L93 Difference]: Finished difference Result 122 states and 143 transitions. [2019-09-03 20:52:08,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-03 20:52:08,764 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2019-09-03 20:52:08,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:08,766 INFO L225 Difference]: With dead ends: 122 [2019-09-03 20:52:08,766 INFO L226 Difference]: Without dead ends: 101 [2019-09-03 20:52:08,767 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 122 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=374, Invalid=1696, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 20:52:08,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-09-03 20:52:08,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 76. [2019-09-03 20:52:08,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-03 20:52:08,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2019-09-03 20:52:08,774 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 67 [2019-09-03 20:52:08,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:08,775 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2019-09-03 20:52:08,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 20:52:08,775 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2019-09-03 20:52:08,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-03 20:52:08,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:08,776 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:08,776 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:08,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:08,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1711924653, now seen corresponding path program 7 times [2019-09-03 20:52:08,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:08,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:08,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:08,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:08,778 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:08,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:08,873 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 54 proven. 72 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:52:08,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:08,873 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:08,874 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:08,874 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:08,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:08,874 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:08,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:08,889 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:52:08,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:08,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 20:52:08,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:09,181 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 84 proven. 42 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:52:09,181 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:09,436 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 84 proven. 42 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:52:09,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:09,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 16] total 32 [2019-09-03 20:52:09,445 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:09,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 20:52:09,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 20:52:09,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=819, Unknown=0, NotChecked=0, Total=992 [2019-09-03 20:52:09,447 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 25 states. [2019-09-03 20:52:10,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:10,042 INFO L93 Difference]: Finished difference Result 140 states and 164 transitions. [2019-09-03 20:52:10,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-03 20:52:10,043 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 77 [2019-09-03 20:52:10,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:10,045 INFO L225 Difference]: With dead ends: 140 [2019-09-03 20:52:10,045 INFO L226 Difference]: Without dead ends: 115 [2019-09-03 20:52:10,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 140 SyntacticMatches, 7 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=488, Invalid=2268, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 20:52:10,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-09-03 20:52:10,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 86. [2019-09-03 20:52:10,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-09-03 20:52:10,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2019-09-03 20:52:10,054 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 77 [2019-09-03 20:52:10,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:10,055 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2019-09-03 20:52:10,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 20:52:10,055 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2019-09-03 20:52:10,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-03 20:52:10,056 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:10,056 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:10,057 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:10,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:10,057 INFO L82 PathProgramCache]: Analyzing trace with hash -252693271, now seen corresponding path program 8 times [2019-09-03 20:52:10,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:10,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:10,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:10,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:10,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:10,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:10,187 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 70 proven. 98 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:52:10,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:10,187 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:10,187 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:10,188 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:10,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:10,188 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:10,204 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:10,204 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:52:10,245 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-03 20:52:10,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:10,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 20:52:10,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:10,501 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 112 proven. 56 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:52:10,502 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:10,790 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 112 proven. 56 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:52:10,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:10,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 18] total 36 [2019-09-03 20:52:10,793 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:10,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 20:52:10,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 20:52:10,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1043, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 20:52:10,795 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand 28 states. [2019-09-03 20:52:11,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:11,484 INFO L93 Difference]: Finished difference Result 158 states and 185 transitions. [2019-09-03 20:52:11,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-03 20:52:11,484 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 87 [2019-09-03 20:52:11,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:11,486 INFO L225 Difference]: With dead ends: 158 [2019-09-03 20:52:11,487 INFO L226 Difference]: Without dead ends: 129 [2019-09-03 20:52:11,488 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 158 SyntacticMatches, 8 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 955 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=617, Invalid=2923, Unknown=0, NotChecked=0, Total=3540 [2019-09-03 20:52:11,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-09-03 20:52:11,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 96. [2019-09-03 20:52:11,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-03 20:52:11,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2019-09-03 20:52:11,495 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 87 [2019-09-03 20:52:11,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:11,496 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2019-09-03 20:52:11,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 20:52:11,496 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2019-09-03 20:52:11,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-03 20:52:11,497 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:11,498 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:11,498 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:11,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:11,498 INFO L82 PathProgramCache]: Analyzing trace with hash -482136257, now seen corresponding path program 9 times [2019-09-03 20:52:11,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:11,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:11,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:11,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:11,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:11,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:11,632 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 88 proven. 128 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:52:11,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:11,632 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:11,632 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:11,632 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:11,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:11,633 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:11,643 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:11,644 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:52:11,680 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:11,680 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:11,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 20:52:11,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:11,988 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 144 proven. 72 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 20:52:11,988 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:12,276 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 144 proven. 72 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:52:12,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:12,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 20, 20] total 40 [2019-09-03 20:52:12,281 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:12,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 20:52:12,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 20:52:12,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=1294, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 20:52:12,283 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand 31 states. [2019-09-03 20:52:13,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:13,145 INFO L93 Difference]: Finished difference Result 176 states and 206 transitions. [2019-09-03 20:52:13,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-03 20:52:13,148 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 97 [2019-09-03 20:52:13,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:13,150 INFO L225 Difference]: With dead ends: 176 [2019-09-03 20:52:13,150 INFO L226 Difference]: Without dead ends: 143 [2019-09-03 20:52:13,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 176 SyntacticMatches, 9 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1231 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=761, Invalid=3661, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 20:52:13,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-09-03 20:52:13,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 106. [2019-09-03 20:52:13,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-09-03 20:52:13,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 110 transitions. [2019-09-03 20:52:13,160 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 110 transitions. Word has length 97 [2019-09-03 20:52:13,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:13,161 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 110 transitions. [2019-09-03 20:52:13,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 20:52:13,161 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2019-09-03 20:52:13,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-03 20:52:13,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:13,163 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:13,163 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:13,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:13,163 INFO L82 PathProgramCache]: Analyzing trace with hash -101508779, now seen corresponding path program 10 times [2019-09-03 20:52:13,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:13,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:13,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:13,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:13,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:13,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:13,343 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 108 proven. 162 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:52:13,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:13,343 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:13,344 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:13,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:13,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:13,344 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:52:13,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:13,368 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:13,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:13,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 20:52:13,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:13,775 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 180 proven. 90 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:52:13,776 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:14,180 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 180 proven. 90 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:52:14,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:14,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 22, 22] total 44 [2019-09-03 20:52:14,193 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:14,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-03 20:52:14,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-03 20:52:14,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=1572, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 20:52:14,195 INFO L87 Difference]: Start difference. First operand 106 states and 110 transitions. Second operand 34 states. [2019-09-03 20:52:15,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:15,170 INFO L93 Difference]: Finished difference Result 194 states and 227 transitions. [2019-09-03 20:52:15,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-03 20:52:15,171 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 107 [2019-09-03 20:52:15,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:15,173 INFO L225 Difference]: With dead ends: 194 [2019-09-03 20:52:15,173 INFO L226 Difference]: Without dead ends: 157 [2019-09-03 20:52:15,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 194 SyntacticMatches, 10 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1542 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=920, Invalid=4482, Unknown=0, NotChecked=0, Total=5402 [2019-09-03 20:52:15,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-09-03 20:52:15,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 116. [2019-09-03 20:52:15,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-09-03 20:52:15,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 120 transitions. [2019-09-03 20:52:15,182 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 120 transitions. Word has length 107 [2019-09-03 20:52:15,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:15,182 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 120 transitions. [2019-09-03 20:52:15,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-03 20:52:15,183 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 120 transitions. [2019-09-03 20:52:15,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-03 20:52:15,184 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:15,184 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:15,185 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:15,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:15,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1620049109, now seen corresponding path program 11 times [2019-09-03 20:52:15,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:15,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:15,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:15,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:15,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:15,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:15,326 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 130 proven. 200 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:52:15,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:15,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:15,327 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:15,327 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:15,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:15,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:15,345 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:15,346 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:52:15,395 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-03 20:52:15,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:15,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 20:52:15,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:15,855 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 220 proven. 110 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:52:15,856 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:16,346 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 220 proven. 110 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 20:52:16,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:16,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 24, 24] total 48 [2019-09-03 20:52:16,350 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:16,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 20:52:16,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 20:52:16,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1877, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 20:52:16,352 INFO L87 Difference]: Start difference. First operand 116 states and 120 transitions. Second operand 37 states. [2019-09-03 20:52:17,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:17,396 INFO L93 Difference]: Finished difference Result 212 states and 248 transitions. [2019-09-03 20:52:17,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-03 20:52:17,396 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 117 [2019-09-03 20:52:17,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:17,399 INFO L225 Difference]: With dead ends: 212 [2019-09-03 20:52:17,399 INFO L226 Difference]: Without dead ends: 171 [2019-09-03 20:52:17,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 212 SyntacticMatches, 11 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1888 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1094, Invalid=5386, Unknown=0, NotChecked=0, Total=6480 [2019-09-03 20:52:17,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-09-03 20:52:17,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 126. [2019-09-03 20:52:17,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-09-03 20:52:17,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 130 transitions. [2019-09-03 20:52:17,408 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 130 transitions. Word has length 117 [2019-09-03 20:52:17,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:17,409 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 130 transitions. [2019-09-03 20:52:17,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 20:52:17,409 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2019-09-03 20:52:17,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-03 20:52:17,411 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:17,411 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:17,411 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:17,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:17,412 INFO L82 PathProgramCache]: Analyzing trace with hash 144047297, now seen corresponding path program 12 times [2019-09-03 20:52:17,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:17,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:17,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:17,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:17,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:17,625 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 154 proven. 242 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:52:17,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:17,625 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:17,625 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:17,626 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:17,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:17,626 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:52:17,654 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:17,654 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:17,702 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:17,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:17,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 20:52:17,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:18,270 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 264 proven. 132 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:52:18,270 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:18,707 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 264 proven. 132 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 20:52:18,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:18,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 26, 26] total 52 [2019-09-03 20:52:18,711 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:18,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-03 20:52:18,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-03 20:52:18,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=443, Invalid=2209, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:52:18,713 INFO L87 Difference]: Start difference. First operand 126 states and 130 transitions. Second operand 40 states. [2019-09-03 20:52:19,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:19,894 INFO L93 Difference]: Finished difference Result 230 states and 269 transitions. [2019-09-03 20:52:19,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-03 20:52:19,895 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 127 [2019-09-03 20:52:19,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:19,896 INFO L225 Difference]: With dead ends: 230 [2019-09-03 20:52:19,896 INFO L226 Difference]: Without dead ends: 185 [2019-09-03 20:52:19,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 230 SyntacticMatches, 12 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2269 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1283, Invalid=6373, Unknown=0, NotChecked=0, Total=7656 [2019-09-03 20:52:19,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-03 20:52:19,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 136. [2019-09-03 20:52:19,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-09-03 20:52:19,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 140 transitions. [2019-09-03 20:52:19,905 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 140 transitions. Word has length 127 [2019-09-03 20:52:19,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:19,907 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 140 transitions. [2019-09-03 20:52:19,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-03 20:52:19,907 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 140 transitions. [2019-09-03 20:52:19,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-03 20:52:19,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:19,909 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:19,909 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:19,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:19,909 INFO L82 PathProgramCache]: Analyzing trace with hash -575859177, now seen corresponding path program 13 times [2019-09-03 20:52:19,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:19,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:19,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:19,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:19,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:20,073 INFO L134 CoverageAnalysis]: Checked inductivity of 732 backedges. 180 proven. 288 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:52:20,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:20,074 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:20,074 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:20,074 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:20,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:20,074 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:20,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:20,084 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:52:20,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:20,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 20:52:20,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:20,616 INFO L134 CoverageAnalysis]: Checked inductivity of 732 backedges. 312 proven. 156 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:52:20,617 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:21,110 INFO L134 CoverageAnalysis]: Checked inductivity of 732 backedges. 312 proven. 156 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-03 20:52:21,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:21,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 28, 28] total 56 [2019-09-03 20:52:21,113 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:21,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-03 20:52:21,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-03 20:52:21,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=512, Invalid=2568, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 20:52:21,115 INFO L87 Difference]: Start difference. First operand 136 states and 140 transitions. Second operand 43 states. [2019-09-03 20:52:22,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:22,621 INFO L93 Difference]: Finished difference Result 248 states and 290 transitions. [2019-09-03 20:52:22,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-03 20:52:22,622 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 137 [2019-09-03 20:52:22,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:22,624 INFO L225 Difference]: With dead ends: 248 [2019-09-03 20:52:22,624 INFO L226 Difference]: Without dead ends: 199 [2019-09-03 20:52:22,627 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 248 SyntacticMatches, 13 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2685 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1487, Invalid=7443, Unknown=0, NotChecked=0, Total=8930 [2019-09-03 20:52:22,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-09-03 20:52:22,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 146. [2019-09-03 20:52:22,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-09-03 20:52:22,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 150 transitions. [2019-09-03 20:52:22,633 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 150 transitions. Word has length 137 [2019-09-03 20:52:22,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:22,633 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 150 transitions. [2019-09-03 20:52:22,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-03 20:52:22,634 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 150 transitions. [2019-09-03 20:52:22,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-03 20:52:22,635 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:22,635 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:22,635 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:22,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:22,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1553375443, now seen corresponding path program 14 times [2019-09-03 20:52:22,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:22,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:22,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:22,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:22,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:22,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:22,818 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 208 proven. 338 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:52:22,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:22,819 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:22,819 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:22,819 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:22,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:22,819 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:52:22,854 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:22,855 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:22,918 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-03 20:52:22,918 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:22,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 20:52:22,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:23,523 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 364 proven. 182 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:52:23,523 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:24,112 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 364 proven. 182 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 20:52:24,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:24,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 30, 30] total 60 [2019-09-03 20:52:24,115 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:24,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-03 20:52:24,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-03 20:52:24,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=586, Invalid=2954, Unknown=0, NotChecked=0, Total=3540 [2019-09-03 20:52:24,117 INFO L87 Difference]: Start difference. First operand 146 states and 150 transitions. Second operand 46 states. [2019-09-03 20:52:25,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:25,451 INFO L93 Difference]: Finished difference Result 266 states and 311 transitions. [2019-09-03 20:52:25,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-03 20:52:25,451 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 147 [2019-09-03 20:52:25,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:25,453 INFO L225 Difference]: With dead ends: 266 [2019-09-03 20:52:25,453 INFO L226 Difference]: Without dead ends: 213 [2019-09-03 20:52:25,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 266 SyntacticMatches, 14 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3136 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1706, Invalid=8596, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:52:25,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-03 20:52:25,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 156. [2019-09-03 20:52:25,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-09-03 20:52:25,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 160 transitions. [2019-09-03 20:52:25,466 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 160 transitions. Word has length 147 [2019-09-03 20:52:25,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:25,467 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 160 transitions. [2019-09-03 20:52:25,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-03 20:52:25,467 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 160 transitions. [2019-09-03 20:52:25,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-03 20:52:25,468 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:25,468 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:25,469 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:25,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:25,469 INFO L82 PathProgramCache]: Analyzing trace with hash -471144445, now seen corresponding path program 15 times [2019-09-03 20:52:25,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:25,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:25,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:25,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:25,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:25,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:25,739 INFO L134 CoverageAnalysis]: Checked inductivity of 994 backedges. 238 proven. 392 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:52:25,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:25,740 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:25,740 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:25,740 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:25,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:25,740 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:25,750 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:25,750 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:52:25,804 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:25,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:25,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 20:52:25,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:26,386 INFO L134 CoverageAnalysis]: Checked inductivity of 994 backedges. 420 proven. 210 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:52:26,386 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:27,021 INFO L134 CoverageAnalysis]: Checked inductivity of 994 backedges. 420 proven. 210 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 20:52:27,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:27,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 32, 32] total 64 [2019-09-03 20:52:27,025 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:27,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-03 20:52:27,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-03 20:52:27,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=665, Invalid=3367, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 20:52:27,027 INFO L87 Difference]: Start difference. First operand 156 states and 160 transitions. Second operand 49 states. [2019-09-03 20:52:28,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:28,560 INFO L93 Difference]: Finished difference Result 284 states and 332 transitions. [2019-09-03 20:52:28,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-03 20:52:28,560 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 157 [2019-09-03 20:52:28,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:28,563 INFO L225 Difference]: With dead ends: 284 [2019-09-03 20:52:28,563 INFO L226 Difference]: Without dead ends: 227 [2019-09-03 20:52:28,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 284 SyntacticMatches, 15 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3622 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1940, Invalid=9832, Unknown=0, NotChecked=0, Total=11772 [2019-09-03 20:52:28,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-09-03 20:52:28,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 166. [2019-09-03 20:52:28,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-09-03 20:52:28,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 170 transitions. [2019-09-03 20:52:28,571 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 170 transitions. Word has length 157 [2019-09-03 20:52:28,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:28,572 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 170 transitions. [2019-09-03 20:52:28,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-03 20:52:28,572 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 170 transitions. [2019-09-03 20:52:28,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-03 20:52:28,573 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:28,573 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:28,574 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:28,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:28,574 INFO L82 PathProgramCache]: Analyzing trace with hash 398311577, now seen corresponding path program 16 times [2019-09-03 20:52:28,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:28,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:28,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:28,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:28,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:28,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:28,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1140 backedges. 270 proven. 450 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:52:28,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:28,794 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:28,794 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:28,794 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:28,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:28,794 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:28,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:28,805 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:52:28,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:28,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 20:52:28,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:29,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1140 backedges. 480 proven. 240 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:52:29,548 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:30,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1140 backedges. 480 proven. 240 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-03 20:52:30,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:30,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 34, 34] total 68 [2019-09-03 20:52:30,376 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:30,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-03 20:52:30,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-03 20:52:30,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=749, Invalid=3807, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 20:52:30,380 INFO L87 Difference]: Start difference. First operand 166 states and 170 transitions. Second operand 52 states. [2019-09-03 20:52:32,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:32,191 INFO L93 Difference]: Finished difference Result 302 states and 353 transitions. [2019-09-03 20:52:32,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-03 20:52:32,192 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 167 [2019-09-03 20:52:32,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:32,193 INFO L225 Difference]: With dead ends: 302 [2019-09-03 20:52:32,194 INFO L226 Difference]: Without dead ends: 241 [2019-09-03 20:52:32,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 302 SyntacticMatches, 16 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4143 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2189, Invalid=11151, Unknown=0, NotChecked=0, Total=13340 [2019-09-03 20:52:32,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-09-03 20:52:32,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 176. [2019-09-03 20:52:32,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-09-03 20:52:32,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 180 transitions. [2019-09-03 20:52:32,202 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 180 transitions. Word has length 167 [2019-09-03 20:52:32,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:32,203 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 180 transitions. [2019-09-03 20:52:32,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-03 20:52:32,203 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 180 transitions. [2019-09-03 20:52:32,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-03 20:52:32,204 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:32,204 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:32,204 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:32,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:32,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1322907887, now seen corresponding path program 17 times [2019-09-03 20:52:32,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:32,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:32,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:32,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:32,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:32,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:32,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 304 proven. 512 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:52:32,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:32,451 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:32,451 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:32,451 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:32,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:32,452 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:32,470 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:32,470 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:52:32,541 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-03 20:52:32,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:32,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 20:52:32,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:33,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 544 proven. 272 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:52:33,260 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:34,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 544 proven. 272 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 20:52:34,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:34,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 36, 36] total 72 [2019-09-03 20:52:34,082 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:34,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-03 20:52:34,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-03 20:52:34,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=838, Invalid=4274, Unknown=0, NotChecked=0, Total=5112 [2019-09-03 20:52:34,083 INFO L87 Difference]: Start difference. First operand 176 states and 180 transitions. Second operand 55 states. [2019-09-03 20:52:36,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:36,015 INFO L93 Difference]: Finished difference Result 320 states and 374 transitions. [2019-09-03 20:52:36,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-03 20:52:36,023 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 177 [2019-09-03 20:52:36,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:36,025 INFO L225 Difference]: With dead ends: 320 [2019-09-03 20:52:36,026 INFO L226 Difference]: Without dead ends: 255 [2019-09-03 20:52:36,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 320 SyntacticMatches, 17 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4699 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2453, Invalid=12553, Unknown=0, NotChecked=0, Total=15006 [2019-09-03 20:52:36,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-09-03 20:52:36,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 186. [2019-09-03 20:52:36,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-09-03 20:52:36,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 190 transitions. [2019-09-03 20:52:36,039 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 190 transitions. Word has length 177 [2019-09-03 20:52:36,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:36,039 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 190 transitions. [2019-09-03 20:52:36,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-03 20:52:36,040 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 190 transitions. [2019-09-03 20:52:36,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-03 20:52:36,043 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:36,044 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:36,044 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:36,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:36,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1717329659, now seen corresponding path program 18 times [2019-09-03 20:52:36,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:36,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:36,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:36,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:36,046 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:36,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:36,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1462 backedges. 340 proven. 578 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:52:36,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:36,404 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:36,404 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:36,404 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:36,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:36,404 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:36,429 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:36,429 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:52:36,503 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:36,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:36,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 20:52:36,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:37,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1462 backedges. 612 proven. 306 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:52:37,462 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:38,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1462 backedges. 612 proven. 306 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-03 20:52:38,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:38,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 38, 38] total 76 [2019-09-03 20:52:38,301 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:38,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-03 20:52:38,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-03 20:52:38,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=932, Invalid=4768, Unknown=0, NotChecked=0, Total=5700 [2019-09-03 20:52:38,302 INFO L87 Difference]: Start difference. First operand 186 states and 190 transitions. Second operand 58 states. [2019-09-03 20:52:40,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:40,374 INFO L93 Difference]: Finished difference Result 338 states and 395 transitions. [2019-09-03 20:52:40,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-03 20:52:40,374 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 187 [2019-09-03 20:52:40,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:40,376 INFO L225 Difference]: With dead ends: 338 [2019-09-03 20:52:40,376 INFO L226 Difference]: Without dead ends: 269 [2019-09-03 20:52:40,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 338 SyntacticMatches, 18 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5290 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2732, Invalid=14038, Unknown=0, NotChecked=0, Total=16770 [2019-09-03 20:52:40,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-09-03 20:52:40,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 196. [2019-09-03 20:52:40,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-09-03 20:52:40,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 200 transitions. [2019-09-03 20:52:40,389 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 200 transitions. Word has length 187 [2019-09-03 20:52:40,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:40,389 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 200 transitions. [2019-09-03 20:52:40,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-03 20:52:40,390 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 200 transitions. [2019-09-03 20:52:40,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-03 20:52:40,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:40,391 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:40,392 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:40,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:40,392 INFO L82 PathProgramCache]: Analyzing trace with hash 837470427, now seen corresponding path program 19 times [2019-09-03 20:52:40,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:40,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:40,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:40,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:40,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:40,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:40,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1638 backedges. 378 proven. 648 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 20:52:40,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:40,713 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:40,713 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:40,713 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:40,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:40,714 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:40,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:40,726 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:52:40,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:40,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 20:52:40,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:41,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1638 backedges. 684 proven. 342 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 20:52:41,675 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:42,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1638 backedges. 684 proven. 342 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-03 20:52:42,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:42,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 40, 40] total 80 [2019-09-03 20:52:42,621 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:42,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-03 20:52:42,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-03 20:52:42,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1031, Invalid=5289, Unknown=0, NotChecked=0, Total=6320 [2019-09-03 20:52:42,623 INFO L87 Difference]: Start difference. First operand 196 states and 200 transitions. Second operand 61 states. [2019-09-03 20:52:44,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:44,804 INFO L93 Difference]: Finished difference Result 356 states and 416 transitions. [2019-09-03 20:52:44,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-09-03 20:52:44,806 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 197 [2019-09-03 20:52:44,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:44,809 INFO L225 Difference]: With dead ends: 356 [2019-09-03 20:52:44,809 INFO L226 Difference]: Without dead ends: 283 [2019-09-03 20:52:44,810 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 356 SyntacticMatches, 19 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5916 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3026, Invalid=15606, Unknown=0, NotChecked=0, Total=18632 [2019-09-03 20:52:44,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-09-03 20:52:44,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 206. [2019-09-03 20:52:44,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-03 20:52:44,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 210 transitions. [2019-09-03 20:52:44,818 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 210 transitions. Word has length 197 [2019-09-03 20:52:44,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:44,818 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 210 transitions. [2019-09-03 20:52:44,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-03 20:52:44,818 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 210 transitions. [2019-09-03 20:52:44,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-03 20:52:44,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:44,820 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:44,820 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:44,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:44,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1676378225, now seen corresponding path program 20 times [2019-09-03 20:52:44,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:44,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:44,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:44,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:44,821 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:44,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:45,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1824 backedges. 418 proven. 722 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 20:52:45,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:45,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:45,112 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:45,112 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:45,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:45,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:45,123 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:52:45,123 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:52:45,211 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-09-03 20:52:45,212 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:45,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 20:52:45,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:46,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1824 backedges. 760 proven. 380 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 20:52:46,263 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:47,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1824 backedges. 760 proven. 380 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-03 20:52:47,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:47,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 42, 42] total 84 [2019-09-03 20:52:47,278 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:47,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-03 20:52:47,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-03 20:52:47,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1135, Invalid=5837, Unknown=0, NotChecked=0, Total=6972 [2019-09-03 20:52:47,279 INFO L87 Difference]: Start difference. First operand 206 states and 210 transitions. Second operand 64 states. [2019-09-03 20:52:49,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:49,629 INFO L93 Difference]: Finished difference Result 374 states and 437 transitions. [2019-09-03 20:52:49,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-03 20:52:49,630 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 207 [2019-09-03 20:52:49,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:49,632 INFO L225 Difference]: With dead ends: 374 [2019-09-03 20:52:49,632 INFO L226 Difference]: Without dead ends: 297 [2019-09-03 20:52:49,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 374 SyntacticMatches, 20 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6577 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3335, Invalid=17257, Unknown=0, NotChecked=0, Total=20592 [2019-09-03 20:52:49,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-09-03 20:52:49,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 216. [2019-09-03 20:52:49,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-09-03 20:52:49,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 220 transitions. [2019-09-03 20:52:49,648 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 220 transitions. Word has length 207 [2019-09-03 20:52:49,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:49,648 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 220 transitions. [2019-09-03 20:52:49,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-03 20:52:49,649 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 220 transitions. [2019-09-03 20:52:49,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-03 20:52:49,650 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:49,650 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:49,650 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:49,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:49,651 INFO L82 PathProgramCache]: Analyzing trace with hash 927848391, now seen corresponding path program 21 times [2019-09-03 20:52:49,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:49,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:49,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:49,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:49,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:49,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:50,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 460 proven. 800 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 20:52:50,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:50,009 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:50,009 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:50,009 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:50,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:50,009 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:50,019 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:52:50,019 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:52:50,087 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:52:50,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:52:50,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 20:52:50,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:51,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 840 proven. 420 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 20:52:51,149 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:52,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 840 proven. 420 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-03 20:52:52,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:52,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 44, 44] total 88 [2019-09-03 20:52:52,319 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:52,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-03 20:52:52,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-03 20:52:52,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1244, Invalid=6412, Unknown=0, NotChecked=0, Total=7656 [2019-09-03 20:52:52,320 INFO L87 Difference]: Start difference. First operand 216 states and 220 transitions. Second operand 67 states. [2019-09-03 20:52:54,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:54,854 INFO L93 Difference]: Finished difference Result 392 states and 458 transitions. [2019-09-03 20:52:54,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-09-03 20:52:54,854 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 217 [2019-09-03 20:52:54,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:54,857 INFO L225 Difference]: With dead ends: 392 [2019-09-03 20:52:54,857 INFO L226 Difference]: Without dead ends: 311 [2019-09-03 20:52:54,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 562 GetRequests, 392 SyntacticMatches, 21 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7273 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3659, Invalid=18991, Unknown=0, NotChecked=0, Total=22650 [2019-09-03 20:52:54,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-09-03 20:52:54,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 226. [2019-09-03 20:52:54,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-09-03 20:52:54,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 230 transitions. [2019-09-03 20:52:54,866 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 230 transitions. Word has length 217 [2019-09-03 20:52:54,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:54,867 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 230 transitions. [2019-09-03 20:52:54,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-03 20:52:54,867 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 230 transitions. [2019-09-03 20:52:54,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-03 20:52:54,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:54,869 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:54,869 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:54,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:54,869 INFO L82 PathProgramCache]: Analyzing trace with hash -668606755, now seen corresponding path program 22 times [2019-09-03 20:52:54,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:54,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:54,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:52:54,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:54,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:55,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2226 backedges. 504 proven. 882 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-09-03 20:52:55,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:55,304 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:52:55,304 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:52:55,304 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:52:55,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:52:55,304 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:52:55,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:55,323 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:52:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:55,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-03 20:52:55,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:52:56,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2226 backedges. 924 proven. 462 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-09-03 20:52:56,605 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:52:57,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2226 backedges. 924 proven. 462 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-09-03 20:52:57,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:52:57,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 46, 46] total 92 [2019-09-03 20:52:57,796 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:52:57,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-03 20:52:57,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-03 20:52:57,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1358, Invalid=7014, Unknown=0, NotChecked=0, Total=8372 [2019-09-03 20:52:57,797 INFO L87 Difference]: Start difference. First operand 226 states and 230 transitions. Second operand 70 states. [2019-09-03 20:53:00,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:00,467 INFO L93 Difference]: Finished difference Result 410 states and 479 transitions. [2019-09-03 20:53:00,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-09-03 20:53:00,467 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 227 [2019-09-03 20:53:00,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:00,469 INFO L225 Difference]: With dead ends: 410 [2019-09-03 20:53:00,470 INFO L226 Difference]: Without dead ends: 325 [2019-09-03 20:53:00,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 410 SyntacticMatches, 22 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8004 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3998, Invalid=20808, Unknown=0, NotChecked=0, Total=24806 [2019-09-03 20:53:00,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-09-03 20:53:00,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 236. [2019-09-03 20:53:00,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-09-03 20:53:00,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 240 transitions. [2019-09-03 20:53:00,484 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 240 transitions. Word has length 227 [2019-09-03 20:53:00,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:00,484 INFO L475 AbstractCegarLoop]: Abstraction has 236 states and 240 transitions. [2019-09-03 20:53:00,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-03 20:53:00,484 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 240 transitions. [2019-09-03 20:53:00,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-03 20:53:00,487 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:00,487 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:00,487 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:00,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:00,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1074551373, now seen corresponding path program 23 times [2019-09-03 20:53:00,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:00,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:00,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:00,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:00,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:00,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:00,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2442 backedges. 550 proven. 968 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2019-09-03 20:53:00,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:00,953 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:00,953 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:00,953 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:00,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:00,954 INFO 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) [2019-09-03 20:53:00,975 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:00,975 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:01,077 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-09-03 20:53:01,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:01,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-03 20:53:01,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:02,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2442 backedges. 1012 proven. 506 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2019-09-03 20:53:02,655 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:03,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2442 backedges. 1012 proven. 506 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2019-09-03 20:53:03,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:03,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 48, 48] total 96 [2019-09-03 20:53:03,943 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:03,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-03 20:53:03,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-03 20:53:03,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1477, Invalid=7643, Unknown=0, NotChecked=0, Total=9120 [2019-09-03 20:53:03,945 INFO L87 Difference]: Start difference. First operand 236 states and 240 transitions. Second operand 73 states. [2019-09-03 20:53:06,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:06,897 INFO L93 Difference]: Finished difference Result 428 states and 500 transitions. [2019-09-03 20:53:06,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-09-03 20:53:06,898 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 237 [2019-09-03 20:53:06,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:06,900 INFO L225 Difference]: With dead ends: 428 [2019-09-03 20:53:06,900 INFO L226 Difference]: Without dead ends: 339 [2019-09-03 20:53:06,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 428 SyntacticMatches, 23 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8770 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4352, Invalid=22708, Unknown=0, NotChecked=0, Total=27060 [2019-09-03 20:53:06,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-09-03 20:53:06,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 246. [2019-09-03 20:53:06,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-09-03 20:53:06,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 250 transitions. [2019-09-03 20:53:06,909 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 250 transitions. Word has length 237 [2019-09-03 20:53:06,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:06,909 INFO L475 AbstractCegarLoop]: Abstraction has 246 states and 250 transitions. [2019-09-03 20:53:06,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-03 20:53:06,909 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 250 transitions. [2019-09-03 20:53:06,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-03 20:53:06,911 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:06,911 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:06,912 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:06,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:06,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1633469367, now seen corresponding path program 24 times [2019-09-03 20:53:06,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:06,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:06,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:06,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:06,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:07,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2668 backedges. 598 proven. 1058 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2019-09-03 20:53:07,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:07,357 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:07,357 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:07,357 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:07,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:07,357 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:07,371 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:07,371 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:53:07,456 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:07,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:07,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-03 20:53:07,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:08,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2668 backedges. 1104 proven. 552 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2019-09-03 20:53:08,863 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:10,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2668 backedges. 1104 proven. 552 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2019-09-03 20:53:10,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:10,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 50, 50] total 100 [2019-09-03 20:53:10,471 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:10,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-03 20:53:10,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-03 20:53:10,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1601, Invalid=8299, Unknown=0, NotChecked=0, Total=9900 [2019-09-03 20:53:10,473 INFO L87 Difference]: Start difference. First operand 246 states and 250 transitions. Second operand 76 states. [2019-09-03 20:53:13,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:13,595 INFO L93 Difference]: Finished difference Result 446 states and 521 transitions. [2019-09-03 20:53:13,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-09-03 20:53:13,596 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 247 [2019-09-03 20:53:13,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:13,599 INFO L225 Difference]: With dead ends: 446 [2019-09-03 20:53:13,599 INFO L226 Difference]: Without dead ends: 353 [2019-09-03 20:53:13,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 640 GetRequests, 446 SyntacticMatches, 24 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9571 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=4721, Invalid=24691, Unknown=0, NotChecked=0, Total=29412 [2019-09-03 20:53:13,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-09-03 20:53:13,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 256. [2019-09-03 20:53:13,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-03 20:53:13,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 260 transitions. [2019-09-03 20:53:13,609 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 260 transitions. Word has length 247 [2019-09-03 20:53:13,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:13,610 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 260 transitions. [2019-09-03 20:53:13,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-03 20:53:13,610 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 260 transitions. [2019-09-03 20:53:13,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-03 20:53:13,612 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:13,612 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:13,612 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:13,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:13,612 INFO L82 PathProgramCache]: Analyzing trace with hash 59552415, now seen corresponding path program 25 times [2019-09-03 20:53:13,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:13,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:13,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:13,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:13,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:13,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:14,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2904 backedges. 648 proven. 1152 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2019-09-03 20:53:14,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:14,120 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:14,120 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:14,120 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:14,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:14,120 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:14,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:14,133 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:53:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:14,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-03 20:53:14,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:15,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2904 backedges. 1200 proven. 600 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2019-09-03 20:53:15,711 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:17,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2904 backedges. 1200 proven. 600 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2019-09-03 20:53:17,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:17,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 52, 52] total 104 [2019-09-03 20:53:17,202 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:17,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-03 20:53:17,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-03 20:53:17,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1730, Invalid=8982, Unknown=0, NotChecked=0, Total=10712 [2019-09-03 20:53:17,203 INFO L87 Difference]: Start difference. First operand 256 states and 260 transitions. Second operand 79 states. [2019-09-03 20:53:20,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:20,588 INFO L93 Difference]: Finished difference Result 464 states and 542 transitions. [2019-09-03 20:53:20,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-09-03 20:53:20,589 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 257 [2019-09-03 20:53:20,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:20,592 INFO L225 Difference]: With dead ends: 464 [2019-09-03 20:53:20,592 INFO L226 Difference]: Without dead ends: 367 [2019-09-03 20:53:20,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 666 GetRequests, 464 SyntacticMatches, 25 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10407 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=5105, Invalid=26757, Unknown=0, NotChecked=0, Total=31862 [2019-09-03 20:53:20,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2019-09-03 20:53:20,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 266. [2019-09-03 20:53:20,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-03 20:53:20,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 270 transitions. [2019-09-03 20:53:20,602 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 270 transitions. Word has length 257 [2019-09-03 20:53:20,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:20,603 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 270 transitions. [2019-09-03 20:53:20,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-03 20:53:20,603 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 270 transitions. [2019-09-03 20:53:20,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-03 20:53:20,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:20,605 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:20,605 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:20,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:20,605 INFO L82 PathProgramCache]: Analyzing trace with hash -965470027, now seen corresponding path program 26 times [2019-09-03 20:53:20,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:20,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:20,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:20,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:20,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:20,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:21,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3150 backedges. 700 proven. 1250 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2019-09-03 20:53:21,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:21,287 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:21,287 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:21,289 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:21,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:21,290 INFO 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-03 20:53:21,327 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:21,327 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 [2019-09-03 20:53:21,495 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-09-03 20:53:21,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:21,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-03 20:53:21,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:23,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3150 backedges. 1300 proven. 650 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2019-09-03 20:53:23,346 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:25,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3150 backedges. 1300 proven. 650 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2019-09-03 20:53:25,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:25,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 54, 54] total 108 [2019-09-03 20:53:25,051 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:25,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-03 20:53:25,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-03 20:53:25,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1864, Invalid=9692, Unknown=0, NotChecked=0, Total=11556 [2019-09-03 20:53:25,052 INFO L87 Difference]: Start difference. First operand 266 states and 270 transitions. Second operand 82 states. [2019-09-03 20:53:28,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:28,586 INFO L93 Difference]: Finished difference Result 482 states and 563 transitions. [2019-09-03 20:53:28,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-09-03 20:53:28,586 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 267 [2019-09-03 20:53:28,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:28,588 INFO L225 Difference]: With dead ends: 482 [2019-09-03 20:53:28,589 INFO L226 Difference]: Without dead ends: 381 [2019-09-03 20:53:28,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 692 GetRequests, 482 SyntacticMatches, 26 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11278 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=5504, Invalid=28906, Unknown=0, NotChecked=0, Total=34410 [2019-09-03 20:53:28,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-09-03 20:53:28,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 276. [2019-09-03 20:53:28,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-09-03 20:53:28,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 280 transitions. [2019-09-03 20:53:28,598 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 280 transitions. Word has length 267 [2019-09-03 20:53:28,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:28,599 INFO L475 AbstractCegarLoop]: Abstraction has 276 states and 280 transitions. [2019-09-03 20:53:28,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-03 20:53:28,599 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 280 transitions. [2019-09-03 20:53:28,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-09-03 20:53:28,600 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:28,601 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:28,601 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:28,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:28,601 INFO L82 PathProgramCache]: Analyzing trace with hash 814317195, now seen corresponding path program 27 times [2019-09-03 20:53:28,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:28,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:28,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:28,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:28,602 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:28,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:29,093 INFO L134 CoverageAnalysis]: Checked inductivity of 3406 backedges. 754 proven. 1352 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2019-09-03 20:53:29,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:29,094 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:29,094 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:29,094 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:29,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:29,094 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:53:29,111 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:29,111 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:29,205 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:29,205 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:29,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-03 20:53:29,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:30,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3406 backedges. 1404 proven. 702 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2019-09-03 20:53:30,872 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:32,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3406 backedges. 1404 proven. 702 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (28)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:53:32,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:32,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 56, 56] total 112 [2019-09-03 20:53:32,638 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:32,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-09-03 20:53:32,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-09-03 20:53:32,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2003, Invalid=10429, Unknown=0, NotChecked=0, Total=12432 [2019-09-03 20:53:32,641 INFO L87 Difference]: Start difference. First operand 276 states and 280 transitions. Second operand 85 states. [2019-09-03 20:53:36,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:36,247 INFO L93 Difference]: Finished difference Result 500 states and 584 transitions. [2019-09-03 20:53:36,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-09-03 20:53:36,248 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 277 [2019-09-03 20:53:36,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:36,250 INFO L225 Difference]: With dead ends: 500 [2019-09-03 20:53:36,251 INFO L226 Difference]: Without dead ends: 395 [2019-09-03 20:53:36,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 718 GetRequests, 500 SyntacticMatches, 27 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12184 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=5918, Invalid=31138, Unknown=0, NotChecked=0, Total=37056 [2019-09-03 20:53:36,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-09-03 20:53:36,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 286. [2019-09-03 20:53:36,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-09-03 20:53:36,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 290 transitions. [2019-09-03 20:53:36,261 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 290 transitions. Word has length 277 [2019-09-03 20:53:36,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:36,262 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 290 transitions. [2019-09-03 20:53:36,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-09-03 20:53:36,262 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 290 transitions. [2019-09-03 20:53:36,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-09-03 20:53:36,264 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:36,264 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:36,264 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:36,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:36,264 INFO L82 PathProgramCache]: Analyzing trace with hash -446106591, now seen corresponding path program 28 times [2019-09-03 20:53:36,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:36,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:36,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:36,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:36,265 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:36,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:36,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3672 backedges. 810 proven. 1458 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2019-09-03 20:53:36,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:36,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:36,839 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:36,839 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:36,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:36,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:36,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:36,849 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:53:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:36,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-03 20:53:36,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:38,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3672 backedges. 1512 proven. 756 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2019-09-03 20:53:38,701 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:40,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3672 backedges. 1512 proven. 756 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2019-09-03 20:53:40,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:40,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 58, 58] total 116 [2019-09-03 20:53:40,823 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:40,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-09-03 20:53:40,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-09-03 20:53:40,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2147, Invalid=11193, Unknown=0, NotChecked=0, Total=13340 [2019-09-03 20:53:40,825 INFO L87 Difference]: Start difference. First operand 286 states and 290 transitions. Second operand 88 states. [2019-09-03 20:53:44,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:44,954 INFO L93 Difference]: Finished difference Result 518 states and 605 transitions. [2019-09-03 20:53:44,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-09-03 20:53:44,955 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 287 [2019-09-03 20:53:44,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:44,957 INFO L225 Difference]: With dead ends: 518 [2019-09-03 20:53:44,957 INFO L226 Difference]: Without dead ends: 409 [2019-09-03 20:53:44,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 744 GetRequests, 518 SyntacticMatches, 28 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13125 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=6347, Invalid=33453, Unknown=0, NotChecked=0, Total=39800 [2019-09-03 20:53:44,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-09-03 20:53:44,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 296. [2019-09-03 20:53:44,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-09-03 20:53:44,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 300 transitions. [2019-09-03 20:53:44,968 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 300 transitions. Word has length 287 [2019-09-03 20:53:44,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:44,969 INFO L475 AbstractCegarLoop]: Abstraction has 296 states and 300 transitions. [2019-09-03 20:53:44,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-09-03 20:53:44,969 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 300 transitions. [2019-09-03 20:53:44,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-09-03 20:53:44,971 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:44,971 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:44,971 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:44,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:44,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1944417929, now seen corresponding path program 29 times [2019-09-03 20:53:44,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:44,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:44,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:44,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:44,973 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:45,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3948 backedges. 868 proven. 1568 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2019-09-03 20:53:45,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:45,710 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:45,710 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:45,710 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:45,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:45,710 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:45,720 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:45,720 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:45,920 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-09-03 20:53:45,920 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:45,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 799 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-03 20:53:45,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:47,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3948 backedges. 1624 proven. 812 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2019-09-03 20:53:47,876 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:49,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3948 backedges. 1624 proven. 812 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2019-09-03 20:53:49,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:49,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 60, 60] total 120 [2019-09-03 20:53:49,849 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:49,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-09-03 20:53:49,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-09-03 20:53:49,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2296, Invalid=11984, Unknown=0, NotChecked=0, Total=14280 [2019-09-03 20:53:49,851 INFO L87 Difference]: Start difference. First operand 296 states and 300 transitions. Second operand 91 states. [2019-09-03 20:53:53,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:53,702 INFO L93 Difference]: Finished difference Result 536 states and 626 transitions. [2019-09-03 20:53:53,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-09-03 20:53:53,702 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 297 [2019-09-03 20:53:53,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:53,706 INFO L225 Difference]: With dead ends: 536 [2019-09-03 20:53:53,706 INFO L226 Difference]: Without dead ends: 423 [2019-09-03 20:53:53,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 770 GetRequests, 536 SyntacticMatches, 29 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14101 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=6791, Invalid=35851, Unknown=0, NotChecked=0, Total=42642 [2019-09-03 20:53:53,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2019-09-03 20:53:53,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 306. [2019-09-03 20:53:53,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-09-03 20:53:53,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 310 transitions. [2019-09-03 20:53:53,717 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 310 transitions. Word has length 297 [2019-09-03 20:53:53,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:53,718 INFO L475 AbstractCegarLoop]: Abstraction has 306 states and 310 transitions. [2019-09-03 20:53:53,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-09-03 20:53:53,718 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 310 transitions. [2019-09-03 20:53:53,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-09-03 20:53:53,720 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:53,720 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:53,720 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:53,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:53,721 INFO L82 PathProgramCache]: Analyzing trace with hash 940723853, now seen corresponding path program 30 times [2019-09-03 20:53:53,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:53,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:53,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:53,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:53,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:53,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:54,308 INFO L134 CoverageAnalysis]: Checked inductivity of 4234 backedges. 928 proven. 1682 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2019-09-03 20:53:54,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:54,308 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:54,308 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:54,309 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:54,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:54,309 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:54,320 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:54,320 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:53:54,419 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:54,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:54,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-03 20:53:54,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:56,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4234 backedges. 1740 proven. 870 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2019-09-03 20:53:56,431 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:58,557 INFO L134 CoverageAnalysis]: Checked inductivity of 4234 backedges. 1740 proven. 870 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2019-09-03 20:53:58,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:58,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 62, 62] total 124 [2019-09-03 20:53:58,561 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:58,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-09-03 20:53:58,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-09-03 20:53:58,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2450, Invalid=12802, Unknown=0, NotChecked=0, Total=15252 [2019-09-03 20:53:58,563 INFO L87 Difference]: Start difference. First operand 306 states and 310 transitions. Second operand 94 states. [2019-09-03 20:54:02,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:02,768 INFO L93 Difference]: Finished difference Result 554 states and 647 transitions. [2019-09-03 20:54:02,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2019-09-03 20:54:02,769 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 307 [2019-09-03 20:54:02,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:02,771 INFO L225 Difference]: With dead ends: 554 [2019-09-03 20:54:02,772 INFO L226 Difference]: Without dead ends: 437 [2019-09-03 20:54:02,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 796 GetRequests, 554 SyntacticMatches, 30 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15112 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=7250, Invalid=38332, Unknown=0, NotChecked=0, Total=45582 [2019-09-03 20:54:02,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-09-03 20:54:02,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 316. [2019-09-03 20:54:02,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-09-03 20:54:02,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 320 transitions. [2019-09-03 20:54:02,791 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 320 transitions. Word has length 307 [2019-09-03 20:54:02,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:02,791 INFO L475 AbstractCegarLoop]: Abstraction has 316 states and 320 transitions. [2019-09-03 20:54:02,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-09-03 20:54:02,792 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 320 transitions. [2019-09-03 20:54:02,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-09-03 20:54:02,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:02,794 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:02,794 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:02,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:02,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1842326685, now seen corresponding path program 31 times [2019-09-03 20:54:02,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:02,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:02,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:02,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:02,799 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:02,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:03,803 INFO L134 CoverageAnalysis]: Checked inductivity of 4530 backedges. 990 proven. 1800 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2019-09-03 20:54:03,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:03,804 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:03,805 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:03,806 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:03,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:03,806 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:03,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:03,836 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:54:03,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:03,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-03 20:54:03,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:06,325 INFO L134 CoverageAnalysis]: Checked inductivity of 4530 backedges. 1860 proven. 930 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2019-09-03 20:54:06,326 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:08,602 INFO L134 CoverageAnalysis]: Checked inductivity of 4530 backedges. 1860 proven. 930 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2019-09-03 20:54:08,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:08,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 64, 64] total 128 [2019-09-03 20:54:08,605 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:08,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-09-03 20:54:08,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-09-03 20:54:08,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2609, Invalid=13647, Unknown=0, NotChecked=0, Total=16256 [2019-09-03 20:54:08,607 INFO L87 Difference]: Start difference. First operand 316 states and 320 transitions. Second operand 97 states. [2019-09-03 20:54:13,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:13,112 INFO L93 Difference]: Finished difference Result 572 states and 668 transitions. [2019-09-03 20:54:13,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-09-03 20:54:13,112 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 317 [2019-09-03 20:54:13,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:13,115 INFO L225 Difference]: With dead ends: 572 [2019-09-03 20:54:13,115 INFO L226 Difference]: Without dead ends: 451 [2019-09-03 20:54:13,118 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 822 GetRequests, 572 SyntacticMatches, 31 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16158 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=7724, Invalid=40896, Unknown=0, NotChecked=0, Total=48620 [2019-09-03 20:54:13,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-09-03 20:54:13,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 326. [2019-09-03 20:54:13,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-09-03 20:54:13,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 330 transitions. [2019-09-03 20:54:13,125 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 330 transitions. Word has length 317 [2019-09-03 20:54:13,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:13,126 INFO L475 AbstractCegarLoop]: Abstraction has 326 states and 330 transitions. [2019-09-03 20:54:13,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-09-03 20:54:13,126 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 330 transitions. [2019-09-03 20:54:13,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-03 20:54:13,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:13,128 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:13,129 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:13,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:13,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1044338695, now seen corresponding path program 32 times [2019-09-03 20:54:13,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:13,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:13,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:13,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:13,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:13,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:13,733 INFO L134 CoverageAnalysis]: Checked inductivity of 4836 backedges. 1054 proven. 1922 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-09-03 20:54:13,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:13,733 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:13,734 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:13,734 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:13,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:13,734 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:13,745 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:54:13,745 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:54:13,984 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-09-03 20:54:13,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:13,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 880 conjuncts, 66 conjunts are in the unsatisfiable core [2019-09-03 20:54:13,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:16,472 INFO L134 CoverageAnalysis]: Checked inductivity of 4836 backedges. 1984 proven. 992 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-09-03 20:54:16,472 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:18,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4836 backedges. 1984 proven. 992 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-09-03 20:54:18,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:18,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 66, 66] total 132 [2019-09-03 20:54:18,874 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:18,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-09-03 20:54:18,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-09-03 20:54:18,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2773, Invalid=14519, Unknown=0, NotChecked=0, Total=17292 [2019-09-03 20:54:18,877 INFO L87 Difference]: Start difference. First operand 326 states and 330 transitions. Second operand 100 states. [2019-09-03 20:54:24,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:24,520 INFO L93 Difference]: Finished difference Result 590 states and 689 transitions. [2019-09-03 20:54:24,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2019-09-03 20:54:24,520 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 327 [2019-09-03 20:54:24,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:24,524 INFO L225 Difference]: With dead ends: 590 [2019-09-03 20:54:24,524 INFO L226 Difference]: Without dead ends: 465 [2019-09-03 20:54:24,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 848 GetRequests, 590 SyntacticMatches, 32 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17239 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=8213, Invalid=43543, Unknown=0, NotChecked=0, Total=51756 [2019-09-03 20:54:24,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-09-03 20:54:24,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 336. [2019-09-03 20:54:24,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-09-03 20:54:24,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 340 transitions. [2019-09-03 20:54:24,542 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 340 transitions. Word has length 327 [2019-09-03 20:54:24,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:24,543 INFO L475 AbstractCegarLoop]: Abstraction has 336 states and 340 transitions. [2019-09-03 20:54:24,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-09-03 20:54:24,543 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 340 transitions. [2019-09-03 20:54:24,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-09-03 20:54:24,547 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:24,547 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:24,549 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:24,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:24,549 INFO L82 PathProgramCache]: Analyzing trace with hash 360406095, now seen corresponding path program 33 times [2019-09-03 20:54:24,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:24,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:24,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:24,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:24,552 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:24,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:25,858 INFO L134 CoverageAnalysis]: Checked inductivity of 5152 backedges. 1120 proven. 2048 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2019-09-03 20:54:25,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:25,859 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:25,859 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:25,860 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:25,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:25,860 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:25,892 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:54:25,892 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:54:26,056 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:54:26,056 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:26,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 907 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-03 20:54:26,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:29,148 INFO L134 CoverageAnalysis]: Checked inductivity of 5152 backedges. 2112 proven. 1056 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2019-09-03 20:54:29,149 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:31,934 INFO L134 CoverageAnalysis]: Checked inductivity of 5152 backedges. 2112 proven. 1056 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2019-09-03 20:54:31,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:31,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 68, 68] total 136 [2019-09-03 20:54:31,938 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:31,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-09-03 20:54:31,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-09-03 20:54:31,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2942, Invalid=15418, Unknown=0, NotChecked=0, Total=18360 [2019-09-03 20:54:31,941 INFO L87 Difference]: Start difference. First operand 336 states and 340 transitions. Second operand 103 states. [2019-09-03 20:54:37,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:37,198 INFO L93 Difference]: Finished difference Result 608 states and 710 transitions. [2019-09-03 20:54:37,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2019-09-03 20:54:37,199 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 337 [2019-09-03 20:54:37,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:37,202 INFO L225 Difference]: With dead ends: 608 [2019-09-03 20:54:37,202 INFO L226 Difference]: Without dead ends: 479 [2019-09-03 20:54:37,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 874 GetRequests, 608 SyntacticMatches, 33 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18355 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=8717, Invalid=46273, Unknown=0, NotChecked=0, Total=54990 [2019-09-03 20:54:37,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-09-03 20:54:37,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 346. [2019-09-03 20:54:37,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-09-03 20:54:37,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 350 transitions. [2019-09-03 20:54:37,212 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 350 transitions. Word has length 337 [2019-09-03 20:54:37,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:37,212 INFO L475 AbstractCegarLoop]: Abstraction has 346 states and 350 transitions. [2019-09-03 20:54:37,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-09-03 20:54:37,213 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 350 transitions. [2019-09-03 20:54:37,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2019-09-03 20:54:37,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:37,215 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:37,215 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:37,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:37,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1820622949, now seen corresponding path program 34 times [2019-09-03 20:54:37,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:37,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:37,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:37,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:37,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:37,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:38,167 INFO L134 CoverageAnalysis]: Checked inductivity of 5478 backedges. 1188 proven. 2178 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2019-09-03 20:54:38,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:38,167 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:38,168 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:38,168 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:38,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:38,168 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:54:38,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:38,190 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:38,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:38,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 934 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-03 20:54:38,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:40,879 INFO L134 CoverageAnalysis]: Checked inductivity of 5478 backedges. 2244 proven. 1122 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2019-09-03 20:54:40,880 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:43,613 INFO L134 CoverageAnalysis]: Checked inductivity of 5478 backedges. 2244 proven. 1122 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2019-09-03 20:54:43,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:43,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 70, 70] total 140 [2019-09-03 20:54:43,617 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:43,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-09-03 20:54:43,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-09-03 20:54:43,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3116, Invalid=16344, Unknown=0, NotChecked=0, Total=19460 [2019-09-03 20:54:43,619 INFO L87 Difference]: Start difference. First operand 346 states and 350 transitions. Second operand 106 states. [2019-09-03 20:54:48,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:48,890 INFO L93 Difference]: Finished difference Result 626 states and 731 transitions. [2019-09-03 20:54:48,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2019-09-03 20:54:48,890 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 347 [2019-09-03 20:54:48,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:48,893 INFO L225 Difference]: With dead ends: 626 [2019-09-03 20:54:48,893 INFO L226 Difference]: Without dead ends: 493 [2019-09-03 20:54:48,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 900 GetRequests, 626 SyntacticMatches, 34 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19506 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=9236, Invalid=49086, Unknown=0, NotChecked=0, Total=58322 [2019-09-03 20:54:48,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-09-03 20:54:48,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 356. [2019-09-03 20:54:48,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-09-03 20:54:48,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 360 transitions. [2019-09-03 20:54:48,904 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 360 transitions. Word has length 347 [2019-09-03 20:54:48,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:48,905 INFO L475 AbstractCegarLoop]: Abstraction has 356 states and 360 transitions. [2019-09-03 20:54:48,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-09-03 20:54:48,905 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 360 transitions. [2019-09-03 20:54:48,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-09-03 20:54:48,907 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:48,907 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:48,908 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:48,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:48,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1600922683, now seen corresponding path program 35 times [2019-09-03 20:54:48,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:48,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:48,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:48,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:48,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:49,623 INFO L134 CoverageAnalysis]: Checked inductivity of 5814 backedges. 1258 proven. 2312 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2019-09-03 20:54:49,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:49,623 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:49,623 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:49,624 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:49,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:49,624 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:49,634 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:54:49,634 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:54:49,822 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-09-03 20:54:49,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:49,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 961 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-03 20:54:49,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:52,475 INFO L134 CoverageAnalysis]: Checked inductivity of 5814 backedges. 2380 proven. 1190 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2019-09-03 20:54:52,475 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:55,329 INFO L134 CoverageAnalysis]: Checked inductivity of 5814 backedges. 2380 proven. 1190 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2019-09-03 20:54:55,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:55,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 72, 72] total 144 [2019-09-03 20:54:55,334 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:55,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-09-03 20:54:55,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-09-03 20:54:55,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3295, Invalid=17297, Unknown=0, NotChecked=0, Total=20592 [2019-09-03 20:54:55,336 INFO L87 Difference]: Start difference. First operand 356 states and 360 transitions. Second operand 109 states. [2019-09-03 20:55:01,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:01,007 INFO L93 Difference]: Finished difference Result 644 states and 752 transitions. [2019-09-03 20:55:01,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2019-09-03 20:55:01,007 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 357 [2019-09-03 20:55:01,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:01,010 INFO L225 Difference]: With dead ends: 644 [2019-09-03 20:55:01,011 INFO L226 Difference]: Without dead ends: 507 [2019-09-03 20:55:01,013 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 926 GetRequests, 644 SyntacticMatches, 35 SemanticMatches, 247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20692 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=9770, Invalid=51982, Unknown=0, NotChecked=0, Total=61752 [2019-09-03 20:55:01,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-09-03 20:55:01,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 366. [2019-09-03 20:55:01,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-09-03 20:55:01,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 370 transitions. [2019-09-03 20:55:01,020 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 370 transitions. Word has length 357 [2019-09-03 20:55:01,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:01,020 INFO L475 AbstractCegarLoop]: Abstraction has 366 states and 370 transitions. [2019-09-03 20:55:01,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-09-03 20:55:01,021 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 370 transitions. [2019-09-03 20:55:01,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2019-09-03 20:55:01,023 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:01,023 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:01,023 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:01,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:01,024 INFO L82 PathProgramCache]: Analyzing trace with hash 690902993, now seen corresponding path program 36 times [2019-09-03 20:55:01,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:01,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:01,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:01,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:01,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:01,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:01,788 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 1330 proven. 2450 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2019-09-03 20:55:01,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:01,788 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:01,789 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:01,789 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:01,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:01,789 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:01,799 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:55:01,800 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:55:01,918 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:55:01,919 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:01,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 988 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-03 20:55:01,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:04,760 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 2520 proven. 1260 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2019-09-03 20:55:04,760 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:07,762 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 2520 proven. 1260 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2019-09-03 20:55:07,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:07,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 74, 74] total 148 [2019-09-03 20:55:07,767 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:07,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-09-03 20:55:07,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-09-03 20:55:07,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3479, Invalid=18277, Unknown=0, NotChecked=0, Total=21756 [2019-09-03 20:55:07,770 INFO L87 Difference]: Start difference. First operand 366 states and 370 transitions. Second operand 112 states. [2019-09-03 20:55:13,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:13,800 INFO L93 Difference]: Finished difference Result 662 states and 773 transitions. [2019-09-03 20:55:13,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2019-09-03 20:55:13,801 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 367 [2019-09-03 20:55:13,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:13,803 INFO L225 Difference]: With dead ends: 662 [2019-09-03 20:55:13,803 INFO L226 Difference]: Without dead ends: 521 [2019-09-03 20:55:13,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 952 GetRequests, 662 SyntacticMatches, 36 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21913 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=10319, Invalid=54961, Unknown=0, NotChecked=0, Total=65280 [2019-09-03 20:55:13,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2019-09-03 20:55:13,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 376. [2019-09-03 20:55:13,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-09-03 20:55:13,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 380 transitions. [2019-09-03 20:55:13,816 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 380 transitions. Word has length 367 [2019-09-03 20:55:13,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:13,817 INFO L475 AbstractCegarLoop]: Abstraction has 376 states and 380 transitions. [2019-09-03 20:55:13,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-09-03 20:55:13,817 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 380 transitions. [2019-09-03 20:55:13,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2019-09-03 20:55:13,820 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:13,820 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:13,820 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:13,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:13,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1345530663, now seen corresponding path program 37 times [2019-09-03 20:55:13,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:13,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:13,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:13,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:13,822 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:13,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:14,702 INFO L134 CoverageAnalysis]: Checked inductivity of 6516 backedges. 1404 proven. 2592 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2019-09-03 20:55:14,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:14,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:14,702 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:14,702 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:14,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:14,703 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:14,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:14,713 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:55:14,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:14,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 1015 conjuncts, 76 conjunts are in the unsatisfiable core [2019-09-03 20:55:14,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:17,744 INFO L134 CoverageAnalysis]: Checked inductivity of 6516 backedges. 2664 proven. 1332 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2019-09-03 20:55:17,744 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:20,985 INFO L134 CoverageAnalysis]: Checked inductivity of 6516 backedges. 2664 proven. 1332 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2019-09-03 20:55:20,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:20,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 76, 76] total 152 [2019-09-03 20:55:20,989 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:20,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-09-03 20:55:20,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-09-03 20:55:20,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3668, Invalid=19284, Unknown=0, NotChecked=0, Total=22952 [2019-09-03 20:55:20,991 INFO L87 Difference]: Start difference. First operand 376 states and 380 transitions. Second operand 115 states. [2019-09-03 20:55:27,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:27,396 INFO L93 Difference]: Finished difference Result 680 states and 794 transitions. [2019-09-03 20:55:27,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2019-09-03 20:55:27,397 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 377 [2019-09-03 20:55:27,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:27,400 INFO L225 Difference]: With dead ends: 680 [2019-09-03 20:55:27,400 INFO L226 Difference]: Without dead ends: 535 [2019-09-03 20:55:27,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 978 GetRequests, 680 SyntacticMatches, 37 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23169 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=10883, Invalid=58023, Unknown=0, NotChecked=0, Total=68906 [2019-09-03 20:55:27,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-03 20:55:27,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 386. [2019-09-03 20:55:27,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2019-09-03 20:55:27,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 390 transitions. [2019-09-03 20:55:27,412 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 390 transitions. Word has length 377 [2019-09-03 20:55:27,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:27,412 INFO L475 AbstractCegarLoop]: Abstraction has 386 states and 390 transitions. [2019-09-03 20:55:27,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-09-03 20:55:27,412 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 390 transitions. [2019-09-03 20:55:27,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-09-03 20:55:27,414 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:27,415 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:27,415 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:27,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:27,415 INFO L82 PathProgramCache]: Analyzing trace with hash 256814653, now seen corresponding path program 38 times [2019-09-03 20:55:27,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:27,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:27,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:27,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:27,416 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:27,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:28,302 INFO L134 CoverageAnalysis]: Checked inductivity of 6882 backedges. 1480 proven. 2738 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2019-09-03 20:55:28,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:28,302 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:28,303 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:28,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:28,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:28,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:28,314 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:55:28,314 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:55:28,494 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-09-03 20:55:28,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:28,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 1042 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-03 20:55:28,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:31,610 INFO L134 CoverageAnalysis]: Checked inductivity of 6882 backedges. 2812 proven. 1406 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2019-09-03 20:55:31,610 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:35,034 INFO L134 CoverageAnalysis]: Checked inductivity of 6882 backedges. 2812 proven. 1406 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2019-09-03 20:55:35,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:35,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 78, 78] total 156 [2019-09-03 20:55:35,040 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:35,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-09-03 20:55:35,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-09-03 20:55:35,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3862, Invalid=20318, Unknown=0, NotChecked=0, Total=24180 [2019-09-03 20:55:35,042 INFO L87 Difference]: Start difference. First operand 386 states and 390 transitions. Second operand 118 states. [2019-09-03 20:55:41,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:41,216 INFO L93 Difference]: Finished difference Result 698 states and 815 transitions. [2019-09-03 20:55:41,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2019-09-03 20:55:41,216 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 387 [2019-09-03 20:55:41,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:41,220 INFO L225 Difference]: With dead ends: 698 [2019-09-03 20:55:41,220 INFO L226 Difference]: Without dead ends: 549 [2019-09-03 20:55:41,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1004 GetRequests, 698 SyntacticMatches, 38 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24460 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=11462, Invalid=61168, Unknown=0, NotChecked=0, Total=72630 [2019-09-03 20:55:41,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2019-09-03 20:55:41,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 396. [2019-09-03 20:55:41,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-09-03 20:55:41,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 400 transitions. [2019-09-03 20:55:41,232 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 400 transitions. Word has length 387 [2019-09-03 20:55:41,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:41,232 INFO L475 AbstractCegarLoop]: Abstraction has 396 states and 400 transitions. [2019-09-03 20:55:41,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-09-03 20:55:41,232 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 400 transitions. [2019-09-03 20:55:41,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2019-09-03 20:55:41,235 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:41,235 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:41,235 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:41,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:41,236 INFO L82 PathProgramCache]: Analyzing trace with hash 2126573843, now seen corresponding path program 39 times [2019-09-03 20:55:41,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:41,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:41,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:41,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:41,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:41,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:42,135 INFO L134 CoverageAnalysis]: Checked inductivity of 7258 backedges. 1558 proven. 2888 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2019-09-03 20:55:42,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:42,136 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:42,136 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:42,136 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:42,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:42,136 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:42,146 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:55:42,146 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:55:42,275 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:55:42,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:42,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 1069 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-03 20:55:42,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:45,508 INFO L134 CoverageAnalysis]: Checked inductivity of 7258 backedges. 2964 proven. 1482 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2019-09-03 20:55:45,508 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:49,032 INFO L134 CoverageAnalysis]: Checked inductivity of 7258 backedges. 2964 proven. 1482 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2019-09-03 20:55:49,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:49,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 80, 80] total 160 [2019-09-03 20:55:49,036 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:49,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 121 states [2019-09-03 20:55:49,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2019-09-03 20:55:49,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4061, Invalid=21379, Unknown=0, NotChecked=0, Total=25440 [2019-09-03 20:55:49,039 INFO L87 Difference]: Start difference. First operand 396 states and 400 transitions. Second operand 121 states. [2019-09-03 20:55:55,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:55,563 INFO L93 Difference]: Finished difference Result 716 states and 836 transitions. [2019-09-03 20:55:55,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2019-09-03 20:55:55,563 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 397 [2019-09-03 20:55:55,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:55,567 INFO L225 Difference]: With dead ends: 716 [2019-09-03 20:55:55,567 INFO L226 Difference]: Without dead ends: 563 [2019-09-03 20:55:55,571 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1030 GetRequests, 716 SyntacticMatches, 39 SemanticMatches, 275 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25786 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=12056, Invalid=64396, Unknown=0, NotChecked=0, Total=76452 [2019-09-03 20:55:55,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2019-09-03 20:55:55,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 406. [2019-09-03 20:55:55,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-09-03 20:55:55,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 410 transitions. [2019-09-03 20:55:55,578 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 410 transitions. Word has length 397 [2019-09-03 20:55:55,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:55,579 INFO L475 AbstractCegarLoop]: Abstraction has 406 states and 410 transitions. [2019-09-03 20:55:55,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 121 states. [2019-09-03 20:55:55,579 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 410 transitions. [2019-09-03 20:55:55,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2019-09-03 20:55:55,581 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:55,582 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:55,582 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:55,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:55,582 INFO L82 PathProgramCache]: Analyzing trace with hash 2100691881, now seen corresponding path program 40 times [2019-09-03 20:55:55,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:55,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:55,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:55,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:55,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:55,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:56,541 INFO L134 CoverageAnalysis]: Checked inductivity of 7644 backedges. 1638 proven. 3042 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2019-09-03 20:55:56,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:56,542 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:56,542 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:56,542 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:55:56,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:56,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 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:56,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:56,552 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:55:56,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:56,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 1096 conjuncts, 82 conjunts are in the unsatisfiable core [2019-09-03 20:55:56,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:00,055 INFO L134 CoverageAnalysis]: Checked inductivity of 7644 backedges. 3120 proven. 1560 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2019-09-03 20:56:00,055 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:03,852 INFO L134 CoverageAnalysis]: Checked inductivity of 7644 backedges. 3120 proven. 1560 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2019-09-03 20:56:03,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:03,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 82, 82] total 164 [2019-09-03 20:56:03,856 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:03,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-09-03 20:56:03,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-09-03 20:56:03,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4265, Invalid=22467, Unknown=0, NotChecked=0, Total=26732 [2019-09-03 20:56:03,858 INFO L87 Difference]: Start difference. First operand 406 states and 410 transitions. Second operand 124 states. [2019-09-03 20:56:10,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:10,943 INFO L93 Difference]: Finished difference Result 734 states and 857 transitions. [2019-09-03 20:56:10,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2019-09-03 20:56:10,944 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 407 [2019-09-03 20:56:10,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:10,947 INFO L225 Difference]: With dead ends: 734 [2019-09-03 20:56:10,947 INFO L226 Difference]: Without dead ends: 577 [2019-09-03 20:56:10,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1056 GetRequests, 734 SyntacticMatches, 40 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27147 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=12665, Invalid=67707, Unknown=0, NotChecked=0, Total=80372 [2019-09-03 20:56:10,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-09-03 20:56:10,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 416. [2019-09-03 20:56:10,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-09-03 20:56:10,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 420 transitions. [2019-09-03 20:56:10,959 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 420 transitions. Word has length 407 [2019-09-03 20:56:10,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:10,959 INFO L475 AbstractCegarLoop]: Abstraction has 416 states and 420 transitions. [2019-09-03 20:56:10,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-09-03 20:56:10,960 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 420 transitions. [2019-09-03 20:56:10,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2019-09-03 20:56:10,962 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:10,962 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:10,963 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:10,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:10,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1489368575, now seen corresponding path program 41 times [2019-09-03 20:56:10,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:10,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:10,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:10,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:10,964 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:11,892 INFO L134 CoverageAnalysis]: Checked inductivity of 8040 backedges. 1720 proven. 3200 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2019-09-03 20:56:11,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:11,892 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:11,892 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:11,892 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:11,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:11,892 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:11,905 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:56:11,905 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:56:12,115 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-09-03 20:56:12,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:12,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 1123 conjuncts, 84 conjunts are in the unsatisfiable core [2019-09-03 20:56:12,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:15,740 INFO L134 CoverageAnalysis]: Checked inductivity of 8040 backedges. 3280 proven. 1640 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2019-09-03 20:56:15,740 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:19,605 INFO L134 CoverageAnalysis]: Checked inductivity of 8040 backedges. 3280 proven. 1640 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2019-09-03 20:56:19,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:19,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 84, 84] total 168 [2019-09-03 20:56:19,610 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:19,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-09-03 20:56:19,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-09-03 20:56:19,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4474, Invalid=23582, Unknown=0, NotChecked=0, Total=28056 [2019-09-03 20:56:19,613 INFO L87 Difference]: Start difference. First operand 416 states and 420 transitions. Second operand 127 states. [2019-09-03 20:56:26,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:26,643 INFO L93 Difference]: Finished difference Result 752 states and 878 transitions. [2019-09-03 20:56:26,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2019-09-03 20:56:26,644 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 417 [2019-09-03 20:56:26,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:26,646 INFO L225 Difference]: With dead ends: 752 [2019-09-03 20:56:26,646 INFO L226 Difference]: Without dead ends: 591 [2019-09-03 20:56:26,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1082 GetRequests, 752 SyntacticMatches, 41 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28543 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=13289, Invalid=71101, Unknown=0, NotChecked=0, Total=84390 [2019-09-03 20:56:26,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-09-03 20:56:26,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 426. [2019-09-03 20:56:26,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-03 20:56:26,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 430 transitions. [2019-09-03 20:56:26,659 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 430 transitions. Word has length 417 [2019-09-03 20:56:26,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:26,660 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 430 transitions. [2019-09-03 20:56:26,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 127 states. [2019-09-03 20:56:26,660 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 430 transitions. [2019-09-03 20:56:26,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2019-09-03 20:56:26,663 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:26,663 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:26,663 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:26,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:26,664 INFO L82 PathProgramCache]: Analyzing trace with hash 938792981, now seen corresponding path program 42 times [2019-09-03 20:56:26,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:26,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:26,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:26,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:26,665 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:26,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:27,721 INFO L134 CoverageAnalysis]: Checked inductivity of 8446 backedges. 1804 proven. 3362 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2019-09-03 20:56:27,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:27,722 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:27,722 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:27,722 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:27,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:27,722 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:27,733 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:56:27,733 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:56:27,869 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:56:27,869 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:27,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 1150 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-03 20:56:27,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:31,596 INFO L134 CoverageAnalysis]: Checked inductivity of 8446 backedges. 3444 proven. 1722 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2019-09-03 20:56:31,596 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:35,689 INFO L134 CoverageAnalysis]: Checked inductivity of 8446 backedges. 3444 proven. 1722 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2019-09-03 20:56:35,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:35,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 86, 86] total 172 [2019-09-03 20:56:35,695 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:35,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-09-03 20:56:35,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-09-03 20:56:35,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4688, Invalid=24724, Unknown=0, NotChecked=0, Total=29412 [2019-09-03 20:56:35,697 INFO L87 Difference]: Start difference. First operand 426 states and 430 transitions. Second operand 130 states. [2019-09-03 20:56:43,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:43,477 INFO L93 Difference]: Finished difference Result 770 states and 899 transitions. [2019-09-03 20:56:43,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2019-09-03 20:56:43,477 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 427 [2019-09-03 20:56:43,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:43,481 INFO L225 Difference]: With dead ends: 770 [2019-09-03 20:56:43,481 INFO L226 Difference]: Without dead ends: 605 [2019-09-03 20:56:43,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1108 GetRequests, 770 SyntacticMatches, 42 SemanticMatches, 296 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29974 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=13928, Invalid=74578, Unknown=0, NotChecked=0, Total=88506 [2019-09-03 20:56:43,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-09-03 20:56:43,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 436. [2019-09-03 20:56:43,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-09-03 20:56:43,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 440 transitions. [2019-09-03 20:56:43,490 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 440 transitions. Word has length 427 [2019-09-03 20:56:43,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:43,490 INFO L475 AbstractCegarLoop]: Abstraction has 436 states and 440 transitions. [2019-09-03 20:56:43,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-09-03 20:56:43,491 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 440 transitions. [2019-09-03 20:56:43,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2019-09-03 20:56:43,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:43,494 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 42, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:43,494 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:43,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:43,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1119009259, now seen corresponding path program 43 times [2019-09-03 20:56:43,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:43,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:43,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:43,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:43,496 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:43,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:44,491 INFO L134 CoverageAnalysis]: Checked inductivity of 8862 backedges. 1890 proven. 3528 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2019-09-03 20:56:44,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:44,492 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:44,492 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:44,492 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:44,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:44,492 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:44,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:44,506 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:56:44,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:44,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 1177 conjuncts, 88 conjunts are in the unsatisfiable core [2019-09-03 20:56:44,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:48,564 INFO L134 CoverageAnalysis]: Checked inductivity of 8862 backedges. 3612 proven. 1806 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2019-09-03 20:56:48,565 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:52,822 INFO L134 CoverageAnalysis]: Checked inductivity of 8862 backedges. 3612 proven. 1806 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2019-09-03 20:56:52,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:52,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 88, 88] total 176 [2019-09-03 20:56:52,827 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:52,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 133 states [2019-09-03 20:56:52,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2019-09-03 20:56:52,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4907, Invalid=25893, Unknown=0, NotChecked=0, Total=30800 [2019-09-03 20:56:52,830 INFO L87 Difference]: Start difference. First operand 436 states and 440 transitions. Second operand 133 states. [2019-09-03 20:57:00,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:00,631 INFO L93 Difference]: Finished difference Result 788 states and 920 transitions. [2019-09-03 20:57:00,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2019-09-03 20:57:00,631 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 437 [2019-09-03 20:57:00,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:00,634 INFO L225 Difference]: With dead ends: 788 [2019-09-03 20:57:00,634 INFO L226 Difference]: Without dead ends: 619 [2019-09-03 20:57:00,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1134 GetRequests, 788 SyntacticMatches, 43 SemanticMatches, 303 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31440 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=14582, Invalid=78138, Unknown=0, NotChecked=0, Total=92720 [2019-09-03 20:57:00,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-09-03 20:57:00,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 446. [2019-09-03 20:57:00,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-09-03 20:57:00,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 450 transitions. [2019-09-03 20:57:00,646 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 450 transitions. Word has length 437 [2019-09-03 20:57:00,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:00,647 INFO L475 AbstractCegarLoop]: Abstraction has 446 states and 450 transitions. [2019-09-03 20:57:00,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 133 states. [2019-09-03 20:57:00,647 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 450 transitions. [2019-09-03 20:57:00,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2019-09-03 20:57:00,650 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:00,650 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:00,650 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:00,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:00,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1956926591, now seen corresponding path program 44 times [2019-09-03 20:57:00,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:00,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:00,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:00,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:00,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:00,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:01,672 INFO L134 CoverageAnalysis]: Checked inductivity of 9288 backedges. 1978 proven. 3698 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2019-09-03 20:57:01,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:01,672 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:01,672 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:01,672 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:01,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:01,672 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:01,685 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:57:01,685 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:57:01,907 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-09-03 20:57:01,907 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:01,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 1204 conjuncts, 90 conjunts are in the unsatisfiable core [2019-09-03 20:57:01,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:05,984 INFO L134 CoverageAnalysis]: Checked inductivity of 9288 backedges. 3784 proven. 1892 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2019-09-03 20:57:05,985 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:10,392 INFO L134 CoverageAnalysis]: Checked inductivity of 9288 backedges. 3784 proven. 1892 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2019-09-03 20:57:10,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:10,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 90, 90] total 180 [2019-09-03 20:57:10,397 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:10,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-09-03 20:57:10,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-09-03 20:57:10,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5131, Invalid=27089, Unknown=0, NotChecked=0, Total=32220 [2019-09-03 20:57:10,400 INFO L87 Difference]: Start difference. First operand 446 states and 450 transitions. Second operand 136 states. [2019-09-03 20:57:18,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:18,817 INFO L93 Difference]: Finished difference Result 806 states and 941 transitions. [2019-09-03 20:57:18,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2019-09-03 20:57:18,818 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 447 [2019-09-03 20:57:18,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:18,821 INFO L225 Difference]: With dead ends: 806 [2019-09-03 20:57:18,822 INFO L226 Difference]: Without dead ends: 633 [2019-09-03 20:57:18,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1160 GetRequests, 806 SyntacticMatches, 44 SemanticMatches, 310 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32941 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=15251, Invalid=81781, Unknown=0, NotChecked=0, Total=97032 [2019-09-03 20:57:18,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-09-03 20:57:18,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 456. [2019-09-03 20:57:18,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-09-03 20:57:18,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 460 transitions. [2019-09-03 20:57:18,832 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 460 transitions. Word has length 447 [2019-09-03 20:57:18,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:18,832 INFO L475 AbstractCegarLoop]: Abstraction has 456 states and 460 transitions. [2019-09-03 20:57:18,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-09-03 20:57:18,832 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 460 transitions. [2019-09-03 20:57:18,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2019-09-03 20:57:18,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:18,836 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 44, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:18,836 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:18,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:18,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1212695337, now seen corresponding path program 45 times [2019-09-03 20:57:18,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:18,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:18,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:18,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:18,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:18,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:19,908 INFO L134 CoverageAnalysis]: Checked inductivity of 9724 backedges. 2068 proven. 3872 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2019-09-03 20:57:19,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:19,908 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:19,909 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:19,909 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:19,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:19,909 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:19,919 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:57:19,919 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:57:20,121 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:57:20,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:20,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 1231 conjuncts, 92 conjunts are in the unsatisfiable core [2019-09-03 20:57:20,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:24,340 INFO L134 CoverageAnalysis]: Checked inductivity of 9724 backedges. 3960 proven. 1980 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2019-09-03 20:57:24,340 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:28,943 INFO L134 CoverageAnalysis]: Checked inductivity of 9724 backedges. 3960 proven. 1980 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2019-09-03 20:57:28,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:28,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 92, 92] total 184 [2019-09-03 20:57:28,948 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:28,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-09-03 20:57:28,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-09-03 20:57:28,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5360, Invalid=28312, Unknown=0, NotChecked=0, Total=33672 [2019-09-03 20:57:28,951 INFO L87 Difference]: Start difference. First operand 456 states and 460 transitions. Second operand 139 states. [2019-09-03 20:57:37,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:37,177 INFO L93 Difference]: Finished difference Result 824 states and 962 transitions. [2019-09-03 20:57:37,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2019-09-03 20:57:37,178 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 457 [2019-09-03 20:57:37,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:37,182 INFO L225 Difference]: With dead ends: 824 [2019-09-03 20:57:37,182 INFO L226 Difference]: Without dead ends: 647 [2019-09-03 20:57:37,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1186 GetRequests, 824 SyntacticMatches, 45 SemanticMatches, 317 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34477 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=15935, Invalid=85507, Unknown=0, NotChecked=0, Total=101442 [2019-09-03 20:57:37,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-09-03 20:57:37,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 466. [2019-09-03 20:57:37,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-09-03 20:57:37,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 470 transitions. [2019-09-03 20:57:37,193 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 470 transitions. Word has length 457 [2019-09-03 20:57:37,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:37,194 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 470 transitions. [2019-09-03 20:57:37,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-09-03 20:57:37,194 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 470 transitions. [2019-09-03 20:57:37,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2019-09-03 20:57:37,197 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:37,197 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 45, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:37,198 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:37,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:37,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1778056685, now seen corresponding path program 46 times [2019-09-03 20:57:37,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:37,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:37,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:37,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:37,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:38,353 INFO L134 CoverageAnalysis]: Checked inductivity of 10170 backedges. 2160 proven. 4050 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2019-09-03 20:57:38,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:38,353 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:38,353 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:38,353 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:38,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:38,353 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:38,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:38,366 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:57:38,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:38,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 1258 conjuncts, 94 conjunts are in the unsatisfiable core [2019-09-03 20:57:38,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:42,972 INFO L134 CoverageAnalysis]: Checked inductivity of 10170 backedges. 4140 proven. 2070 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2019-09-03 20:57:42,972 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:47,769 INFO L134 CoverageAnalysis]: Checked inductivity of 10170 backedges. 4140 proven. 2070 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2019-09-03 20:57:47,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:47,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 94, 94] total 188 [2019-09-03 20:57:47,774 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:47,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-09-03 20:57:47,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-09-03 20:57:47,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5594, Invalid=29562, Unknown=0, NotChecked=0, Total=35156 [2019-09-03 20:57:47,777 INFO L87 Difference]: Start difference. First operand 466 states and 470 transitions. Second operand 142 states. [2019-09-03 20:57:56,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:56,557 INFO L93 Difference]: Finished difference Result 842 states and 983 transitions. [2019-09-03 20:57:56,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2019-09-03 20:57:56,558 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 467 [2019-09-03 20:57:56,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:56,562 INFO L225 Difference]: With dead ends: 842 [2019-09-03 20:57:56,562 INFO L226 Difference]: Without dead ends: 661 [2019-09-03 20:57:56,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1212 GetRequests, 842 SyntacticMatches, 46 SemanticMatches, 324 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36048 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=16634, Invalid=89316, Unknown=0, NotChecked=0, Total=105950 [2019-09-03 20:57:56,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2019-09-03 20:57:56,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 476. [2019-09-03 20:57:56,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-09-03 20:57:56,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 480 transitions. [2019-09-03 20:57:56,579 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 480 transitions. Word has length 467 [2019-09-03 20:57:56,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:56,580 INFO L475 AbstractCegarLoop]: Abstraction has 476 states and 480 transitions. [2019-09-03 20:57:56,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-09-03 20:57:56,580 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 480 transitions. [2019-09-03 20:57:56,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2019-09-03 20:57:56,583 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:56,583 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:56,583 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:56,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:56,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1774550723, now seen corresponding path program 47 times [2019-09-03 20:57:56,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:56,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:56,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:56,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:56,585 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:57,761 INFO L134 CoverageAnalysis]: Checked inductivity of 10626 backedges. 2254 proven. 4232 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2019-09-03 20:57:57,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:57,762 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:57,762 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:57,762 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:57,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:57,762 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:57,773 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:57:57,773 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:57:58,020 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-09-03 20:57:58,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:58,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 1285 conjuncts, 96 conjunts are in the unsatisfiable core [2019-09-03 20:57:58,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:02,852 INFO L134 CoverageAnalysis]: Checked inductivity of 10626 backedges. 4324 proven. 2162 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2019-09-03 20:58:02,853 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:07,993 INFO L134 CoverageAnalysis]: Checked inductivity of 10626 backedges. 4324 proven. 2162 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2019-09-03 20:58:07,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:07,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 96, 96] total 192 [2019-09-03 20:58:07,999 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:07,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 145 states [2019-09-03 20:58:08,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2019-09-03 20:58:08,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5833, Invalid=30839, Unknown=0, NotChecked=0, Total=36672 [2019-09-03 20:58:08,003 INFO L87 Difference]: Start difference. First operand 476 states and 480 transitions. Second operand 145 states. [2019-09-03 20:58:17,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:17,036 INFO L93 Difference]: Finished difference Result 860 states and 1004 transitions. [2019-09-03 20:58:17,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2019-09-03 20:58:17,037 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 477 [2019-09-03 20:58:17,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:17,041 INFO L225 Difference]: With dead ends: 860 [2019-09-03 20:58:17,041 INFO L226 Difference]: Without dead ends: 675 [2019-09-03 20:58:17,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1238 GetRequests, 860 SyntacticMatches, 47 SemanticMatches, 331 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37654 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=17348, Invalid=93208, Unknown=0, NotChecked=0, Total=110556 [2019-09-03 20:58:17,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2019-09-03 20:58:17,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 486. [2019-09-03 20:58:17,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2019-09-03 20:58:17,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 490 transitions. [2019-09-03 20:58:17,050 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 490 transitions. Word has length 477 [2019-09-03 20:58:17,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:17,050 INFO L475 AbstractCegarLoop]: Abstraction has 486 states and 490 transitions. [2019-09-03 20:58:17,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 145 states. [2019-09-03 20:58:17,050 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 490 transitions. [2019-09-03 20:58:17,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2019-09-03 20:58:17,053 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:17,053 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 47, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:17,053 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:17,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:17,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1927065767, now seen corresponding path program 48 times [2019-09-03 20:58:17,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:17,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:17,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:17,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:17,055 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:17,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:18,217 INFO L134 CoverageAnalysis]: Checked inductivity of 11092 backedges. 2350 proven. 4418 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2019-09-03 20:58:18,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:18,218 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:18,218 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:18,218 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:18,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:18,218 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:18,231 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:58:18,231 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:58:18,386 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:58:18,386 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:18,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 1312 conjuncts, 98 conjunts are in the unsatisfiable core [2019-09-03 20:58:18,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:23,130 INFO L134 CoverageAnalysis]: Checked inductivity of 11092 backedges. 4512 proven. 2256 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2019-09-03 20:58:23,131 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:28,346 INFO L134 CoverageAnalysis]: Checked inductivity of 11092 backedges. 4512 proven. 2256 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2019-09-03 20:58:28,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:28,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 98, 98] total 196 [2019-09-03 20:58:28,351 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:28,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-09-03 20:58:28,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-09-03 20:58:28,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6077, Invalid=32143, Unknown=0, NotChecked=0, Total=38220 [2019-09-03 20:58:28,354 INFO L87 Difference]: Start difference. First operand 486 states and 490 transitions. Second operand 148 states. [2019-09-03 20:58:38,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:38,019 INFO L93 Difference]: Finished difference Result 878 states and 1025 transitions. [2019-09-03 20:58:38,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2019-09-03 20:58:38,020 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 487 [2019-09-03 20:58:38,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:38,023 INFO L225 Difference]: With dead ends: 878 [2019-09-03 20:58:38,023 INFO L226 Difference]: Without dead ends: 689 [2019-09-03 20:58:38,026 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1264 GetRequests, 878 SyntacticMatches, 48 SemanticMatches, 338 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39295 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=18077, Invalid=97183, Unknown=0, NotChecked=0, Total=115260 [2019-09-03 20:58:38,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2019-09-03 20:58:38,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 496. [2019-09-03 20:58:38,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2019-09-03 20:58:38,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 500 transitions. [2019-09-03 20:58:38,032 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 500 transitions. Word has length 487 [2019-09-03 20:58:38,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:38,032 INFO L475 AbstractCegarLoop]: Abstraction has 496 states and 500 transitions. [2019-09-03 20:58:38,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-09-03 20:58:38,033 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 500 transitions. [2019-09-03 20:58:38,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2019-09-03 20:58:38,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:38,035 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 48, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:38,036 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:38,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:38,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1636597679, now seen corresponding path program 49 times [2019-09-03 20:58:38,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:38,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:38,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:38,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:38,037 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:39,222 INFO L134 CoverageAnalysis]: Checked inductivity of 11568 backedges. 2448 proven. 4608 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2019-09-03 20:58:39,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:39,222 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:39,222 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:39,222 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:39,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:39,222 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:39,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:39,234 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:58:39,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:39,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 1339 conjuncts, 100 conjunts are in the unsatisfiable core [2019-09-03 20:58:39,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:44,394 INFO L134 CoverageAnalysis]: Checked inductivity of 11568 backedges. 4704 proven. 2352 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2019-09-03 20:58:44,394 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:49,851 INFO L134 CoverageAnalysis]: Checked inductivity of 11568 backedges. 4704 proven. 2352 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2019-09-03 20:58:49,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:49,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 100, 100] total 200 [2019-09-03 20:58:49,856 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:49,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 151 states [2019-09-03 20:58:49,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2019-09-03 20:58:49,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6326, Invalid=33474, Unknown=0, NotChecked=0, Total=39800 [2019-09-03 20:58:49,859 INFO L87 Difference]: Start difference. First operand 496 states and 500 transitions. Second operand 151 states. [2019-09-03 20:58:59,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:59,579 INFO L93 Difference]: Finished difference Result 896 states and 1046 transitions. [2019-09-03 20:58:59,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2019-09-03 20:58:59,580 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 497 [2019-09-03 20:58:59,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:59,583 INFO L225 Difference]: With dead ends: 896 [2019-09-03 20:58:59,583 INFO L226 Difference]: Without dead ends: 703 [2019-09-03 20:58:59,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1290 GetRequests, 896 SyntacticMatches, 49 SemanticMatches, 345 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40971 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=18821, Invalid=101241, Unknown=0, NotChecked=0, Total=120062 [2019-09-03 20:58:59,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2019-09-03 20:58:59,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 506. [2019-09-03 20:58:59,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-09-03 20:58:59,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 510 transitions. [2019-09-03 20:58:59,600 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 510 transitions. Word has length 497 [2019-09-03 20:58:59,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:59,600 INFO L475 AbstractCegarLoop]: Abstraction has 506 states and 510 transitions. [2019-09-03 20:58:59,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 151 states. [2019-09-03 20:58:59,600 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 510 transitions. [2019-09-03 20:58:59,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2019-09-03 20:58:59,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:59,605 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 49, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:59,606 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:59,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:59,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1796923451, now seen corresponding path program 50 times [2019-09-03 20:58:59,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:59,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:59,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:59,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:59,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:59,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:00,970 INFO L134 CoverageAnalysis]: Checked inductivity of 12054 backedges. 2548 proven. 4802 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2019-09-03 20:59:00,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:00,970 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:00,970 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:00,970 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:59:00,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:00,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:00,980 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:59:00,981 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:59:01,245 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-09-03 20:59:01,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:59:01,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 1366 conjuncts, 102 conjunts are in the unsatisfiable core [2019-09-03 20:59:01,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:06,429 INFO L134 CoverageAnalysis]: Checked inductivity of 12054 backedges. 4900 proven. 2450 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2019-09-03 20:59:06,430 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:12,126 INFO L134 CoverageAnalysis]: Checked inductivity of 12054 backedges. 4900 proven. 2450 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2019-09-03 20:59:12,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:12,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 102, 102] total 204 [2019-09-03 20:59:12,132 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:12,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-09-03 20:59:12,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-09-03 20:59:12,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6580, Invalid=34832, Unknown=0, NotChecked=0, Total=41412 [2019-09-03 20:59:12,135 INFO L87 Difference]: Start difference. First operand 506 states and 510 transitions. Second operand 154 states. [2019-09-03 20:59:22,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:22,910 INFO L93 Difference]: Finished difference Result 914 states and 1067 transitions. [2019-09-03 20:59:22,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2019-09-03 20:59:22,911 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 507 [2019-09-03 20:59:22,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:22,913 INFO L225 Difference]: With dead ends: 914 [2019-09-03 20:59:22,914 INFO L226 Difference]: Without dead ends: 717 [2019-09-03 20:59:22,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1316 GetRequests, 914 SyntacticMatches, 50 SemanticMatches, 352 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42682 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=19580, Invalid=105382, Unknown=0, NotChecked=0, Total=124962 [2019-09-03 20:59:22,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-09-03 20:59:22,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 516. [2019-09-03 20:59:22,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-09-03 20:59:22,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 520 transitions. [2019-09-03 20:59:22,927 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 520 transitions. Word has length 507 [2019-09-03 20:59:22,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:22,928 INFO L475 AbstractCegarLoop]: Abstraction has 516 states and 520 transitions. [2019-09-03 20:59:22,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-09-03 20:59:22,928 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 520 transitions. [2019-09-03 20:59:22,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2019-09-03 20:59:22,931 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:22,932 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:22,932 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:22,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:22,932 INFO L82 PathProgramCache]: Analyzing trace with hash 511524763, now seen corresponding path program 51 times [2019-09-03 20:59:22,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:22,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:22,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:59:22,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:22,933 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:24,294 INFO L134 CoverageAnalysis]: Checked inductivity of 12550 backedges. 2650 proven. 5000 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2019-09-03 20:59:24,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:24,295 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:24,295 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:24,295 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:59:24,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:24,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:24,307 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:59:24,307 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:59:24,471 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:59:24,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:59:24,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 1393 conjuncts, 104 conjunts are in the unsatisfiable core [2019-09-03 20:59:24,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:29,842 INFO L134 CoverageAnalysis]: Checked inductivity of 12550 backedges. 5100 proven. 2550 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2019-09-03 20:59:29,842 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:35,831 INFO L134 CoverageAnalysis]: Checked inductivity of 12550 backedges. 5100 proven. 2550 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2019-09-03 20:59:35,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:35,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 104, 104] total 208 [2019-09-03 20:59:35,836 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:35,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 157 states [2019-09-03 20:59:35,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2019-09-03 20:59:35,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6839, Invalid=36217, Unknown=0, NotChecked=0, Total=43056 [2019-09-03 20:59:35,839 INFO L87 Difference]: Start difference. First operand 516 states and 520 transitions. Second operand 157 states. [2019-09-03 20:59:46,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:46,291 INFO L93 Difference]: Finished difference Result 932 states and 1088 transitions. [2019-09-03 20:59:46,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 208 states. [2019-09-03 20:59:46,291 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 517 [2019-09-03 20:59:46,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:46,295 INFO L225 Difference]: With dead ends: 932 [2019-09-03 20:59:46,295 INFO L226 Difference]: Without dead ends: 731 [2019-09-03 20:59:46,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1342 GetRequests, 932 SyntacticMatches, 51 SemanticMatches, 359 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44428 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=20354, Invalid=109606, Unknown=0, NotChecked=0, Total=129960 [2019-09-03 20:59:46,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-09-03 20:59:46,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 526. [2019-09-03 20:59:46,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2019-09-03 20:59:46,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 530 transitions. [2019-09-03 20:59:46,308 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 530 transitions. Word has length 517 [2019-09-03 20:59:46,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:46,309 INFO L475 AbstractCegarLoop]: Abstraction has 526 states and 530 transitions. [2019-09-03 20:59:46,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 157 states. [2019-09-03 20:59:46,309 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 530 transitions. [2019-09-03 20:59:46,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2019-09-03 20:59:46,312 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:46,313 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 51, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:46,313 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:46,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:46,313 INFO L82 PathProgramCache]: Analyzing trace with hash 672198449, now seen corresponding path program 52 times [2019-09-03 20:59:46,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:46,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:46,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:59:46,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:46,315 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:46,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:47,674 INFO L134 CoverageAnalysis]: Checked inductivity of 13056 backedges. 2754 proven. 5202 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2019-09-03 20:59:47,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:47,675 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:47,675 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:47,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:59:47,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:47,675 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:47,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:47,686 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:59:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:47,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 1420 conjuncts, 106 conjunts are in the unsatisfiable core [2019-09-03 20:59:47,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:53,430 INFO L134 CoverageAnalysis]: Checked inductivity of 13056 backedges. 5304 proven. 2652 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2019-09-03 20:59:53,430 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:59,539 INFO L134 CoverageAnalysis]: Checked inductivity of 13056 backedges. 5304 proven. 2652 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2019-09-03 20:59:59,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:59,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 106, 106] total 212 [2019-09-03 20:59:59,543 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:59,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-09-03 20:59:59,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-09-03 20:59:59,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7103, Invalid=37629, Unknown=0, NotChecked=0, Total=44732 [2019-09-03 20:59:59,547 INFO L87 Difference]: Start difference. First operand 526 states and 530 transitions. Second operand 160 states. [2019-09-03 21:00:10,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:10,387 INFO L93 Difference]: Finished difference Result 950 states and 1109 transitions. [2019-09-03 21:00:10,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2019-09-03 21:00:10,387 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 527 [2019-09-03 21:00:10,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:10,390 INFO L225 Difference]: With dead ends: 950 [2019-09-03 21:00:10,390 INFO L226 Difference]: Without dead ends: 745 [2019-09-03 21:00:10,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1368 GetRequests, 950 SyntacticMatches, 52 SemanticMatches, 366 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46209 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=21143, Invalid=113913, Unknown=0, NotChecked=0, Total=135056 [2019-09-03 21:00:10,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2019-09-03 21:00:10,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 536. [2019-09-03 21:00:10,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-09-03 21:00:10,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 540 transitions. [2019-09-03 21:00:10,406 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 540 transitions. Word has length 527 [2019-09-03 21:00:10,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:10,406 INFO L475 AbstractCegarLoop]: Abstraction has 536 states and 540 transitions. [2019-09-03 21:00:10,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-09-03 21:00:10,406 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 540 transitions. [2019-09-03 21:00:10,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2019-09-03 21:00:10,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:10,409 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 53, 53, 52, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:10,409 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:10,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:10,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1228390777, now seen corresponding path program 53 times [2019-09-03 21:00:10,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:10,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:10,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:00:10,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:10,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:10,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:11,884 INFO L134 CoverageAnalysis]: Checked inductivity of 13572 backedges. 2860 proven. 5408 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2019-09-03 21:00:11,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:11,884 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:11,884 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:11,885 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:00:11,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:11,885 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:11,900 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:00:11,901 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:00:12,191 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-09-03 21:00:12,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:00:12,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 1447 conjuncts, 108 conjunts are in the unsatisfiable core [2019-09-03 21:00:12,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:17,987 INFO L134 CoverageAnalysis]: Checked inductivity of 13572 backedges. 5512 proven. 2756 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2019-09-03 21:00:17,987 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:24,308 INFO L134 CoverageAnalysis]: Checked inductivity of 13572 backedges. 5512 proven. 2756 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2019-09-03 21:00:24,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:24,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 108, 108] total 216 [2019-09-03 21:00:24,313 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:24,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 163 states [2019-09-03 21:00:24,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2019-09-03 21:00:24,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7372, Invalid=39068, Unknown=0, NotChecked=0, Total=46440 [2019-09-03 21:00:24,316 INFO L87 Difference]: Start difference. First operand 536 states and 540 transitions. Second operand 163 states. [2019-09-03 21:00:35,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:35,145 INFO L93 Difference]: Finished difference Result 968 states and 1130 transitions. [2019-09-03 21:00:35,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2019-09-03 21:00:35,146 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 537 [2019-09-03 21:00:35,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:35,150 INFO L225 Difference]: With dead ends: 968 [2019-09-03 21:00:35,150 INFO L226 Difference]: Without dead ends: 759 [2019-09-03 21:00:35,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1394 GetRequests, 968 SyntacticMatches, 53 SemanticMatches, 373 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48025 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=21947, Invalid=118303, Unknown=0, NotChecked=0, Total=140250 [2019-09-03 21:00:35,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2019-09-03 21:00:35,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 546. [2019-09-03 21:00:35,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2019-09-03 21:00:35,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 550 transitions. [2019-09-03 21:00:35,163 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 550 transitions. Word has length 537 [2019-09-03 21:00:35,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:35,163 INFO L475 AbstractCegarLoop]: Abstraction has 546 states and 550 transitions. [2019-09-03 21:00:35,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 163 states. [2019-09-03 21:00:35,163 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 550 transitions. [2019-09-03 21:00:35,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2019-09-03 21:00:35,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:35,167 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 53, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:35,168 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:35,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:35,168 INFO L82 PathProgramCache]: Analyzing trace with hash 339164573, now seen corresponding path program 54 times [2019-09-03 21:00:35,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:35,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:35,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:00:35,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:35,169 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:35,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:36,668 INFO L134 CoverageAnalysis]: Checked inductivity of 14098 backedges. 2968 proven. 5618 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2019-09-03 21:00:36,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:36,668 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:36,669 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:36,669 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:00:36,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:36,669 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:36,680 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:00:36,680 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:00:36,854 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:00:36,854 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:00:36,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 1474 conjuncts, 110 conjunts are in the unsatisfiable core [2019-09-03 21:00:36,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:42,860 INFO L134 CoverageAnalysis]: Checked inductivity of 14098 backedges. 5724 proven. 2862 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2019-09-03 21:00:42,861 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:49,428 INFO L134 CoverageAnalysis]: Checked inductivity of 14098 backedges. 5724 proven. 2862 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2019-09-03 21:00:49,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:49,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 110, 110] total 220 [2019-09-03 21:00:49,433 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:49,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-09-03 21:00:49,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-09-03 21:00:49,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7646, Invalid=40534, Unknown=0, NotChecked=0, Total=48180 [2019-09-03 21:00:49,437 INFO L87 Difference]: Start difference. First operand 546 states and 550 transitions. Second operand 166 states. [2019-09-03 21:01:01,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:01:01,190 INFO L93 Difference]: Finished difference Result 986 states and 1151 transitions. [2019-09-03 21:01:01,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 220 states. [2019-09-03 21:01:01,190 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 547 [2019-09-03 21:01:01,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:01:01,194 INFO L225 Difference]: With dead ends: 986 [2019-09-03 21:01:01,194 INFO L226 Difference]: Without dead ends: 773 [2019-09-03 21:01:01,202 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1420 GetRequests, 986 SyntacticMatches, 54 SemanticMatches, 380 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49876 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=22766, Invalid=122776, Unknown=0, NotChecked=0, Total=145542 [2019-09-03 21:01:01,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2019-09-03 21:01:01,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 556. [2019-09-03 21:01:01,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2019-09-03 21:01:01,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 560 transitions. [2019-09-03 21:01:01,210 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 560 transitions. Word has length 547 [2019-09-03 21:01:01,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:01:01,210 INFO L475 AbstractCegarLoop]: Abstraction has 556 states and 560 transitions. [2019-09-03 21:01:01,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-09-03 21:01:01,210 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 560 transitions. [2019-09-03 21:01:01,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 558 [2019-09-03 21:01:01,214 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:01:01,214 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 55, 55, 54, 54, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:01:01,214 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:01:01,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:01:01,215 INFO L82 PathProgramCache]: Analyzing trace with hash -144835469, now seen corresponding path program 55 times [2019-09-03 21:01:01,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:01:01,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:01,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:01:01,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:01,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:01:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:02,926 INFO L134 CoverageAnalysis]: Checked inductivity of 14634 backedges. 3078 proven. 5832 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2019-09-03 21:01:02,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:02,926 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:01:02,927 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:01:02,927 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:01:02,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:02,927 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:01:02,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:01:02,937 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:01:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:03,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 1501 conjuncts, 112 conjunts are in the unsatisfiable core [2019-09-03 21:01:03,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:01:09,403 INFO L134 CoverageAnalysis]: Checked inductivity of 14634 backedges. 5940 proven. 2970 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2019-09-03 21:01:09,403 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:01:16,215 INFO L134 CoverageAnalysis]: Checked inductivity of 14634 backedges. 5940 proven. 2970 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2019-09-03 21:01:16,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:01:16,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 112, 112] total 224 [2019-09-03 21:01:16,220 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:01:16,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 169 states [2019-09-03 21:01:16,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 169 interpolants. [2019-09-03 21:01:16,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7925, Invalid=42027, Unknown=0, NotChecked=0, Total=49952 [2019-09-03 21:01:16,223 INFO L87 Difference]: Start difference. First operand 556 states and 560 transitions. Second operand 169 states. [2019-09-03 21:01:27,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:01:27,694 INFO L93 Difference]: Finished difference Result 1004 states and 1172 transitions. [2019-09-03 21:01:27,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 224 states. [2019-09-03 21:01:27,695 INFO L78 Accepts]: Start accepts. Automaton has 169 states. Word has length 557 [2019-09-03 21:01:27,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:01:27,699 INFO L225 Difference]: With dead ends: 1004 [2019-09-03 21:01:27,699 INFO L226 Difference]: Without dead ends: 787 [2019-09-03 21:01:27,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1446 GetRequests, 1004 SyntacticMatches, 55 SemanticMatches, 387 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51762 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=23600, Invalid=127332, Unknown=0, NotChecked=0, Total=150932 [2019-09-03 21:01:27,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2019-09-03 21:01:27,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 566. [2019-09-03 21:01:27,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2019-09-03 21:01:27,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 570 transitions. [2019-09-03 21:01:27,711 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 570 transitions. Word has length 557 [2019-09-03 21:01:27,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:01:27,711 INFO L475 AbstractCegarLoop]: Abstraction has 566 states and 570 transitions. [2019-09-03 21:01:27,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 169 states. [2019-09-03 21:01:27,711 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 570 transitions. [2019-09-03 21:01:27,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2019-09-03 21:01:27,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:01:27,714 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 56, 56, 55, 55, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:01:27,714 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:01:27,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:01:27,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1839762185, now seen corresponding path program 56 times [2019-09-03 21:01:27,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:01:27,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:27,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:01:27,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:27,715 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:01:27,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:29,295 INFO L134 CoverageAnalysis]: Checked inductivity of 15180 backedges. 3190 proven. 6050 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2019-09-03 21:01:29,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:29,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:01:29,296 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:01:29,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:01:29,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:29,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:01:29,308 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:01:29,308 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:01:29,620 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2019-09-03 21:01:29,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:01:29,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 1528 conjuncts, 114 conjunts are in the unsatisfiable core [2019-09-03 21:01:29,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:01:36,067 INFO L134 CoverageAnalysis]: Checked inductivity of 15180 backedges. 6160 proven. 3080 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2019-09-03 21:01:36,068 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:01:43,109 INFO L134 CoverageAnalysis]: Checked inductivity of 15180 backedges. 6160 proven. 3080 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2019-09-03 21:01:43,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:01:43,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 114, 114] total 228 [2019-09-03 21:01:43,114 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:01:43,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 172 states [2019-09-03 21:01:43,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2019-09-03 21:01:43,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8209, Invalid=43547, Unknown=0, NotChecked=0, Total=51756 [2019-09-03 21:01:43,118 INFO L87 Difference]: Start difference. First operand 566 states and 570 transitions. Second operand 172 states. [2019-09-03 21:01:55,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:01:55,712 INFO L93 Difference]: Finished difference Result 1022 states and 1193 transitions. [2019-09-03 21:01:55,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 228 states. [2019-09-03 21:01:55,712 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 567 [2019-09-03 21:01:55,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:01:55,717 INFO L225 Difference]: With dead ends: 1022 [2019-09-03 21:01:55,717 INFO L226 Difference]: Without dead ends: 801 [2019-09-03 21:01:55,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1472 GetRequests, 1022 SyntacticMatches, 56 SemanticMatches, 394 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53683 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=24449, Invalid=131971, Unknown=0, NotChecked=0, Total=156420 [2019-09-03 21:01:55,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2019-09-03 21:01:55,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 576. [2019-09-03 21:01:55,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-09-03 21:01:55,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 580 transitions. [2019-09-03 21:01:55,730 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 580 transitions. Word has length 567 [2019-09-03 21:01:55,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:01:55,731 INFO L475 AbstractCegarLoop]: Abstraction has 576 states and 580 transitions. [2019-09-03 21:01:55,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 172 states. [2019-09-03 21:01:55,731 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 580 transitions. [2019-09-03 21:01:55,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2019-09-03 21:01:55,733 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:01:55,734 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 57, 57, 56, 56, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:01:55,734 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:01:55,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:01:55,734 INFO L82 PathProgramCache]: Analyzing trace with hash -2081490593, now seen corresponding path program 57 times [2019-09-03 21:01:55,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:01:55,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:55,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:01:55,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:55,735 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:01:55,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:57,276 INFO L134 CoverageAnalysis]: Checked inductivity of 15736 backedges. 3304 proven. 6272 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2019-09-03 21:01:57,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:57,276 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:01:57,276 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:01:57,276 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:01:57,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:57,276 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:01:57,333 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:01:57,333 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:01:57,514 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:01:57,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:01:57,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 1555 conjuncts, 116 conjunts are in the unsatisfiable core [2019-09-03 21:01:57,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:02:04,139 INFO L134 CoverageAnalysis]: Checked inductivity of 15736 backedges. 6384 proven. 3192 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2019-09-03 21:02:04,140 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:02:11,409 INFO L134 CoverageAnalysis]: Checked inductivity of 15736 backedges. 6384 proven. 3192 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2019-09-03 21:02:11,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:02:11,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 116, 116] total 232 [2019-09-03 21:02:11,414 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:02:11,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 175 states [2019-09-03 21:02:11,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 175 interpolants. [2019-09-03 21:02:11,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8498, Invalid=45094, Unknown=0, NotChecked=0, Total=53592 [2019-09-03 21:02:11,418 INFO L87 Difference]: Start difference. First operand 576 states and 580 transitions. Second operand 175 states. [2019-09-03 21:02:24,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:02:24,068 INFO L93 Difference]: Finished difference Result 1040 states and 1214 transitions. [2019-09-03 21:02:24,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 232 states. [2019-09-03 21:02:24,069 INFO L78 Accepts]: Start accepts. Automaton has 175 states. Word has length 577 [2019-09-03 21:02:24,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:02:24,073 INFO L225 Difference]: With dead ends: 1040 [2019-09-03 21:02:24,073 INFO L226 Difference]: Without dead ends: 815 [2019-09-03 21:02:24,084 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1498 GetRequests, 1040 SyntacticMatches, 57 SemanticMatches, 401 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55639 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=25313, Invalid=136693, Unknown=0, NotChecked=0, Total=162006 [2019-09-03 21:02:24,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2019-09-03 21:02:24,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 586. [2019-09-03 21:02:24,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-09-03 21:02:24,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 590 transitions. [2019-09-03 21:02:24,091 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 590 transitions. Word has length 577 [2019-09-03 21:02:24,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:02:24,091 INFO L475 AbstractCegarLoop]: Abstraction has 586 states and 590 transitions. [2019-09-03 21:02:24,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 175 states. [2019-09-03 21:02:24,091 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 590 transitions. [2019-09-03 21:02:24,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2019-09-03 21:02:24,095 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:02:24,096 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 58, 58, 57, 57, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:02:24,096 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:02:24,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:02:24,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1351264395, now seen corresponding path program 58 times [2019-09-03 21:02:24,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:02:24,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:24,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:02:24,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:24,097 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:02:24,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:25,939 INFO L134 CoverageAnalysis]: Checked inductivity of 16302 backedges. 3420 proven. 6498 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2019-09-03 21:02:25,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:25,939 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:02:25,939 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:02:25,939 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:02:25,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:25,939 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:02:25,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:02:25,950 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:02:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:26,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 1582 conjuncts, 118 conjunts are in the unsatisfiable core [2019-09-03 21:02:26,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:02:33,203 INFO L134 CoverageAnalysis]: Checked inductivity of 16302 backedges. 6612 proven. 3306 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2019-09-03 21:02:33,203 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:02:40,783 INFO L134 CoverageAnalysis]: Checked inductivity of 16302 backedges. 6612 proven. 3306 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2019-09-03 21:02:40,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:02:40,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 118, 118] total 236 [2019-09-03 21:02:40,787 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:02:40,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 178 states [2019-09-03 21:02:40,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2019-09-03 21:02:40,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8792, Invalid=46668, Unknown=0, NotChecked=0, Total=55460 [2019-09-03 21:02:40,792 INFO L87 Difference]: Start difference. First operand 586 states and 590 transitions. Second operand 178 states. [2019-09-03 21:02:53,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:02:53,128 INFO L93 Difference]: Finished difference Result 1058 states and 1235 transitions. [2019-09-03 21:02:53,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 236 states. [2019-09-03 21:02:53,128 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 587 [2019-09-03 21:02:53,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:02:53,133 INFO L225 Difference]: With dead ends: 1058 [2019-09-03 21:02:53,133 INFO L226 Difference]: Without dead ends: 829 [2019-09-03 21:02:53,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1524 GetRequests, 1058 SyntacticMatches, 58 SemanticMatches, 408 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57630 ImplicationChecksByTransitivity, 22.7s TimeCoverageRelationStatistics Valid=26192, Invalid=141498, Unknown=0, NotChecked=0, Total=167690 [2019-09-03 21:02:53,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2019-09-03 21:02:53,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 596. [2019-09-03 21:02:53,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-09-03 21:02:53,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 600 transitions. [2019-09-03 21:02:53,146 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 600 transitions. Word has length 587 [2019-09-03 21:02:53,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:02:53,146 INFO L475 AbstractCegarLoop]: Abstraction has 596 states and 600 transitions. [2019-09-03 21:02:53,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 178 states. [2019-09-03 21:02:53,147 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 600 transitions. [2019-09-03 21:02:53,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2019-09-03 21:02:53,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:02:53,151 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 59, 59, 58, 58, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:02:53,151 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:02:53,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:02:53,152 INFO L82 PathProgramCache]: Analyzing trace with hash -152324789, now seen corresponding path program 59 times [2019-09-03 21:02:53,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:02:53,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:53,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:02:53,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:53,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:02:53,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:54,836 INFO L134 CoverageAnalysis]: Checked inductivity of 16878 backedges. 3538 proven. 6728 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2019-09-03 21:02:54,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:54,836 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:02:54,837 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:02:54,837 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:02:54,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:54,837 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:02:54,849 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:02:54,849 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:02:55,184 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 59 check-sat command(s) [2019-09-03 21:02:55,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:02:55,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 1609 conjuncts, 120 conjunts are in the unsatisfiable core [2019-09-03 21:02:55,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:03:02,317 INFO L134 CoverageAnalysis]: Checked inductivity of 16878 backedges. 6844 proven. 3422 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2019-09-03 21:03:02,317 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:03:10,099 INFO L134 CoverageAnalysis]: Checked inductivity of 16878 backedges. 6844 proven. 3422 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2019-09-03 21:03:10,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:03:10,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 120, 120] total 240 [2019-09-03 21:03:10,105 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:03:10,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 181 states [2019-09-03 21:03:10,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 181 interpolants. [2019-09-03 21:03:10,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9091, Invalid=48269, Unknown=0, NotChecked=0, Total=57360 [2019-09-03 21:03:10,110 INFO L87 Difference]: Start difference. First operand 596 states and 600 transitions. Second operand 181 states. [2019-09-03 21:03:23,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:03:23,944 INFO L93 Difference]: Finished difference Result 1076 states and 1256 transitions. [2019-09-03 21:03:23,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 240 states. [2019-09-03 21:03:23,945 INFO L78 Accepts]: Start accepts. Automaton has 181 states. Word has length 597 [2019-09-03 21:03:23,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:03:23,949 INFO L225 Difference]: With dead ends: 1076 [2019-09-03 21:03:23,949 INFO L226 Difference]: Without dead ends: 843 [2019-09-03 21:03:23,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1550 GetRequests, 1076 SyntacticMatches, 59 SemanticMatches, 415 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59656 ImplicationChecksByTransitivity, 23.1s TimeCoverageRelationStatistics Valid=27086, Invalid=146386, Unknown=0, NotChecked=0, Total=173472 [2019-09-03 21:03:23,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2019-09-03 21:03:23,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 606. [2019-09-03 21:03:23,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-09-03 21:03:23,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 610 transitions. [2019-09-03 21:03:23,968 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 610 transitions. Word has length 597 [2019-09-03 21:03:23,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:03:23,968 INFO L475 AbstractCegarLoop]: Abstraction has 606 states and 610 transitions. [2019-09-03 21:03:23,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 181 states. [2019-09-03 21:03:23,969 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 610 transitions. [2019-09-03 21:03:23,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2019-09-03 21:03:23,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:03:23,972 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 59, 59, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:03:23,972 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:03:23,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:03:23,973 INFO L82 PathProgramCache]: Analyzing trace with hash -613539103, now seen corresponding path program 60 times [2019-09-03 21:03:23,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:03:23,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:23,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:03:23,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:23,974 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:03:24,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:25,741 INFO L134 CoverageAnalysis]: Checked inductivity of 17464 backedges. 3658 proven. 6962 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2019-09-03 21:03:25,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:25,742 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:03:25,742 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:03:25,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:03:25,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:25,742 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:03:25,752 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:03:25,752 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:03:25,946 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:03:25,947 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:03:25,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 1636 conjuncts, 122 conjunts are in the unsatisfiable core [2019-09-03 21:03:25,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:03:33,349 INFO L134 CoverageAnalysis]: Checked inductivity of 17464 backedges. 7080 proven. 3540 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2019-09-03 21:03:33,349 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:03:41,362 INFO L134 CoverageAnalysis]: Checked inductivity of 17464 backedges. 7080 proven. 3540 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2019-09-03 21:03:41,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:03:41,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 122, 122] total 244 [2019-09-03 21:03:41,367 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:03:41,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 184 states [2019-09-03 21:03:41,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2019-09-03 21:03:41,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9395, Invalid=49897, Unknown=0, NotChecked=0, Total=59292 [2019-09-03 21:03:41,372 INFO L87 Difference]: Start difference. First operand 606 states and 610 transitions. Second operand 184 states. [2019-09-03 21:03:55,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:03:55,357 INFO L93 Difference]: Finished difference Result 1094 states and 1277 transitions. [2019-09-03 21:03:55,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 244 states. [2019-09-03 21:03:55,358 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 607 [2019-09-03 21:03:55,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:03:55,361 INFO L225 Difference]: With dead ends: 1094 [2019-09-03 21:03:55,361 INFO L226 Difference]: Without dead ends: 857 [2019-09-03 21:03:55,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1576 GetRequests, 1094 SyntacticMatches, 60 SemanticMatches, 422 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61717 ImplicationChecksByTransitivity, 23.9s TimeCoverageRelationStatistics Valid=27995, Invalid=151357, Unknown=0, NotChecked=0, Total=179352 [2019-09-03 21:03:55,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2019-09-03 21:03:55,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 616. [2019-09-03 21:03:55,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2019-09-03 21:03:55,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 620 transitions. [2019-09-03 21:03:55,378 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 620 transitions. Word has length 607 [2019-09-03 21:03:55,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:03:55,378 INFO L475 AbstractCegarLoop]: Abstraction has 616 states and 620 transitions. [2019-09-03 21:03:55,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 184 states. [2019-09-03 21:03:55,379 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 620 transitions. [2019-09-03 21:03:55,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 618 [2019-09-03 21:03:55,381 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:03:55,382 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 61, 61, 60, 60, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:03:55,382 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:03:55,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:03:55,382 INFO L82 PathProgramCache]: Analyzing trace with hash 25473079, now seen corresponding path program 61 times [2019-09-03 21:03:55,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:03:55,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:55,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:03:55,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:55,383 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:03:55,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:57,265 INFO L134 CoverageAnalysis]: Checked inductivity of 18060 backedges. 3780 proven. 7200 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2019-09-03 21:03:57,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:57,266 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:03:57,266 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:03:57,266 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:03:57,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:57,266 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:03:57,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:03:57,276 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:03:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:57,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 1663 conjuncts, 124 conjunts are in the unsatisfiable core [2019-09-03 21:03:57,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:05,059 INFO L134 CoverageAnalysis]: Checked inductivity of 18060 backedges. 7320 proven. 3660 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2019-09-03 21:04:05,059 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:13,344 INFO L134 CoverageAnalysis]: Checked inductivity of 18060 backedges. 7320 proven. 3660 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2019-09-03 21:04:13,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:13,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 124, 124] total 248 [2019-09-03 21:04:13,349 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:13,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 187 states [2019-09-03 21:04:13,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 187 interpolants. [2019-09-03 21:04:13,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9704, Invalid=51552, Unknown=0, NotChecked=0, Total=61256 [2019-09-03 21:04:13,354 INFO L87 Difference]: Start difference. First operand 616 states and 620 transitions. Second operand 187 states.