java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-lit/gr2006.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:25:52,226 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:25:52,228 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:25:52,241 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:25:52,241 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:25:52,242 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:25:52,243 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:25:52,245 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:25:52,247 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:25:52,248 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:25:52,249 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:25:52,250 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:25:52,251 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:25:52,252 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:25:52,253 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:25:52,254 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:25:52,255 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:25:52,256 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:25:52,257 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:25:52,260 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:25:52,261 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:25:52,262 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:25:52,264 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:25:52,264 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:25:52,267 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:25:52,267 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:25:52,268 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:25:52,269 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:25:52,269 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:25:52,270 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:25:52,270 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:25:52,271 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:25:52,272 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:25:52,273 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:25:52,274 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:25:52,274 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:25:52,275 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:25:52,275 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:25:52,275 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:25:52,276 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:25:52,277 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:25:52,278 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-20 13:25:52,299 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:25:52,299 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:25:52,300 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:25:52,300 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:25:52,302 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:25:52,302 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:25:52,302 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:25:52,302 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:25:52,303 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:25:52,303 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:25:52,303 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:25:52,304 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:25:52,304 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:25:52,304 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:25:52,305 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:25:52,305 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:25:52,306 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:25:52,306 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:25:52,306 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:25:52,306 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:25:52,307 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:25:52,307 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:25:52,307 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:25:52,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:25:52,308 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:25:52,308 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:25:52,308 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:25:52,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:25:52,309 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:25:52,309 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:25:52,355 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:25:52,370 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:25:52,373 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:25:52,376 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:25:52,376 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:25:52,377 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gr2006.i [2019-09-20 13:25:52,439 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a80757964/74ca6381def549a5bd286ad1354b14e8/FLAGace4aaed4 [2019-09-20 13:25:52,890 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:25:52,890 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gr2006.i [2019-09-20 13:25:52,897 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a80757964/74ca6381def549a5bd286ad1354b14e8/FLAGace4aaed4 [2019-09-20 13:25:53,287 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a80757964/74ca6381def549a5bd286ad1354b14e8 [2019-09-20 13:25:53,296 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:25:53,298 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:25:53,299 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:25:53,299 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:25:53,303 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:25:53,304 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:25:53" (1/1) ... [2019-09-20 13:25:53,311 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e744482 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:53, skipping insertion in model container [2019-09-20 13:25:53,311 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:25:53" (1/1) ... [2019-09-20 13:25:53,320 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:25:53,337 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:25:53,504 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:25:53,509 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:25:53,523 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:25:53,537 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:25:53,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:53 WrapperNode [2019-09-20 13:25:53,537 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:25:53,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:25:53,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:25:53,539 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:25:53,646 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:53" (1/1) ... [2019-09-20 13:25:53,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:53" (1/1) ... [2019-09-20 13:25:53,651 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:53" (1/1) ... [2019-09-20 13:25:53,651 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:53" (1/1) ... [2019-09-20 13:25:53,655 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:53" (1/1) ... [2019-09-20 13:25:53,660 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:53" (1/1) ... [2019-09-20 13:25:53,662 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:53" (1/1) ... [2019-09-20 13:25:53,663 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:25:53,663 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:25:53,663 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:25:53,664 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:25:53,664 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:53" (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-20 13:25:53,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:25:53,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:25:53,720 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-20 13:25:53,720 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:25:53,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:25:53,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-20 13:25:53,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-20 13:25:53,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:25:53,720 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:25:53,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:25:53,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:25:53,915 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:25:53,915 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:25:53,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:25:53 BoogieIcfgContainer [2019-09-20 13:25:53,917 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:25:53,918 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:25:53,918 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:25:53,928 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:25:53,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:25:53" (1/3) ... [2019-09-20 13:25:53,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29cd89e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:25:53, skipping insertion in model container [2019-09-20 13:25:53,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:53" (2/3) ... [2019-09-20 13:25:53,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29cd89e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:25:53, skipping insertion in model container [2019-09-20 13:25:53,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:25:53" (3/3) ... [2019-09-20 13:25:53,932 INFO L109 eAbstractionObserver]: Analyzing ICFG gr2006.i [2019-09-20 13:25:53,948 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:25:53,956 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:25:53,972 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:25:53,996 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:25:53,996 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:25:53,996 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:25:53,996 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:25:53,996 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:25:53,997 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:25:53,997 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:25:53,997 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:25:54,011 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-09-20 13:25:54,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-20 13:25:54,018 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:54,018 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:54,020 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:54,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:54,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1001202113, now seen corresponding path program 1 times [2019-09-20 13:25:54,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:54,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:54,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:54,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:54,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:54,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:54,122 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-20 13:25:54,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:54,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-20 13:25:54,124 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:54,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-20 13:25:54,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-20 13:25:54,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 13:25:54,147 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2019-09-20 13:25:54,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:54,161 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2019-09-20 13:25:54,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-20 13:25:54,163 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-20 13:25:54,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:54,173 INFO L225 Difference]: With dead ends: 20 [2019-09-20 13:25:54,174 INFO L226 Difference]: Without dead ends: 13 [2019-09-20 13:25:54,176 INFO L636 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-20 13:25:54,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-09-20 13:25:54,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-09-20 13:25:54,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-20 13:25:54,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-09-20 13:25:54,215 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-09-20 13:25:54,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:54,215 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-09-20 13:25:54,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-20 13:25:54,216 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-09-20 13:25:54,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-20 13:25:54,217 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:54,217 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:54,217 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:54,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:54,218 INFO L82 PathProgramCache]: Analyzing trace with hash 563077882, now seen corresponding path program 1 times [2019-09-20 13:25:54,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:54,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:54,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:54,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:54,220 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:54,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:54,309 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-20 13:25:54,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:54,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:25:54,310 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:54,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:54,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:54,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:54,312 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 4 states. [2019-09-20 13:25:54,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:54,464 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2019-09-20 13:25:54,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:25:54,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-20 13:25:54,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:54,466 INFO L225 Difference]: With dead ends: 17 [2019-09-20 13:25:54,466 INFO L226 Difference]: Without dead ends: 17 [2019-09-20 13:25:54,467 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:54,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-20 13:25:54,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-20 13:25:54,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-20 13:25:54,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-09-20 13:25:54,472 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2019-09-20 13:25:54,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:54,473 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-09-20 13:25:54,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:54,473 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-09-20 13:25:54,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-20 13:25:54,474 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:54,474 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:54,474 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:54,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:54,475 INFO L82 PathProgramCache]: Analyzing trace with hash 620336184, now seen corresponding path program 1 times [2019-09-20 13:25:54,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:54,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:54,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:54,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:54,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:54,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:54,537 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-20 13:25:54,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:54,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:25:54,541 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:54,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:25:54,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:25:54,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:25:54,543 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 3 states. [2019-09-20 13:25:54,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:54,556 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-09-20 13:25:54,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:25:54,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-09-20 13:25:54,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:54,558 INFO L225 Difference]: With dead ends: 20 [2019-09-20 13:25:54,558 INFO L226 Difference]: Without dead ends: 20 [2019-09-20 13:25:54,559 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:25:54,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-20 13:25:54,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-09-20 13:25:54,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-20 13:25:54,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-09-20 13:25:54,563 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2019-09-20 13:25:54,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:54,563 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-09-20 13:25:54,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:25:54,564 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-09-20 13:25:54,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-20 13:25:54,565 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:54,565 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:54,565 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:54,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:54,566 INFO L82 PathProgramCache]: Analyzing trace with hash -657196198, now seen corresponding path program 1 times [2019-09-20 13:25:54,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:54,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:54,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:54,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:54,568 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:54,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:54,613 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:25:54,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:54,615 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:25:54,616 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2019-09-20 13:25:54,618 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [16], [18], [22], [24], [31], [34], [36], [42], [43], [44], [46] [2019-09-20 13:25:54,657 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-20 13:25:54,658 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-20 13:25:54,811 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-20 13:25:54,815 INFO L272 AbstractInterpreter]: Visited 14 different actions 73 times. Merged at 5 different actions 32 times. Widened at 1 different actions 5 times. Performed 197 root evaluator evaluations with a maximum evaluation depth of 4. Performed 197 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 10 fixpoints after 3 different actions. Largest state had 5 variables. [2019-09-20 13:25:54,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:54,821 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-20 13:25:54,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:54,822 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-20 13:25:54,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:54,844 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-20 13:25:54,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:54,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-20 13:25:54,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:25:54,889 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:25:54,889 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:25:54,927 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:25:54,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-20 13:25:54,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-09-20 13:25:54,933 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-20 13:25:54,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:54,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:54,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:25:54,934 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 4 states. [2019-09-20 13:25:54,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:54,967 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2019-09-20 13:25:54,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:25:54,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-09-20 13:25:54,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:54,969 INFO L225 Difference]: With dead ends: 23 [2019-09-20 13:25:54,969 INFO L226 Difference]: Without dead ends: 23 [2019-09-20 13:25:54,970 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:25:54,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-20 13:25:54,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-09-20 13:25:54,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-20 13:25:54,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-09-20 13:25:54,977 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 18 [2019-09-20 13:25:54,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:54,977 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-09-20 13:25:54,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:54,977 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-09-20 13:25:54,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-20 13:25:54,980 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:54,980 INFO L407 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:54,980 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:54,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:54,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1550672957, now seen corresponding path program 2 times [2019-09-20 13:25:54,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:54,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:54,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:54,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:54,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:55,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:55,087 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-20 13:25:55,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:55,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:25:55,087 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-20 13:25:55,088 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-20 13:25:55,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:55,088 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-20 13:25:55,108 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-20 13:25:55,108 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-20 13:25:55,126 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-20 13:25:55,126 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:25:55,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-20 13:25:55,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:25:55,192 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:25:55,192 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:25:55,291 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:25:55,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-20 13:25:55,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2019-09-20 13:25:55,296 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-20 13:25:55,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 13:25:55,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 13:25:55,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-09-20 13:25:55,297 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 10 states. [2019-09-20 13:25:55,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:55,552 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2019-09-20 13:25:55,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-20 13:25:55,553 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-09-20 13:25:55,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:55,554 INFO L225 Difference]: With dead ends: 45 [2019-09-20 13:25:55,555 INFO L226 Difference]: Without dead ends: 45 [2019-09-20 13:25:55,556 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2019-09-20 13:25:55,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-20 13:25:55,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2019-09-20 13:25:55,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-20 13:25:55,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2019-09-20 13:25:55,562 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 21 [2019-09-20 13:25:55,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:55,562 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2019-09-20 13:25:55,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 13:25:55,563 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2019-09-20 13:25:55,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-20 13:25:55,564 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:55,564 INFO L407 BasicCegarLoop]: trace histogram [7, 6, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:55,564 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:55,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:55,565 INFO L82 PathProgramCache]: Analyzing trace with hash -839757736, now seen corresponding path program 3 times [2019-09-20 13:25:55,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:55,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:55,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:25:55,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:55,567 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:55,672 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-20 13:25:55,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:55,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:25:55,673 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-20 13:25:55,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-20 13:25:55,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:55,674 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:25:55,697 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-20 13:25:55,698 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-20 13:25:55,715 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-20 13:25:55,715 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:25:55,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-20 13:25:55,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:25:55,773 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 32 proven. 26 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-20 13:25:55,773 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:25:55,896 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 32 proven. 26 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-20 13:25:55,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-20 13:25:55,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2019-09-20 13:25:55,903 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-20 13:25:55,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-20 13:25:55,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-20 13:25:55,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-09-20 13:25:55,905 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 12 states. [2019-09-20 13:25:56,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:56,139 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2019-09-20 13:25:56,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-20 13:25:56,141 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2019-09-20 13:25:56,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:56,143 INFO L225 Difference]: With dead ends: 65 [2019-09-20 13:25:56,143 INFO L226 Difference]: Without dead ends: 65 [2019-09-20 13:25:56,144 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=244, Invalid=568, Unknown=0, NotChecked=0, Total=812 [2019-09-20 13:25:56,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-20 13:25:56,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 43. [2019-09-20 13:25:56,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-20 13:25:56,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2019-09-20 13:25:56,158 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 30 [2019-09-20 13:25:56,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:56,158 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2019-09-20 13:25:56,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-20 13:25:56,160 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2019-09-20 13:25:56,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-20 13:25:56,161 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:56,161 INFO L407 BasicCegarLoop]: trace histogram [9, 8, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:56,162 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:56,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:56,163 INFO L82 PathProgramCache]: Analyzing trace with hash 508995066, now seen corresponding path program 4 times [2019-09-20 13:25:56,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:56,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:56,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:25:56,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:56,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:56,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:56,291 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-20 13:25:56,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:56,291 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:25:56,292 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-20 13:25:56,292 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-20 13:25:56,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:56,293 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:25:56,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:56,314 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-20 13:25:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:56,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-20 13:25:56,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:25:56,431 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 56 proven. 40 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-20 13:25:56,432 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:25:56,558 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 56 proven. 40 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-20 13:25:56,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-20 13:25:56,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2019-09-20 13:25:56,562 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-20 13:25:56,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-20 13:25:56,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-20 13:25:56,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2019-09-20 13:25:56,564 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 14 states. [2019-09-20 13:25:56,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:56,853 INFO L93 Difference]: Finished difference Result 78 states and 93 transitions. [2019-09-20 13:25:56,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-20 13:25:56,857 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2019-09-20 13:25:56,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:56,858 INFO L225 Difference]: With dead ends: 78 [2019-09-20 13:25:56,858 INFO L226 Difference]: Without dead ends: 78 [2019-09-20 13:25:56,859 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=333, Invalid=789, Unknown=0, NotChecked=0, Total=1122 [2019-09-20 13:25:56,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-20 13:25:56,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 49. [2019-09-20 13:25:56,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-20 13:25:56,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2019-09-20 13:25:56,865 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 36 [2019-09-20 13:25:56,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:56,866 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2019-09-20 13:25:56,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-20 13:25:56,866 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2019-09-20 13:25:56,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-20 13:25:56,868 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:56,869 INFO L407 BasicCegarLoop]: trace histogram [11, 10, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:56,869 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:56,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:56,869 INFO L82 PathProgramCache]: Analyzing trace with hash -284519592, now seen corresponding path program 5 times [2019-09-20 13:25:56,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:56,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:56,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:56,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:56,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:56,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:57,003 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-20 13:25:57,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:57,004 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:25:57,004 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-20 13:25:57,004 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-20 13:25:57,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:57,004 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-20 13:25:57,040 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-20 13:25:57,040 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:25:57,068 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-20 13:25:57,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:25:57,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-20 13:25:57,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:25:57,146 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 86 proven. 57 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-20 13:25:57,146 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:25:57,299 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 86 proven. 57 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-20 13:25:57,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-20 13:25:57,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2019-09-20 13:25:57,303 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-20 13:25:57,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-20 13:25:57,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-20 13:25:57,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2019-09-20 13:25:57,304 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 16 states. [2019-09-20 13:25:57,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:57,639 INFO L93 Difference]: Finished difference Result 91 states and 109 transitions. [2019-09-20 13:25:57,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-20 13:25:57,640 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2019-09-20 13:25:57,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:57,644 INFO L225 Difference]: With dead ends: 91 [2019-09-20 13:25:57,644 INFO L226 Difference]: Without dead ends: 91 [2019-09-20 13:25:57,647 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=436, Invalid=1046, Unknown=0, NotChecked=0, Total=1482 [2019-09-20 13:25:57,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-20 13:25:57,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 55. [2019-09-20 13:25:57,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-20 13:25:57,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2019-09-20 13:25:57,659 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 42 [2019-09-20 13:25:57,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:57,659 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2019-09-20 13:25:57,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-20 13:25:57,660 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2019-09-20 13:25:57,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-20 13:25:57,664 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:57,664 INFO L407 BasicCegarLoop]: trace histogram [13, 12, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:57,669 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:57,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:57,670 INFO L82 PathProgramCache]: Analyzing trace with hash -535736454, now seen corresponding path program 6 times [2019-09-20 13:25:57,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:57,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:57,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:25:57,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:57,672 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:57,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:57,813 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 157 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-20 13:25:57,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:57,813 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:25:57,813 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-20 13:25:57,814 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-20 13:25:57,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:57,814 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-20 13:25:57,841 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-20 13:25:57,842 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-20 13:25:57,861 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-20 13:25:57,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:25:57,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-20 13:25:57,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:25:57,964 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 122 proven. 77 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-20 13:25:57,965 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:25:58,117 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 122 proven. 77 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 13:25:58,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-20 13:25:58,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2019-09-20 13:25:58,120 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-20 13:25:58,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-20 13:25:58,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-20 13:25:58,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=465, Unknown=0, NotChecked=0, Total=650 [2019-09-20 13:25:58,122 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 18 states. [2019-09-20 13:25:58,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:58,472 INFO L93 Difference]: Finished difference Result 104 states and 125 transitions. [2019-09-20 13:25:58,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-20 13:25:58,473 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2019-09-20 13:25:58,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:58,474 INFO L225 Difference]: With dead ends: 104 [2019-09-20 13:25:58,475 INFO L226 Difference]: Without dead ends: 104 [2019-09-20 13:25:58,476 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=553, Invalid=1339, Unknown=0, NotChecked=0, Total=1892 [2019-09-20 13:25:58,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-20 13:25:58,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 61. [2019-09-20 13:25:58,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-20 13:25:58,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2019-09-20 13:25:58,482 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 48 [2019-09-20 13:25:58,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:58,483 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2019-09-20 13:25:58,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-20 13:25:58,483 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2019-09-20 13:25:58,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-20 13:25:58,484 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:58,484 INFO L407 BasicCegarLoop]: trace histogram [15, 14, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:58,485 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:58,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:58,485 INFO L82 PathProgramCache]: Analyzing trace with hash 336586328, now seen corresponding path program 7 times [2019-09-20 13:25:58,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:58,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:58,487 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:25:58,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:58,487 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:58,629 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 215 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-20 13:25:58,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:58,630 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:25:58,630 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-20 13:25:58,630 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-20 13:25:58,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:58,630 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-20 13:25:58,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:58,654 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-20 13:25:58,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:58,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-20 13:25:58,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:25:58,805 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 164 proven. 100 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-20 13:25:58,805 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:25:58,953 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 164 proven. 100 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-20 13:25:58,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-20 13:25:58,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2019-09-20 13:25:58,958 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-20 13:25:58,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-20 13:25:58,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-20 13:25:58,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=582, Unknown=0, NotChecked=0, Total=812 [2019-09-20 13:25:58,959 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand 20 states. [2019-09-20 13:25:59,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:59,375 INFO L93 Difference]: Finished difference Result 117 states and 141 transitions. [2019-09-20 13:25:59,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-20 13:25:59,377 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 54 [2019-09-20 13:25:59,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:59,378 INFO L225 Difference]: With dead ends: 117 [2019-09-20 13:25:59,378 INFO L226 Difference]: Without dead ends: 117 [2019-09-20 13:25:59,379 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=684, Invalid=1668, Unknown=0, NotChecked=0, Total=2352 [2019-09-20 13:25:59,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-09-20 13:25:59,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 67. [2019-09-20 13:25:59,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-20 13:25:59,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2019-09-20 13:25:59,385 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 54 [2019-09-20 13:25:59,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:59,386 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2019-09-20 13:25:59,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-20 13:25:59,386 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2019-09-20 13:25:59,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-20 13:25:59,387 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:59,387 INFO L407 BasicCegarLoop]: trace histogram [17, 16, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:59,387 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:59,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:59,388 INFO L82 PathProgramCache]: Analyzing trace with hash 154544378, now seen corresponding path program 8 times [2019-09-20 13:25:59,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:59,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:59,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:59,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:59,389 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:59,549 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 282 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-20 13:25:59,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:59,552 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:25:59,552 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-20 13:25:59,552 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-20 13:25:59,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:59,552 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-20 13:25:59,585 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-20 13:25:59,585 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:25:59,622 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-20 13:25:59,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:25:59,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-20 13:25:59,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:25:59,810 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 224 proven. 162 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-20 13:25:59,810 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:26:00,021 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 224 proven. 162 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-20 13:26:00,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-20 13:26:00,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-09-20 13:26:00,025 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-20 13:26:00,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-20 13:26:00,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-20 13:26:00,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=291, Unknown=0, NotChecked=0, Total=506 [2019-09-20 13:26:00,028 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. Second operand 22 states. [2019-09-20 13:26:00,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:00,520 INFO L93 Difference]: Finished difference Result 186 states and 230 transitions. [2019-09-20 13:26:00,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-20 13:26:00,521 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 60 [2019-09-20 13:26:00,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:00,524 INFO L225 Difference]: With dead ends: 186 [2019-09-20 13:26:00,524 INFO L226 Difference]: Without dead ends: 186 [2019-09-20 13:26:00,526 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 111 SyntacticMatches, 16 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=619, Invalid=1273, Unknown=0, NotChecked=0, Total=1892 [2019-09-20 13:26:00,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-09-20 13:26:00,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 94. [2019-09-20 13:26:00,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-09-20 13:26:00,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 113 transitions. [2019-09-20 13:26:00,545 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 113 transitions. Word has length 60 [2019-09-20 13:26:00,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:00,546 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 113 transitions. [2019-09-20 13:26:00,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-20 13:26:00,546 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2019-09-20 13:26:00,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-20 13:26:00,549 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:00,549 INFO L407 BasicCegarLoop]: trace histogram [28, 27, 19, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:00,549 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:00,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:00,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1948702853, now seen corresponding path program 9 times [2019-09-20 13:26:00,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:00,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:00,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:26:00,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:00,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:00,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:01,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 506 proven. 628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:01,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:26:01,195 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:26:01,195 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-20 13:26:01,195 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-20 13:26:01,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:26:01,196 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 13:26:01,221 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-20 13:26:01,221 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-20 13:26:01,256 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-20 13:26:01,257 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:26:01,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-20 13:26:01,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:26:01,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 531 proven. 126 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-09-20 13:26:01,496 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:26:01,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 531 proven. 126 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-09-20 13:26:01,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-20 13:26:01,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 12, 12] total 59 [2019-09-20 13:26:01,925 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-20 13:26:01,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-20 13:26:01,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-20 13:26:01,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=629, Invalid=2793, Unknown=0, NotChecked=0, Total=3422 [2019-09-20 13:26:01,929 INFO L87 Difference]: Start difference. First operand 94 states and 113 transitions. Second operand 49 states. [2019-09-20 13:26:02,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:02,336 INFO L93 Difference]: Finished difference Result 98 states and 117 transitions. [2019-09-20 13:26:02,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-20 13:26:02,337 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 93 [2019-09-20 13:26:02,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:02,338 INFO L225 Difference]: With dead ends: 98 [2019-09-20 13:26:02,338 INFO L226 Difference]: Without dead ends: 98 [2019-09-20 13:26:02,340 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1518 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1327, Invalid=4679, Unknown=0, NotChecked=0, Total=6006 [2019-09-20 13:26:02,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-20 13:26:02,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-09-20 13:26:02,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-20 13:26:02,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 116 transitions. [2019-09-20 13:26:02,345 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 116 transitions. Word has length 93 [2019-09-20 13:26:02,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:02,346 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 116 transitions. [2019-09-20 13:26:02,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-20 13:26:02,346 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 116 transitions. [2019-09-20 13:26:02,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-20 13:26:02,347 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:02,347 INFO L407 BasicCegarLoop]: trace histogram [29, 28, 19, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:02,348 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:02,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:02,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1268513464, now seen corresponding path program 10 times [2019-09-20 13:26:02,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:02,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:02,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:26:02,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:02,350 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:03,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1218 backedges. 509 proven. 709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:03,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:26:03,053 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:26:03,053 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-20 13:26:03,053 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-20 13:26:03,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:26:03,054 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-20 13:26:03,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:03,100 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-20 13:26:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:03,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-20 13:26:03,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:26:03,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1218 backedges. 586 proven. 155 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-09-20 13:26:03,409 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:26:03,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1218 backedges. 586 proven. 155 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-09-20 13:26:03,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-20 13:26:03,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 13, 13] total 63 [2019-09-20 13:26:03,754 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-20 13:26:03,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-20 13:26:03,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-20 13:26:03,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=717, Invalid=3189, Unknown=0, NotChecked=0, Total=3906 [2019-09-20 13:26:03,756 INFO L87 Difference]: Start difference. First operand 97 states and 116 transitions. Second operand 52 states. [2019-09-20 13:26:04,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:04,199 INFO L93 Difference]: Finished difference Result 101 states and 120 transitions. [2019-09-20 13:26:04,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-20 13:26:04,199 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 96 [2019-09-20 13:26:04,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:04,201 INFO L225 Difference]: With dead ends: 101 [2019-09-20 13:26:04,201 INFO L226 Difference]: Without dead ends: 101 [2019-09-20 13:26:04,204 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1741 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1562, Invalid=5410, Unknown=0, NotChecked=0, Total=6972 [2019-09-20 13:26:04,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-09-20 13:26:04,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-09-20 13:26:04,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-20 13:26:04,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 119 transitions. [2019-09-20 13:26:04,209 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 119 transitions. Word has length 96 [2019-09-20 13:26:04,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:04,209 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 119 transitions. [2019-09-20 13:26:04,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-20 13:26:04,210 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 119 transitions. [2019-09-20 13:26:04,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-20 13:26:04,211 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:04,211 INFO L407 BasicCegarLoop]: trace histogram [30, 29, 19, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:04,211 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:04,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:04,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1130364325, now seen corresponding path program 11 times [2019-09-20 13:26:04,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:04,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:04,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:04,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:04,214 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:04,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:04,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 512 proven. 793 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:04,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:26:04,851 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:26:04,851 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-20 13:26:04,851 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-20 13:26:04,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:26:04,851 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-20 13:26:04,884 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-20 13:26:04,885 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-20 13:26:04,970 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-09-20 13:26:04,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:26:04,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-20 13:26:04,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:26:05,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 931 proven. 342 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-20 13:26:05,336 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:26:05,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 931 proven. 342 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-20 13:26:05,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-20 13:26:05,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 21, 21] total 68 [2019-09-20 13:26:05,843 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-20 13:26:05,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-20 13:26:05,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-20 13:26:05,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1289, Invalid=3267, Unknown=0, NotChecked=0, Total=4556 [2019-09-20 13:26:05,847 INFO L87 Difference]: Start difference. First operand 100 states and 119 transitions. Second operand 62 states. [2019-09-20 13:26:06,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:06,392 INFO L93 Difference]: Finished difference Result 104 states and 123 transitions. [2019-09-20 13:26:06,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-20 13:26:06,393 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 99 [2019-09-20 13:26:06,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:06,394 INFO L225 Difference]: With dead ends: 104 [2019-09-20 13:26:06,394 INFO L226 Difference]: Without dead ends: 103 [2019-09-20 13:26:06,396 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 155 SyntacticMatches, 19 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4330 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2178, Invalid=6194, Unknown=0, NotChecked=0, Total=8372 [2019-09-20 13:26:06,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-09-20 13:26:06,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-09-20 13:26:06,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-20 13:26:06,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 122 transitions. [2019-09-20 13:26:06,401 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 122 transitions. Word has length 99 [2019-09-20 13:26:06,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:06,404 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 122 transitions. [2019-09-20 13:26:06,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-20 13:26:06,405 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2019-09-20 13:26:06,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-20 13:26:06,406 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:06,406 INFO L407 BasicCegarLoop]: trace histogram [31, 30, 19, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:06,406 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:06,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:06,407 INFO L82 PathProgramCache]: Analyzing trace with hash -2137738280, now seen corresponding path program 12 times [2019-09-20 13:26:06,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:06,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:06,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:26:06,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:06,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:06,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:07,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 515 proven. 880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:07,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:26:07,131 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:26:07,131 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-20 13:26:07,131 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-20 13:26:07,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:26:07,131 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 13:26:07,171 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-20 13:26:07,171 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-20 13:26:07,212 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-20 13:26:07,212 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:26:07,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-20 13:26:07,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:26:07,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 696 proven. 222 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-09-20 13:26:07,531 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:26:07,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 696 proven. 222 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-09-20 13:26:07,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-20 13:26:07,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 15, 15] total 71 [2019-09-20 13:26:07,968 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-20 13:26:07,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-20 13:26:07,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-20 13:26:07,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=917, Invalid=4053, Unknown=0, NotChecked=0, Total=4970 [2019-09-20 13:26:07,972 INFO L87 Difference]: Start difference. First operand 103 states and 122 transitions. Second operand 58 states. [2019-09-20 13:26:08,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:08,545 INFO L93 Difference]: Finished difference Result 107 states and 126 transitions. [2019-09-20 13:26:08,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-20 13:26:08,551 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 102 [2019-09-20 13:26:08,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:08,552 INFO L225 Difference]: With dead ends: 107 [2019-09-20 13:26:08,553 INFO L226 Difference]: Without dead ends: 107 [2019-09-20 13:26:08,558 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2223 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2098, Invalid=7022, Unknown=0, NotChecked=0, Total=9120 [2019-09-20 13:26:08,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-20 13:26:08,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-09-20 13:26:08,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-09-20 13:26:08,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 125 transitions. [2019-09-20 13:26:08,565 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 125 transitions. Word has length 102 [2019-09-20 13:26:08,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:08,565 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 125 transitions. [2019-09-20 13:26:08,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-20 13:26:08,565 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 125 transitions. [2019-09-20 13:26:08,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:26:08,566 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:08,567 INFO L407 BasicCegarLoop]: trace histogram [32, 31, 19, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:08,567 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:08,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:08,567 INFO L82 PathProgramCache]: Analyzing trace with hash 416232763, now seen corresponding path program 13 times [2019-09-20 13:26:08,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:08,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:08,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:26:08,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:08,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:08,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:09,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 518 proven. 970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:09,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:26:09,292 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:26:09,292 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-20 13:26:09,292 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-20 13:26:09,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:26:09,292 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-20 13:26:09,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:09,340 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-20 13:26:09,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:09,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-20 13:26:09,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:26:09,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 751 proven. 260 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-09-20 13:26:09,757 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:26:10,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 751 proven. 260 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-09-20 13:26:10,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-20 13:26:10,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 16, 16] total 75 [2019-09-20 13:26:10,265 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-20 13:26:10,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-20 13:26:10,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-20 13:26:10,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1029, Invalid=4521, Unknown=0, NotChecked=0, Total=5550 [2019-09-20 13:26:10,267 INFO L87 Difference]: Start difference. First operand 106 states and 125 transitions. Second operand 61 states. [2019-09-20 13:26:10,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:10,955 INFO L93 Difference]: Finished difference Result 110 states and 129 transitions. [2019-09-20 13:26:10,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-20 13:26:10,956 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 105 [2019-09-20 13:26:10,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:10,957 INFO L225 Difference]: With dead ends: 110 [2019-09-20 13:26:10,957 INFO L226 Difference]: Without dead ends: 110 [2019-09-20 13:26:10,958 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2482 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2399, Invalid=7903, Unknown=0, NotChecked=0, Total=10302 [2019-09-20 13:26:10,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-20 13:26:10,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-09-20 13:26:10,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-09-20 13:26:10,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 128 transitions. [2019-09-20 13:26:10,966 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 128 transitions. Word has length 105 [2019-09-20 13:26:10,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:10,966 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 128 transitions. [2019-09-20 13:26:10,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-20 13:26:10,966 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 128 transitions. [2019-09-20 13:26:10,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-20 13:26:10,968 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:10,968 INFO L407 BasicCegarLoop]: trace histogram [33, 32, 19, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:10,968 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:10,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:10,969 INFO L82 PathProgramCache]: Analyzing trace with hash 421926136, now seen corresponding path program 14 times [2019-09-20 13:26:10,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:10,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:10,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:10,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:10,971 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:11,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 521 proven. 1063 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:11,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:26:11,762 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:26:11,762 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-20 13:26:11,763 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-20 13:26:11,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:26:11,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 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-20 13:26:11,808 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-20 13:26:11,808 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-20 13:26:11,872 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-09-20 13:26:11,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:26:11,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-20 13:26:11,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:26:12,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 982 proven. 561 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-20 13:26:12,240 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:26:12,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 982 proven. 561 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-20 13:26:12,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-20 13:26:12,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 21, 21] total 71 [2019-09-20 13:26:12,882 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-20 13:26:12,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-20 13:26:12,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-20 13:26:12,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1325, Invalid=3645, Unknown=0, NotChecked=0, Total=4970 [2019-09-20 13:26:12,883 INFO L87 Difference]: Start difference. First operand 109 states and 128 transitions. Second operand 68 states. [2019-09-20 13:26:13,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:13,640 INFO L93 Difference]: Finished difference Result 113 states and 132 transitions. [2019-09-20 13:26:13,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-20 13:26:13,641 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 108 [2019-09-20 13:26:13,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:13,642 INFO L225 Difference]: With dead ends: 113 [2019-09-20 13:26:13,643 INFO L226 Difference]: Without dead ends: 112 [2019-09-20 13:26:13,644 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 167 SyntacticMatches, 28 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5248 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2565, Invalid=7535, Unknown=0, NotChecked=0, Total=10100 [2019-09-20 13:26:13,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-20 13:26:13,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-09-20 13:26:13,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-20 13:26:13,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 131 transitions. [2019-09-20 13:26:13,647 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 131 transitions. Word has length 108 [2019-09-20 13:26:13,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:13,647 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 131 transitions. [2019-09-20 13:26:13,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-20 13:26:13,648 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 131 transitions. [2019-09-20 13:26:13,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-20 13:26:13,649 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:13,649 INFO L407 BasicCegarLoop]: trace histogram [34, 33, 19, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:13,649 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:13,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:13,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1765490661, now seen corresponding path program 15 times [2019-09-20 13:26:13,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:13,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:13,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:26:13,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:13,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:14,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 524 proven. 1159 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:14,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:26:14,475 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:26:14,475 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-20 13:26:14,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-20 13:26:14,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:26:14,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 13:26:14,528 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-20 13:26:14,528 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-20 13:26:14,564 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-20 13:26:14,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:26:14,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-20 13:26:14,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:26:14,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 861 proven. 345 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-09-20 13:26:14,983 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:26:15,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 861 proven. 345 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-09-20 13:26:15,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-20 13:26:15,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 18, 18] total 83 [2019-09-20 13:26:15,665 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-20 13:26:15,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-20 13:26:15,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-20 13:26:15,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1277, Invalid=5529, Unknown=0, NotChecked=0, Total=6806 [2019-09-20 13:26:15,666 INFO L87 Difference]: Start difference. First operand 112 states and 131 transitions. Second operand 67 states. [2019-09-20 13:26:16,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:16,480 INFO L93 Difference]: Finished difference Result 116 states and 135 transitions. [2019-09-20 13:26:16,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-20 13:26:16,480 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 111 [2019-09-20 13:26:16,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:16,481 INFO L225 Difference]: With dead ends: 116 [2019-09-20 13:26:16,481 INFO L226 Difference]: Without dead ends: 116 [2019-09-20 13:26:16,483 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3036 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3067, Invalid=9815, Unknown=0, NotChecked=0, Total=12882 [2019-09-20 13:26:16,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-20 13:26:16,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-09-20 13:26:16,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-20 13:26:16,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 134 transitions. [2019-09-20 13:26:16,487 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 134 transitions. Word has length 111 [2019-09-20 13:26:16,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:16,487 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 134 transitions. [2019-09-20 13:26:16,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-20 13:26:16,488 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 134 transitions. [2019-09-20 13:26:16,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-20 13:26:16,489 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:16,489 INFO L407 BasicCegarLoop]: trace histogram [35, 34, 19, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:16,489 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:16,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:16,490 INFO L82 PathProgramCache]: Analyzing trace with hash 439492120, now seen corresponding path program 16 times [2019-09-20 13:26:16,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:16,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:16,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:26:16,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:16,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:17,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 527 proven. 1258 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:17,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:26:17,387 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:26:17,387 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-20 13:26:17,388 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-20 13:26:17,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:26:17,389 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-20 13:26:17,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:17,448 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-20 13:26:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:17,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-20 13:26:17,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:26:17,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 916 proven. 392 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-09-20 13:26:17,950 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:26:18,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 916 proven. 392 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-09-20 13:26:18,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-20 13:26:18,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 19, 19] total 87 [2019-09-20 13:26:18,654 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-20 13:26:18,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-20 13:26:18,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-20 13:26:18,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1413, Invalid=6069, Unknown=0, NotChecked=0, Total=7482 [2019-09-20 13:26:18,657 INFO L87 Difference]: Start difference. First operand 115 states and 134 transitions. Second operand 70 states. [2019-09-20 13:26:19,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:19,556 INFO L93 Difference]: Finished difference Result 119 states and 138 transitions. [2019-09-20 13:26:19,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-20 13:26:19,556 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 114 [2019-09-20 13:26:19,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:19,558 INFO L225 Difference]: With dead ends: 119 [2019-09-20 13:26:19,558 INFO L226 Difference]: Without dead ends: 119 [2019-09-20 13:26:19,559 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3331 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3434, Invalid=10846, Unknown=0, NotChecked=0, Total=14280 [2019-09-20 13:26:19,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-09-20 13:26:19,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-09-20 13:26:19,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-09-20 13:26:19,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 137 transitions. [2019-09-20 13:26:19,563 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 137 transitions. Word has length 114 [2019-09-20 13:26:19,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:19,563 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 137 transitions. [2019-09-20 13:26:19,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-20 13:26:19,563 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 137 transitions. [2019-09-20 13:26:19,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-20 13:26:19,564 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:19,564 INFO L407 BasicCegarLoop]: trace histogram [36, 35, 19, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:19,565 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:19,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:19,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1851695867, now seen corresponding path program 17 times [2019-09-20 13:26:19,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:19,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:19,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:19,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:19,567 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:19,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:20,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 530 proven. 1360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:20,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:26:20,524 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:26:20,524 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-20 13:26:20,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-20 13:26:20,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:26:20,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:26:20,589 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-20 13:26:20,589 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-20 13:26:20,658 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-09-20 13:26:20,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:26:20,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-20 13:26:20,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:26:21,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 1006 proven. 834 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-20 13:26:21,072 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:26:21,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 1006 proven. 834 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-20 13:26:21,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-20 13:26:21,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 21, 21] total 74 [2019-09-20 13:26:21,891 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-20 13:26:21,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-20 13:26:21,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-20 13:26:21,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1406, Invalid=3996, Unknown=0, NotChecked=0, Total=5402 [2019-09-20 13:26:21,892 INFO L87 Difference]: Start difference. First operand 118 states and 137 transitions. Second operand 74 states. [2019-09-20 13:26:22,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:22,924 INFO L93 Difference]: Finished difference Result 122 states and 141 transitions. [2019-09-20 13:26:22,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-20 13:26:22,924 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 117 [2019-09-20 13:26:22,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:22,925 INFO L225 Difference]: With dead ends: 122 [2019-09-20 13:26:22,925 INFO L226 Difference]: Without dead ends: 121 [2019-09-20 13:26:22,926 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 180 SyntacticMatches, 36 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6068 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3051, Invalid=8939, Unknown=0, NotChecked=0, Total=11990 [2019-09-20 13:26:22,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-09-20 13:26:22,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-09-20 13:26:22,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-09-20 13:26:22,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 140 transitions. [2019-09-20 13:26:22,930 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 140 transitions. Word has length 117 [2019-09-20 13:26:22,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:22,930 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 140 transitions. [2019-09-20 13:26:22,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-20 13:26:22,931 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 140 transitions. [2019-09-20 13:26:22,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-20 13:26:22,931 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:22,931 INFO L407 BasicCegarLoop]: trace histogram [37, 36, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:22,932 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:22,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:22,932 INFO L82 PathProgramCache]: Analyzing trace with hash -686108872, now seen corresponding path program 18 times [2019-09-20 13:26:22,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:22,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:22,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:26:22,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:22,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:22,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:23,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 1026 proven. 495 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-09-20 13:26:23,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:26:23,187 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:26:23,187 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-20 13:26:23,188 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-20 13:26:23,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:26:23,188 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:26:23,279 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-20 13:26:23,279 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-20 13:26:23,327 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-20 13:26:23,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:26:23,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-20 13:26:23,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:26:23,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 1026 proven. 495 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-09-20 13:26:23,349 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:26:23,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 1026 proven. 495 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-09-20 13:26:23,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-20 13:26:23,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2019-09-20 13:26:23,912 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-20 13:26:23,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-20 13:26:23,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-20 13:26:23,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-20 13:26:23,913 INFO L87 Difference]: Start difference. First operand 121 states and 140 transitions. Second operand 21 states. [2019-09-20 13:26:23,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:23,961 INFO L93 Difference]: Finished difference Result 125 states and 144 transitions. [2019-09-20 13:26:23,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-20 13:26:23,961 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 120 [2019-09-20 13:26:23,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:23,962 INFO L225 Difference]: With dead ends: 125 [2019-09-20 13:26:23,962 INFO L226 Difference]: Without dead ends: 125 [2019-09-20 13:26:23,963 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-20 13:26:23,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-09-20 13:26:23,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-09-20 13:26:23,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-09-20 13:26:23,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 143 transitions. [2019-09-20 13:26:23,966 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 143 transitions. Word has length 120 [2019-09-20 13:26:23,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:23,967 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 143 transitions. [2019-09-20 13:26:23,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-20 13:26:23,967 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 143 transitions. [2019-09-20 13:26:23,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-20 13:26:23,968 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:23,968 INFO L407 BasicCegarLoop]: trace histogram [38, 37, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:23,968 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:23,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:23,969 INFO L82 PathProgramCache]: Analyzing trace with hash -117776933, now seen corresponding path program 19 times [2019-09-20 13:26:23,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:23,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:23,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:26:23,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:23,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:23,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:24,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2109 backedges. 0 proven. 1558 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-09-20 13:26:24,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:26:24,384 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:26:24,384 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-20 13:26:24,385 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-20 13:26:24,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:26:24,385 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-20 13:26:24,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:24,451 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-20 13:26:24,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:24,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-20 13:26:24,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:26:24,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2109 backedges. 1081 proven. 551 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-09-20 13:26:24,836 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:26:25,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2109 backedges. 1081 proven. 551 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-09-20 13:26:25,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-20 13:26:25,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 63 [2019-09-20 13:26:25,486 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-20 13:26:25,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-20 13:26:25,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-20 13:26:25,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1075, Invalid=2831, Unknown=0, NotChecked=0, Total=3906 [2019-09-20 13:26:25,487 INFO L87 Difference]: Start difference. First operand 124 states and 143 transitions. Second operand 43 states. [2019-09-20 13:26:26,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:26,655 INFO L93 Difference]: Finished difference Result 473 states and 603 transitions. [2019-09-20 13:26:26,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-20 13:26:26,658 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 123 [2019-09-20 13:26:26,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:26,661 INFO L225 Difference]: With dead ends: 473 [2019-09-20 13:26:26,661 INFO L226 Difference]: Without dead ends: 473 [2019-09-20 13:26:26,663 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1848 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3071, Invalid=7849, Unknown=0, NotChecked=0, Total=10920 [2019-09-20 13:26:26,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-09-20 13:26:26,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 160. [2019-09-20 13:26:26,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-20 13:26:26,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 190 transitions. [2019-09-20 13:26:26,670 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 190 transitions. Word has length 123 [2019-09-20 13:26:26,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:26,670 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 190 transitions. [2019-09-20 13:26:26,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-20 13:26:26,671 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 190 transitions. [2019-09-20 13:26:26,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-20 13:26:26,671 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:26,672 INFO L407 BasicCegarLoop]: trace histogram [40, 39, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:26,672 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:26,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:26,672 INFO L82 PathProgramCache]: Analyzing trace with hash 2023127357, now seen corresponding path program 20 times [2019-09-20 13:26:26,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:26,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:26,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:26,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:26,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:26,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2340 backedges. 0 proven. 1730 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2019-09-20 13:26:26,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:26:26,982 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:26:26,982 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-20 13:26:26,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-20 13:26:26,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:26:26,983 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-20 13:26:27,089 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-20 13:26:27,089 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-20 13:26:27,168 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-09-20 13:26:27,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:26:27,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-20 13:26:27,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:26:27,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2340 backedges. 1198 proven. 610 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2019-09-20 13:26:27,632 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:26:28,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2340 backedges. 1198 proven. 610 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2019-09-20 13:26:28,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-20 13:26:28,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 66 [2019-09-20 13:26:28,343 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-20 13:26:28,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-20 13:26:28,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-20 13:26:28,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1181, Invalid=3109, Unknown=0, NotChecked=0, Total=4290 [2019-09-20 13:26:28,344 INFO L87 Difference]: Start difference. First operand 160 states and 190 transitions. Second operand 45 states. [2019-09-20 13:26:29,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:29,569 INFO L93 Difference]: Finished difference Result 540 states and 691 transitions. [2019-09-20 13:26:29,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-20 13:26:29,570 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 129 [2019-09-20 13:26:29,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:29,572 INFO L225 Difference]: With dead ends: 540 [2019-09-20 13:26:29,572 INFO L226 Difference]: Without dead ends: 540 [2019-09-20 13:26:29,573 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2035 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3371, Invalid=8619, Unknown=0, NotChecked=0, Total=11990 [2019-09-20 13:26:29,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-09-20 13:26:29,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 166. [2019-09-20 13:26:29,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-09-20 13:26:29,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 197 transitions. [2019-09-20 13:26:29,580 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 197 transitions. Word has length 129 [2019-09-20 13:26:29,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:29,580 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 197 transitions. [2019-09-20 13:26:29,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-20 13:26:29,581 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 197 transitions. [2019-09-20 13:26:29,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-20 13:26:29,582 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:29,582 INFO L407 BasicCegarLoop]: trace histogram [42, 41, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:29,582 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:29,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:29,582 INFO L82 PathProgramCache]: Analyzing trace with hash 800093275, now seen corresponding path program 21 times [2019-09-20 13:26:29,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:29,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:29,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:26:29,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:29,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:29,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:29,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 0 proven. 1911 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2019-09-20 13:26:29,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:26:29,993 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:26:29,993 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-20 13:26:29,994 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-20 13:26:29,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:26:29,994 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-20 13:26:30,074 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-20 13:26:30,075 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-20 13:26:30,115 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-20 13:26:30,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:26:30,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-20 13:26:30,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:26:30,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 1321 proven. 672 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2019-09-20 13:26:30,523 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:26:31,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 1321 proven. 672 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2019-09-20 13:26:31,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-20 13:26:31,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 69 [2019-09-20 13:26:31,257 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-20 13:26:31,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-20 13:26:31,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-20 13:26:31,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1292, Invalid=3400, Unknown=0, NotChecked=0, Total=4692 [2019-09-20 13:26:31,258 INFO L87 Difference]: Start difference. First operand 166 states and 197 transitions. Second operand 47 states. [2019-09-20 13:26:32,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:32,610 INFO L93 Difference]: Finished difference Result 577 states and 739 transitions. [2019-09-20 13:26:32,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-20 13:26:32,614 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 135 [2019-09-20 13:26:32,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:32,617 INFO L225 Difference]: With dead ends: 577 [2019-09-20 13:26:32,617 INFO L226 Difference]: Without dead ends: 577 [2019-09-20 13:26:32,624 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2231 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3685, Invalid=9425, Unknown=0, NotChecked=0, Total=13110 [2019-09-20 13:26:32,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-09-20 13:26:32,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 172. [2019-09-20 13:26:32,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-20 13:26:32,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 204 transitions. [2019-09-20 13:26:32,632 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 204 transitions. Word has length 135 [2019-09-20 13:26:32,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:32,632 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 204 transitions. [2019-09-20 13:26:32,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-20 13:26:32,632 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 204 transitions. [2019-09-20 13:26:32,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-20 13:26:32,633 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:32,633 INFO L407 BasicCegarLoop]: trace histogram [44, 43, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:32,633 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:32,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:32,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1026217533, now seen corresponding path program 22 times [2019-09-20 13:26:32,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:32,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:32,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:26:32,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:32,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:32,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat