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-acceleration/functions_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 20:37:17,094 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:37:17,096 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:37:17,108 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:37:17,109 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:37:17,110 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:37:17,111 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:37:17,113 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:37:17,115 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:37:17,116 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:37:17,117 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:37:17,118 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:37:17,119 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:37:17,120 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:37:17,121 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:37:17,122 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:37:17,123 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:37:17,124 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:37:17,126 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:37:17,128 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:37:17,129 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:37:17,131 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:37:17,132 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:37:17,132 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:37:17,135 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:37:17,135 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:37:17,135 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:37:17,136 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:37:17,137 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:37:17,138 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:37:17,138 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:37:17,139 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:37:17,140 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:37:17,141 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:37:17,142 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:37:17,142 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:37:17,143 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:37:17,143 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:37:17,143 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:37:17,146 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:37:17,147 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:37:17,148 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:37:17,174 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:37:17,175 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:37:17,175 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 20:37:17,177 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 20:37:17,177 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 20:37:17,178 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 20:37:17,178 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 20:37:17,178 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 20:37:17,178 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 20:37:17,178 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 20:37:17,179 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:37:17,179 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:37:17,179 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:37:17,180 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:37:17,180 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:37:17,180 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:37:17,180 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:37:17,180 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:37:17,181 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:37:17,181 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:37:17,181 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:37:17,182 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 20:37:17,183 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:37:17,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:37:17,183 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:37:17,184 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:37:17,184 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 20:37:17,184 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:37:17,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:37:17,184 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 20:37:17,237 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:37:17,249 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:37:17,252 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:37:17,254 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:37:17,254 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:37:17,255 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/functions_1-2.c [2019-09-03 20:37:17,317 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02e857e25/39c3b8aa142543dc95e7c04cfaefa8e7/FLAGe9bad6a7f [2019-09-03 20:37:17,711 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:37:17,711 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/functions_1-2.c [2019-09-03 20:37:17,717 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02e857e25/39c3b8aa142543dc95e7c04cfaefa8e7/FLAGe9bad6a7f [2019-09-03 20:37:18,101 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02e857e25/39c3b8aa142543dc95e7c04cfaefa8e7 [2019-09-03 20:37:18,117 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:37:18,119 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:37:18,120 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:37:18,120 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:37:18,124 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:37:18,125 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:37:18" (1/1) ... [2019-09-03 20:37:18,129 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25d452d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:18, skipping insertion in model container [2019-09-03 20:37:18,129 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:37:18" (1/1) ... [2019-09-03 20:37:18,137 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:37:18,157 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:37:18,370 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:37:18,377 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:37:18,390 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:37:18,401 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:37:18,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:18 WrapperNode [2019-09-03 20:37:18,402 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:37:18,403 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:37:18,403 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:37:18,403 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:37:18,507 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:18" (1/1) ... [2019-09-03 20:37:18,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:18" (1/1) ... [2019-09-03 20:37:18,511 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:18" (1/1) ... [2019-09-03 20:37:18,511 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:18" (1/1) ... [2019-09-03 20:37:18,514 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:18" (1/1) ... [2019-09-03 20:37:18,520 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:18" (1/1) ... [2019-09-03 20:37:18,521 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:18" (1/1) ... [2019-09-03 20:37:18,524 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:37:18,524 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:37:18,524 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:37:18,525 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:37:18,525 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:18" (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:37:18,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:37:18,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:37:18,582 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 20:37:18,582 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-09-03 20:37:18,582 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:37:18,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:37:18,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:37:18,582 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-09-03 20:37:18,582 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:37:18,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:37:18,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:37:18,742 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:37:18,742 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-03 20:37:18,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:37:18 BoogieIcfgContainer [2019-09-03 20:37:18,744 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:37:18,745 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:37:18,745 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:37:18,748 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:37:18,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:37:18" (1/3) ... [2019-09-03 20:37:18,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25da60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:37:18, skipping insertion in model container [2019-09-03 20:37:18,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:18" (2/3) ... [2019-09-03 20:37:18,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25da60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:37:18, skipping insertion in model container [2019-09-03 20:37:18,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:37:18" (3/3) ... [2019-09-03 20:37:18,753 INFO L109 eAbstractionObserver]: Analyzing ICFG functions_1-2.c [2019-09-03 20:37:18,763 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:37:18,772 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 20:37:18,790 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 20:37:18,831 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:37:18,831 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 20:37:18,831 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:37:18,832 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:37:18,832 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:37:18,832 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:37:18,832 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:37:18,833 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:37:18,854 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-09-03 20:37:18,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:37:18,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:18,869 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:18,871 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:18,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:18,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1238725826, now seen corresponding path program 1 times [2019-09-03 20:37:18,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:18,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:18,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:18,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:18,943 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:18,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:18,998 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:37:19,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:37:19,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 20:37:19,001 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:37:19,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 20:37:19,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 20:37:19,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:37:19,019 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2019-09-03 20:37:19,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:19,034 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-09-03 20:37:19,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 20:37:19,036 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-03 20:37:19,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:19,043 INFO L225 Difference]: With dead ends: 22 [2019-09-03 20:37:19,044 INFO L226 Difference]: Without dead ends: 16 [2019-09-03 20:37:19,046 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:37:19,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-03 20:37:19,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-03 20:37:19,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-03 20:37:19,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-09-03 20:37:19,083 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 10 [2019-09-03 20:37:19,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:19,084 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-09-03 20:37:19,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 20:37:19,084 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-09-03 20:37:19,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:37:19,085 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:19,086 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:19,086 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:19,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:19,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1244266952, now seen corresponding path program 1 times [2019-09-03 20:37:19,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:19,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:19,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:19,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:19,089 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:19,205 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:37:19,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:37:19,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:37:19,206 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:37:19,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:37:19,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:37:19,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:37:19,210 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 3 states. [2019-09-03 20:37:19,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:19,228 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-09-03 20:37:19,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:37:19,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-03 20:37:19,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:19,231 INFO L225 Difference]: With dead ends: 19 [2019-09-03 20:37:19,231 INFO L226 Difference]: Without dead ends: 19 [2019-09-03 20:37:19,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:37:19,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-03 20:37:19,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-09-03 20:37:19,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-03 20:37:19,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-09-03 20:37:19,241 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 10 [2019-09-03 20:37:19,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:19,242 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-09-03 20:37:19,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:37:19,242 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-09-03 20:37:19,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 20:37:19,243 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:19,243 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:19,243 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:19,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:19,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1831198934, now seen corresponding path program 1 times [2019-09-03 20:37:19,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:19,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:19,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:19,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:19,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:19,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:19,415 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:37:19,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:19,416 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:19,417 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2019-09-03 20:37:19,419 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [6], [13], [15], [17], [23], [26], [28], [34], [35], [36], [38], [39], [40] [2019-09-03 20:37:19,459 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:37:19,460 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:37:19,536 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-03 20:37:19,915 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:37:19,918 INFO L272 AbstractInterpreter]: Visited 16 different actions 82 times. Merged at 4 different actions 24 times. Widened at 1 different actions 4 times. Performed 108 root evaluator evaluations with a maximum evaluation depth of 12. Performed 108 inverse root evaluator evaluations with a maximum inverse evaluation depth of 12. Found 1 fixpoints after 1 different actions. Largest state had 3 variables. [2019-09-03 20:37:19,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:19,924 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:37:19,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:19,925 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:19,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:19,950 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:37:19,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:19,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 20:37:19,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:20,097 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:37:20,097 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:20,296 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:37:20,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:20,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-09-03 20:37:20,304 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:20,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:37:20,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:37:20,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:37:20,308 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 7 states. [2019-09-03 20:37:20,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:20,421 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-09-03 20:37:20,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:37:20,422 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-09-03 20:37:20,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:20,423 INFO L225 Difference]: With dead ends: 22 [2019-09-03 20:37:20,423 INFO L226 Difference]: Without dead ends: 22 [2019-09-03 20:37:20,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:37:20,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-03 20:37:20,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2019-09-03 20:37:20,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-03 20:37:20,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-09-03 20:37:20,434 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 16 [2019-09-03 20:37:20,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:20,434 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-09-03 20:37:20,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:37:20,435 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-09-03 20:37:20,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-03 20:37:20,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:20,439 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:20,439 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:20,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:20,440 INFO L82 PathProgramCache]: Analyzing trace with hash 329045236, now seen corresponding path program 2 times [2019-09-03 20:37:20,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:20,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:20,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:20,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:20,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:20,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:20,638 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-03 20:37:20,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:20,638 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:20,639 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:20,639 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:37:20,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:20,639 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:37:20,657 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:37:20,658 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:37:20,681 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 20:37:20,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:20,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 20:37:20,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:20,735 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-03 20:37:20,735 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:20,991 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 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:37:20,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:20,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 16 [2019-09-03 20:37:20,997 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:20,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 20:37:20,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 20:37:20,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-09-03 20:37:20,999 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 9 states. [2019-09-03 20:37:21,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:21,149 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-09-03 20:37:21,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:37:21,150 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-09-03 20:37:21,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:21,152 INFO L225 Difference]: With dead ends: 25 [2019-09-03 20:37:21,153 INFO L226 Difference]: Without dead ends: 25 [2019-09-03 20:37:21,153 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2019-09-03 20:37:21,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-03 20:37:21,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2019-09-03 20:37:21,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-03 20:37:21,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-09-03 20:37:21,160 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 22 [2019-09-03 20:37:21,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:21,162 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-09-03 20:37:21,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 20:37:21,163 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-09-03 20:37:21,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 20:37:21,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:21,165 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:21,165 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:21,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:21,165 INFO L82 PathProgramCache]: Analyzing trace with hash 755481234, now seen corresponding path program 3 times [2019-09-03 20:37:21,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:21,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:21,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:21,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:21,169 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:21,426 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-03 20:37:21,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:21,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:21,427 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:21,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:37:21,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:21,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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:37:21,443 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:37:21,443 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:37:21,464 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:37:21,465 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:21,466 WARN L254 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 20:37:21,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:21,525 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-03 20:37:21,525 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:21,912 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-03 20:37:21,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:21,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 12] total 21 [2019-09-03 20:37:21,916 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:21,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 20:37:21,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 20:37:21,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2019-09-03 20:37:21,918 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 11 states. [2019-09-03 20:37:22,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:22,114 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2019-09-03 20:37:22,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 20:37:22,117 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2019-09-03 20:37:22,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:22,118 INFO L225 Difference]: With dead ends: 28 [2019-09-03 20:37:22,118 INFO L226 Difference]: Without dead ends: 28 [2019-09-03 20:37:22,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 41 SyntacticMatches, 8 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2019-09-03 20:37:22,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-03 20:37:22,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-09-03 20:37:22,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-03 20:37:22,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2019-09-03 20:37:22,131 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 28 [2019-09-03 20:37:22,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:22,132 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-09-03 20:37:22,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 20:37:22,135 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2019-09-03 20:37:22,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-03 20:37:22,136 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:22,136 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:22,137 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:22,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:22,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1475645008, now seen corresponding path program 4 times [2019-09-03 20:37:22,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:22,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:22,141 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:22,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:22,141 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:22,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:22,344 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-03 20:37:22,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:22,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:22,345 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:22,345 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:37:22,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:22,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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:37:22,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:22,361 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:37:22,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:22,382 WARN L254 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-03 20:37:22,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:22,441 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-03 20:37:22,442 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:22,963 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-03 20:37:22,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:22,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 15] total 26 [2019-09-03 20:37:22,969 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:22,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 20:37:22,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 20:37:22,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=546, Unknown=0, NotChecked=0, Total=650 [2019-09-03 20:37:22,971 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 13 states. [2019-09-03 20:37:23,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:23,247 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2019-09-03 20:37:23,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 20:37:23,247 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2019-09-03 20:37:23,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:23,249 INFO L225 Difference]: With dead ends: 31 [2019-09-03 20:37:23,249 INFO L226 Difference]: Without dead ends: 31 [2019-09-03 20:37:23,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 49 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2019-09-03 20:37:23,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-03 20:37:23,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2019-09-03 20:37:23,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-03 20:37:23,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-09-03 20:37:23,255 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 34 [2019-09-03 20:37:23,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:23,256 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-09-03 20:37:23,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 20:37:23,256 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-09-03 20:37:23,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-03 20:37:23,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:23,257 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:23,258 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:23,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:23,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1545919054, now seen corresponding path program 5 times [2019-09-03 20:37:23,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:23,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:23,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:23,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:23,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:23,456 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-03 20:37:23,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:23,456 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:23,457 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:23,457 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:37:23,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:23,457 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:37:23,485 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:37:23,485 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:37:23,545 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-03 20:37:23,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:23,547 WARN L254 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-03 20:37:23,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:23,629 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-03 20:37:23,629 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:24,309 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:37:24,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:24,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 18] total 31 [2019-09-03 20:37:24,314 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:24,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 20:37:24,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 20:37:24,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=793, Unknown=0, NotChecked=0, Total=930 [2019-09-03 20:37:24,319 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 15 states. [2019-09-03 20:37:24,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:24,645 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2019-09-03 20:37:24,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 20:37:24,645 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2019-09-03 20:37:24,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:24,647 INFO L225 Difference]: With dead ends: 34 [2019-09-03 20:37:24,647 INFO L226 Difference]: Without dead ends: 34 [2019-09-03 20:37:24,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 57 SyntacticMatches, 12 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=217, Invalid=1043, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 20:37:24,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-03 20:37:24,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-09-03 20:37:24,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-03 20:37:24,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-09-03 20:37:24,653 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 40 [2019-09-03 20:37:24,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:24,654 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-09-03 20:37:24,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 20:37:24,654 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2019-09-03 20:37:24,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-03 20:37:24,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:24,655 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:24,655 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:24,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:24,656 INFO L82 PathProgramCache]: Analyzing trace with hash 128504940, now seen corresponding path program 6 times [2019-09-03 20:37:24,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:24,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:24,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:24,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:24,657 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:24,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:25,107 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-03 20:37:25,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:25,108 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:25,108 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:25,108 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:37:25,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:25,108 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:37:25,119 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:37:25,119 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:37:25,149 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:37:25,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:25,151 WARN L254 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-03 20:37:25,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:25,214 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-03 20:37:25,214 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:26,002 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-03 20:37:26,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:26,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 21] total 36 [2019-09-03 20:37:26,006 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:26,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 20:37:26,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 20:37:26,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1086, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 20:37:26,011 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 17 states. [2019-09-03 20:37:26,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:26,464 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2019-09-03 20:37:26,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 20:37:26,464 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2019-09-03 20:37:26,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:26,466 INFO L225 Difference]: With dead ends: 37 [2019-09-03 20:37:26,466 INFO L226 Difference]: Without dead ends: 37 [2019-09-03 20:37:26,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 65 SyntacticMatches, 14 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=282, Invalid=1440, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 20:37:26,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-03 20:37:26,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2019-09-03 20:37:26,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-03 20:37:26,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2019-09-03 20:37:26,473 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 46 [2019-09-03 20:37:26,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:26,473 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2019-09-03 20:37:26,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 20:37:26,473 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2019-09-03 20:37:26,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-03 20:37:26,474 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:26,475 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:26,475 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:26,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:26,475 INFO L82 PathProgramCache]: Analyzing trace with hash -842776566, now seen corresponding path program 7 times [2019-09-03 20:37:26,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:26,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:26,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:26,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:26,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:26,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:26,774 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-09-03 20:37:26,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:26,774 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:26,775 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:26,775 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:37:26,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:26,775 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:26,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:26,790 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:37:26,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:26,816 WARN L254 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 73 conjunts are in the unsatisfiable core [2019-09-03 20:37:26,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:26,923 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-09-03 20:37:26,924 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:27,889 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-03 20:37:27,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:27,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 24] total 41 [2019-09-03 20:37:27,895 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:27,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 20:37:27,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 20:37:27,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1425, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 20:37:27,897 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 19 states. [2019-09-03 20:37:28,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:28,398 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2019-09-03 20:37:28,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-03 20:37:28,399 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 52 [2019-09-03 20:37:28,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:28,400 INFO L225 Difference]: With dead ends: 40 [2019-09-03 20:37:28,401 INFO L226 Difference]: Without dead ends: 40 [2019-09-03 20:37:28,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 73 SyntacticMatches, 16 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=355, Invalid=1901, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 20:37:28,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-03 20:37:28,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-09-03 20:37:28,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-03 20:37:28,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2019-09-03 20:37:28,408 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 52 [2019-09-03 20:37:28,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:28,409 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-09-03 20:37:28,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 20:37:28,409 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2019-09-03 20:37:28,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-03 20:37:28,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:28,410 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:28,410 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:28,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:28,411 INFO L82 PathProgramCache]: Analyzing trace with hash 880540968, now seen corresponding path program 8 times [2019-09-03 20:37:28,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:28,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:28,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:28,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:28,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:28,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:28,719 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:37:28,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:28,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:28,719 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:28,720 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:28,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:28,720 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:37:28,735 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:37:28,735 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:38:22,623 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-03 20:38:22,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:38:22,799 WARN L254 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 83 conjunts are in the unsatisfiable core [2019-09-03 20:38:22,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:38:22,891 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 20:38:22,891 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:38:24,127 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-03 20:38:24,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:38:24,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 27] total 46 [2019-09-03 20:38:24,138 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:38:24,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 20:38:24,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 20:38:24,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=1810, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 20:38:24,140 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 21 states. [2019-09-03 20:38:24,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:38:24,778 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2019-09-03 20:38:24,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 20:38:24,778 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 58 [2019-09-03 20:38:24,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:38:24,780 INFO L225 Difference]: With dead ends: 43 [2019-09-03 20:38:24,780 INFO L226 Difference]: Without dead ends: 43 [2019-09-03 20:38:24,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 81 SyntacticMatches, 18 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=436, Invalid=2426, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 20:38:24,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-03 20:38:24,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2019-09-03 20:38:24,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-03 20:38:24,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2019-09-03 20:38:24,787 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 58 [2019-09-03 20:38:24,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:38:24,787 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2019-09-03 20:38:24,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 20:38:24,788 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2019-09-03 20:38:24,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-03 20:38:24,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:38:24,789 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:38:24,789 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:38:24,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:38:24,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1565725754, now seen corresponding path program 9 times [2019-09-03 20:38:24,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:38:24,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:24,791 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:38:24,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:24,791 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:38:24,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:25,231 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-09-03 20:38:25,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:25,232 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:38:25,232 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:38:25,232 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:38:25,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:25,232 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:38:25,255 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:38:25,256 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:38:25,280 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:38:25,281 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:38:25,282 WARN L254 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 93 conjunts are in the unsatisfiable core [2019-09-03 20:38:25,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:38:25,384 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-09-03 20:38:25,384 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:38:26,884 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-03 20:38:26,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:38:26,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 30] total 51 [2019-09-03 20:38:26,889 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:38:26,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 20:38:26,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 20:38:26,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=2241, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 20:38:26,892 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 23 states. [2019-09-03 20:38:27,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:38:27,635 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2019-09-03 20:38:27,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-03 20:38:27,635 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 64 [2019-09-03 20:38:27,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:38:27,637 INFO L225 Difference]: With dead ends: 46 [2019-09-03 20:38:27,637 INFO L226 Difference]: Without dead ends: 46 [2019-09-03 20:38:27,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 89 SyntacticMatches, 20 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=525, Invalid=3015, Unknown=0, NotChecked=0, Total=3540 [2019-09-03 20:38:27,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-03 20:38:27,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2019-09-03 20:38:27,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-03 20:38:27,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2019-09-03 20:38:27,644 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 64 [2019-09-03 20:38:27,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:38:27,644 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2019-09-03 20:38:27,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 20:38:27,644 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2019-09-03 20:38:27,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-03 20:38:27,646 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:38:27,646 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:38:27,646 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:38:27,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:38:27,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1577839588, now seen corresponding path program 10 times [2019-09-03 20:38:27,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:38:27,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:27,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:38:27,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:27,648 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:38:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:28,071 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-09-03 20:38:28,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:28,071 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:38:28,071 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:38:28,072 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:38:28,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:28,072 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:38:28,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:38:28,082 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:38:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:28,119 WARN L254 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 103 conjunts are in the unsatisfiable core [2019-09-03 20:38:28,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:38:28,287 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-09-03 20:38:28,288 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:38:30,336 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-03 20:38:30,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:38:30,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 33] total 56 [2019-09-03 20:38:30,340 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:38:30,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 20:38:30,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 20:38:30,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=2718, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 20:38:30,342 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 25 states. [2019-09-03 20:38:31,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:38:31,208 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2019-09-03 20:38:31,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 20:38:31,209 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 70 [2019-09-03 20:38:31,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:38:31,211 INFO L225 Difference]: With dead ends: 49 [2019-09-03 20:38:31,211 INFO L226 Difference]: Without dead ends: 49 [2019-09-03 20:38:31,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 97 SyntacticMatches, 22 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=622, Invalid=3668, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 20:38:31,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-03 20:38:31,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-09-03 20:38:31,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-03 20:38:31,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2019-09-03 20:38:31,218 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 70 [2019-09-03 20:38:31,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:38:31,219 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2019-09-03 20:38:31,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 20:38:31,219 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2019-09-03 20:38:31,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-03 20:38:31,221 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:38:31,221 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:38:31,221 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:38:31,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:38:31,222 INFO L82 PathProgramCache]: Analyzing trace with hash 153476482, now seen corresponding path program 11 times [2019-09-03 20:38:31,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:38:31,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:31,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:38:31,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:38:31,223 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:38:31,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:38:31,693 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2019-09-03 20:38:31,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:31,694 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:38:31,694 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:38:31,694 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:38:31,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:38:31,694 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:38:31,709 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:38:31,710 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:39:18,990 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-03 20:39:18,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:39:20,037 WARN L254 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 113 conjunts are in the unsatisfiable core [2019-09-03 20:39:20,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:39:20,162 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2019-09-03 20:39:20,162 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:39:22,324 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 286 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-09-03 20:39:22,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:39:22,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 36] total 61 [2019-09-03 20:39:22,335 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:39:22,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 20:39:22,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 20:39:22,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=3241, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 20:39:22,337 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand 27 states. [2019-09-03 20:39:23,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:39:23,454 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2019-09-03 20:39:23,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 20:39:23,454 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 76 [2019-09-03 20:39:23,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:39:23,455 INFO L225 Difference]: With dead ends: 52 [2019-09-03 20:39:23,455 INFO L226 Difference]: Without dead ends: 52 [2019-09-03 20:39:23,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 105 SyntacticMatches, 24 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=727, Invalid=4385, Unknown=0, NotChecked=0, Total=5112 [2019-09-03 20:39:23,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-03 20:39:23,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2019-09-03 20:39:23,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-03 20:39:23,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2019-09-03 20:39:23,471 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 76 [2019-09-03 20:39:23,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:39:23,471 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2019-09-03 20:39:23,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 20:39:23,471 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2019-09-03 20:39:23,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-03 20:39:23,474 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:39:23,474 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:39:23,475 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:39:23,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:39:23,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1587568480, now seen corresponding path program 12 times [2019-09-03 20:39:23,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:39:23,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:23,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:39:23,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:23,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:39:23,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:39:24,061 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2019-09-03 20:39:24,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:24,061 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:39:24,061 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:39:24,061 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:39:24,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:24,062 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:39:24,079 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:39:24,079 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:39:24,108 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:39:24,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:39:24,112 WARN L254 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 123 conjunts are in the unsatisfiable core [2019-09-03 20:39:24,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:39:24,213 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2019-09-03 20:39:24,213 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:39:26,572 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-03 20:39:26,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:39:26,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 39] total 66 [2019-09-03 20:39:26,575 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:39:26,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 20:39:26,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 20:39:26,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=480, Invalid=3810, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 20:39:26,578 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand 29 states. [2019-09-03 20:39:27,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:39:27,742 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2019-09-03 20:39:27,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-03 20:39:27,743 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 82 [2019-09-03 20:39:27,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:39:27,744 INFO L225 Difference]: With dead ends: 55 [2019-09-03 20:39:27,745 INFO L226 Difference]: Without dead ends: 55 [2019-09-03 20:39:27,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 113 SyntacticMatches, 26 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=840, Invalid=5166, Unknown=0, NotChecked=0, Total=6006 [2019-09-03 20:39:27,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-03 20:39:27,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2019-09-03 20:39:27,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-03 20:39:27,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2019-09-03 20:39:27,751 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 82 [2019-09-03 20:39:27,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:39:27,752 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2019-09-03 20:39:27,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 20:39:27,752 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2019-09-03 20:39:27,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-03 20:39:27,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:39:27,754 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:39:27,754 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:39:27,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:39:27,754 INFO L82 PathProgramCache]: Analyzing trace with hash -50981570, now seen corresponding path program 13 times [2019-09-03 20:39:27,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:39:27,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:27,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:39:27,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:27,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:39:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:39:28,290 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2019-09-03 20:39:28,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:28,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:39:28,291 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:39:28,291 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:39:28,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:28,291 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:39:28,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:39:28,314 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:39:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:39:28,346 WARN L254 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 133 conjunts are in the unsatisfiable core [2019-09-03 20:39:28,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:39:28,446 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2019-09-03 20:39:28,447 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:39:31,669 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 0 proven. 403 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-09-03 20:39:31,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:39:31,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 42] total 71 [2019-09-03 20:39:31,673 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:39:31,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 20:39:31,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 20:39:31,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=545, Invalid=4425, Unknown=0, NotChecked=0, Total=4970 [2019-09-03 20:39:31,676 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand 31 states. [2019-09-03 20:39:33,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:39:33,117 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2019-09-03 20:39:33,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-03 20:39:33,118 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 88 [2019-09-03 20:39:33,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:39:33,119 INFO L225 Difference]: With dead ends: 58 [2019-09-03 20:39:33,119 INFO L226 Difference]: Without dead ends: 58 [2019-09-03 20:39:33,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 121 SyntacticMatches, 28 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=961, Invalid=6011, Unknown=0, NotChecked=0, Total=6972 [2019-09-03 20:39:33,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-03 20:39:33,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2019-09-03 20:39:33,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-03 20:39:33,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 69 transitions. [2019-09-03 20:39:33,127 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 69 transitions. Word has length 88 [2019-09-03 20:39:33,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:39:33,127 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 69 transitions. [2019-09-03 20:39:33,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 20:39:33,128 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2019-09-03 20:39:33,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-03 20:39:33,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:39:33,129 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:39:33,129 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:39:33,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:39:33,130 INFO L82 PathProgramCache]: Analyzing trace with hash -922870948, now seen corresponding path program 14 times [2019-09-03 20:39:33,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:39:33,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:33,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:39:33,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:33,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:39:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:39:33,714 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2019-09-03 20:39:33,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:33,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:39:33,715 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:39:33,715 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:39:33,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:33,715 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:39:33,730 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:39:33,731 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:41:56,178 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-03 20:41:56,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:41:57,127 WARN L254 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 143 conjunts are in the unsatisfiable core [2019-09-03 20:41:57,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:41:57,218 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2019-09-03 20:41:57,218 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:42:00,339 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 0 proven. 469 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-03 20:42:00,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:42:00,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 45] total 76 [2019-09-03 20:42:00,347 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:42:00,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 20:42:00,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 20:42:00,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=614, Invalid=5086, Unknown=0, NotChecked=0, Total=5700 [2019-09-03 20:42:00,350 INFO L87 Difference]: Start difference. First operand 56 states and 69 transitions. Second operand 33 states. [2019-09-03 20:42:01,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:42:01,992 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2019-09-03 20:42:01,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-03 20:42:01,993 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 94 [2019-09-03 20:42:01,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:42:01,994 INFO L225 Difference]: With dead ends: 61 [2019-09-03 20:42:01,994 INFO L226 Difference]: Without dead ends: 61 [2019-09-03 20:42:01,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 129 SyntacticMatches, 30 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1090, Invalid=6920, Unknown=0, NotChecked=0, Total=8010 [2019-09-03 20:42:01,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-03 20:42:02,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-09-03 20:42:02,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-03 20:42:02,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2019-09-03 20:42:02,001 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 94 [2019-09-03 20:42:02,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:42:02,001 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2019-09-03 20:42:02,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 20:42:02,002 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2019-09-03 20:42:02,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-03 20:42:02,003 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:42:02,003 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:42:02,003 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:42:02,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:42:02,003 INFO L82 PathProgramCache]: Analyzing trace with hash 124031738, now seen corresponding path program 15 times [2019-09-03 20:42:02,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:42:02,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:02,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:42:02,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:02,005 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:42:02,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:42:02,649 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2019-09-03 20:42:02,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:02,649 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:42:02,649 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:42:02,650 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:42:02,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:02,650 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:42:02,661 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:42:02,661 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:42:02,694 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:42:02,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:42:02,697 WARN L254 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 153 conjunts are in the unsatisfiable core [2019-09-03 20:42:02,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:42:02,782 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2019-09-03 20:42:02,782 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:42:06,235 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 0 proven. 540 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-09-03 20:42:06,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:42:06,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 48] total 81 [2019-09-03 20:42:06,245 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:42:06,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-03 20:42:06,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-03 20:42:06,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=687, Invalid=5793, Unknown=0, NotChecked=0, Total=6480 [2019-09-03 20:42:06,246 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. Second operand 35 states. [2019-09-03 20:42:07,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:42:07,937 INFO L93 Difference]: Finished difference Result 64 states and 80 transitions. [2019-09-03 20:42:07,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-03 20:42:07,937 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 100 [2019-09-03 20:42:07,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:42:07,938 INFO L225 Difference]: With dead ends: 64 [2019-09-03 20:42:07,938 INFO L226 Difference]: Without dead ends: 64 [2019-09-03 20:42:07,940 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 137 SyntacticMatches, 32 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 919 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1227, Invalid=7893, Unknown=0, NotChecked=0, Total=9120 [2019-09-03 20:42:07,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-03 20:42:07,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2019-09-03 20:42:07,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-03 20:42:07,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 77 transitions. [2019-09-03 20:42:07,945 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 77 transitions. Word has length 100 [2019-09-03 20:42:07,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:42:07,946 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 77 transitions. [2019-09-03 20:42:07,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-03 20:42:07,946 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 77 transitions. [2019-09-03 20:42:07,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-03 20:42:07,947 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:42:07,947 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:42:07,947 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:42:07,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:42:07,948 INFO L82 PathProgramCache]: Analyzing trace with hash 216947736, now seen corresponding path program 16 times [2019-09-03 20:42:07,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:42:07,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:07,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:42:07,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:07,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:42:07,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:42:08,760 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2019-09-03 20:42:08,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:08,761 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:42:08,761 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:42:08,761 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:42:08,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:08,761 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:42:08,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:42:08,772 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:42:08,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:42:08,816 WARN L254 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 163 conjunts are in the unsatisfiable core [2019-09-03 20:42:08,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:42:08,917 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2019-09-03 20:42:08,917 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:42:12,919 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 0 proven. 616 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-03 20:42:12,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:42:12,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 51] total 86 [2019-09-03 20:42:12,923 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:42:12,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 20:42:12,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 20:42:12,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=764, Invalid=6546, Unknown=0, NotChecked=0, Total=7310 [2019-09-03 20:42:12,925 INFO L87 Difference]: Start difference. First operand 62 states and 77 transitions. Second operand 37 states. [2019-09-03 20:42:14,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:42:14,815 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2019-09-03 20:42:14,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-03 20:42:14,820 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 106 [2019-09-03 20:42:14,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:42:14,821 INFO L225 Difference]: With dead ends: 67 [2019-09-03 20:42:14,821 INFO L226 Difference]: Without dead ends: 67 [2019-09-03 20:42:14,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 145 SyntacticMatches, 34 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1036 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1372, Invalid=8930, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:42:14,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-03 20:42:14,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2019-09-03 20:42:14,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-03 20:42:14,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 81 transitions. [2019-09-03 20:42:14,832 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 81 transitions. Word has length 106 [2019-09-03 20:42:14,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:42:14,832 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 81 transitions. [2019-09-03 20:42:14,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 20:42:14,832 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 81 transitions. [2019-09-03 20:42:14,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-03 20:42:14,833 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:42:14,834 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:42:14,834 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:42:14,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:42:14,834 INFO L82 PathProgramCache]: Analyzing trace with hash -13085002, now seen corresponding path program 17 times [2019-09-03 20:42:14,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:42:14,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:14,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:42:14,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:42:14,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:42:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:42:15,762 INFO L134 CoverageAnalysis]: Checked inductivity of 833 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-09-03 20:42:15,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:15,762 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:42:15,762 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:42:15,762 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:42:15,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:42:15,763 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:42:15,813 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:42:15,813 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:47:04,590 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-03 20:47:04,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2019-09-03 20:47:14,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:47:14,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-09-03 20:47:14,847 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:47:14,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-03 20:47:14,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-03 20:47:14,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1316, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 20:47:14,848 INFO L87 Difference]: Start difference. First operand 65 states and 81 transitions. Second operand 38 states. [2019-09-03 20:47:16,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:47:16,664 INFO L93 Difference]: Finished difference Result 70 states and 88 transitions. [2019-09-03 20:47:16,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-03 20:47:16,664 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 112 [2019-09-03 20:47:16,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:47:16,666 INFO L225 Difference]: With dead ends: 70 [2019-09-03 20:47:16,666 INFO L226 Difference]: Without dead ends: 70 [2019-09-03 20:47:16,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=175, Invalid=2795, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 20:47:16,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-03 20:47:16,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2019-09-03 20:47:16,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-03 20:47:16,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 85 transitions. [2019-09-03 20:47:16,672 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 85 transitions. Word has length 112 [2019-09-03 20:47:16,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:47:16,672 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 85 transitions. [2019-09-03 20:47:16,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-03 20:47:16,673 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 85 transitions. [2019-09-03 20:47:16,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-03 20:47:16,674 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:47:16,674 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:47:16,674 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:47:16,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:47:16,674 INFO L82 PathProgramCache]: Analyzing trace with hash -759733548, now seen corresponding path program 18 times [2019-09-03 20:47:16,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:47:16,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:47:16,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:47:16,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:47:16,676 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:47:16,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:47:17,673 INFO L134 CoverageAnalysis]: Checked inductivity of 936 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2019-09-03 20:47:17,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:47:17,674 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:47:17,674 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:47:17,674 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:47:17,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:47:17,675 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:47:17,693 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:47:17,693 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:47:17,736 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:47:17,736 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:47:17,740 WARN L254 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 183 conjunts are in the unsatisfiable core [2019-09-03 20:47:17,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:47:17,889 INFO L134 CoverageAnalysis]: Checked inductivity of 936 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2019-09-03 20:47:17,889 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:47:22,633 INFO L134 CoverageAnalysis]: Checked inductivity of 936 backedges. 0 proven. 783 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-09-03 20:47:22,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:47:22,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 57] total 96 [2019-09-03 20:47:22,643 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:47:22,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-03 20:47:22,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-03 20:47:22,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=930, Invalid=8190, Unknown=0, NotChecked=0, Total=9120 [2019-09-03 20:47:22,644 INFO L87 Difference]: Start difference. First operand 68 states and 85 transitions. Second operand 41 states. [2019-09-03 20:47:25,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:47:25,012 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2019-09-03 20:47:25,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-03 20:47:25,013 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 118 [2019-09-03 20:47:25,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:47:25,013 INFO L225 Difference]: With dead ends: 73 [2019-09-03 20:47:25,014 INFO L226 Difference]: Without dead ends: 73 [2019-09-03 20:47:25,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 161 SyntacticMatches, 38 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1291 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1686, Invalid=11196, Unknown=0, NotChecked=0, Total=12882 [2019-09-03 20:47:25,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-09-03 20:47:25,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2019-09-03 20:47:25,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-03 20:47:25,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 89 transitions. [2019-09-03 20:47:25,018 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 89 transitions. Word has length 118 [2019-09-03 20:47:25,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:47:25,019 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 89 transitions. [2019-09-03 20:47:25,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-03 20:47:25,019 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2019-09-03 20:47:25,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-03 20:47:25,020 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:47:25,020 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:47:25,020 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:47:25,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:47:25,021 INFO L82 PathProgramCache]: Analyzing trace with hash -927440782, now seen corresponding path program 19 times [2019-09-03 20:47:25,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:47:25,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:47:25,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:47:25,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:47:25,022 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:47:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:47:25,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1045 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2019-09-03 20:47:25,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:47:25,995 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:47:25,995 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:47:25,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:47:25,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:47:25,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 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:47:26,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:47:26,007 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:47:26,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:47:26,051 WARN L254 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 193 conjunts are in the unsatisfiable core [2019-09-03 20:47:26,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:47:26,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1045 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2019-09-03 20:47:26,162 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:47:33,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1045 backedges. 0 proven. 872 refuted. 2 times theorem prover too weak. 171 trivial. 0 not checked. [2019-09-03 20:47:33,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:47:33,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 60] total 101 [2019-09-03 20:47:33,550 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:47:33,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-03 20:47:33,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-03 20:47:33,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1019, Invalid=9080, Unknown=1, NotChecked=0, Total=10100 [2019-09-03 20:47:33,555 INFO L87 Difference]: Start difference. First operand 71 states and 89 transitions. Second operand 43 states. [2019-09-03 20:47:36,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:47:36,213 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2019-09-03 20:47:36,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-03 20:47:36,214 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 124 [2019-09-03 20:47:36,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:47:36,215 INFO L225 Difference]: With dead ends: 76 [2019-09-03 20:47:36,215 INFO L226 Difference]: Without dead ends: 76 [2019-09-03 20:47:36,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 169 SyntacticMatches, 40 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1429 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=1855, Invalid=12424, Unknown=1, NotChecked=0, Total=14280 [2019-09-03 20:47:36,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-03 20:47:36,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2019-09-03 20:47:36,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-09-03 20:47:36,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2019-09-03 20:47:36,220 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 124 [2019-09-03 20:47:36,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:47:36,220 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2019-09-03 20:47:36,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-03 20:47:36,221 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2019-09-03 20:47:36,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-03 20:47:36,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:47:36,222 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:47:36,222 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:47:36,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:47:36,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1835020176, now seen corresponding path program 20 times [2019-09-03 20:47:36,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:47:36,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:47:36,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:47:36,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:47:36,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:47:36,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:47:37,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-09-03 20:47:37,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:47:37,386 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:47:37,387 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:47:37,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:47:37,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:47:37,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 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:47:37,401 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:47:37,401 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:50:27,451 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-03 20:50:27,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:50:28,215 WARN L254 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 203 conjunts are in the unsatisfiable core [2019-09-03 20:50:28,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:50:28,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-09-03 20:50:28,347 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:50:34,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 0 proven. 970 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-09-03 20:50:34,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:50:34,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 63] total 106 [2019-09-03 20:50:34,323 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:50:34,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-03 20:50:34,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-03 20:50:34,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1112, Invalid=10018, Unknown=0, NotChecked=0, Total=11130 [2019-09-03 20:50:34,324 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand 45 states. [2019-09-03 20:50:37,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:50:37,177 INFO L93 Difference]: Finished difference Result 79 states and 100 transitions. [2019-09-03 20:50:37,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-03 20:50:37,181 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 130 [2019-09-03 20:50:37,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:50:37,182 INFO L225 Difference]: With dead ends: 79 [2019-09-03 20:50:37,182 INFO L226 Difference]: Without dead ends: 79 [2019-09-03 20:50:37,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 177 SyntacticMatches, 42 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1574 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=2032, Invalid=13718, Unknown=0, NotChecked=0, Total=15750 [2019-09-03 20:50:37,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-09-03 20:50:37,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2019-09-03 20:50:37,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-03 20:50:37,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 97 transitions. [2019-09-03 20:50:37,188 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 97 transitions. Word has length 130 [2019-09-03 20:50:37,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:50:37,188 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 97 transitions. [2019-09-03 20:50:37,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-03 20:50:37,189 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 97 transitions. [2019-09-03 20:50:37,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-03 20:50:37,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:50:37,190 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:50:37,190 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:50:37,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:50:37,190 INFO L82 PathProgramCache]: Analyzing trace with hash 363573294, now seen corresponding path program 21 times [2019-09-03 20:50:37,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:50:37,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:50:37,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:50:37,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:50:37,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:50:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:50:38,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-09-03 20:50:38,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:50:38,448 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:50:38,448 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:50:38,448 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:50:38,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:50:38,448 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:50:38,466 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:50:38,466 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:50:38,511 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:50:38,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:50:38,515 WARN L254 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 213 conjunts are in the unsatisfiable core [2019-09-03 20:50:38,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:50:38,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-09-03 20:50:38,667 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:50:45,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 0 proven. 1071 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-03 20:50:45,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:50:45,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 66] total 111 [2019-09-03 20:50:45,150 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:50:45,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-03 20:50:45,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-03 20:50:45,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1209, Invalid=11001, Unknown=0, NotChecked=0, Total=12210 [2019-09-03 20:50:45,152 INFO L87 Difference]: Start difference. First operand 77 states and 97 transitions. Second operand 47 states. [2019-09-03 20:50:48,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:50:48,260 INFO L93 Difference]: Finished difference Result 82 states and 104 transitions. [2019-09-03 20:50:48,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-03 20:50:48,260 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 136 [2019-09-03 20:50:48,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:50:48,262 INFO L225 Difference]: With dead ends: 82 [2019-09-03 20:50:48,262 INFO L226 Difference]: Without dead ends: 82 [2019-09-03 20:50:48,264 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 185 SyntacticMatches, 44 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1726 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=2217, Invalid=15075, Unknown=0, NotChecked=0, Total=17292 [2019-09-03 20:50:48,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-03 20:50:48,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2019-09-03 20:50:48,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-03 20:50:48,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 101 transitions. [2019-09-03 20:50:48,268 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 101 transitions. Word has length 136 [2019-09-03 20:50:48,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:50:48,268 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 101 transitions. [2019-09-03 20:50:48,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-03 20:50:48,268 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 101 transitions. [2019-09-03 20:50:48,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-03 20:50:48,271 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:50:48,271 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:50:48,271 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:50:48,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:50:48,272 INFO L82 PathProgramCache]: Analyzing trace with hash -579878324, now seen corresponding path program 22 times [2019-09-03 20:50:48,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:50:48,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:50:48,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:50:48,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:50:48,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:50:48,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:50:49,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1408 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2019-09-03 20:50:49,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:50:49,864 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:50:49,864 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:50:49,864 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:50:49,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:50:49,864 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:50:49,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:50:49,874 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:50:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:50:49,924 WARN L254 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 223 conjunts are in the unsatisfiable core [2019-09-03 20:50:49,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:50:50,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1408 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2019-09-03 20:50:50,052 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:50:57,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1408 backedges. 0 proven. 1177 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-09-03 20:50:57,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:50:57,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 69] total 116 [2019-09-03 20:50:57,274 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:50:57,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-03 20:50:57,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-03 20:50:57,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1310, Invalid=12030, Unknown=0, NotChecked=0, Total=13340 [2019-09-03 20:50:57,276 INFO L87 Difference]: Start difference. First operand 80 states and 101 transitions. Second operand 49 states. [2019-09-03 20:51:00,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:00,674 INFO L93 Difference]: Finished difference Result 85 states and 108 transitions. [2019-09-03 20:51:00,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-03 20:51:00,675 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 142 [2019-09-03 20:51:00,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:00,676 INFO L225 Difference]: With dead ends: 85 [2019-09-03 20:51:00,677 INFO L226 Difference]: Without dead ends: 85 [2019-09-03 20:51:00,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 193 SyntacticMatches, 46 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1885 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=2410, Invalid=16496, Unknown=0, NotChecked=0, Total=18906 [2019-09-03 20:51:00,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-09-03 20:51:00,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2019-09-03 20:51:00,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-03 20:51:00,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 105 transitions. [2019-09-03 20:51:00,682 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 105 transitions. Word has length 142 [2019-09-03 20:51:00,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:00,682 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 105 transitions. [2019-09-03 20:51:00,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-03 20:51:00,683 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 105 transitions. [2019-09-03 20:51:00,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-03 20:51:00,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:00,684 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:00,684 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:00,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:00,684 INFO L82 PathProgramCache]: Analyzing trace with hash 626607594, now seen corresponding path program 23 times [2019-09-03 20:51:00,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:00,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:00,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:00,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:00,686 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:01,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1541 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2019-09-03 20:51:01,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:51:01,978 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:51:01,978 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:51:01,978 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:51:01,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:51:01,978 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:51:01,990 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:51:01,990 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP)