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-lit/gj2007.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 20:53:01,622 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:53:01,624 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:53:01,636 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:53:01,636 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:53:01,637 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:53:01,639 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:53:01,641 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:53:01,642 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:53:01,643 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:53:01,644 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:53:01,645 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:53:01,646 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:53:01,647 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:53:01,648 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:53:01,649 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:53:01,650 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:53:01,650 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:53:01,652 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:53:01,655 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:53:01,657 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:53:01,658 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:53:01,659 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:53:01,660 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:53:01,662 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:53:01,662 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:53:01,663 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:53:01,664 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:53:01,664 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:53:01,665 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:53:01,665 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:53:01,666 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:53:01,667 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:53:01,667 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:53:01,669 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:53:01,669 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:53:01,670 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:53:01,670 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:53:01,670 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:53:01,671 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:53:01,672 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:53:01,673 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:53:01,687 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:53:01,688 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:53:01,688 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 20:53:01,688 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 20:53:01,689 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 20:53:01,689 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 20:53:01,689 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 20:53:01,690 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 20:53:01,690 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 20:53:01,690 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 20:53:01,691 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:53:01,691 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:53:01,691 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:53:01,691 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:53:01,691 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:53:01,692 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:53:01,692 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:53:01,692 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:53:01,692 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:53:01,692 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:53:01,693 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:53:01,693 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 20:53:01,693 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:53:01,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:53:01,694 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:53:01,694 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:53:01,694 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 20:53:01,694 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:53:01,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:53:01,695 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 20:53:01,723 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:53:01,736 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:53:01,740 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:53:01,741 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:53:01,742 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:53:01,743 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gj2007.i [2019-09-03 20:53:01,806 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d6e8a8e0/a31fba2c410644fba5df1f493e762226/FLAG9d59f03aa [2019-09-03 20:53:02,224 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:53:02,225 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007.i [2019-09-03 20:53:02,231 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d6e8a8e0/a31fba2c410644fba5df1f493e762226/FLAG9d59f03aa [2019-09-03 20:53:02,646 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d6e8a8e0/a31fba2c410644fba5df1f493e762226 [2019-09-03 20:53:02,657 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:53:02,658 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:53:02,659 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:53:02,660 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:53:02,663 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:53:02,664 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:53:02" (1/1) ... [2019-09-03 20:53:02,668 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@566837db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:53:02, skipping insertion in model container [2019-09-03 20:53:02,668 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:53:02" (1/1) ... [2019-09-03 20:53:02,676 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:53:02,697 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:53:02,889 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:53:02,901 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:53:02,917 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:53:02,929 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:53:02,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:53:02 WrapperNode [2019-09-03 20:53:02,930 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:53:02,931 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:53:02,931 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:53:02,931 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:53:03,041 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:53:02" (1/1) ... [2019-09-03 20:53:03,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:53:02" (1/1) ... [2019-09-03 20:53:03,048 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:53:02" (1/1) ... [2019-09-03 20:53:03,049 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:53:02" (1/1) ... [2019-09-03 20:53:03,055 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:53:02" (1/1) ... [2019-09-03 20:53:03,062 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:53:02" (1/1) ... [2019-09-03 20:53:03,063 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:53:02" (1/1) ... [2019-09-03 20:53:03,065 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:53:03,065 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:53:03,066 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:53:03,066 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:53:03,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:53:02" (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:53:03,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:53:03,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:53:03,118 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 20:53:03,119 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:53:03,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:53:03,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 20:53:03,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:53:03,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 20:53:03,119 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:53:03,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:53:03,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:53:03,277 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:53:03,277 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-03 20:53:03,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:53:03 BoogieIcfgContainer [2019-09-03 20:53:03,279 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:53:03,280 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:53:03,280 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:53:03,283 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:53:03,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:53:02" (1/3) ... [2019-09-03 20:53:03,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57835925 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:53:03, skipping insertion in model container [2019-09-03 20:53:03,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:53:02" (2/3) ... [2019-09-03 20:53:03,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57835925 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:53:03, skipping insertion in model container [2019-09-03 20:53:03,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:53:03" (3/3) ... [2019-09-03 20:53:03,287 INFO L109 eAbstractionObserver]: Analyzing ICFG gj2007.i [2019-09-03 20:53:03,296 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:53:03,303 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 20:53:03,318 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 20:53:03,346 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:53:03,346 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 20:53:03,347 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:53:03,347 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:53:03,347 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:53:03,347 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:53:03,347 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:53:03,347 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:53:03,363 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-09-03 20:53:03,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:53:03,373 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:03,374 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:03,376 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:03,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:03,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1712329921, now seen corresponding path program 1 times [2019-09-03 20:53:03,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:03,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:03,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:03,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:03,424 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:03,478 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:53:03,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:53:03,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 20:53:03,481 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:53:03,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 20:53:03,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 20:53:03,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:53:03,503 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-09-03 20:53:03,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:03,521 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-09-03 20:53:03,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 20:53:03,522 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-03 20:53:03,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:03,532 INFO L225 Difference]: With dead ends: 19 [2019-09-03 20:53:03,532 INFO L226 Difference]: Without dead ends: 12 [2019-09-03 20:53:03,534 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:53:03,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-03 20:53:03,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-03 20:53:03,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-03 20:53:03,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-09-03 20:53:03,564 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2019-09-03 20:53:03,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:03,564 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-09-03 20:53:03,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 20:53:03,565 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-09-03 20:53:03,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:53:03,565 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:03,566 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:03,566 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:03,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:03,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1703094711, now seen corresponding path program 1 times [2019-09-03 20:53:03,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:03,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:03,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:03,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:03,568 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:03,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:03,637 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:53:03,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:53:03,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:53:03,638 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:53:03,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:53:03,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:53:03,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:53:03,641 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 3 states. [2019-09-03 20:53:03,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:03,670 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-09-03 20:53:03,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:53:03,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-03 20:53:03,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:03,672 INFO L225 Difference]: With dead ends: 14 [2019-09-03 20:53:03,672 INFO L226 Difference]: Without dead ends: 14 [2019-09-03 20:53:03,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:53:03,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-03 20:53:03,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-09-03 20:53:03,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-03 20:53:03,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-09-03 20:53:03,678 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2019-09-03 20:53:03,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:03,678 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-09-03 20:53:03,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:53:03,679 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-09-03 20:53:03,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 20:53:03,680 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:03,680 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:03,680 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:03,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:03,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1337256884, now seen corresponding path program 1 times [2019-09-03 20:53:03,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:03,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:03,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:03,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:03,683 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:03,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:03,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:53:03,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:03,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:03,802 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 13 with the following transitions: [2019-09-03 20:53:03,804 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [16], [26], [29], [31], [37], [38], [39], [41] [2019-09-03 20:53:03,873 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:53:03,874 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:53:04,017 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-03 20:53:04,020 INFO L272 AbstractInterpreter]: Visited 8 different actions 23 times. Merged at 2 different actions 10 times. Widened at 1 different actions 1 times. Performed 42 root evaluator evaluations with a maximum evaluation depth of 4. Performed 42 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 2 variables. [2019-09-03 20:53:04,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:04,025 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-03 20:53:04,064 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-03 20:53:04,064 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-03 20:53:04,071 INFO L420 sIntCurrentIteration]: We unified 11 AI predicates to 11 [2019-09-03 20:53:04,071 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-03 20:53:04,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:53:04,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-03 20:53:04,073 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:53:04,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:53:04,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:53:04,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:53:04,075 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 3 states. [2019-09-03 20:53:04,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:04,120 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2019-09-03 20:53:04,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:53:04,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-09-03 20:53:04,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:04,122 INFO L225 Difference]: With dead ends: 16 [2019-09-03 20:53:04,122 INFO L226 Difference]: Without dead ends: 16 [2019-09-03 20:53:04,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:53:04,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-03 20:53:04,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-03 20:53:04,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-03 20:53:04,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-09-03 20:53:04,131 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2019-09-03 20:53:04,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:04,132 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-09-03 20:53:04,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:53:04,133 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2019-09-03 20:53:04,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 20:53:04,134 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:04,134 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:04,135 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:04,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:04,135 INFO L82 PathProgramCache]: Analyzing trace with hash 2011681711, now seen corresponding path program 1 times [2019-09-03 20:53:04,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:04,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:04,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:04,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:04,137 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:04,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:04,179 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:53:04,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:04,179 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:04,180 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2019-09-03 20:53:04,180 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [16], [18], [26], [29], [31], [37], [38], [39], [41] [2019-09-03 20:53:04,182 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:53:04,182 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:53:04,215 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:53:04,216 INFO L272 AbstractInterpreter]: Visited 13 different actions 45 times. Merged at 4 different actions 15 times. Widened at 2 different actions 3 times. Performed 84 root evaluator evaluations with a maximum evaluation depth of 4. Performed 84 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 4 fixpoints after 2 different actions. Largest state had 2 variables. [2019-09-03 20:53:04,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:04,218 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:53:04,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:04,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 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:53:04,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:04,247 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:04,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-03 20:53:04,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:04,303 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:53:04,304 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:04,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:53:04,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:04,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-09-03 20:53:04,351 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:04,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:53:04,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:53:04,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:53:04,353 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 4 states. [2019-09-03 20:53:04,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:04,376 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-09-03 20:53:04,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:53:04,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-09-03 20:53:04,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:04,378 INFO L225 Difference]: With dead ends: 18 [2019-09-03 20:53:04,378 INFO L226 Difference]: Without dead ends: 18 [2019-09-03 20:53:04,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:53:04,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-03 20:53:04,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-03 20:53:04,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-03 20:53:04,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-09-03 20:53:04,382 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2019-09-03 20:53:04,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:04,383 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-09-03 20:53:04,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:53:04,383 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-09-03 20:53:04,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 20:53:04,384 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:04,384 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:04,384 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:04,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:04,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1891741908, now seen corresponding path program 2 times [2019-09-03 20:53:04,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:04,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:04,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:04,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:04,387 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:04,456 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:53:04,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:04,457 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:04,457 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:04,458 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:04,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:04,459 INFO 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:53:04,492 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:04,493 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:04,506 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 20:53:04,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:04,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 20:53:04,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:04,543 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:53:04,543 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:04,597 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:53:04,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:04,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2019-09-03 20:53:04,602 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:04,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 20:53:04,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 20:53:04,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:53:04,604 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 8 states. [2019-09-03 20:53:04,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:04,675 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2019-09-03 20:53:04,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:53:04,676 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-09-03 20:53:04,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:04,679 INFO L225 Difference]: With dead ends: 26 [2019-09-03 20:53:04,679 INFO L226 Difference]: Without dead ends: 26 [2019-09-03 20:53:04,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:53:04,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-03 20:53:04,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2019-09-03 20:53:04,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-03 20:53:04,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-09-03 20:53:04,695 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 16 [2019-09-03 20:53:04,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:04,695 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-09-03 20:53:04,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 20:53:04,696 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-09-03 20:53:04,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-03 20:53:04,697 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:04,697 INFO L399 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:04,702 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:04,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:04,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1567930911, now seen corresponding path program 3 times [2019-09-03 20:53:04,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:04,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:04,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:04,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:04,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:04,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:04,800 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:53:04,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:04,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:04,801 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:04,802 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:04,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:04,802 INFO 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:53:04,816 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:04,817 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:53:04,858 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:04,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:04,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 20:53:04,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:04,874 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:53:04,874 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:04,931 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:53:04,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:04,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2019-09-03 20:53:04,936 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:04,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:53:04,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:53:04,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:53:04,938 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 6 states. [2019-09-03 20:53:04,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:04,962 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-09-03 20:53:04,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:53:04,963 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-09-03 20:53:04,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:04,964 INFO L225 Difference]: With dead ends: 25 [2019-09-03 20:53:04,964 INFO L226 Difference]: Without dead ends: 25 [2019-09-03 20:53:04,964 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:53:04,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-03 20:53:04,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-09-03 20:53:04,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-03 20:53:04,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-09-03 20:53:04,968 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 22 [2019-09-03 20:53:04,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:04,969 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-09-03 20:53:04,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:53:04,969 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-09-03 20:53:04,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-03 20:53:04,970 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:04,970 INFO L399 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:04,970 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:04,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:04,971 INFO L82 PathProgramCache]: Analyzing trace with hash 92956828, now seen corresponding path program 4 times [2019-09-03 20:53:04,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:04,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:04,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:04,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:04,973 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:05,026 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:53:05,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:05,026 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:05,027 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:05,027 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:05,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:05,028 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:53:05,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:05,045 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:05,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-03 20:53:05,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:05,071 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:53:05,072 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:05,134 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:53:05,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:05,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2019-09-03 20:53:05,138 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:05,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:53:05,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:53:05,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:53:05,140 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 7 states. [2019-09-03 20:53:05,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:05,174 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2019-09-03 20:53:05,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:53:05,174 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-09-03 20:53:05,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:05,175 INFO L225 Difference]: With dead ends: 27 [2019-09-03 20:53:05,175 INFO L226 Difference]: Without dead ends: 27 [2019-09-03 20:53:05,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:53:05,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-03 20:53:05,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-03 20:53:05,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-03 20:53:05,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-09-03 20:53:05,180 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 24 [2019-09-03 20:53:05,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:05,180 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-09-03 20:53:05,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:53:05,181 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-09-03 20:53:05,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-03 20:53:05,181 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:05,182 INFO L399 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:05,182 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:05,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:05,182 INFO L82 PathProgramCache]: Analyzing trace with hash -17929255, now seen corresponding path program 5 times [2019-09-03 20:53:05,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:05,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:05,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:05,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:05,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:05,249 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:53:05,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:05,250 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:05,250 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:05,250 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:05,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:05,251 INFO 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:53:05,268 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:05,269 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:05,287 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-03 20:53:05,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:05,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-03 20:53:05,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:05,351 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-03 20:53:05,352 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:05,442 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-03 20:53:05,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:05,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2019-09-03 20:53:05,447 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:05,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 20:53:05,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 20:53:05,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-03 20:53:05,449 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 12 states. [2019-09-03 20:53:05,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:05,516 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2019-09-03 20:53:05,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 20:53:05,517 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-09-03 20:53:05,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:05,518 INFO L225 Difference]: With dead ends: 32 [2019-09-03 20:53:05,518 INFO L226 Difference]: Without dead ends: 32 [2019-09-03 20:53:05,519 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-03 20:53:05,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-03 20:53:05,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-09-03 20:53:05,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-03 20:53:05,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-09-03 20:53:05,523 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 26 [2019-09-03 20:53:05,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:05,523 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-09-03 20:53:05,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 20:53:05,523 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-09-03 20:53:05,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-03 20:53:05,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:05,525 INFO L399 BasicCegarLoop]: trace histogram [10, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:05,525 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:05,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:05,525 INFO L82 PathProgramCache]: Analyzing trace with hash 331873105, now seen corresponding path program 6 times [2019-09-03 20:53:05,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:05,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:05,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:05,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:05,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:05,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:05,639 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-03 20:53:05,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:05,639 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:05,639 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:05,640 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:05,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:05,640 INFO 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:53:05,656 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:05,657 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:53:05,676 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:05,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:05,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 20:53:05,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:05,692 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-03 20:53:05,693 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:05,817 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-03 20:53:05,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:05,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2019-09-03 20:53:05,821 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:05,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 20:53:05,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 20:53:05,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-03 20:53:05,824 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 9 states. [2019-09-03 20:53:05,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:05,870 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2019-09-03 20:53:05,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:53:05,870 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-09-03 20:53:05,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:05,871 INFO L225 Difference]: With dead ends: 33 [2019-09-03 20:53:05,871 INFO L226 Difference]: Without dead ends: 33 [2019-09-03 20:53:05,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-03 20:53:05,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-03 20:53:05,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-03 20:53:05,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-03 20:53:05,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-09-03 20:53:05,876 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 30 [2019-09-03 20:53:05,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:05,877 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-09-03 20:53:05,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 20:53:05,877 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-09-03 20:53:05,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-03 20:53:05,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:05,878 INFO L399 BasicCegarLoop]: trace histogram [11, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:05,878 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:05,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:05,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1078338354, now seen corresponding path program 7 times [2019-09-03 20:53:05,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:05,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:05,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:05,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:05,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:05,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:05,990 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-03 20:53:05,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:05,991 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:05,991 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:05,991 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:05,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:05,991 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:53:06,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:06,011 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:06,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:06,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 20:53:06,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:06,034 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-03 20:53:06,034 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:06,186 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-03 20:53:06,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:06,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2019-09-03 20:53:06,193 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:06,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 20:53:06,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 20:53:06,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-03 20:53:06,194 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 10 states. [2019-09-03 20:53:06,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:06,236 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2019-09-03 20:53:06,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 20:53:06,236 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-09-03 20:53:06,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:06,237 INFO L225 Difference]: With dead ends: 35 [2019-09-03 20:53:06,237 INFO L226 Difference]: Without dead ends: 35 [2019-09-03 20:53:06,238 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-03 20:53:06,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-03 20:53:06,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-09-03 20:53:06,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-03 20:53:06,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-09-03 20:53:06,242 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 32 [2019-09-03 20:53:06,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:06,242 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-09-03 20:53:06,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 20:53:06,243 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-09-03 20:53:06,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-03 20:53:06,243 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:06,244 INFO L399 BasicCegarLoop]: trace histogram [12, 8, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:06,244 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:06,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:06,244 INFO L82 PathProgramCache]: Analyzing trace with hash 918115083, now seen corresponding path program 8 times [2019-09-03 20:53:06,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:06,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:06,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:06,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:06,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:06,337 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 63 proven. 72 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-03 20:53:06,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:06,338 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:06,338 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:06,338 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:06,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:06,339 INFO 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:53:06,351 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:06,351 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:06,371 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-03 20:53:06,371 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:06,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-03 20:53:06,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:06,436 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 16 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-03 20:53:06,437 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:06,522 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 16 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-03 20:53:06,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:06,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 21 [2019-09-03 20:53:06,526 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:06,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 20:53:06,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 20:53:06,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-03 20:53:06,531 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 16 states. [2019-09-03 20:53:06,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:06,604 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2019-09-03 20:53:06,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 20:53:06,605 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2019-09-03 20:53:06,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:06,606 INFO L225 Difference]: With dead ends: 40 [2019-09-03 20:53:06,606 INFO L226 Difference]: Without dead ends: 40 [2019-09-03 20:53:06,607 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-03 20:53:06,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-03 20:53:06,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-09-03 20:53:06,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-03 20:53:06,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2019-09-03 20:53:06,610 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 34 [2019-09-03 20:53:06,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:06,610 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2019-09-03 20:53:06,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 20:53:06,611 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2019-09-03 20:53:06,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-03 20:53:06,612 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:06,612 INFO L399 BasicCegarLoop]: trace histogram [14, 9, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:06,612 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:06,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:06,613 INFO L82 PathProgramCache]: Analyzing trace with hash 287297795, now seen corresponding path program 9 times [2019-09-03 20:53:06,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:06,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:06,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:06,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:06,614 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:06,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:06,739 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-03 20:53:06,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:06,740 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:06,740 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:06,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:53:06,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:06,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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:53:06,759 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:06,760 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:06,778 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:06,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:06,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 20:53:06,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:06,789 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-03 20:53:06,789 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:07,001 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-03 20:53:07,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:07,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2019-09-03 20:53:07,008 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:07,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 20:53:07,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 20:53:07,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-03 20:53:07,009 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 12 states. [2019-09-03 20:53:07,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:07,056 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2019-09-03 20:53:07,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 20:53:07,056 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2019-09-03 20:53:07,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:07,057 INFO L225 Difference]: With dead ends: 41 [2019-09-03 20:53:07,057 INFO L226 Difference]: Without dead ends: 41 [2019-09-03 20:53:07,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-03 20:53:07,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-03 20:53:07,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-09-03 20:53:07,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-03 20:53:07,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2019-09-03 20:53:07,062 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 38 [2019-09-03 20:53:07,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:07,062 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2019-09-03 20:53:07,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 20:53:07,063 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2019-09-03 20:53:07,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-03 20:53:07,063 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:07,064 INFO L399 BasicCegarLoop]: trace histogram [15, 10, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:07,064 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:07,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:07,064 INFO L82 PathProgramCache]: Analyzing trace with hash -955587200, now seen corresponding path program 10 times [2019-09-03 20:53:07,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:07,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:07,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:07,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:07,065 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:07,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:07,152 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 99 proven. 110 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-03 20:53:07,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:07,153 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:07,153 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:07,153 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,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:07,153 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:07,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:07,171 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:53:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:07,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 20:53:07,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:07,215 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 99 proven. 110 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-03 20:53:07,216 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:07,432 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 99 proven. 110 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-03 20:53:07,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:07,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2019-09-03 20:53:07,437 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:07,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 20:53:07,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 20:53:07,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-03 20:53:07,439 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 13 states. [2019-09-03 20:53:07,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:07,483 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2019-09-03 20:53:07,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 20:53:07,484 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-09-03 20:53:07,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:07,485 INFO L225 Difference]: With dead ends: 43 [2019-09-03 20:53:07,485 INFO L226 Difference]: Without dead ends: 43 [2019-09-03 20:53:07,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-03 20:53:07,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-03 20:53:07,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-09-03 20:53:07,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-03 20:53:07,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2019-09-03 20:53:07,490 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 40 [2019-09-03 20:53:07,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:07,490 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2019-09-03 20:53:07,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 20:53:07,490 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2019-09-03 20:53:07,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-03 20:53:07,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:07,491 INFO L399 BasicCegarLoop]: trace histogram [16, 11, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:07,492 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:07,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:07,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1367159107, now seen corresponding path program 11 times [2019-09-03 20:53:07,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:07,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:07,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:07,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:07,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:07,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:07,591 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 108 proven. 132 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-03 20:53:07,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:07,592 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:07,592 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:07,592 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,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:07,592 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:53:07,605 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:07,605 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:07,621 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-03 20:53:07,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:07,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 20:53:07,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:07,726 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 121 proven. 25 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-09-03 20:53:07,727 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:07,870 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 121 proven. 25 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-09-03 20:53:07,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:07,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 8] total 26 [2019-09-03 20:53:07,874 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:07,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 20:53:07,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 20:53:07,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-03 20:53:07,876 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 20 states. [2019-09-03 20:53:07,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:07,973 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2019-09-03 20:53:07,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 20:53:07,974 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2019-09-03 20:53:07,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:07,975 INFO L225 Difference]: With dead ends: 48 [2019-09-03 20:53:07,975 INFO L226 Difference]: Without dead ends: 48 [2019-09-03 20:53:07,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-03 20:53:07,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-03 20:53:07,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-09-03 20:53:07,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-03 20:53:07,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2019-09-03 20:53:07,980 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 42 [2019-09-03 20:53:07,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:07,981 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2019-09-03 20:53:07,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 20:53:07,981 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2019-09-03 20:53:07,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-03 20:53:07,982 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:07,982 INFO L399 BasicCegarLoop]: trace histogram [18, 12, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:07,982 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:07,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:07,983 INFO L82 PathProgramCache]: Analyzing trace with hash -2055201995, now seen corresponding path program 12 times [2019-09-03 20:53:07,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:07,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:07,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:07,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:07,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:07,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:08,093 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 143 proven. 156 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-03 20:53:08,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:08,094 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:08,094 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:08,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:08,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:08,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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:08,105 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:08,106 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:53:08,122 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:08,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:08,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 20:53:08,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:08,133 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 143 proven. 156 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-03 20:53:08,133 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:08,379 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 143 proven. 156 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-03 20:53:08,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:08,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2019-09-03 20:53:08,382 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:08,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 20:53:08,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 20:53:08,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-03 20:53:08,385 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 15 states. [2019-09-03 20:53:08,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:08,449 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2019-09-03 20:53:08,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 20:53:08,450 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2019-09-03 20:53:08,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:08,451 INFO L225 Difference]: With dead ends: 49 [2019-09-03 20:53:08,451 INFO L226 Difference]: Without dead ends: 49 [2019-09-03 20:53:08,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-03 20:53:08,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-03 20:53:08,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-09-03 20:53:08,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-03 20:53:08,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2019-09-03 20:53:08,457 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 46 [2019-09-03 20:53:08,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:08,457 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2019-09-03 20:53:08,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 20:53:08,457 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2019-09-03 20:53:08,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-03 20:53:08,458 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:08,458 INFO L399 BasicCegarLoop]: trace histogram [19, 13, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:08,459 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:08,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:08,459 INFO L82 PathProgramCache]: Analyzing trace with hash -561945934, now seen corresponding path program 13 times [2019-09-03 20:53:08,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:08,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:08,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:08,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:08,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:08,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:08,587 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 154 proven. 182 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-03 20:53:08,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:08,587 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:08,588 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:08,588 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:08,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:08,588 INFO 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:53:08,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:08,599 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:53:08,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:08,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 20:53:08,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:08,641 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 154 proven. 182 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-03 20:53:08,642 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:09,008 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 154 proven. 182 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-03 20:53:09,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:09,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2019-09-03 20:53:09,011 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:09,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 20:53:09,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 20:53:09,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-03 20:53:09,013 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 16 states. [2019-09-03 20:53:09,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:09,095 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2019-09-03 20:53:09,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 20:53:09,096 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 48 [2019-09-03 20:53:09,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:09,096 INFO L225 Difference]: With dead ends: 51 [2019-09-03 20:53:09,096 INFO L226 Difference]: Without dead ends: 51 [2019-09-03 20:53:09,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-03 20:53:09,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-03 20:53:09,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-09-03 20:53:09,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-03 20:53:09,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2019-09-03 20:53:09,101 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 48 [2019-09-03 20:53:09,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:09,102 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2019-09-03 20:53:09,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 20:53:09,102 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2019-09-03 20:53:09,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-03 20:53:09,103 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:09,103 INFO L399 BasicCegarLoop]: trace histogram [20, 14, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:09,103 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:09,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:09,103 INFO L82 PathProgramCache]: Analyzing trace with hash -61948177, now seen corresponding path program 14 times [2019-09-03 20:53:09,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:09,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:09,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:09,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:09,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:09,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:09,257 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 165 proven. 210 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-03 20:53:09,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:09,258 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:09,258 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:09,258 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:09,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:09,258 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:09,271 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:09,272 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:09,288 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-03 20:53:09,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:09,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 20:53:09,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:09,400 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 182 proven. 36 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-09-03 20:53:09,401 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:09,550 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 182 proven. 36 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-09-03 20:53:09,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:09,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 9, 9] total 31 [2019-09-03 20:53:09,554 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:09,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 20:53:09,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 20:53:09,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-03 20:53:09,555 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 24 states. [2019-09-03 20:53:09,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:09,660 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2019-09-03 20:53:09,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 20:53:09,660 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2019-09-03 20:53:09,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:09,661 INFO L225 Difference]: With dead ends: 56 [2019-09-03 20:53:09,661 INFO L226 Difference]: Without dead ends: 56 [2019-09-03 20:53:09,662 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-03 20:53:09,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-03 20:53:09,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-09-03 20:53:09,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-03 20:53:09,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2019-09-03 20:53:09,668 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 50 [2019-09-03 20:53:09,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:09,669 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2019-09-03 20:53:09,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 20:53:09,669 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2019-09-03 20:53:09,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-03 20:53:09,670 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:09,670 INFO L399 BasicCegarLoop]: trace histogram [22, 15, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:09,670 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:09,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:09,671 INFO L82 PathProgramCache]: Analyzing trace with hash -395003417, now seen corresponding path program 15 times [2019-09-03 20:53:09,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:09,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:09,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:09,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:09,672 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:09,838 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 208 proven. 240 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-03 20:53:09,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:09,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:09,839 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:09,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:09,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:09,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 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:53:09,850 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:09,850 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:53:09,873 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:09,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:09,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-03 20:53:09,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:09,884 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 208 proven. 240 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-03 20:53:09,884 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:10,231 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 208 proven. 240 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-03 20:53:10,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:10,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2019-09-03 20:53:10,235 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:10,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 20:53:10,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 20:53:10,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 20:53:10,237 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 18 states. [2019-09-03 20:53:10,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:10,296 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2019-09-03 20:53:10,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-03 20:53:10,296 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 54 [2019-09-03 20:53:10,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:10,297 INFO L225 Difference]: With dead ends: 57 [2019-09-03 20:53:10,297 INFO L226 Difference]: Without dead ends: 57 [2019-09-03 20:53:10,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 20:53:10,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-03 20:53:10,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-09-03 20:53:10,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-03 20:53:10,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2019-09-03 20:53:10,301 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 54 [2019-09-03 20:53:10,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:10,306 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2019-09-03 20:53:10,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 20:53:10,306 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2019-09-03 20:53:10,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-03 20:53:10,307 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:10,307 INFO L399 BasicCegarLoop]: trace histogram [23, 16, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:10,307 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:10,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:10,307 INFO L82 PathProgramCache]: Analyzing trace with hash 279524452, now seen corresponding path program 16 times [2019-09-03 20:53:10,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:10,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:10,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:10,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:10,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:10,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:10,500 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 221 proven. 272 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-03 20:53:10,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:10,500 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:10,500 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:10,500 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:10,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:10,500 INFO 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:53:10,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:10,512 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:53:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:10,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 20:53:10,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:10,539 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 221 proven. 272 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-03 20:53:10,539 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:10,929 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 221 proven. 272 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-03 20:53:10,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:10,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 36 [2019-09-03 20:53:10,932 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:10,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 20:53:10,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 20:53:10,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 20:53:10,934 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 19 states. [2019-09-03 20:53:11,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:11,015 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2019-09-03 20:53:11,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 20:53:11,016 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 56 [2019-09-03 20:53:11,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:11,017 INFO L225 Difference]: With dead ends: 59 [2019-09-03 20:53:11,017 INFO L226 Difference]: Without dead ends: 59 [2019-09-03 20:53:11,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 20:53:11,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-03 20:53:11,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-09-03 20:53:11,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-03 20:53:11,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2019-09-03 20:53:11,021 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 56 [2019-09-03 20:53:11,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:11,021 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2019-09-03 20:53:11,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 20:53:11,022 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2019-09-03 20:53:11,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-03 20:53:11,023 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:11,024 INFO L399 BasicCegarLoop]: trace histogram [24, 17, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:11,024 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:11,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:11,024 INFO L82 PathProgramCache]: Analyzing trace with hash -39255135, now seen corresponding path program 17 times [2019-09-03 20:53:11,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:11,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:11,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:11,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:11,026 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:11,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:11,210 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 234 proven. 306 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-03 20:53:11,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:11,211 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:11,211 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:11,211 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:11,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:11,211 INFO 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:53:11,221 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:11,222 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:11,240 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-03 20:53:11,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:11,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 20:53:11,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:11,404 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 255 proven. 49 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2019-09-03 20:53:11,404 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:11,645 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 255 proven. 49 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2019-09-03 20:53:11,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:11,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10, 10] total 36 [2019-09-03 20:53:11,650 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:11,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 20:53:11,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 20:53:11,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 20:53:11,653 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 28 states. [2019-09-03 20:53:11,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:11,766 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2019-09-03 20:53:11,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-03 20:53:11,767 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 58 [2019-09-03 20:53:11,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:11,768 INFO L225 Difference]: With dead ends: 64 [2019-09-03 20:53:11,768 INFO L226 Difference]: Without dead ends: 64 [2019-09-03 20:53:11,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 20:53:11,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-03 20:53:11,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-09-03 20:53:11,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-03 20:53:11,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2019-09-03 20:53:11,772 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 58 [2019-09-03 20:53:11,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:11,772 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2019-09-03 20:53:11,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 20:53:11,773 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2019-09-03 20:53:11,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-03 20:53:11,773 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:11,774 INFO L399 BasicCegarLoop]: trace histogram [26, 18, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:11,774 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:11,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:11,774 INFO L82 PathProgramCache]: Analyzing trace with hash 923897113, now seen corresponding path program 18 times [2019-09-03 20:53:11,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:11,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:11,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:11,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:11,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:12,064 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 285 proven. 342 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-03 20:53:12,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:12,065 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:12,065 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:12,065 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:12,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:12,065 INFO 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:53:12,075 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:12,075 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:53:12,093 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:12,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:12,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 20:53:12,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:12,104 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 285 proven. 342 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-03 20:53:12,104 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:12,611 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 285 proven. 342 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-03 20:53:12,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:12,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2019-09-03 20:53:12,617 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:12,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 20:53:12,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 20:53:12,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 20:53:12,621 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand 21 states. [2019-09-03 20:53:12,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:12,703 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2019-09-03 20:53:12,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 20:53:12,703 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 62 [2019-09-03 20:53:12,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:12,704 INFO L225 Difference]: With dead ends: 65 [2019-09-03 20:53:12,705 INFO L226 Difference]: Without dead ends: 65 [2019-09-03 20:53:12,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 20:53:12,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-03 20:53:12,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-09-03 20:53:12,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-03 20:53:12,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2019-09-03 20:53:12,712 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 62 [2019-09-03 20:53:12,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:12,713 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2019-09-03 20:53:12,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 20:53:12,719 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2019-09-03 20:53:12,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-03 20:53:12,720 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:12,720 INFO L399 BasicCegarLoop]: trace histogram [27, 19, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:12,720 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:12,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:12,721 INFO L82 PathProgramCache]: Analyzing trace with hash -308921706, now seen corresponding path program 19 times [2019-09-03 20:53:12,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:12,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:12,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:12,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:12,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:12,943 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 300 proven. 380 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-03 20:53:12,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:12,943 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:12,944 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:12,944 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:12,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:12,944 INFO 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:53:12,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:12,956 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:53:12,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:12,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 20:53:12,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:12,982 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 300 proven. 380 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-03 20:53:12,982 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:13,564 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 300 proven. 380 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-03 20:53:13,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:13,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 42 [2019-09-03 20:53:13,568 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:13,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 20:53:13,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 20:53:13,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 20:53:13,570 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand 22 states. [2019-09-03 20:53:13,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:13,648 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2019-09-03 20:53:13,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-03 20:53:13,651 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 64 [2019-09-03 20:53:13,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:13,652 INFO L225 Difference]: With dead ends: 67 [2019-09-03 20:53:13,652 INFO L226 Difference]: Without dead ends: 67 [2019-09-03 20:53:13,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 20:53:13,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-03 20:53:13,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-09-03 20:53:13,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-03 20:53:13,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2019-09-03 20:53:13,659 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 64 [2019-09-03 20:53:13,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:13,659 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2019-09-03 20:53:13,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 20:53:13,659 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2019-09-03 20:53:13,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-03 20:53:13,660 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:13,660 INFO L399 BasicCegarLoop]: trace histogram [28, 20, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:13,668 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:13,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:13,669 INFO L82 PathProgramCache]: Analyzing trace with hash 363166931, now seen corresponding path program 20 times [2019-09-03 20:53:13,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:13,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:13,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:13,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:13,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:13,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:13,906 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 315 proven. 420 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-03 20:53:13,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:13,907 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:13,907 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:13,907 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:13,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:13,907 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:53:13,921 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:13,921 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:13,943 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-03 20:53:13,944 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:13,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 20:53:13,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:14,110 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 340 proven. 64 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-09-03 20:53:14,110 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:14,372 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 340 proven. 64 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-09-03 20:53:14,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:14,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 11, 11] total 41 [2019-09-03 20:53:14,376 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:14,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 20:53:14,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 20:53:14,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 20:53:14,378 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand 32 states. [2019-09-03 20:53:14,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:14,496 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2019-09-03 20:53:14,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-03 20:53:14,496 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 66 [2019-09-03 20:53:14,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:14,497 INFO L225 Difference]: With dead ends: 72 [2019-09-03 20:53:14,498 INFO L226 Difference]: Without dead ends: 72 [2019-09-03 20:53:14,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 20:53:14,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-03 20:53:14,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-09-03 20:53:14,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-03 20:53:14,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2019-09-03 20:53:14,502 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 66 [2019-09-03 20:53:14,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:14,502 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2019-09-03 20:53:14,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 20:53:14,502 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2019-09-03 20:53:14,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-03 20:53:14,503 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:14,504 INFO L399 BasicCegarLoop]: trace histogram [30, 21, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:14,504 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:14,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:14,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1309510453, now seen corresponding path program 21 times [2019-09-03 20:53:14,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:14,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:14,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:14,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:14,506 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:14,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:14,758 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 374 proven. 462 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-03 20:53:14,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:14,759 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:14,759 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:14,759 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,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:14,759 INFO 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:53:14,769 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:14,770 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:53:14,802 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:14,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:14,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 20:53:14,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:14,815 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 374 proven. 462 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-03 20:53:14,815 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:15,342 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 374 proven. 462 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-03 20:53:15,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:15,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 46 [2019-09-03 20:53:15,345 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:15,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 20:53:15,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 20:53:15,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 20:53:15,347 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand 24 states. [2019-09-03 20:53:15,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:15,440 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2019-09-03 20:53:15,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 20:53:15,441 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 70 [2019-09-03 20:53:15,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:15,442 INFO L225 Difference]: With dead ends: 73 [2019-09-03 20:53:15,442 INFO L226 Difference]: Without dead ends: 73 [2019-09-03 20:53:15,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 20:53:15,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-09-03 20:53:15,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-09-03 20:53:15,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-03 20:53:15,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2019-09-03 20:53:15,447 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 70 [2019-09-03 20:53:15,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:15,447 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2019-09-03 20:53:15,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 20:53:15,447 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2019-09-03 20:53:15,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-03 20:53:15,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:15,448 INFO L399 BasicCegarLoop]: trace histogram [31, 22, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:15,448 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:15,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:15,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1222923592, now seen corresponding path program 22 times [2019-09-03 20:53:15,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:15,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:15,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:15,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:15,450 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:15,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:15,690 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 391 proven. 506 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-03 20:53:15,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:15,690 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:15,690 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:15,691 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:15,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:15,691 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:15,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:15,702 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:53:15,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:15,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 20:53:15,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:15,735 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 391 proven. 506 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-03 20:53:15,735 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:16,351 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 391 proven. 506 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-03 20:53:16,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:16,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2019-09-03 20:53:16,355 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:16,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 20:53:16,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 20:53:16,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 20:53:16,356 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand 25 states. [2019-09-03 20:53:16,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:16,447 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2019-09-03 20:53:16,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 20:53:16,448 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 72 [2019-09-03 20:53:16,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:16,449 INFO L225 Difference]: With dead ends: 75 [2019-09-03 20:53:16,449 INFO L226 Difference]: Without dead ends: 75 [2019-09-03 20:53:16,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 20:53:16,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-03 20:53:16,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-09-03 20:53:16,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-03 20:53:16,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2019-09-03 20:53:16,453 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 72 [2019-09-03 20:53:16,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:16,453 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2019-09-03 20:53:16,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 20:53:16,454 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2019-09-03 20:53:16,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-03 20:53:16,454 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:16,454 INFO L399 BasicCegarLoop]: trace histogram [32, 23, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:16,455 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:16,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:16,455 INFO L82 PathProgramCache]: Analyzing trace with hash -354415995, now seen corresponding path program 23 times [2019-09-03 20:53:16,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:16,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:16,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:16,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:16,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:16,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 408 proven. 552 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-03 20:53:16,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:16,717 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:16,717 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:16,717 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:16,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:16,717 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:16,727 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:16,727 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:16,749 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-09-03 20:53:16,750 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:16,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 20:53:16,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:16,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 437 proven. 81 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2019-09-03 20:53:16,948 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:17,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 437 proven. 81 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2019-09-03 20:53:17,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:17,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 12, 12] total 46 [2019-09-03 20:53:17,240 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:17,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 20:53:17,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 20:53:17,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 20:53:17,242 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand 36 states. [2019-09-03 20:53:17,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:17,471 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2019-09-03 20:53:17,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-03 20:53:17,472 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 74 [2019-09-03 20:53:17,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:17,473 INFO L225 Difference]: With dead ends: 80 [2019-09-03 20:53:17,473 INFO L226 Difference]: Without dead ends: 80 [2019-09-03 20:53:17,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 20:53:17,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-03 20:53:17,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-09-03 20:53:17,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-03 20:53:17,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2019-09-03 20:53:17,477 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 74 [2019-09-03 20:53:17,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:17,477 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2019-09-03 20:53:17,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 20:53:17,477 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2019-09-03 20:53:17,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-03 20:53:17,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:17,478 INFO L399 BasicCegarLoop]: trace histogram [34, 24, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:17,478 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:17,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:17,479 INFO L82 PathProgramCache]: Analyzing trace with hash 456872189, now seen corresponding path program 24 times [2019-09-03 20:53:17,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:17,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:17,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:17,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:17,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:17,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:17,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 475 proven. 600 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-03 20:53:17,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:17,752 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:17,752 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:17,752 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:17,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:17,752 INFO 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:17,763 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:17,763 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:53:17,787 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:17,787 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:17,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 20:53:17,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:17,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 475 proven. 600 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-03 20:53:17,798 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:18,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 475 proven. 600 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-03 20:53:18,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:18,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 52 [2019-09-03 20:53:18,466 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:18,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 20:53:18,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 20:53:18,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:18,468 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 27 states. [2019-09-03 20:53:18,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:18,563 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2019-09-03 20:53:18,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 20:53:18,564 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 78 [2019-09-03 20:53:18,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:18,565 INFO L225 Difference]: With dead ends: 81 [2019-09-03 20:53:18,565 INFO L226 Difference]: Without dead ends: 81 [2019-09-03 20:53:18,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:18,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-09-03 20:53:18,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-09-03 20:53:18,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-03 20:53:18,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2019-09-03 20:53:18,569 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 78 [2019-09-03 20:53:18,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:18,570 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2019-09-03 20:53:18,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 20:53:18,570 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2019-09-03 20:53:18,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-03 20:53:18,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:18,571 INFO L399 BasicCegarLoop]: trace histogram [35, 25, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:18,571 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:18,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:18,572 INFO L82 PathProgramCache]: Analyzing trace with hash 2008507514, now seen corresponding path program 25 times [2019-09-03 20:53:18,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:18,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:18,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:18,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:18,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:18,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:19,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 494 proven. 650 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-03 20:53:19,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:19,012 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:19,012 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:19,012 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:19,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:19,012 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:53:19,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:19,027 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:19,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 20:53:19,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:19,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 494 proven. 650 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-03 20:53:19,071 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:19,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 494 proven. 650 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-03 20:53:19,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:19,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 52 [2019-09-03 20:53:19,821 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:19,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 20:53:19,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 20:53:19,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:19,823 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 28 states. [2019-09-03 20:53:19,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:19,934 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2019-09-03 20:53:19,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-03 20:53:19,936 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 80 [2019-09-03 20:53:19,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:19,937 INFO L225 Difference]: With dead ends: 83 [2019-09-03 20:53:19,937 INFO L226 Difference]: Without dead ends: 83 [2019-09-03 20:53:19,938 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 135 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:19,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-09-03 20:53:19,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-09-03 20:53:19,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-03 20:53:19,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2019-09-03 20:53:19,941 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 80 [2019-09-03 20:53:19,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:19,941 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2019-09-03 20:53:19,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 20:53:19,942 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2019-09-03 20:53:19,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-03 20:53:19,942 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:19,942 INFO L399 BasicCegarLoop]: trace histogram [36, 26, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:19,943 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:19,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:19,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1518564169, now seen corresponding path program 26 times [2019-09-03 20:53:19,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:19,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:19,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:19,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:19,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:20,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 513 proven. 702 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-03 20:53:20,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:20,284 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:20,284 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:20,284 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:20,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:20,285 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:20,296 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:20,297 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:20,322 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-09-03 20:53:20,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:20,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 20:53:20,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:20,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 546 proven. 100 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2019-09-03 20:53:20,565 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:20,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 546 proven. 100 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2019-09-03 20:53:20,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:20,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 13, 13] total 51 [2019-09-03 20:53:20,907 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:20,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-03 20:53:20,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-03 20:53:20,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 20:53:20,909 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand 40 states. [2019-09-03 20:53:21,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:21,100 INFO L93 Difference]: Finished difference Result 88 states and 100 transitions. [2019-09-03 20:53:21,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-03 20:53:21,102 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 82 [2019-09-03 20:53:21,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:21,103 INFO L225 Difference]: With dead ends: 88 [2019-09-03 20:53:21,103 INFO L226 Difference]: Without dead ends: 88 [2019-09-03 20:53:21,104 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 20:53:21,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-03 20:53:21,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-09-03 20:53:21,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-03 20:53:21,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2019-09-03 20:53:21,107 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 82 [2019-09-03 20:53:21,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:21,107 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2019-09-03 20:53:21,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-03 20:53:21,107 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2019-09-03 20:53:21,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-03 20:53:21,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:21,108 INFO L399 BasicCegarLoop]: trace histogram [38, 27, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:21,108 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:21,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:21,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1956118959, now seen corresponding path program 27 times [2019-09-03 20:53:21,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:21,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:21,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:21,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:21,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:21,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:21,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 588 proven. 756 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-03 20:53:21,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:21,448 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:21,449 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:21,449 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,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:21,449 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:21,461 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:21,461 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:53:21,485 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:21,486 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:21,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-03 20:53:21,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:21,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 588 proven. 756 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-03 20:53:21,502 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:22,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 588 proven. 756 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-03 20:53:22,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:22,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 52 [2019-09-03 20:53:22,451 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:22,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 20:53:22,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 20:53:22,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:22,455 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand 30 states. [2019-09-03 20:53:22,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:22,576 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2019-09-03 20:53:22,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-03 20:53:22,577 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 86 [2019-09-03 20:53:22,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:22,578 INFO L225 Difference]: With dead ends: 89 [2019-09-03 20:53:22,578 INFO L226 Difference]: Without dead ends: 89 [2019-09-03 20:53:22,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 145 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:22,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-09-03 20:53:22,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-09-03 20:53:22,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-09-03 20:53:22,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2019-09-03 20:53:22,582 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 86 [2019-09-03 20:53:22,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:22,583 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2019-09-03 20:53:22,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 20:53:22,583 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2019-09-03 20:53:22,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-03 20:53:22,584 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:22,584 INFO L399 BasicCegarLoop]: trace histogram [39, 28, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:22,584 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:22,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:22,584 INFO L82 PathProgramCache]: Analyzing trace with hash 247154732, now seen corresponding path program 28 times [2019-09-03 20:53:22,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:22,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:22,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:22,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:22,586 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:23,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 609 proven. 812 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-03 20:53:23,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:23,230 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:23,230 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:23,230 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:23,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:23,231 INFO 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) [2019-09-03 20:53:23,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:23,250 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:23,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 20:53:23,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:23,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 609 proven. 812 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-03 20:53:23,292 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:24,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 609 proven. 812 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-03 20:53:24,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:24,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 52 [2019-09-03 20:53:24,089 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:24,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 20:53:24,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 20:53:24,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:24,092 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand 31 states. [2019-09-03 20:53:24,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:24,202 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2019-09-03 20:53:24,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 20:53:24,202 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 88 [2019-09-03 20:53:24,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:24,203 INFO L225 Difference]: With dead ends: 91 [2019-09-03 20:53:24,203 INFO L226 Difference]: Without dead ends: 91 [2019-09-03 20:53:24,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 148 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:24,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-03 20:53:24,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-09-03 20:53:24,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-03 20:53:24,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2019-09-03 20:53:24,207 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 88 [2019-09-03 20:53:24,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:24,207 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2019-09-03 20:53:24,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 20:53:24,208 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2019-09-03 20:53:24,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-03 20:53:24,208 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:24,208 INFO L399 BasicCegarLoop]: trace histogram [40, 29, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:24,209 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:24,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:24,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1389960343, now seen corresponding path program 29 times [2019-09-03 20:53:24,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:24,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:24,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:24,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:24,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:24,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:24,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 630 proven. 870 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-03 20:53:24,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:24,616 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:24,617 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:24,617 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:24,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:24,617 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:53:24,636 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:24,637 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:24,669 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-09-03 20:53:24,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:24,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 20:53:24,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:25,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 667 proven. 121 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2019-09-03 20:53:25,019 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:25,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 667 proven. 121 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2019-09-03 20:53:25,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:25,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 14, 14] total 56 [2019-09-03 20:53:25,477 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:25,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-03 20:53:25,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-03 20:53:25,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 20:53:25,479 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand 44 states. [2019-09-03 20:53:25,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:25,712 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2019-09-03 20:53:25,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-03 20:53:25,713 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 90 [2019-09-03 20:53:25,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:25,714 INFO L225 Difference]: With dead ends: 96 [2019-09-03 20:53:25,714 INFO L226 Difference]: Without dead ends: 96 [2019-09-03 20:53:25,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 20:53:25,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-03 20:53:25,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-09-03 20:53:25,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-03 20:53:25,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2019-09-03 20:53:25,728 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 90 [2019-09-03 20:53:25,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:25,729 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2019-09-03 20:53:25,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-03 20:53:25,729 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2019-09-03 20:53:25,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-03 20:53:25,730 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:25,730 INFO L399 BasicCegarLoop]: trace histogram [42, 30, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:25,730 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:25,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:25,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1027368673, now seen corresponding path program 30 times [2019-09-03 20:53:25,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:25,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:25,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:25,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:25,732 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:25,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:26,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 713 proven. 930 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-03 20:53:26,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:26,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:26,280 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:26,280 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:26,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:26,280 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:53:26,297 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:26,297 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:26,323 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:26,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:26,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 20:53:26,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:26,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 713 proven. 930 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-03 20:53:26,338 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:27,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 713 proven. 930 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-03 20:53:27,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:27,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 52 [2019-09-03 20:53:27,092 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:27,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 20:53:27,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 20:53:27,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:27,093 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 33 states. [2019-09-03 20:53:27,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:27,234 INFO L93 Difference]: Finished difference Result 97 states and 109 transitions. [2019-09-03 20:53:27,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 20:53:27,234 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 94 [2019-09-03 20:53:27,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:27,236 INFO L225 Difference]: With dead ends: 97 [2019-09-03 20:53:27,236 INFO L226 Difference]: Without dead ends: 97 [2019-09-03 20:53:27,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 158 SyntacticMatches, 12 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:27,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-09-03 20:53:27,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-09-03 20:53:27,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-03 20:53:27,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2019-09-03 20:53:27,241 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 94 [2019-09-03 20:53:27,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:27,241 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2019-09-03 20:53:27,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 20:53:27,242 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2019-09-03 20:53:27,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-03 20:53:27,242 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:27,242 INFO L399 BasicCegarLoop]: trace histogram [43, 31, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:27,243 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:27,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:27,243 INFO L82 PathProgramCache]: Analyzing trace with hash 539222110, now seen corresponding path program 31 times [2019-09-03 20:53:27,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:27,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:27,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:27,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:27,244 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:27,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 736 proven. 992 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-03 20:53:27,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:27,856 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:27,856 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:27,856 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:27,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:27,856 INFO 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:53:27,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:27,867 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:53:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:27,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 20:53:27,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:27,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 736 proven. 992 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-03 20:53:27,908 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:28,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 736 proven. 992 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-03 20:53:28,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:28,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 52 [2019-09-03 20:53:28,735 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:28,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-03 20:53:28,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-03 20:53:28,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:28,736 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand 34 states. [2019-09-03 20:53:28,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:28,868 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2019-09-03 20:53:28,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-03 20:53:28,869 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 96 [2019-09-03 20:53:28,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:28,870 INFO L225 Difference]: With dead ends: 99 [2019-09-03 20:53:28,870 INFO L226 Difference]: Without dead ends: 99 [2019-09-03 20:53:28,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 161 SyntacticMatches, 14 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:28,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-03 20:53:28,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-09-03 20:53:28,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-09-03 20:53:28,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2019-09-03 20:53:28,875 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 96 [2019-09-03 20:53:28,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:28,875 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2019-09-03 20:53:28,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-03 20:53:28,875 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2019-09-03 20:53:28,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-03 20:53:28,876 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:28,876 INFO L399 BasicCegarLoop]: trace histogram [44, 32, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:28,876 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:28,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:28,877 INFO L82 PathProgramCache]: Analyzing trace with hash -418189669, now seen corresponding path program 32 times [2019-09-03 20:53:28,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:28,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:28,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:28,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:28,877 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:28,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:29,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 759 proven. 1056 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-03 20:53:29,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:29,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:29,402 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:29,402 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,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:29,402 INFO 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:53:29,412 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:29,413 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:29,440 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-09-03 20:53:29,441 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:29,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 20:53:29,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:29,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 800 proven. 144 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2019-09-03 20:53:29,796 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:30,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 800 proven. 144 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2019-09-03 20:53:30,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:30,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 15, 15] total 61 [2019-09-03 20:53:30,277 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:30,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-03 20:53:30,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-03 20:53:30,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 20:53:30,279 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 48 states. [2019-09-03 20:53:30,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:30,524 INFO L93 Difference]: Finished difference Result 104 states and 118 transitions. [2019-09-03 20:53:30,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-03 20:53:30,524 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 98 [2019-09-03 20:53:30,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:30,525 INFO L225 Difference]: With dead ends: 104 [2019-09-03 20:53:30,526 INFO L226 Difference]: Without dead ends: 104 [2019-09-03 20:53:30,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 20:53:30,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-03 20:53:30,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-09-03 20:53:30,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-03 20:53:30,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2019-09-03 20:53:30,530 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 98 [2019-09-03 20:53:30,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:30,530 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2019-09-03 20:53:30,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-03 20:53:30,531 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2019-09-03 20:53:30,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-03 20:53:30,531 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:30,531 INFO L399 BasicCegarLoop]: trace histogram [46, 33, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:30,532 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:30,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:30,532 INFO L82 PathProgramCache]: Analyzing trace with hash 803496083, now seen corresponding path program 33 times [2019-09-03 20:53:30,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:30,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:30,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:30,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:30,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:30,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:30,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 850 proven. 1122 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:53:30,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:30,997 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:30,997 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:30,997 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:30,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:30,997 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:53:31,009 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:31,009 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:53:31,037 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:31,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:31,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-03 20:53:31,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:31,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 850 proven. 1122 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:53:31,052 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:31,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 850 proven. 1122 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:53:31,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:31,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 52 [2019-09-03 20:53:31,838 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:31,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 20:53:31,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 20:53:31,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:31,840 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand 36 states. [2019-09-03 20:53:31,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:31,974 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2019-09-03 20:53:31,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-03 20:53:31,975 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 102 [2019-09-03 20:53:31,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:31,976 INFO L225 Difference]: With dead ends: 105 [2019-09-03 20:53:31,976 INFO L226 Difference]: Without dead ends: 105 [2019-09-03 20:53:31,977 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 171 SyntacticMatches, 18 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:31,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-09-03 20:53:31,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-09-03 20:53:31,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-09-03 20:53:31,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2019-09-03 20:53:31,979 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 102 [2019-09-03 20:53:31,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:31,980 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2019-09-03 20:53:31,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 20:53:31,980 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2019-09-03 20:53:31,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-03 20:53:31,980 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:31,980 INFO L399 BasicCegarLoop]: trace histogram [47, 34, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:31,981 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:31,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:31,981 INFO L82 PathProgramCache]: Analyzing trace with hash -106099440, now seen corresponding path program 34 times [2019-09-03 20:53:31,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:31,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:31,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:31,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:31,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:31,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:32,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 875 proven. 1190 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:53:32,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:32,468 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:32,468 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:32,468 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:32,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:32,469 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:53:32,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:32,478 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:53:32,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:32,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 20:53:32,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:32,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 875 proven. 1190 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:53:32,524 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:33,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 875 proven. 1190 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:53:33,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:33,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 52 [2019-09-03 20:53:33,334 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:33,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 20:53:33,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 20:53:33,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:33,335 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand 37 states. [2019-09-03 20:53:33,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:33,452 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2019-09-03 20:53:33,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-03 20:53:33,452 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 104 [2019-09-03 20:53:33,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:33,453 INFO L225 Difference]: With dead ends: 107 [2019-09-03 20:53:33,453 INFO L226 Difference]: Without dead ends: 107 [2019-09-03 20:53:33,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 174 SyntacticMatches, 20 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:33,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-03 20:53:33,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-09-03 20:53:33,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-09-03 20:53:33,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 120 transitions. [2019-09-03 20:53:33,457 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 120 transitions. Word has length 104 [2019-09-03 20:53:33,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:33,457 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 120 transitions. [2019-09-03 20:53:33,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 20:53:33,458 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2019-09-03 20:53:33,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-03 20:53:33,458 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:33,458 INFO L399 BasicCegarLoop]: trace histogram [48, 35, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:33,459 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:33,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:33,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1945931341, now seen corresponding path program 35 times [2019-09-03 20:53:33,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:33,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:33,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:33,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:33,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:33,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:33,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 900 proven. 1260 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-03 20:53:33,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:33,981 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:33,981 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:33,981 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:33,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:33,981 INFO 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:53:33,991 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:33,992 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:34,021 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-09-03 20:53:34,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:34,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 20:53:34,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:34,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 945 proven. 169 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2019-09-03 20:53:34,429 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:34,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 945 proven. 169 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2019-09-03 20:53:35,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:35,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 16, 16] total 66 [2019-09-03 20:53:35,002 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:35,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-03 20:53:35,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-03 20:53:35,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 20:53:35,008 INFO L87 Difference]: Start difference. First operand 107 states and 120 transitions. Second operand 52 states. [2019-09-03 20:53:35,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:35,232 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2019-09-03 20:53:35,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-03 20:53:35,233 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 106 [2019-09-03 20:53:35,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:35,234 INFO L225 Difference]: With dead ends: 112 [2019-09-03 20:53:35,234 INFO L226 Difference]: Without dead ends: 112 [2019-09-03 20:53:35,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 20:53:35,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-03 20:53:35,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2019-09-03 20:53:35,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-09-03 20:53:35,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2019-09-03 20:53:35,240 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 106 [2019-09-03 20:53:35,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:35,240 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2019-09-03 20:53:35,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-03 20:53:35,240 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2019-09-03 20:53:35,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-03 20:53:35,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:35,241 INFO L399 BasicCegarLoop]: trace histogram [50, 36, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:35,241 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:35,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:35,242 INFO L82 PathProgramCache]: Analyzing trace with hash -2133602619, now seen corresponding path program 36 times [2019-09-03 20:53:35,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:35,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:35,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:35,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:35,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:35,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 999 proven. 1332 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-03 20:53:35,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:35,804 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:35,804 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:35,804 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:35,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:35,804 INFO 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:53:35,816 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:35,816 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:53:35,848 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:35,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:35,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 20:53:35,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:35,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 999 proven. 1332 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-03 20:53:35,868 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:36,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 999 proven. 1332 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (37)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:53:36,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:36,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 52 [2019-09-03 20:53:36,708 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:36,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-03 20:53:36,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-03 20:53:36,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:36,710 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand 39 states. [2019-09-03 20:53:36,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:36,851 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2019-09-03 20:53:36,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 20:53:36,851 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 110 [2019-09-03 20:53:36,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:36,852 INFO L225 Difference]: With dead ends: 113 [2019-09-03 20:53:36,852 INFO L226 Difference]: Without dead ends: 113 [2019-09-03 20:53:36,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 184 SyntacticMatches, 24 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:36,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-09-03 20:53:36,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-09-03 20:53:36,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-09-03 20:53:36,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2019-09-03 20:53:36,856 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 110 [2019-09-03 20:53:36,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:36,856 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2019-09-03 20:53:36,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-03 20:53:36,856 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2019-09-03 20:53:36,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-03 20:53:36,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:36,857 INFO L399 BasicCegarLoop]: trace histogram [51, 37, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:36,858 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:36,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:36,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1654304322, now seen corresponding path program 37 times [2019-09-03 20:53:36,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:36,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:36,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:36,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:36,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:36,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:37,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1026 proven. 1406 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-03 20:53:37,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:37,677 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:37,677 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:37,677 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:37,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:37,678 INFO 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:53:37,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:37,687 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:53:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:37,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-03 20:53:37,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:37,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1026 proven. 1406 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-03 20:53:37,736 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:38,563 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1026 proven. 1406 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-03 20:53:38,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:38,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 52 [2019-09-03 20:53:38,567 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:38,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-03 20:53:38,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-03 20:53:38,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:38,568 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand 40 states. [2019-09-03 20:53:38,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:38,713 INFO L93 Difference]: Finished difference Result 115 states and 129 transitions. [2019-09-03 20:53:38,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-03 20:53:38,714 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 112 [2019-09-03 20:53:38,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:38,715 INFO L225 Difference]: With dead ends: 115 [2019-09-03 20:53:38,715 INFO L226 Difference]: Without dead ends: 115 [2019-09-03 20:53:38,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 187 SyntacticMatches, 26 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:38,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-09-03 20:53:38,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-09-03 20:53:38,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-03 20:53:38,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2019-09-03 20:53:38,726 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 112 [2019-09-03 20:53:38,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:38,726 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2019-09-03 20:53:38,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-03 20:53:38,727 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2019-09-03 20:53:38,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-03 20:53:38,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:38,727 INFO L399 BasicCegarLoop]: trace histogram [52, 38, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:38,728 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:38,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:38,728 INFO L82 PathProgramCache]: Analyzing trace with hash -299392385, now seen corresponding path program 38 times [2019-09-03 20:53:38,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:38,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:38,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:38,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:38,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:39,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1053 proven. 1482 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-03 20:53:39,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:39,611 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:39,611 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:39,611 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:39,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:39,611 INFO 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:53:39,621 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:39,622 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:39,657 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-09-03 20:53:39,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:39,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-03 20:53:39,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:40,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1102 proven. 196 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2019-09-03 20:53:40,131 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:40,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1102 proven. 196 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2019-09-03 20:53:40,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:40,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 17, 17] total 71 [2019-09-03 20:53:40,764 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:40,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-03 20:53:40,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-03 20:53:40,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-09-03 20:53:40,765 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand 56 states. [2019-09-03 20:53:41,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:41,034 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2019-09-03 20:53:41,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-03 20:53:41,034 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 114 [2019-09-03 20:53:41,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:41,035 INFO L225 Difference]: With dead ends: 120 [2019-09-03 20:53:41,036 INFO L226 Difference]: Without dead ends: 120 [2019-09-03 20:53:41,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-09-03 20:53:41,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-03 20:53:41,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2019-09-03 20:53:41,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-03 20:53:41,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 134 transitions. [2019-09-03 20:53:41,040 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 134 transitions. Word has length 114 [2019-09-03 20:53:41,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:41,040 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 134 transitions. [2019-09-03 20:53:41,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-03 20:53:41,040 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 134 transitions. [2019-09-03 20:53:41,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-03 20:53:41,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:41,041 INFO L399 BasicCegarLoop]: trace histogram [54, 39, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:41,041 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:41,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:41,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1680436873, now seen corresponding path program 39 times [2019-09-03 20:53:41,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:41,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:41,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:41,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:41,042 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:41,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1160 proven. 1560 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-03 20:53:41,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:41,681 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:41,682 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:41,682 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:41,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:41,682 INFO 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:53:41,692 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:41,692 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:53:41,727 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:41,727 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:41,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-03 20:53:41,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:41,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1160 proven. 1560 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-03 20:53:41,743 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:42,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1160 proven. 1560 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-03 20:53:42,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:42,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 52 [2019-09-03 20:53:42,681 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:42,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-03 20:53:42,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-03 20:53:42,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:42,684 INFO L87 Difference]: Start difference. First operand 119 states and 134 transitions. Second operand 42 states. [2019-09-03 20:53:42,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:42,895 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2019-09-03 20:53:42,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-03 20:53:42,898 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 118 [2019-09-03 20:53:42,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:42,899 INFO L225 Difference]: With dead ends: 121 [2019-09-03 20:53:42,900 INFO L226 Difference]: Without dead ends: 121 [2019-09-03 20:53:42,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 197 SyntacticMatches, 30 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:42,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-09-03 20:53:42,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-09-03 20:53:42,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-09-03 20:53:42,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 136 transitions. [2019-09-03 20:53:42,904 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 136 transitions. Word has length 118 [2019-09-03 20:53:42,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:42,904 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 136 transitions. [2019-09-03 20:53:42,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-03 20:53:42,905 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 136 transitions. [2019-09-03 20:53:42,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-03 20:53:42,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:42,906 INFO L399 BasicCegarLoop]: trace histogram [55, 40, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:42,906 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:42,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:42,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1505272820, now seen corresponding path program 40 times [2019-09-03 20:53:42,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:42,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:42,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:42,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:42,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:42,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:43,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1189 proven. 1640 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-03 20:53:43,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:43,614 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:43,614 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:43,614 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:43,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:43,614 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:53:43,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:43,625 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:53:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:43,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 20:53:43,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:43,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1189 proven. 1640 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-03 20:53:43,683 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:44,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1189 proven. 1640 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-03 20:53:44,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:44,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 52 [2019-09-03 20:53:44,532 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:44,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-03 20:53:44,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-03 20:53:44,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:44,535 INFO L87 Difference]: Start difference. First operand 121 states and 136 transitions. Second operand 43 states. [2019-09-03 20:53:44,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:44,670 INFO L93 Difference]: Finished difference Result 123 states and 138 transitions. [2019-09-03 20:53:44,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-03 20:53:44,670 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 120 [2019-09-03 20:53:44,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:44,672 INFO L225 Difference]: With dead ends: 123 [2019-09-03 20:53:44,672 INFO L226 Difference]: Without dead ends: 123 [2019-09-03 20:53:44,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 200 SyntacticMatches, 32 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:44,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-09-03 20:53:44,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-09-03 20:53:44,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-09-03 20:53:44,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 138 transitions. [2019-09-03 20:53:44,675 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 138 transitions. Word has length 120 [2019-09-03 20:53:44,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:44,675 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 138 transitions. [2019-09-03 20:53:44,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-03 20:53:44,676 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 138 transitions. [2019-09-03 20:53:44,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-03 20:53:44,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:44,677 INFO L399 BasicCegarLoop]: trace histogram [56, 41, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:44,677 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:44,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:44,677 INFO L82 PathProgramCache]: Analyzing trace with hash 660605745, now seen corresponding path program 41 times [2019-09-03 20:53:44,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:44,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:44,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:44,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:44,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:44,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:45,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1218 proven. 1722 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-03 20:53:45,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:45,465 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:45,465 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:45,465 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,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:45,466 INFO 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:53:45,476 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:45,476 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:45,512 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-09-03 20:53:45,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:45,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 20:53:45,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:46,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1271 proven. 225 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-09-03 20:53:46,161 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:46,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1271 proven. 225 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-09-03 20:53:46,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:46,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 18, 18] total 76 [2019-09-03 20:53:46,931 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:46,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-03 20:53:46,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-03 20:53:46,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-09-03 20:53:46,933 INFO L87 Difference]: Start difference. First operand 123 states and 138 transitions. Second operand 60 states. [2019-09-03 20:53:47,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:47,239 INFO L93 Difference]: Finished difference Result 128 states and 145 transitions. [2019-09-03 20:53:47,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-03 20:53:47,240 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 122 [2019-09-03 20:53:47,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:47,241 INFO L225 Difference]: With dead ends: 128 [2019-09-03 20:53:47,241 INFO L226 Difference]: Without dead ends: 128 [2019-09-03 20:53:47,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-09-03 20:53:47,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-03 20:53:47,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-09-03 20:53:47,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-09-03 20:53:47,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 143 transitions. [2019-09-03 20:53:47,244 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 143 transitions. Word has length 122 [2019-09-03 20:53:47,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:47,245 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 143 transitions. [2019-09-03 20:53:47,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-03 20:53:47,245 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 143 transitions. [2019-09-03 20:53:47,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-03 20:53:47,246 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:47,246 INFO L399 BasicCegarLoop]: trace histogram [58, 42, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:47,246 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:47,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:47,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1648396457, now seen corresponding path program 42 times [2019-09-03 20:53:47,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:47,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:47,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:47,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:47,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:47,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:48,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1333 proven. 1806 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-03 20:53:48,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:48,029 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:48,029 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:48,029 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:48,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:48,030 INFO 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:53:48,040 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:48,040 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:53:48,073 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:48,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:48,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 20:53:48,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:48,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1333 proven. 1806 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-03 20:53:48,095 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:49,008 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1333 proven. 1806 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-03 20:53:49,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:49,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 52 [2019-09-03 20:53:49,011 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:49,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-03 20:53:49,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-03 20:53:49,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:49,012 INFO L87 Difference]: Start difference. First operand 127 states and 143 transitions. Second operand 45 states. [2019-09-03 20:53:49,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:49,187 INFO L93 Difference]: Finished difference Result 129 states and 145 transitions. [2019-09-03 20:53:49,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-03 20:53:49,188 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 126 [2019-09-03 20:53:49,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:49,189 INFO L225 Difference]: With dead ends: 129 [2019-09-03 20:53:49,190 INFO L226 Difference]: Without dead ends: 129 [2019-09-03 20:53:49,190 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 210 SyntacticMatches, 36 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:49,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-09-03 20:53:49,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-09-03 20:53:49,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-09-03 20:53:49,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 145 transitions. [2019-09-03 20:53:49,193 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 145 transitions. Word has length 126 [2019-09-03 20:53:49,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:49,193 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 145 transitions. [2019-09-03 20:53:49,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-03 20:53:49,194 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 145 transitions. [2019-09-03 20:53:49,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-03 20:53:49,194 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:49,194 INFO L399 BasicCegarLoop]: trace histogram [59, 43, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:49,195 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:49,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:49,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1398459942, now seen corresponding path program 43 times [2019-09-03 20:53:49,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:49,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:49,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:49,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:49,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:49,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:49,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1364 proven. 1892 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-03 20:53:49,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:49,963 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:49,963 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:49,963 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:49,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:49,963 INFO 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:53:49,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:49,978 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:53:50,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:50,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-03 20:53:50,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:50,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1364 proven. 1892 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-03 20:53:50,038 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:50,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1364 proven. 1892 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-03 20:53:50,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:50,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 52 [2019-09-03 20:53:50,929 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:50,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-03 20:53:50,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-03 20:53:50,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:50,930 INFO L87 Difference]: Start difference. First operand 129 states and 145 transitions. Second operand 46 states. [2019-09-03 20:53:51,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:51,083 INFO L93 Difference]: Finished difference Result 131 states and 147 transitions. [2019-09-03 20:53:51,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-03 20:53:51,083 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 128 [2019-09-03 20:53:51,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:51,085 INFO L225 Difference]: With dead ends: 131 [2019-09-03 20:53:51,085 INFO L226 Difference]: Without dead ends: 131 [2019-09-03 20:53:51,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 213 SyntacticMatches, 38 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:51,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-09-03 20:53:51,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-09-03 20:53:51,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-09-03 20:53:51,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 147 transitions. [2019-09-03 20:53:51,089 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 147 transitions. Word has length 128 [2019-09-03 20:53:51,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:51,089 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 147 transitions. [2019-09-03 20:53:51,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-03 20:53:51,089 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 147 transitions. [2019-09-03 20:53:51,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-03 20:53:51,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:51,090 INFO L399 BasicCegarLoop]: trace histogram [60, 44, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:51,090 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:51,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:51,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1727637603, now seen corresponding path program 44 times [2019-09-03 20:53:51,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:51,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:51,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:51,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:51,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:51,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:52,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1395 proven. 1980 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-03 20:53:52,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:52,099 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:52,100 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:52,100 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:52,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:52,100 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:53:52,111 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:52,111 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:52,149 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-09-03 20:53:52,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:52,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-03 20:53:52,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:53,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1452 proven. 256 refuted. 0 times theorem prover too weak. 1892 trivial. 0 not checked. [2019-09-03 20:53:53,239 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:54,215 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1452 proven. 256 refuted. 0 times theorem prover too weak. 1892 trivial. 0 not checked. [2019-09-03 20:53:54,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:54,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 19, 19] total 81 [2019-09-03 20:53:54,219 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:54,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-03 20:53:54,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-03 20:53:54,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-09-03 20:53:54,220 INFO L87 Difference]: Start difference. First operand 131 states and 147 transitions. Second operand 64 states. [2019-09-03 20:53:54,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:54,532 INFO L93 Difference]: Finished difference Result 136 states and 154 transitions. [2019-09-03 20:53:54,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-03 20:53:54,532 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 130 [2019-09-03 20:53:54,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:54,533 INFO L225 Difference]: With dead ends: 136 [2019-09-03 20:53:54,534 INFO L226 Difference]: Without dead ends: 136 [2019-09-03 20:53:54,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-09-03 20:53:54,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-03 20:53:54,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2019-09-03 20:53:54,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-03 20:53:54,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 152 transitions. [2019-09-03 20:53:54,536 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 152 transitions. Word has length 130 [2019-09-03 20:53:54,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:54,537 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 152 transitions. [2019-09-03 20:53:54,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-03 20:53:54,537 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 152 transitions. [2019-09-03 20:53:54,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-03 20:53:54,538 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:54,538 INFO L399 BasicCegarLoop]: trace histogram [62, 45, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:54,538 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:54,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:54,539 INFO L82 PathProgramCache]: Analyzing trace with hash -387083173, now seen corresponding path program 45 times [2019-09-03 20:53:54,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:54,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:54,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:54,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:54,540 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:54,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:55,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1518 proven. 2070 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-03 20:53:55,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:55,351 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:55,351 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:55,351 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:53:55,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:55,352 INFO 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:53:55,362 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:53:55,362 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:53:55,406 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:53:55,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:55,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-03 20:53:55,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:55,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1518 proven. 2070 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-03 20:53:55,431 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:56,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1518 proven. 2070 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-03 20:53:56,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:56,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 52 [2019-09-03 20:53:56,296 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:56,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-03 20:53:56,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-03 20:53:56,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:56,296 INFO L87 Difference]: Start difference. First operand 135 states and 152 transitions. Second operand 48 states. [2019-09-03 20:53:56,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:56,502 INFO L93 Difference]: Finished difference Result 137 states and 154 transitions. [2019-09-03 20:53:56,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-03 20:53:56,502 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 134 [2019-09-03 20:53:56,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:56,503 INFO L225 Difference]: With dead ends: 137 [2019-09-03 20:53:56,503 INFO L226 Difference]: Without dead ends: 137 [2019-09-03 20:53:56,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 223 SyntacticMatches, 42 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:56,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-09-03 20:53:56,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-09-03 20:53:56,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-09-03 20:53:56,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 154 transitions. [2019-09-03 20:53:56,508 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 154 transitions. Word has length 134 [2019-09-03 20:53:56,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:56,508 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 154 transitions. [2019-09-03 20:53:56,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-03 20:53:56,508 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 154 transitions. [2019-09-03 20:53:56,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-03 20:53:56,509 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:56,509 INFO L399 BasicCegarLoop]: trace histogram [63, 46, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:56,510 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:56,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:56,510 INFO L82 PathProgramCache]: Analyzing trace with hash -144896808, now seen corresponding path program 46 times [2019-09-03 20:53:56,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:56,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:56,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:53:56,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:56,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:56,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:57,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 1551 proven. 2162 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-03 20:53:57,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:57,358 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:57,359 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:57,359 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:57,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:57,359 INFO 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:53:57,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:57,370 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:53:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:57,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-03 20:53:57,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:53:57,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 1551 proven. 2162 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-03 20:53:57,434 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:53:58,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 1551 proven. 2162 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-03 20:53:58,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:53:58,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 52 [2019-09-03 20:53:58,315 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:53:58,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-03 20:53:58,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-03 20:53:58,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:58,316 INFO L87 Difference]: Start difference. First operand 137 states and 154 transitions. Second operand 49 states. [2019-09-03 20:53:58,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:53:58,474 INFO L93 Difference]: Finished difference Result 139 states and 156 transitions. [2019-09-03 20:53:58,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-03 20:53:58,475 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 136 [2019-09-03 20:53:58,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:53:58,476 INFO L225 Difference]: With dead ends: 139 [2019-09-03 20:53:58,476 INFO L226 Difference]: Without dead ends: 139 [2019-09-03 20:53:58,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 226 SyntacticMatches, 44 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:53:58,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-09-03 20:53:58,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-09-03 20:53:58,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-09-03 20:53:58,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 156 transitions. [2019-09-03 20:53:58,479 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 156 transitions. Word has length 136 [2019-09-03 20:53:58,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:53:58,479 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 156 transitions. [2019-09-03 20:53:58,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-03 20:53:58,479 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 156 transitions. [2019-09-03 20:53:58,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-03 20:53:58,480 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:53:58,480 INFO L399 BasicCegarLoop]: trace histogram [64, 47, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:53:58,481 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:53:58,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:53:58,481 INFO L82 PathProgramCache]: Analyzing trace with hash 667965973, now seen corresponding path program 47 times [2019-09-03 20:53:58,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:53:58,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:58,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:53:58,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:53:58,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:53:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:53:59,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 1584 proven. 2256 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-03 20:53:59,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:59,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:53:59,402 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:53:59,403 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:59,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:53:59,403 INFO 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:53:59,421 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:53:59,421 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:53:59,463 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-09-03 20:53:59,463 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:53:59,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 20:53:59,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:00,162 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 1645 proven. 289 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2019-09-03 20:54:00,163 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:01,083 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 1645 proven. 289 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2019-09-03 20:54:01,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:01,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 20, 20] total 86 [2019-09-03 20:54:01,086 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:01,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-03 20:54:01,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-03 20:54:01,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-09-03 20:54:01,088 INFO L87 Difference]: Start difference. First operand 139 states and 156 transitions. Second operand 68 states. [2019-09-03 20:54:01,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:01,436 INFO L93 Difference]: Finished difference Result 144 states and 163 transitions. [2019-09-03 20:54:01,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-03 20:54:01,437 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 138 [2019-09-03 20:54:01,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:01,438 INFO L225 Difference]: With dead ends: 144 [2019-09-03 20:54:01,438 INFO L226 Difference]: Without dead ends: 144 [2019-09-03 20:54:01,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-09-03 20:54:01,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-09-03 20:54:01,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2019-09-03 20:54:01,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-09-03 20:54:01,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 161 transitions. [2019-09-03 20:54:01,442 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 161 transitions. Word has length 138 [2019-09-03 20:54:01,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:01,443 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 161 transitions. [2019-09-03 20:54:01,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-03 20:54:01,443 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 161 transitions. [2019-09-03 20:54:01,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-03 20:54:01,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:01,444 INFO L399 BasicCegarLoop]: trace histogram [66, 48, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:01,444 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:01,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:01,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1237216115, now seen corresponding path program 48 times [2019-09-03 20:54:01,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:01,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:01,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:01,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:01,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:03,017 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 1715 proven. 2352 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-03 20:54:03,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:03,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:03,018 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:03,018 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:03,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:03,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:54:03,042 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:54:03,043 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:54:03,100 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:54:03,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:03,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-03 20:54:03,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:03,146 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 1715 proven. 2352 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-03 20:54:03,147 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:04,194 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 1715 proven. 2352 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-03 20:54:04,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:04,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 52 [2019-09-03 20:54:04,198 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:04,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-03 20:54:04,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-03 20:54:04,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:54:04,198 INFO L87 Difference]: Start difference. First operand 143 states and 161 transitions. Second operand 51 states. [2019-09-03 20:54:04,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:04,344 INFO L93 Difference]: Finished difference Result 145 states and 163 transitions. [2019-09-03 20:54:04,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-03 20:54:04,345 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 142 [2019-09-03 20:54:04,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:04,347 INFO L225 Difference]: With dead ends: 145 [2019-09-03 20:54:04,347 INFO L226 Difference]: Without dead ends: 145 [2019-09-03 20:54:04,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 236 SyntacticMatches, 48 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:54:04,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-09-03 20:54:04,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-09-03 20:54:04,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-09-03 20:54:04,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 163 transitions. [2019-09-03 20:54:04,351 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 163 transitions. Word has length 142 [2019-09-03 20:54:04,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:04,351 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 163 transitions. [2019-09-03 20:54:04,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-03 20:54:04,351 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 163 transitions. [2019-09-03 20:54:04,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-03 20:54:04,352 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:04,352 INFO L399 BasicCegarLoop]: trace histogram [67, 49, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:04,353 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:04,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:04,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1596145674, now seen corresponding path program 49 times [2019-09-03 20:54:04,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:04,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:04,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:04,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:04,354 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:04,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:05,350 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 1750 proven. 2450 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-03 20:54:05,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:05,350 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:05,350 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:05,351 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:05,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:05,351 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:54:05,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:05,362 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:54:05,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:05,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-03 20:54:05,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:05,420 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 1750 proven. 2450 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-03 20:54:05,420 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:06,294 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 1750 proven. 2450 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-03 20:54:06,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:06,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 52 [2019-09-03 20:54:06,297 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:06,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-03 20:54:06,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-03 20:54:06,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:54:06,299 INFO L87 Difference]: Start difference. First operand 145 states and 163 transitions. Second operand 52 states. [2019-09-03 20:54:06,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:06,490 INFO L93 Difference]: Finished difference Result 147 states and 165 transitions. [2019-09-03 20:54:06,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-03 20:54:06,490 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 144 [2019-09-03 20:54:06,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:06,491 INFO L225 Difference]: With dead ends: 147 [2019-09-03 20:54:06,491 INFO L226 Difference]: Without dead ends: 147 [2019-09-03 20:54:06,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 239 SyntacticMatches, 50 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:54:06,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-09-03 20:54:06,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2019-09-03 20:54:06,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-09-03 20:54:06,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 165 transitions. [2019-09-03 20:54:06,495 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 165 transitions. Word has length 144 [2019-09-03 20:54:06,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:06,495 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 165 transitions. [2019-09-03 20:54:06,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-03 20:54:06,495 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 165 transitions. [2019-09-03 20:54:06,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-03 20:54:06,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:06,496 INFO L399 BasicCegarLoop]: trace histogram [68, 50, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:06,497 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:06,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:06,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1447559239, now seen corresponding path program 50 times [2019-09-03 20:54:06,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:06,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:06,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:06,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:06,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:06,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:08,197 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:08,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:08,197 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:08,197 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:08,197 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:08,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:08,198 INFO 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:54:08,208 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:54:08,209 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:54:08,254 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-09-03 20:54:08,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:08,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 20:54:08,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:08,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 1850 proven. 324 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-03 20:54:08,270 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:09,269 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 1850 proven. 324 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-03 20:54:09,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:09,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 21, 21] total 90 [2019-09-03 20:54:09,272 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:09,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-03 20:54:09,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-03 20:54:09,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-09-03 20:54:09,273 INFO L87 Difference]: Start difference. First operand 147 states and 165 transitions. Second operand 71 states. [2019-09-03 20:54:09,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:09,728 INFO L93 Difference]: Finished difference Result 150 states and 170 transitions. [2019-09-03 20:54:09,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-03 20:54:09,729 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 146 [2019-09-03 20:54:09,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:09,731 INFO L225 Difference]: With dead ends: 150 [2019-09-03 20:54:09,731 INFO L226 Difference]: Without dead ends: 150 [2019-09-03 20:54:09,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-09-03 20:54:09,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-09-03 20:54:09,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-09-03 20:54:09,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-09-03 20:54:09,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 168 transitions. [2019-09-03 20:54:09,734 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 168 transitions. Word has length 146 [2019-09-03 20:54:09,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:09,735 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 168 transitions. [2019-09-03 20:54:09,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-03 20:54:09,735 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 168 transitions. [2019-09-03 20:54:09,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-03 20:54:09,736 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:09,737 INFO L399 BasicCegarLoop]: trace histogram [69, 50, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:09,737 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:09,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:09,737 INFO L82 PathProgramCache]: Analyzing trace with hash 638062466, now seen corresponding path program 51 times [2019-09-03 20:54:09,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:09,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:09,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:09,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:09,738 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:09,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:11,512 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:11,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:11,513 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:11,513 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:11,513 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:11,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:11,513 INFO 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:54:11,524 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:54:11,524 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:54:11,563 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:54:11,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:11,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-03 20:54:11,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:11,597 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:11,597 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:14,694 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:14,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:14,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 102 [2019-09-03 20:54:14,697 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:14,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-03 20:54:14,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-03 20:54:14,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:14,699 INFO L87 Difference]: Start difference. First operand 149 states and 168 transitions. Second operand 72 states. [2019-09-03 20:54:15,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:15,134 INFO L93 Difference]: Finished difference Result 152 states and 173 transitions. [2019-09-03 20:54:15,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-03 20:54:15,134 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 148 [2019-09-03 20:54:15,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:15,135 INFO L225 Difference]: With dead ends: 152 [2019-09-03 20:54:15,136 INFO L226 Difference]: Without dead ends: 152 [2019-09-03 20:54:15,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 227 SyntacticMatches, 40 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1980 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:15,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-03 20:54:15,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2019-09-03 20:54:15,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-09-03 20:54:15,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 171 transitions. [2019-09-03 20:54:15,139 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 171 transitions. Word has length 148 [2019-09-03 20:54:15,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:15,139 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 171 transitions. [2019-09-03 20:54:15,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-03 20:54:15,140 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 171 transitions. [2019-09-03 20:54:15,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-03 20:54:15,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:15,141 INFO L399 BasicCegarLoop]: trace histogram [70, 50, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:15,141 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:15,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:15,141 INFO L82 PathProgramCache]: Analyzing trace with hash 100744189, now seen corresponding path program 52 times [2019-09-03 20:54:15,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:15,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:15,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:15,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:15,142 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:15,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:17,734 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:17,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:17,734 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:17,734 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:17,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:17,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:17,735 INFO 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:54:17,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:17,745 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:54:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:17,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-03 20:54:17,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:17,841 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:17,841 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:20,991 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:20,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:20,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 102 [2019-09-03 20:54:20,995 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:20,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-03 20:54:20,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-03 20:54:20,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:20,996 INFO L87 Difference]: Start difference. First operand 151 states and 171 transitions. Second operand 73 states. [2019-09-03 20:54:21,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:21,441 INFO L93 Difference]: Finished difference Result 154 states and 176 transitions. [2019-09-03 20:54:21,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-03 20:54:21,442 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 150 [2019-09-03 20:54:21,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:21,443 INFO L225 Difference]: With dead ends: 154 [2019-09-03 20:54:21,443 INFO L226 Difference]: Without dead ends: 154 [2019-09-03 20:54:21,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 230 SyntacticMatches, 42 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2079 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:21,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-09-03 20:54:21,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2019-09-03 20:54:21,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-09-03 20:54:21,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 174 transitions. [2019-09-03 20:54:21,447 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 174 transitions. Word has length 150 [2019-09-03 20:54:21,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:21,447 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 174 transitions. [2019-09-03 20:54:21,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-03 20:54:21,447 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 174 transitions. [2019-09-03 20:54:21,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-03 20:54:21,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:21,448 INFO L399 BasicCegarLoop]: trace histogram [71, 50, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:21,448 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:21,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:21,448 INFO L82 PathProgramCache]: Analyzing trace with hash -866044488, now seen corresponding path program 53 times [2019-09-03 20:54:21,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:21,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:21,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:21,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:21,449 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:23,361 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:23,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:23,361 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:23,361 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:23,361 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:23,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:23,361 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:23,372 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:54:23,372 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:54:23,427 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-09-03 20:54:23,427 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:23,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 20:54:23,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:23,443 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2150 proven. 441 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-03 20:54:23,443 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:24,668 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2150 proven. 441 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-03 20:54:24,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:24,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 24, 24] total 96 [2019-09-03 20:54:24,671 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:24,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-03 20:54:24,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-03 20:54:24,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-09-03 20:54:24,673 INFO L87 Difference]: Start difference. First operand 153 states and 174 transitions. Second operand 74 states. [2019-09-03 20:54:25,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:25,105 INFO L93 Difference]: Finished difference Result 156 states and 179 transitions. [2019-09-03 20:54:25,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-03 20:54:25,105 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 152 [2019-09-03 20:54:25,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:25,107 INFO L225 Difference]: With dead ends: 156 [2019-09-03 20:54:25,107 INFO L226 Difference]: Without dead ends: 156 [2019-09-03 20:54:25,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-09-03 20:54:25,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-09-03 20:54:25,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2019-09-03 20:54:25,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-09-03 20:54:25,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 177 transitions. [2019-09-03 20:54:25,110 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 177 transitions. Word has length 152 [2019-09-03 20:54:25,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:25,111 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 177 transitions. [2019-09-03 20:54:25,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-03 20:54:25,111 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 177 transitions. [2019-09-03 20:54:25,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-03 20:54:25,112 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:25,112 INFO L399 BasicCegarLoop]: trace histogram [72, 50, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:25,112 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:25,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:25,112 INFO L82 PathProgramCache]: Analyzing trace with hash 2057940147, now seen corresponding path program 54 times [2019-09-03 20:54:25,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:25,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:25,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:25,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:25,114 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:27,279 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:27,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:27,280 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:27,280 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:27,280 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:27,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:27,280 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:27,290 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:54:27,290 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:54:27,340 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:54:27,340 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:27,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-03 20:54:27,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:27,376 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:27,377 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:30,526 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:30,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:30,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 102 [2019-09-03 20:54:30,529 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:30,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-03 20:54:30,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-03 20:54:30,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:30,530 INFO L87 Difference]: Start difference. First operand 155 states and 177 transitions. Second operand 75 states. [2019-09-03 20:54:30,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:30,938 INFO L93 Difference]: Finished difference Result 158 states and 182 transitions. [2019-09-03 20:54:30,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-03 20:54:30,939 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 154 [2019-09-03 20:54:30,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:30,940 INFO L225 Difference]: With dead ends: 158 [2019-09-03 20:54:30,940 INFO L226 Difference]: Without dead ends: 158 [2019-09-03 20:54:30,941 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 236 SyntacticMatches, 46 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2277 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:30,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-09-03 20:54:30,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2019-09-03 20:54:30,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-09-03 20:54:30,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 180 transitions. [2019-09-03 20:54:30,943 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 180 transitions. Word has length 154 [2019-09-03 20:54:30,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:30,944 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 180 transitions. [2019-09-03 20:54:30,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-03 20:54:30,944 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 180 transitions. [2019-09-03 20:54:30,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-03 20:54:30,945 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:30,945 INFO L399 BasicCegarLoop]: trace histogram [73, 50, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:30,945 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:30,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:30,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1196404498, now seen corresponding path program 55 times [2019-09-03 20:54:30,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:30,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:30,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:30,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:30,947 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:30,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:32,890 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:32,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:32,891 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:32,891 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:32,891 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:32,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:32,891 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:32,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:32,900 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:54:32,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:32,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 75 conjunts are in the unsatisfiable core [2019-09-03 20:54:32,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:32,978 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:32,978 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:36,105 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:36,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:36,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 102 [2019-09-03 20:54:36,108 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:36,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-03 20:54:36,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-03 20:54:36,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:36,110 INFO L87 Difference]: Start difference. First operand 157 states and 180 transitions. Second operand 76 states. [2019-09-03 20:54:36,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:36,593 INFO L93 Difference]: Finished difference Result 160 states and 185 transitions. [2019-09-03 20:54:36,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-03 20:54:36,593 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 156 [2019-09-03 20:54:36,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:36,594 INFO L225 Difference]: With dead ends: 160 [2019-09-03 20:54:36,594 INFO L226 Difference]: Without dead ends: 160 [2019-09-03 20:54:36,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 239 SyntacticMatches, 48 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2376 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:36,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-09-03 20:54:36,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2019-09-03 20:54:36,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-09-03 20:54:36,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 183 transitions. [2019-09-03 20:54:36,598 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 183 transitions. Word has length 156 [2019-09-03 20:54:36,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:36,598 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 183 transitions. [2019-09-03 20:54:36,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-03 20:54:36,598 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 183 transitions. [2019-09-03 20:54:36,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-03 20:54:36,599 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:36,599 INFO L399 BasicCegarLoop]: trace histogram [74, 50, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:36,600 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:36,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:36,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1885416855, now seen corresponding path program 56 times [2019-09-03 20:54:36,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:36,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:36,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:36,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:36,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:36,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:38,785 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:38,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:38,786 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:38,786 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:38,786 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,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:38,786 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:38,797 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:54:38,797 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:54:38,851 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-09-03 20:54:38,851 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:38,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 20:54:38,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:38,875 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2450 proven. 576 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-03 20:54:38,875 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:40,357 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2450 proven. 576 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-03 20:54:40,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:40,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 27, 27] total 102 [2019-09-03 20:54:40,361 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:40,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-03 20:54:40,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-03 20:54:40,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:40,362 INFO L87 Difference]: Start difference. First operand 159 states and 183 transitions. Second operand 77 states. [2019-09-03 20:54:40,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:40,797 INFO L93 Difference]: Finished difference Result 162 states and 188 transitions. [2019-09-03 20:54:40,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-03 20:54:40,797 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 158 [2019-09-03 20:54:40,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:40,798 INFO L225 Difference]: With dead ends: 162 [2019-09-03 20:54:40,798 INFO L226 Difference]: Without dead ends: 162 [2019-09-03 20:54:40,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:40,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-03 20:54:40,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2019-09-03 20:54:40,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-09-03 20:54:40,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 186 transitions. [2019-09-03 20:54:40,801 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 186 transitions. Word has length 158 [2019-09-03 20:54:40,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:40,801 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 186 transitions. [2019-09-03 20:54:40,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-03 20:54:40,802 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 186 transitions. [2019-09-03 20:54:40,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-03 20:54:40,802 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:40,803 INFO L399 BasicCegarLoop]: trace histogram [75, 50, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:40,803 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:40,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:40,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1693638948, now seen corresponding path program 57 times [2019-09-03 20:54:40,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:40,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:40,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:40,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:40,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:40,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:43,112 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:43,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:43,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:43,112 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:43,113 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:43,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:43,113 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:43,123 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:54:43,123 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:54:43,168 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:54:43,168 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:43,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-03 20:54:43,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:43,204 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:43,205 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:46,354 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:46,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:46,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 102 [2019-09-03 20:54:46,357 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:46,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-03 20:54:46,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-03 20:54:46,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:46,358 INFO L87 Difference]: Start difference. First operand 161 states and 186 transitions. Second operand 78 states. [2019-09-03 20:54:46,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:46,846 INFO L93 Difference]: Finished difference Result 164 states and 191 transitions. [2019-09-03 20:54:46,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-09-03 20:54:46,847 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 160 [2019-09-03 20:54:46,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:46,848 INFO L225 Difference]: With dead ends: 164 [2019-09-03 20:54:46,848 INFO L226 Difference]: Without dead ends: 164 [2019-09-03 20:54:46,848 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 245 SyntacticMatches, 52 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2574 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:46,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-09-03 20:54:46,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2019-09-03 20:54:46,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-09-03 20:54:46,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 189 transitions. [2019-09-03 20:54:46,852 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 189 transitions. Word has length 160 [2019-09-03 20:54:46,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:46,853 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 189 transitions. [2019-09-03 20:54:46,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-03 20:54:46,853 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 189 transitions. [2019-09-03 20:54:46,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-03 20:54:46,853 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:46,853 INFO L399 BasicCegarLoop]: trace histogram [76, 50, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:46,854 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:46,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:46,854 INFO L82 PathProgramCache]: Analyzing trace with hash 897461535, now seen corresponding path program 58 times [2019-09-03 20:54:46,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:46,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:46,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:46,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:46,855 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:48,973 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:48,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:48,973 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:48,973 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:48,973 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:48,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:48,973 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:48,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:48,983 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:54:49,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:49,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-03 20:54:49,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:49,052 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:49,052 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:52,247 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:52,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:52,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 102 [2019-09-03 20:54:52,250 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:52,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-03 20:54:52,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-03 20:54:52,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:52,253 INFO L87 Difference]: Start difference. First operand 163 states and 189 transitions. Second operand 79 states. [2019-09-03 20:54:52,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:52,792 INFO L93 Difference]: Finished difference Result 166 states and 194 transitions. [2019-09-03 20:54:52,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-03 20:54:52,792 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 162 [2019-09-03 20:54:52,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:52,793 INFO L225 Difference]: With dead ends: 166 [2019-09-03 20:54:52,793 INFO L226 Difference]: Without dead ends: 166 [2019-09-03 20:54:52,794 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 248 SyntacticMatches, 54 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2673 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:52,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-09-03 20:54:52,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2019-09-03 20:54:52,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-09-03 20:54:52,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 192 transitions. [2019-09-03 20:54:52,797 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 192 transitions. Word has length 162 [2019-09-03 20:54:52,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:52,797 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 192 transitions. [2019-09-03 20:54:52,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-03 20:54:52,797 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 192 transitions. [2019-09-03 20:54:52,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-03 20:54:52,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:52,798 INFO L399 BasicCegarLoop]: trace histogram [77, 50, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:52,799 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:52,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:52,799 INFO L82 PathProgramCache]: Analyzing trace with hash 275146330, now seen corresponding path program 59 times [2019-09-03 20:54:52,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:52,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:52,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:54:52,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:52,800 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:54:56,405 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:54:56,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:56,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:54:56,406 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:54:56,406 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:54:56,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:54:56,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:54:56,417 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:54:56,417 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:54:56,479 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2019-09-03 20:54:56,479 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:54:56,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 20:54:56,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:54:56,495 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2750 proven. 729 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-03 20:54:56,496 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:54:58,118 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2750 proven. 729 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-03 20:54:58,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:54:58,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 30, 30] total 102 [2019-09-03 20:54:58,122 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:54:58,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-09-03 20:54:58,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-09-03 20:54:58,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:58,124 INFO L87 Difference]: Start difference. First operand 165 states and 192 transitions. Second operand 80 states. [2019-09-03 20:54:58,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:54:58,664 INFO L93 Difference]: Finished difference Result 168 states and 197 transitions. [2019-09-03 20:54:58,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-09-03 20:54:58,664 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 164 [2019-09-03 20:54:58,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:54:58,665 INFO L225 Difference]: With dead ends: 168 [2019-09-03 20:54:58,665 INFO L226 Difference]: Without dead ends: 168 [2019-09-03 20:54:58,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 301 SyntacticMatches, 6 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:54:58,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-03 20:54:58,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2019-09-03 20:54:58,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-03 20:54:58,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 195 transitions. [2019-09-03 20:54:58,668 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 195 transitions. Word has length 164 [2019-09-03 20:54:58,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:54:58,669 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 195 transitions. [2019-09-03 20:54:58,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-09-03 20:54:58,669 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 195 transitions. [2019-09-03 20:54:58,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-03 20:54:58,670 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:54:58,670 INFO L399 BasicCegarLoop]: trace histogram [78, 50, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:54:58,670 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:54:58,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:54:58,671 INFO L82 PathProgramCache]: Analyzing trace with hash -769311531, now seen corresponding path program 60 times [2019-09-03 20:54:58,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:54:58,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:58,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:54:58,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:54:58,672 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:54:58,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:01,310 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:01,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:01,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:01,310 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:01,310 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,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:01,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:01,320 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:55:01,321 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:55:01,364 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:55:01,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:01,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-03 20:55:01,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:01,403 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:01,403 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:04,651 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:04,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:04,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 102 [2019-09-03 20:55:04,656 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:04,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-03 20:55:04,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-03 20:55:04,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:04,666 INFO L87 Difference]: Start difference. First operand 167 states and 195 transitions. Second operand 81 states. [2019-09-03 20:55:05,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:05,221 INFO L93 Difference]: Finished difference Result 170 states and 200 transitions. [2019-09-03 20:55:05,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-03 20:55:05,221 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 166 [2019-09-03 20:55:05,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:05,222 INFO L225 Difference]: With dead ends: 170 [2019-09-03 20:55:05,222 INFO L226 Difference]: Without dead ends: 170 [2019-09-03 20:55:05,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 254 SyntacticMatches, 58 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2871 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:05,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-09-03 20:55:05,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2019-09-03 20:55:05,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-09-03 20:55:05,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 198 transitions. [2019-09-03 20:55:05,226 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 198 transitions. Word has length 166 [2019-09-03 20:55:05,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:05,226 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 198 transitions. [2019-09-03 20:55:05,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-03 20:55:05,227 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 198 transitions. [2019-09-03 20:55:05,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-03 20:55:05,227 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:05,228 INFO L399 BasicCegarLoop]: trace histogram [79, 50, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:05,228 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:05,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:05,228 INFO L82 PathProgramCache]: Analyzing trace with hash 529031312, now seen corresponding path program 61 times [2019-09-03 20:55:05,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:05,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:05,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:05,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:05,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:07,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:07,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:07,450 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:07,450 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:07,450 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:07,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:07,450 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:07,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:07,460 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:55:07,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:07,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 81 conjunts are in the unsatisfiable core [2019-09-03 20:55:07,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:07,543 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:07,543 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:10,921 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:10,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:10,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 102 [2019-09-03 20:55:10,924 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:10,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-03 20:55:10,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-03 20:55:10,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:10,926 INFO L87 Difference]: Start difference. First operand 169 states and 198 transitions. Second operand 82 states. [2019-09-03 20:55:11,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:11,461 INFO L93 Difference]: Finished difference Result 172 states and 203 transitions. [2019-09-03 20:55:11,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-09-03 20:55:11,461 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 168 [2019-09-03 20:55:11,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:11,462 INFO L225 Difference]: With dead ends: 172 [2019-09-03 20:55:11,462 INFO L226 Difference]: Without dead ends: 172 [2019-09-03 20:55:11,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 257 SyntacticMatches, 60 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2970 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:11,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-09-03 20:55:11,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2019-09-03 20:55:11,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-09-03 20:55:11,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 201 transitions. [2019-09-03 20:55:11,467 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 201 transitions. Word has length 168 [2019-09-03 20:55:11,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:11,468 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 201 transitions. [2019-09-03 20:55:11,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-03 20:55:11,468 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 201 transitions. [2019-09-03 20:55:11,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-03 20:55:11,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:11,469 INFO L399 BasicCegarLoop]: trace histogram [80, 50, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:11,469 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:11,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:11,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1598979701, now seen corresponding path program 62 times [2019-09-03 20:55:11,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:11,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:11,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:11,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:11,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:11,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:13,757 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:13,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:13,758 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:13,758 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:13,758 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:13,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:13,758 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:13,768 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:55:13,768 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:55:13,842 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 62 check-sat command(s) [2019-09-03 20:55:13,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:13,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 20:55:13,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:13,859 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3050 proven. 900 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-03 20:55:13,859 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:15,598 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3050 proven. 900 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-03 20:55:15,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:15,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 33, 33] total 102 [2019-09-03 20:55:15,601 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:15,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-09-03 20:55:15,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-09-03 20:55:15,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:15,603 INFO L87 Difference]: Start difference. First operand 171 states and 201 transitions. Second operand 83 states. [2019-09-03 20:55:16,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:16,181 INFO L93 Difference]: Finished difference Result 174 states and 206 transitions. [2019-09-03 20:55:16,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-03 20:55:16,181 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 170 [2019-09-03 20:55:16,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:16,182 INFO L225 Difference]: With dead ends: 174 [2019-09-03 20:55:16,182 INFO L226 Difference]: Without dead ends: 174 [2019-09-03 20:55:16,182 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 310 SyntacticMatches, 12 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:16,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-09-03 20:55:16,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2019-09-03 20:55:16,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-09-03 20:55:16,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 204 transitions. [2019-09-03 20:55:16,185 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 204 transitions. Word has length 170 [2019-09-03 20:55:16,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:16,185 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 204 transitions. [2019-09-03 20:55:16,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-09-03 20:55:16,185 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 204 transitions. [2019-09-03 20:55:16,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-03 20:55:16,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:16,186 INFO L399 BasicCegarLoop]: trace histogram [81, 50, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:16,186 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:16,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:16,187 INFO L82 PathProgramCache]: Analyzing trace with hash 2081836998, now seen corresponding path program 63 times [2019-09-03 20:55:16,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:16,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:16,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:16,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:16,188 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:18,520 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:18,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:18,521 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:18,521 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:18,521 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:18,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:18,521 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:18,533 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:55:18,533 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:55:18,593 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:55:18,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:18,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 83 conjunts are in the unsatisfiable core [2019-09-03 20:55:18,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:18,635 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:18,636 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:21,912 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:21,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:21,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 102 [2019-09-03 20:55:21,916 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:21,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-09-03 20:55:21,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-09-03 20:55:21,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:21,917 INFO L87 Difference]: Start difference. First operand 173 states and 204 transitions. Second operand 84 states. [2019-09-03 20:55:22,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:22,523 INFO L93 Difference]: Finished difference Result 176 states and 209 transitions. [2019-09-03 20:55:22,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-03 20:55:22,524 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 172 [2019-09-03 20:55:22,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:22,525 INFO L225 Difference]: With dead ends: 176 [2019-09-03 20:55:22,525 INFO L226 Difference]: Without dead ends: 176 [2019-09-03 20:55:22,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 263 SyntacticMatches, 64 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3168 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:22,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-09-03 20:55:22,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2019-09-03 20:55:22,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-03 20:55:22,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 207 transitions. [2019-09-03 20:55:22,528 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 207 transitions. Word has length 172 [2019-09-03 20:55:22,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:22,528 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 207 transitions. [2019-09-03 20:55:22,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-09-03 20:55:22,528 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 207 transitions. [2019-09-03 20:55:22,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-03 20:55:22,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:22,529 INFO L399 BasicCegarLoop]: trace histogram [82, 50, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:22,529 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:22,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:22,530 INFO L82 PathProgramCache]: Analyzing trace with hash 293632833, now seen corresponding path program 64 times [2019-09-03 20:55:22,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:22,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:22,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:22,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:22,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:24,891 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:24,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:24,891 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:24,891 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:24,891 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:24,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:24,891 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:24,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:24,901 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:55:24,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:24,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 84 conjunts are in the unsatisfiable core [2019-09-03 20:55:24,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:24,979 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:24,980 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:28,263 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:28,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:28,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 102 [2019-09-03 20:55:28,267 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:28,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-09-03 20:55:28,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-09-03 20:55:28,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:28,268 INFO L87 Difference]: Start difference. First operand 175 states and 207 transitions. Second operand 85 states. [2019-09-03 20:55:28,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:28,894 INFO L93 Difference]: Finished difference Result 178 states and 212 transitions. [2019-09-03 20:55:28,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-09-03 20:55:28,894 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 174 [2019-09-03 20:55:28,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:28,895 INFO L225 Difference]: With dead ends: 178 [2019-09-03 20:55:28,895 INFO L226 Difference]: Without dead ends: 178 [2019-09-03 20:55:28,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 266 SyntacticMatches, 66 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3267 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:28,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-09-03 20:55:28,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2019-09-03 20:55:28,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-03 20:55:28,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 210 transitions. [2019-09-03 20:55:28,898 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 210 transitions. Word has length 174 [2019-09-03 20:55:28,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:28,899 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 210 transitions. [2019-09-03 20:55:28,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-09-03 20:55:28,899 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 210 transitions. [2019-09-03 20:55:28,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-03 20:55:28,900 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:28,900 INFO L399 BasicCegarLoop]: trace histogram [83, 50, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:28,901 INFO L418 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:28,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:28,901 INFO L82 PathProgramCache]: Analyzing trace with hash -183651332, now seen corresponding path program 65 times [2019-09-03 20:55:28,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:28,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:28,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:28,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:28,902 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:28,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:31,345 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:31,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:31,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:31,346 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:31,346 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:31,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:31,346 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:31,355 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:55:31,355 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:55:31,437 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 68 check-sat command(s) [2019-09-03 20:55:31,437 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:31,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 20:55:31,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:31,455 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 3350 proven. 1089 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-03 20:55:31,455 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:33,327 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 3350 proven. 1089 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-03 20:55:33,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:33,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 36, 36] total 102 [2019-09-03 20:55:33,330 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:33,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-09-03 20:55:33,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-09-03 20:55:33,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:33,332 INFO L87 Difference]: Start difference. First operand 177 states and 210 transitions. Second operand 86 states. [2019-09-03 20:55:33,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:33,850 INFO L93 Difference]: Finished difference Result 180 states and 215 transitions. [2019-09-03 20:55:33,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-09-03 20:55:33,851 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 176 [2019-09-03 20:55:33,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:33,852 INFO L225 Difference]: With dead ends: 180 [2019-09-03 20:55:33,852 INFO L226 Difference]: Without dead ends: 180 [2019-09-03 20:55:33,852 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 319 SyntacticMatches, 18 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:33,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-03 20:55:33,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 179. [2019-09-03 20:55:33,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-09-03 20:55:33,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 213 transitions. [2019-09-03 20:55:33,855 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 213 transitions. Word has length 176 [2019-09-03 20:55:33,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:33,856 INFO L475 AbstractCegarLoop]: Abstraction has 179 states and 213 transitions. [2019-09-03 20:55:33,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-09-03 20:55:33,856 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 213 transitions. [2019-09-03 20:55:33,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-03 20:55:33,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:33,857 INFO L399 BasicCegarLoop]: trace histogram [84, 50, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:33,857 INFO L418 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:33,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:33,858 INFO L82 PathProgramCache]: Analyzing trace with hash 707766775, now seen corresponding path program 66 times [2019-09-03 20:55:33,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:33,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:33,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:33,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:33,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:33,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:36,387 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:36,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:36,387 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:36,387 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:36,387 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:36,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:36,387 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:36,398 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:55:36,398 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:55:36,453 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:55:36,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:36,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-03 20:55:36,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:36,491 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:36,491 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:39,777 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:39,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:39,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 102 [2019-09-03 20:55:39,780 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:39,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-09-03 20:55:39,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-09-03 20:55:39,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:39,782 INFO L87 Difference]: Start difference. First operand 179 states and 213 transitions. Second operand 87 states. [2019-09-03 20:55:40,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:40,394 INFO L93 Difference]: Finished difference Result 182 states and 218 transitions. [2019-09-03 20:55:40,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-03 20:55:40,395 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 178 [2019-09-03 20:55:40,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:40,396 INFO L225 Difference]: With dead ends: 182 [2019-09-03 20:55:40,396 INFO L226 Difference]: Without dead ends: 182 [2019-09-03 20:55:40,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 272 SyntacticMatches, 70 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3465 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:40,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-03 20:55:40,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2019-09-03 20:55:40,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-09-03 20:55:40,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 216 transitions. [2019-09-03 20:55:40,400 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 216 transitions. Word has length 178 [2019-09-03 20:55:40,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:40,400 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 216 transitions. [2019-09-03 20:55:40,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-09-03 20:55:40,400 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 216 transitions. [2019-09-03 20:55:40,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-03 20:55:40,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:40,401 INFO L399 BasicCegarLoop]: trace histogram [85, 50, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:40,402 INFO L418 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:40,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:40,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1632891598, now seen corresponding path program 67 times [2019-09-03 20:55:40,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:40,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:40,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:40,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:40,403 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:42,990 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:42,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:42,991 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:42,991 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:42,991 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,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:42,991 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:43,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:43,000 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:55:43,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:43,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 87 conjunts are in the unsatisfiable core [2019-09-03 20:55:43,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:43,079 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:43,079 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:46,351 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:46,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:46,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 102 [2019-09-03 20:55:46,354 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:46,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-09-03 20:55:46,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-09-03 20:55:46,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:46,355 INFO L87 Difference]: Start difference. First operand 181 states and 216 transitions. Second operand 88 states. [2019-09-03 20:55:46,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:46,997 INFO L93 Difference]: Finished difference Result 184 states and 221 transitions. [2019-09-03 20:55:46,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-09-03 20:55:46,998 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 180 [2019-09-03 20:55:46,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:46,999 INFO L225 Difference]: With dead ends: 184 [2019-09-03 20:55:46,999 INFO L226 Difference]: Without dead ends: 184 [2019-09-03 20:55:46,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 275 SyntacticMatches, 72 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3564 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:47,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-09-03 20:55:47,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2019-09-03 20:55:47,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-09-03 20:55:47,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 219 transitions. [2019-09-03 20:55:47,002 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 219 transitions. Word has length 180 [2019-09-03 20:55:47,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:47,003 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 219 transitions. [2019-09-03 20:55:47,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-09-03 20:55:47,003 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 219 transitions. [2019-09-03 20:55:47,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-03 20:55:47,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:47,004 INFO L399 BasicCegarLoop]: trace histogram [86, 50, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:47,005 INFO L418 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:47,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:47,005 INFO L82 PathProgramCache]: Analyzing trace with hash -442724947, now seen corresponding path program 68 times [2019-09-03 20:55:47,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:47,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:47,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:55:47,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:47,006 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:47,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:49,589 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:49,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:49,590 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:49,590 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:49,590 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:49,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:49,590 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:49,601 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:55:49,601 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:55:49,692 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 74 check-sat command(s) [2019-09-03 20:55:49,692 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:49,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-03 20:55:49,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:49,711 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3650 proven. 1296 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-03 20:55:49,712 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:51,693 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3650 proven. 1296 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-03 20:55:51,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:51,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 39, 39] total 102 [2019-09-03 20:55:51,697 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:51,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-09-03 20:55:51,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-09-03 20:55:51,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:51,699 INFO L87 Difference]: Start difference. First operand 183 states and 219 transitions. Second operand 89 states. [2019-09-03 20:55:52,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:52,328 INFO L93 Difference]: Finished difference Result 186 states and 224 transitions. [2019-09-03 20:55:52,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-03 20:55:52,328 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 182 [2019-09-03 20:55:52,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:52,329 INFO L225 Difference]: With dead ends: 186 [2019-09-03 20:55:52,329 INFO L226 Difference]: Without dead ends: 186 [2019-09-03 20:55:52,330 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 328 SyntacticMatches, 24 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:52,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-09-03 20:55:52,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2019-09-03 20:55:52,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-09-03 20:55:52,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 222 transitions. [2019-09-03 20:55:52,332 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 222 transitions. Word has length 182 [2019-09-03 20:55:52,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:52,332 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 222 transitions. [2019-09-03 20:55:52,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-09-03 20:55:52,332 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 222 transitions. [2019-09-03 20:55:52,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-03 20:55:52,333 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:52,333 INFO L399 BasicCegarLoop]: trace histogram [87, 50, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:52,333 INFO L418 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:52,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:52,334 INFO L82 PathProgramCache]: Analyzing trace with hash 846125928, now seen corresponding path program 69 times [2019-09-03 20:55:52,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:52,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:52,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:52,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:52,335 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:55:54,978 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:54,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:54,979 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:55:54,979 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:55:54,979 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:54,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:55:54,979 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:55:54,989 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:55:54,989 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:55:55,043 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:55:55,043 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:55:55,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 89 conjunts are in the unsatisfiable core [2019-09-03 20:55:55,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:55:55,073 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:55,073 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:55:58,369 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:55:58,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:55:58,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 102 [2019-09-03 20:55:58,372 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:55:58,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-09-03 20:55:58,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-09-03 20:55:58,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:58,374 INFO L87 Difference]: Start difference. First operand 185 states and 222 transitions. Second operand 90 states. [2019-09-03 20:55:58,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:55:58,985 INFO L93 Difference]: Finished difference Result 188 states and 227 transitions. [2019-09-03 20:55:58,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-03 20:55:58,985 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 184 [2019-09-03 20:55:58,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:55:58,986 INFO L225 Difference]: With dead ends: 188 [2019-09-03 20:55:58,986 INFO L226 Difference]: Without dead ends: 188 [2019-09-03 20:55:58,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 281 SyntacticMatches, 76 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3762 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:55:58,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-03 20:55:58,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 187. [2019-09-03 20:55:58,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-09-03 20:55:58,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 225 transitions. [2019-09-03 20:55:58,990 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 225 transitions. Word has length 184 [2019-09-03 20:55:58,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:55:58,990 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 225 transitions. [2019-09-03 20:55:58,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-09-03 20:55:58,990 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 225 transitions. [2019-09-03 20:55:58,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-03 20:55:58,991 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:55:58,991 INFO L399 BasicCegarLoop]: trace histogram [88, 50, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:55:58,992 INFO L418 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:55:58,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:55:58,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1813731741, now seen corresponding path program 70 times [2019-09-03 20:55:58,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:55:58,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:58,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:55:58,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:55:58,993 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:55:59,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:01,947 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:01,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:01,948 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:01,948 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:01,948 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:01,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:01,948 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:01,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:01,958 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:56:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:02,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 90 conjunts are in the unsatisfiable core [2019-09-03 20:56:02,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:02,041 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:02,041 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:05,374 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:05,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:05,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 102 [2019-09-03 20:56:05,378 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:05,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-09-03 20:56:05,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-09-03 20:56:05,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:56:05,380 INFO L87 Difference]: Start difference. First operand 187 states and 225 transitions. Second operand 91 states. [2019-09-03 20:56:06,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:06,127 INFO L93 Difference]: Finished difference Result 190 states and 230 transitions. [2019-09-03 20:56:06,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-03 20:56:06,127 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 186 [2019-09-03 20:56:06,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:06,128 INFO L225 Difference]: With dead ends: 190 [2019-09-03 20:56:06,128 INFO L226 Difference]: Without dead ends: 190 [2019-09-03 20:56:06,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 284 SyntacticMatches, 78 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3861 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:56:06,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-09-03 20:56:06,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2019-09-03 20:56:06,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-03 20:56:06,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 228 transitions. [2019-09-03 20:56:06,131 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 228 transitions. Word has length 186 [2019-09-03 20:56:06,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:06,132 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 228 transitions. [2019-09-03 20:56:06,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-09-03 20:56:06,132 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 228 transitions. [2019-09-03 20:56:06,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-03 20:56:06,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:06,133 INFO L399 BasicCegarLoop]: trace histogram [89, 50, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:06,133 INFO L418 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:06,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:06,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1863556766, now seen corresponding path program 71 times [2019-09-03 20:56:06,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:06,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:06,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:06,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:06,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:06,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:08,940 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:08,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:08,940 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:08,940 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:08,940 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:08,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:08,941 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:08,951 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:56:08,951 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:56:09,100 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 80 check-sat command(s) [2019-09-03 20:56:09,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:09,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 20:56:09,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:09,134 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 3950 proven. 1521 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-03 20:56:09,134 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:11,287 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 3950 proven. 1521 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-03 20:56:11,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:11,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 42, 42] total 102 [2019-09-03 20:56:11,290 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:11,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-09-03 20:56:11,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-09-03 20:56:11,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:56:11,292 INFO L87 Difference]: Start difference. First operand 189 states and 228 transitions. Second operand 92 states. [2019-09-03 20:56:11,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:11,973 INFO L93 Difference]: Finished difference Result 192 states and 233 transitions. [2019-09-03 20:56:11,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-09-03 20:56:11,973 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 188 [2019-09-03 20:56:11,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:11,974 INFO L225 Difference]: With dead ends: 192 [2019-09-03 20:56:11,974 INFO L226 Difference]: Without dead ends: 192 [2019-09-03 20:56:11,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 337 SyntacticMatches, 30 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:56:11,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-09-03 20:56:11,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 191. [2019-09-03 20:56:11,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-03 20:56:11,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 231 transitions. [2019-09-03 20:56:11,977 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 231 transitions. Word has length 188 [2019-09-03 20:56:11,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:11,977 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 231 transitions. [2019-09-03 20:56:11,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-09-03 20:56:11,977 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 231 transitions. [2019-09-03 20:56:11,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-03 20:56:11,978 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:11,978 INFO L399 BasicCegarLoop]: trace histogram [90, 50, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:11,978 INFO L418 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:11,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:11,979 INFO L82 PathProgramCache]: Analyzing trace with hash 979727385, now seen corresponding path program 72 times [2019-09-03 20:56:11,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:11,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:11,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:11,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:11,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:14,829 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:14,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:14,829 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:14,830 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:14,830 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:14,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:14,830 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:14,840 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:56:14,840 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:56:14,901 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:56:14,901 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:14,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 92 conjunts are in the unsatisfiable core [2019-09-03 20:56:14,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:14,945 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:14,945 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:18,239 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:18,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:18,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 102 [2019-09-03 20:56:18,242 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:18,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-09-03 20:56:18,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-09-03 20:56:18,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:56:18,244 INFO L87 Difference]: Start difference. First operand 191 states and 231 transitions. Second operand 93 states. [2019-09-03 20:56:19,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:19,025 INFO L93 Difference]: Finished difference Result 194 states and 236 transitions. [2019-09-03 20:56:19,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-09-03 20:56:19,025 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 190 [2019-09-03 20:56:19,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:19,026 INFO L225 Difference]: With dead ends: 194 [2019-09-03 20:56:19,026 INFO L226 Difference]: Without dead ends: 194 [2019-09-03 20:56:19,026 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 290 SyntacticMatches, 82 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4059 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:56:19,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-09-03 20:56:19,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2019-09-03 20:56:19,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-09-03 20:56:19,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 234 transitions. [2019-09-03 20:56:19,029 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 234 transitions. Word has length 190 [2019-09-03 20:56:19,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:19,029 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 234 transitions. [2019-09-03 20:56:19,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-09-03 20:56:19,029 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 234 transitions. [2019-09-03 20:56:19,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-03 20:56:19,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:19,030 INFO L399 BasicCegarLoop]: trace histogram [91, 50, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:19,030 INFO L418 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:19,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:19,030 INFO L82 PathProgramCache]: Analyzing trace with hash 2023216852, now seen corresponding path program 73 times [2019-09-03 20:56:19,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:19,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:19,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:19,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:19,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:21,959 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 8281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:21,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:21,959 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:21,960 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:21,960 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:21,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:21,960 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:21,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:21,970 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:56:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:22,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 93 conjunts are in the unsatisfiable core [2019-09-03 20:56:22,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:22,056 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 8281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:22,056 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:25,365 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 8281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:25,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:25,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 102 [2019-09-03 20:56:25,369 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:25,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-09-03 20:56:25,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-09-03 20:56:25,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:56:25,371 INFO L87 Difference]: Start difference. First operand 193 states and 234 transitions. Second operand 94 states. [2019-09-03 20:56:26,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:26,043 INFO L93 Difference]: Finished difference Result 196 states and 239 transitions. [2019-09-03 20:56:26,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-09-03 20:56:26,043 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 192 [2019-09-03 20:56:26,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:26,044 INFO L225 Difference]: With dead ends: 196 [2019-09-03 20:56:26,044 INFO L226 Difference]: Without dead ends: 196 [2019-09-03 20:56:26,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 293 SyntacticMatches, 84 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4158 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:56:26,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-09-03 20:56:26,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 195. [2019-09-03 20:56:26,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-03 20:56:26,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 237 transitions. [2019-09-03 20:56:26,047 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 237 transitions. Word has length 192 [2019-09-03 20:56:26,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:26,047 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 237 transitions. [2019-09-03 20:56:26,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-09-03 20:56:26,047 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 237 transitions. [2019-09-03 20:56:26,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-03 20:56:26,048 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:26,048 INFO L399 BasicCegarLoop]: trace histogram [92, 50, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:26,048 INFO L418 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:26,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:26,048 INFO L82 PathProgramCache]: Analyzing trace with hash -205752625, now seen corresponding path program 74 times [2019-09-03 20:56:26,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:26,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:26,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:26,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:26,049 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:28,995 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:28,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:28,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:28,996 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:28,996 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:28,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:28,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:29,006 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:56:29,006 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:56:29,122 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 86 check-sat command(s) [2019-09-03 20:56:29,123 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:29,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-03 20:56:29,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:29,146 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 4250 proven. 1764 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-03 20:56:29,146 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:31,387 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 4250 proven. 1764 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-03 20:56:31,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:31,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 45, 45] total 102 [2019-09-03 20:56:31,391 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:31,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-09-03 20:56:31,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-09-03 20:56:31,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:56:31,392 INFO L87 Difference]: Start difference. First operand 195 states and 237 transitions. Second operand 95 states. [2019-09-03 20:56:32,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:32,027 INFO L93 Difference]: Finished difference Result 198 states and 242 transitions. [2019-09-03 20:56:32,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-03 20:56:32,027 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 194 [2019-09-03 20:56:32,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:32,028 INFO L225 Difference]: With dead ends: 198 [2019-09-03 20:56:32,028 INFO L226 Difference]: Without dead ends: 198 [2019-09-03 20:56:32,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 346 SyntacticMatches, 36 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:56:32,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-09-03 20:56:32,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2019-09-03 20:56:32,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-03 20:56:32,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 240 transitions. [2019-09-03 20:56:32,034 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 240 transitions. Word has length 194 [2019-09-03 20:56:32,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:32,034 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 240 transitions. [2019-09-03 20:56:32,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-09-03 20:56:32,035 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 240 transitions. [2019-09-03 20:56:32,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-03 20:56:32,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:32,036 INFO L399 BasicCegarLoop]: trace histogram [93, 50, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:32,036 INFO L418 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:32,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:32,036 INFO L82 PathProgramCache]: Analyzing trace with hash 943260682, now seen corresponding path program 75 times [2019-09-03 20:56:32,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:32,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:32,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:32,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:32,037 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:32,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:35,074 INFO L134 CoverageAnalysis]: Checked inductivity of 8649 backedges. 0 proven. 8649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:35,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:35,075 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:35,075 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:35,075 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:35,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:35,075 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:35,086 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:56:35,086 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:56:35,142 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:56:35,143 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:35,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 95 conjunts are in the unsatisfiable core [2019-09-03 20:56:35,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:35,187 INFO L134 CoverageAnalysis]: Checked inductivity of 8649 backedges. 0 proven. 8649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:35,188 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:38,575 INFO L134 CoverageAnalysis]: Checked inductivity of 8649 backedges. 0 proven. 8649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:38,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:38,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 102 [2019-09-03 20:56:38,578 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:38,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-09-03 20:56:38,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-09-03 20:56:38,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:56:38,580 INFO L87 Difference]: Start difference. First operand 197 states and 240 transitions. Second operand 96 states. [2019-09-03 20:56:39,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:39,341 INFO L93 Difference]: Finished difference Result 200 states and 245 transitions. [2019-09-03 20:56:39,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-09-03 20:56:39,341 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 196 [2019-09-03 20:56:39,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:39,342 INFO L225 Difference]: With dead ends: 200 [2019-09-03 20:56:39,342 INFO L226 Difference]: Without dead ends: 200 [2019-09-03 20:56:39,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 299 SyntacticMatches, 88 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4356 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:56:39,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-09-03 20:56:39,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2019-09-03 20:56:39,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-03 20:56:39,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 243 transitions. [2019-09-03 20:56:39,346 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 243 transitions. Word has length 196 [2019-09-03 20:56:39,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:39,346 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 243 transitions. [2019-09-03 20:56:39,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-09-03 20:56:39,346 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 243 transitions. [2019-09-03 20:56:39,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-03 20:56:39,347 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:39,347 INFO L399 BasicCegarLoop]: trace histogram [94, 50, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:39,348 INFO L418 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:39,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:39,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1338453637, now seen corresponding path program 76 times [2019-09-03 20:56:39,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:39,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:39,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:39,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:39,349 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:39,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:42,515 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:42,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:42,515 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:42,515 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:42,515 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:42,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:42,516 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:42,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:42,526 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:56:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:42,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 96 conjunts are in the unsatisfiable core [2019-09-03 20:56:42,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:42,630 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:42,630 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:45,959 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:45,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:45,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 102 [2019-09-03 20:56:45,962 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:45,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-09-03 20:56:45,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-09-03 20:56:45,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:56:45,964 INFO L87 Difference]: Start difference. First operand 199 states and 243 transitions. Second operand 97 states. [2019-09-03 20:56:46,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:46,603 INFO L93 Difference]: Finished difference Result 202 states and 248 transitions. [2019-09-03 20:56:46,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-09-03 20:56:46,603 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 198 [2019-09-03 20:56:46,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:46,604 INFO L225 Difference]: With dead ends: 202 [2019-09-03 20:56:46,604 INFO L226 Difference]: Without dead ends: 202 [2019-09-03 20:56:46,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 302 SyntacticMatches, 90 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4455 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:56:46,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-03 20:56:46,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2019-09-03 20:56:46,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-09-03 20:56:46,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 246 transitions. [2019-09-03 20:56:46,608 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 246 transitions. Word has length 198 [2019-09-03 20:56:46,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:46,608 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 246 transitions. [2019-09-03 20:56:46,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-09-03 20:56:46,609 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 246 transitions. [2019-09-03 20:56:46,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-03 20:56:46,610 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:46,610 INFO L399 BasicCegarLoop]: trace histogram [95, 50, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:46,610 INFO L418 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:46,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:46,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1133205952, now seen corresponding path program 77 times [2019-09-03 20:56:46,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:46,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:46,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:56:46,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:46,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:46,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:49,786 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 0 proven. 9025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:49,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:49,786 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:49,786 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:49,787 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:49,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:49,787 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:49,796 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:56:49,797 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:56:49,917 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 92 check-sat command(s) [2019-09-03 20:56:49,917 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:49,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-03 20:56:49,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:49,941 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 4550 proven. 2025 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-03 20:56:49,942 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:52,307 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 4550 proven. 2025 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-03 20:56:52,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:52,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 48, 48] total 102 [2019-09-03 20:56:52,311 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:52,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-09-03 20:56:52,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-09-03 20:56:52,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:56:52,313 INFO L87 Difference]: Start difference. First operand 201 states and 246 transitions. Second operand 98 states. [2019-09-03 20:56:53,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:56:53,064 INFO L93 Difference]: Finished difference Result 204 states and 251 transitions. [2019-09-03 20:56:53,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-09-03 20:56:53,065 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 200 [2019-09-03 20:56:53,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:56:53,066 INFO L225 Difference]: With dead ends: 204 [2019-09-03 20:56:53,066 INFO L226 Difference]: Without dead ends: 204 [2019-09-03 20:56:53,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 355 SyntacticMatches, 42 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:56:53,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-09-03 20:56:53,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 203. [2019-09-03 20:56:53,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-03 20:56:53,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 249 transitions. [2019-09-03 20:56:53,069 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 249 transitions. Word has length 200 [2019-09-03 20:56:53,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:56:53,069 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 249 transitions. [2019-09-03 20:56:53,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-09-03 20:56:53,069 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 249 transitions. [2019-09-03 20:56:53,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-03 20:56:53,070 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:56:53,070 INFO L399 BasicCegarLoop]: trace histogram [96, 50, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:56:53,070 INFO L418 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:56:53,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:56:53,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1281156293, now seen corresponding path program 78 times [2019-09-03 20:56:53,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:56:53,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:53,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:56:53,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:56:53,072 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:56:53,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:56:56,279 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 0 proven. 9216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:56,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:56,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:56:56,280 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:56:56,280 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:56:56,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:56:56,280 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:56:56,290 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:56:56,290 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:56:56,350 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:56:56,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:56:56,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 98 conjunts are in the unsatisfiable core [2019-09-03 20:56:56,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:56:56,383 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 0 proven. 9216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:56,383 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:56:59,713 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 0 proven. 9216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:56:59,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:56:59,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 102 [2019-09-03 20:56:59,716 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:56:59,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-09-03 20:56:59,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-09-03 20:56:59,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:56:59,718 INFO L87 Difference]: Start difference. First operand 203 states and 249 transitions. Second operand 99 states. [2019-09-03 20:57:00,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:00,568 INFO L93 Difference]: Finished difference Result 206 states and 254 transitions. [2019-09-03 20:57:00,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-03 20:57:00,568 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 202 [2019-09-03 20:57:00,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:00,569 INFO L225 Difference]: With dead ends: 206 [2019-09-03 20:57:00,569 INFO L226 Difference]: Without dead ends: 206 [2019-09-03 20:57:00,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 308 SyntacticMatches, 94 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4653 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:57:00,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-09-03 20:57:00,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2019-09-03 20:57:00,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-03 20:57:00,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 252 transitions. [2019-09-03 20:57:00,571 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 252 transitions. Word has length 202 [2019-09-03 20:57:00,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:00,571 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 252 transitions. [2019-09-03 20:57:00,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-09-03 20:57:00,572 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 252 transitions. [2019-09-03 20:57:00,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-03 20:57:00,572 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:00,572 INFO L399 BasicCegarLoop]: trace histogram [97, 50, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:00,573 INFO L418 AbstractCegarLoop]: === Iteration 82 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:00,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:00,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1727513226, now seen corresponding path program 79 times [2019-09-03 20:57:00,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:00,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:00,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:00,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:00,574 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:00,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:03,840 INFO L134 CoverageAnalysis]: Checked inductivity of 9409 backedges. 0 proven. 9409 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:03,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:03,841 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:03,841 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:03,841 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:03,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:03,841 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:03,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:03,851 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:57:03,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:03,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 99 conjunts are in the unsatisfiable core [2019-09-03 20:57:03,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:03,948 INFO L134 CoverageAnalysis]: Checked inductivity of 9409 backedges. 0 proven. 9409 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:03,949 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:07,281 INFO L134 CoverageAnalysis]: Checked inductivity of 9409 backedges. 0 proven. 9409 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:07,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:07,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 102 [2019-09-03 20:57:07,285 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:07,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-09-03 20:57:07,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-09-03 20:57:07,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:57:07,287 INFO L87 Difference]: Start difference. First operand 205 states and 252 transitions. Second operand 100 states. [2019-09-03 20:57:07,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:07,967 INFO L93 Difference]: Finished difference Result 208 states and 257 transitions. [2019-09-03 20:57:07,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-09-03 20:57:07,967 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 204 [2019-09-03 20:57:07,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:07,968 INFO L225 Difference]: With dead ends: 208 [2019-09-03 20:57:07,968 INFO L226 Difference]: Without dead ends: 208 [2019-09-03 20:57:07,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 311 SyntacticMatches, 96 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4752 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:57:07,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-09-03 20:57:07,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 207. [2019-09-03 20:57:07,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-09-03 20:57:07,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 255 transitions. [2019-09-03 20:57:07,971 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 255 transitions. Word has length 204 [2019-09-03 20:57:07,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:07,971 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 255 transitions. [2019-09-03 20:57:07,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-09-03 20:57:07,971 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 255 transitions. [2019-09-03 20:57:07,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-09-03 20:57:07,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:07,972 INFO L399 BasicCegarLoop]: trace histogram [98, 50, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:07,972 INFO L418 AbstractCegarLoop]: === Iteration 83 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:07,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:07,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1179796239, now seen corresponding path program 80 times [2019-09-03 20:57:07,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:07,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:07,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:07,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:07,973 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:11,343 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 9604 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:11,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:11,344 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:11,344 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:11,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:57:11,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:11,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 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:11,355 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:57:11,355 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:57:11,487 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 98 check-sat command(s) [2019-09-03 20:57:11,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:11,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-03 20:57:11,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:11,515 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 4850 proven. 2304 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-03 20:57:11,515 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:13,978 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 4850 proven. 2304 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-09-03 20:57:13,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:13,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 51, 51] total 102 [2019-09-03 20:57:13,982 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:13,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-09-03 20:57:13,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-09-03 20:57:13,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:57:13,984 INFO L87 Difference]: Start difference. First operand 207 states and 255 transitions. Second operand 101 states. [2019-09-03 20:57:14,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:14,877 INFO L93 Difference]: Finished difference Result 210 states and 260 transitions. [2019-09-03 20:57:14,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-03 20:57:14,877 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 206 [2019-09-03 20:57:14,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:14,878 INFO L225 Difference]: With dead ends: 210 [2019-09-03 20:57:14,878 INFO L226 Difference]: Without dead ends: 210 [2019-09-03 20:57:14,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 364 SyntacticMatches, 48 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:57:14,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-03 20:57:14,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2019-09-03 20:57:14,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-09-03 20:57:14,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 258 transitions. [2019-09-03 20:57:14,881 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 258 transitions. Word has length 206 [2019-09-03 20:57:14,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:14,881 INFO L475 AbstractCegarLoop]: Abstraction has 209 states and 258 transitions. [2019-09-03 20:57:14,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-09-03 20:57:14,881 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 258 transitions. [2019-09-03 20:57:14,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-03 20:57:14,882 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:14,882 INFO L399 BasicCegarLoop]: trace histogram [99, 50, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:14,884 INFO L418 AbstractCegarLoop]: === Iteration 84 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:14,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:14,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1190218156, now seen corresponding path program 81 times [2019-09-03 20:57:14,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:14,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:14,885 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:14,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:14,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:18,426 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:18,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:18,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:18,427 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:18,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:18,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:18,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:18,441 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:57:18,441 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:57:18,505 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:57:18,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:18,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 101 conjunts are in the unsatisfiable core [2019-09-03 20:57:18,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:18,541 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:18,541 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:21,881 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:21,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:21,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 102 [2019-09-03 20:57:21,885 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:21,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-09-03 20:57:21,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-09-03 20:57:21,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:57:21,886 INFO L87 Difference]: Start difference. First operand 209 states and 258 transitions. Second operand 102 states. [2019-09-03 20:57:22,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:22,732 INFO L93 Difference]: Finished difference Result 211 states and 261 transitions. [2019-09-03 20:57:22,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-09-03 20:57:22,733 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 208 [2019-09-03 20:57:22,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:22,734 INFO L225 Difference]: With dead ends: 211 [2019-09-03 20:57:22,734 INFO L226 Difference]: Without dead ends: 211 [2019-09-03 20:57:22,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 317 SyntacticMatches, 100 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4950 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:57:22,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-03 20:57:22,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-09-03 20:57:22,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-09-03 20:57:22,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 261 transitions. [2019-09-03 20:57:22,738 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 261 transitions. Word has length 208 [2019-09-03 20:57:22,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:22,738 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 261 transitions. [2019-09-03 20:57:22,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-09-03 20:57:22,738 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 261 transitions. [2019-09-03 20:57:22,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-03 20:57:22,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:22,740 INFO L399 BasicCegarLoop]: trace histogram [100, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:22,740 INFO L418 AbstractCegarLoop]: === Iteration 85 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:22,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:22,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1853582425, now seen corresponding path program 82 times [2019-09-03 20:57:22,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:22,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:22,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:22,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:22,741 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:22,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:24,615 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2019-09-03 20:57:24,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:24,615 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:24,615 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:24,615 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:24,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:24,616 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:24,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:24,626 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:57:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:24,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 108 conjunts are in the unsatisfiable core [2019-09-03 20:57:24,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:24,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:25,081 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2019-09-03 20:57:25,082 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:25,330 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (83)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:57:25,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:25,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 57 [2019-09-03 20:57:25,334 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:25,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-03 20:57:25,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-03 20:57:25,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3079, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 20:57:25,336 INFO L87 Difference]: Start difference. First operand 211 states and 261 transitions. Second operand 57 states. [2019-09-03 20:57:27,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:27,302 INFO L93 Difference]: Finished difference Result 2865 states and 4240 transitions. [2019-09-03 20:57:27,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-03 20:57:27,303 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 210 [2019-09-03 20:57:27,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:27,314 INFO L225 Difference]: With dead ends: 2865 [2019-09-03 20:57:27,314 INFO L226 Difference]: Without dead ends: 2862 [2019-09-03 20:57:27,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 415 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=119, Invalid=3187, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 20:57:27,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2019-09-03 20:57:27,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 213. [2019-09-03 20:57:27,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-09-03 20:57:27,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 264 transitions. [2019-09-03 20:57:27,332 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 264 transitions. Word has length 210 [2019-09-03 20:57:27,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:27,333 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 264 transitions. [2019-09-03 20:57:27,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-03 20:57:27,333 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 264 transitions. [2019-09-03 20:57:27,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-03 20:57:27,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:27,335 INFO L399 BasicCegarLoop]: trace histogram [101, 51, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:27,335 INFO L418 AbstractCegarLoop]: === Iteration 86 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:27,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:27,335 INFO L82 PathProgramCache]: Analyzing trace with hash -2073212190, now seen corresponding path program 83 times [2019-09-03 20:57:27,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:27,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:27,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:27,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:27,337 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:28,602 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 7651 proven. 0 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2019-09-03 20:57:28,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:57:28,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2019-09-03 20:57:28,602 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:57:28,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-03 20:57:28,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-03 20:57:28,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:57:28,608 INFO L87 Difference]: Start difference. First operand 213 states and 264 transitions. Second operand 52 states. [2019-09-03 20:57:28,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:28,821 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2019-09-03 20:57:28,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-03 20:57:28,821 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 212 [2019-09-03 20:57:28,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:28,822 INFO L225 Difference]: With dead ends: 206 [2019-09-03 20:57:28,822 INFO L226 Difference]: Without dead ends: 0 [2019-09-03 20:57:28,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:57:28,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-03 20:57:28,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-03 20:57:28,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-03 20:57:28,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-03 20:57:28,826 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 212 [2019-09-03 20:57:28,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:28,827 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-03 20:57:28,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-03 20:57:28,827 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-03 20:57:28,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-03 20:57:28,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 08:57:28 BoogieIcfgContainer [2019-09-03 20:57:28,834 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 20:57:28,836 INFO L168 Benchmark]: Toolchain (without parser) took 266177.47 ms. Allocated memory was 132.1 MB in the beginning and 563.1 MB in the end (delta: 431.0 MB). Free memory was 87.7 MB in the beginning and 475.2 MB in the end (delta: -387.6 MB). Peak memory consumption was 43.4 MB. Max. memory is 7.1 GB. [2019-09-03 20:57:28,841 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 132.1 MB. Free memory was 106.3 MB in the beginning and 106.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-03 20:57:28,844 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.80 ms. Allocated memory is still 132.1 MB. Free memory was 87.5 MB in the beginning and 78.4 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2019-09-03 20:57:28,845 INFO L168 Benchmark]: Boogie Preprocessor took 134.53 ms. Allocated memory was 132.1 MB in the beginning and 199.8 MB in the end (delta: 67.6 MB). Free memory was 78.4 MB in the beginning and 176.6 MB in the end (delta: -98.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. [2019-09-03 20:57:28,846 INFO L168 Benchmark]: RCFGBuilder took 213.48 ms. Allocated memory is still 199.8 MB. Free memory was 176.6 MB in the beginning and 165.1 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 7.1 GB. [2019-09-03 20:57:28,846 INFO L168 Benchmark]: TraceAbstraction took 265554.15 ms. Allocated memory was 199.8 MB in the beginning and 563.1 MB in the end (delta: 363.3 MB). Free memory was 165.1 MB in the beginning and 475.2 MB in the end (delta: -310.1 MB). Peak memory consumption was 53.2 MB. Max. memory is 7.1 GB. [2019-09-03 20:57:28,847 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 132.1 MB. Free memory was 106.3 MB in the beginning and 106.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 270.80 ms. Allocated memory is still 132.1 MB. Free memory was 87.5 MB in the beginning and 78.4 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 134.53 ms. Allocated memory was 132.1 MB in the beginning and 199.8 MB in the end (delta: 67.6 MB). Free memory was 78.4 MB in the beginning and 176.6 MB in the end (delta: -98.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 213.48 ms. Allocated memory is still 199.8 MB. Free memory was 176.6 MB in the beginning and 165.1 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 265554.15 ms. Allocated memory was 199.8 MB in the beginning and 563.1 MB in the end (delta: 363.3 MB). Free memory was 165.1 MB in the beginning and 475.2 MB in the end (delta: -310.1 MB). Peak memory consumption was 53.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. SAFE Result, 265.4s OverallTime, 86 OverallIterations, 101 TraceHistogramMax, 28.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1003 SDtfs, 3333 SDslu, 23116 SDs, 0 SdLazy, 15779 SolverSat, 5424 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23762 GetRequests, 16316 SyntacticMatches, 2130 SemanticMatches, 5316 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88588 ImplicationChecksByTransitivity, 222.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=213occurred in iteration=85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 0.36363636363636365 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 86 MinimizatonAttempts, 2698 StatesRemovedByMinimization, 48 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 4.1s SatisfiabilityAnalysisTime, 228.5s InterpolantComputationTime, 19824 NumberOfCodeBlocks, 19022 NumberOfCodeBlocksAsserted, 1250 NumberOfCheckSat, 29364 ConstructedInterpolants, 0 QuantifiedInterpolants, 11411364 SizeOfPredicates, 77 NumberOfNonLiveVariables, 21524 ConjunctsInSsa, 3404 ConjunctsInUnsatCore, 250 InterpolantComputations, 3 PerfectInterpolantSequences, 275404/950081 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...