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-new/count_by_nondet.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 20:57:04,351 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:57:04,353 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:57:04,369 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:57:04,370 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:57:04,371 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:57:04,374 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:57:04,382 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:57:04,386 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:57:04,388 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:57:04,389 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:57:04,390 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:57:04,390 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:57:04,392 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:57:04,393 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:57:04,395 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:57:04,396 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:57:04,397 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:57:04,402 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:57:04,404 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:57:04,408 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:57:04,409 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:57:04,410 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:57:04,412 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:57:04,416 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:57:04,416 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:57:04,416 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:57:04,419 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:57:04,420 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:57:04,422 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:57:04,422 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:57:04,424 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:57:04,425 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:57:04,426 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:57:04,429 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:57:04,429 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:57:04,430 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:57:04,430 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:57:04,430 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:57:04,431 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:57:04,431 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:57:04,432 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-03 20:57:04,450 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:57:04,450 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:57:04,451 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 20:57:04,451 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 20:57:04,452 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 20:57:04,452 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 20:57:04,453 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 20:57:04,453 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 20:57:04,453 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 20:57:04,453 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 20:57:04,454 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:57:04,454 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:57:04,454 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:57:04,455 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:57:04,455 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:57:04,455 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:57:04,456 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:57:04,456 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:57:04,457 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:57:04,457 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:57:04,457 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:57:04,458 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 20:57:04,458 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:57:04,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:57:04,458 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:57:04,458 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:57:04,459 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 20:57:04,459 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:57:04,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:57:04,459 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 20:57:04,512 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:57:04,529 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:57:04,534 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:57:04,535 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:57:04,536 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:57:04,537 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/count_by_nondet.i [2019-09-03 20:57:04,607 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d87934900/847aaa040af642c5b34c11a4e4437f34/FLAG02522f07d [2019-09-03 20:57:05,011 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:57:05,012 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/count_by_nondet.i [2019-09-03 20:57:05,018 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d87934900/847aaa040af642c5b34c11a4e4437f34/FLAG02522f07d [2019-09-03 20:57:05,427 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d87934900/847aaa040af642c5b34c11a4e4437f34 [2019-09-03 20:57:05,437 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:57:05,439 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:57:05,440 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:57:05,440 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:57:05,443 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:57:05,444 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:57:05" (1/1) ... [2019-09-03 20:57:05,447 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f6d39c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:57:05, skipping insertion in model container [2019-09-03 20:57:05,448 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:57:05" (1/1) ... [2019-09-03 20:57:05,455 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:57:05,475 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:57:05,638 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:57:05,642 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:57:05,657 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:57:05,669 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:57:05,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:57:05 WrapperNode [2019-09-03 20:57:05,669 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:57:05,670 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:57:05,670 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:57:05,670 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:57:05,763 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:57:05" (1/1) ... [2019-09-03 20:57:05,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:57:05" (1/1) ... [2019-09-03 20:57:05,768 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:57:05" (1/1) ... [2019-09-03 20:57:05,768 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:57:05" (1/1) ... [2019-09-03 20:57:05,771 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:57:05" (1/1) ... [2019-09-03 20:57:05,779 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:57:05" (1/1) ... [2019-09-03 20:57:05,780 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:57:05" (1/1) ... [2019-09-03 20:57:05,781 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:57:05,781 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:57:05,781 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:57:05,781 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:57:05,782 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:57:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:57:05,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:57:05,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:57:05,830 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 20:57:05,830 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:57:05,831 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:57:05,831 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 20:57:05,831 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:57:05,831 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 20:57:05,831 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:57:05,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:57:05,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:57:05,989 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:57:05,989 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-03 20:57:05,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:57:05 BoogieIcfgContainer [2019-09-03 20:57:05,991 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:57:05,991 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:57:05,992 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:57:05,995 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:57:05,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:57:05" (1/3) ... [2019-09-03 20:57:05,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@754687a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:57:05, skipping insertion in model container [2019-09-03 20:57:05,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:57:05" (2/3) ... [2019-09-03 20:57:05,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@754687a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:57:05, skipping insertion in model container [2019-09-03 20:57:05,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:57:05" (3/3) ... [2019-09-03 20:57:05,998 INFO L109 eAbstractionObserver]: Analyzing ICFG count_by_nondet.i [2019-09-03 20:57:06,008 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:57:06,016 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 20:57:06,033 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 20:57:06,077 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:57:06,077 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 20:57:06,078 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:57:06,078 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:57:06,078 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:57:06,079 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:57:06,079 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:57:06,079 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:57:06,100 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-09-03 20:57:06,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:57:06,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:06,115 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:06,123 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:06,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:06,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1137787585, now seen corresponding path program 1 times [2019-09-03 20:57:06,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:06,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:06,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:06,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:06,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:06,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:06,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:06,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:57:06,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 20:57:06,240 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:57:06,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 20:57:06,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 20:57:06,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:57:06,262 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-09-03 20:57:06,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:06,276 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-09-03 20:57:06,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 20:57:06,278 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-03 20:57:06,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:06,287 INFO L225 Difference]: With dead ends: 19 [2019-09-03 20:57:06,288 INFO L226 Difference]: Without dead ends: 12 [2019-09-03 20:57:06,289 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:57:06,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-03 20:57:06,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-03 20:57:06,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-03 20:57:06,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-09-03 20:57:06,323 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-09-03 20:57:06,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:06,323 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-09-03 20:57:06,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 20:57:06,324 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-09-03 20:57:06,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:57:06,324 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:06,324 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:06,325 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:06,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:06,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1130399417, now seen corresponding path program 1 times [2019-09-03 20:57:06,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:06,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:06,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:06,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:06,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:06,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:06,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:06,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:57:06,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:57:06,385 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:57:06,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:57:06,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:57:06,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:57:06,389 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2019-09-03 20:57:06,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:06,414 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-09-03 20:57:06,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:57:06,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-03 20:57:06,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:06,417 INFO L225 Difference]: With dead ends: 14 [2019-09-03 20:57:06,417 INFO L226 Difference]: Without dead ends: 14 [2019-09-03 20:57:06,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:57:06,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-03 20:57:06,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-09-03 20:57:06,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-03 20:57:06,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-09-03 20:57:06,423 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2019-09-03 20:57:06,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:06,424 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-09-03 20:57:06,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:57:06,424 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-09-03 20:57:06,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 20:57:06,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:06,426 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:06,426 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:06,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:06,427 INFO L82 PathProgramCache]: Analyzing trace with hash 820627669, now seen corresponding path program 1 times [2019-09-03 20:57:06,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:06,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:06,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:06,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:06,429 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:06,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:06,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:06,503 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:06,504 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 13 with the following transitions: [2019-09-03 20:57:06,506 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [17], [24], [27], [29], [35], [36], [37], [39] [2019-09-03 20:57:06,548 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:57:06,548 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:57:06,744 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:57:06,753 INFO L272 AbstractInterpreter]: Visited 12 different actions 46 times. Merged at 3 different actions 16 times. Widened at 1 different actions 3 times. Performed 112 root evaluator evaluations with a maximum evaluation depth of 5. Performed 112 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 5 variables. [2019-09-03 20:57:06,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:06,762 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:57:06,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:06,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 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:57:06,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:06,783 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:06,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-03 20:57:06,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:06,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:06,852 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:06,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:06,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:06,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2019-09-03 20:57:06,882 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:06,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:57:06,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:57:06,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:57:06,884 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 4 states. [2019-09-03 20:57:06,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:06,908 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-09-03 20:57:06,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:57:06,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-03 20:57:06,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:06,910 INFO L225 Difference]: With dead ends: 15 [2019-09-03 20:57:06,910 INFO L226 Difference]: Without dead ends: 15 [2019-09-03 20:57:06,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:57:06,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-09-03 20:57:06,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-09-03 20:57:06,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-03 20:57:06,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-09-03 20:57:06,914 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2019-09-03 20:57:06,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:06,915 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-09-03 20:57:06,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:57:06,915 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-09-03 20:57:06,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 20:57:06,916 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:06,916 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:06,917 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:06,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:06,917 INFO L82 PathProgramCache]: Analyzing trace with hash -517278735, now seen corresponding path program 2 times [2019-09-03 20:57:06,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:06,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:06,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:06,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:06,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:06,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:07,011 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:07,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:07,012 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:07,012 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:07,013 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:07,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:07,013 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:07,030 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:57:07,030 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:57:07,050 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 20:57:07,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:07,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 20:57:07,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:07,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:07,087 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:07,087 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:07,152 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:07,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:07,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2019-09-03 20:57:07,156 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:07,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 20:57:07,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 20:57:07,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:57:07,158 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 9 states. [2019-09-03 20:57:07,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:07,195 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-09-03 20:57:07,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:57:07,196 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2019-09-03 20:57:07,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:07,197 INFO L225 Difference]: With dead ends: 21 [2019-09-03 20:57:07,197 INFO L226 Difference]: Without dead ends: 18 [2019-09-03 20:57:07,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-09-03 20:57:07,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-03 20:57:07,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-09-03 20:57:07,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-03 20:57:07,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-09-03 20:57:07,205 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2019-09-03 20:57:07,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:07,205 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-09-03 20:57:07,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 20:57:07,205 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-09-03 20:57:07,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 20:57:07,207 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:07,208 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:07,208 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:07,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:07,208 INFO L82 PathProgramCache]: Analyzing trace with hash -2050111475, now seen corresponding path program 3 times [2019-09-03 20:57:07,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:07,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:07,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:07,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:07,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:07,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:07,313 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:07,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:07,313 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:07,314 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:07,314 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:07,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:07,314 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:57:07,329 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:57:07,329 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:07,345 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:57:07,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:07,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 20:57:07,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:07,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:07,378 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:07,378 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:07,522 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:07,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:07,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2019-09-03 20:57:07,526 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:07,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 20:57:07,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 20:57:07,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-09-03 20:57:07,528 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2019-09-03 20:57:07,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:07,564 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-09-03 20:57:07,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:57:07,564 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-09-03 20:57:07,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:07,565 INFO L225 Difference]: With dead ends: 23 [2019-09-03 20:57:07,565 INFO L226 Difference]: Without dead ends: 20 [2019-09-03 20:57:07,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2019-09-03 20:57:07,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-03 20:57:07,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-09-03 20:57:07,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-03 20:57:07,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-09-03 20:57:07,569 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2019-09-03 20:57:07,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:07,570 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-09-03 20:57:07,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 20:57:07,570 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-09-03 20:57:07,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 20:57:07,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:07,571 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:07,571 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:07,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:07,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1928592087, now seen corresponding path program 4 times [2019-09-03 20:57:07,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:07,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:07,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:07,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:07,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:07,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:07,647 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:07,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:07,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:07,648 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:07,648 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:07,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:07,649 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:57:07,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:07,671 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:07,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:07,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 20:57:07,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:07,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:07,717 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:07,717 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:07,801 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:07,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:07,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2019-09-03 20:57:07,805 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:07,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 20:57:07,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 20:57:07,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-09-03 20:57:07,806 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 11 states. [2019-09-03 20:57:07,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:07,839 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-09-03 20:57:07,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:57:07,840 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2019-09-03 20:57:07,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:07,841 INFO L225 Difference]: With dead ends: 25 [2019-09-03 20:57:07,841 INFO L226 Difference]: Without dead ends: 22 [2019-09-03 20:57:07,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-09-03 20:57:07,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-03 20:57:07,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-09-03 20:57:07,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-03 20:57:07,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-09-03 20:57:07,845 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2019-09-03 20:57:07,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:07,845 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-09-03 20:57:07,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 20:57:07,846 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-09-03 20:57:07,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 20:57:07,846 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:07,847 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:07,847 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:07,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:07,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1112577211, now seen corresponding path program 5 times [2019-09-03 20:57:07,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:07,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:07,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:07,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:07,849 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:07,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:07,952 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:07,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:07,953 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:07,953 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:07,953 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:07,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:07,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:07,975 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:57:07,975 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:57:07,996 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-03 20:57:07,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:07,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 20:57:07,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:08,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:08,036 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:08,036 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:08,143 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:08,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:08,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2019-09-03 20:57:08,148 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:08,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 20:57:08,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 20:57:08,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2019-09-03 20:57:08,150 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2019-09-03 20:57:08,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:08,194 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-09-03 20:57:08,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 20:57:08,196 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-09-03 20:57:08,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:08,197 INFO L225 Difference]: With dead ends: 27 [2019-09-03 20:57:08,197 INFO L226 Difference]: Without dead ends: 24 [2019-09-03 20:57:08,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2019-09-03 20:57:08,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-03 20:57:08,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-09-03 20:57:08,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-03 20:57:08,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-09-03 20:57:08,203 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2019-09-03 20:57:08,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:08,203 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-09-03 20:57:08,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 20:57:08,204 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-09-03 20:57:08,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-03 20:57:08,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:08,206 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:08,207 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:08,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:08,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1393670753, now seen corresponding path program 6 times [2019-09-03 20:57:08,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:08,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:08,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:08,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:08,211 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:08,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:08,331 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:08,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:08,332 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:08,332 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:08,332 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:08,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:08,333 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) [2019-09-03 20:57:08,347 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:57:08,347 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:08,373 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:57:08,373 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:08,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 20:57:08,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:08,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:08,407 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:08,408 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:08,563 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:08,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:08,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2019-09-03 20:57:08,566 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:08,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 20:57:08,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 20:57:08,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2019-09-03 20:57:08,568 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 13 states. [2019-09-03 20:57:08,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:08,614 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-09-03 20:57:08,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 20:57:08,615 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2019-09-03 20:57:08,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:08,616 INFO L225 Difference]: With dead ends: 29 [2019-09-03 20:57:08,616 INFO L226 Difference]: Without dead ends: 26 [2019-09-03 20:57:08,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2019-09-03 20:57:08,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-03 20:57:08,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-09-03 20:57:08,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-03 20:57:08,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-09-03 20:57:08,620 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2019-09-03 20:57:08,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:08,620 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-09-03 20:57:08,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 20:57:08,620 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-09-03 20:57:08,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-03 20:57:08,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:08,621 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:08,621 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:08,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:08,622 INFO L82 PathProgramCache]: Analyzing trace with hash 421311101, now seen corresponding path program 7 times [2019-09-03 20:57:08,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:08,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:08,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:08,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:08,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:08,750 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:08,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:08,751 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:08,751 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:08,751 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:08,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:08,751 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:57:08,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:08,765 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:08,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:08,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 20:57:08,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:08,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:08,824 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:08,824 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:08,977 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:08,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:08,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2019-09-03 20:57:08,981 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:08,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 20:57:08,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 20:57:08,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=299, Unknown=0, NotChecked=0, Total=462 [2019-09-03 20:57:08,983 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 14 states. [2019-09-03 20:57:09,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:09,023 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-09-03 20:57:09,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 20:57:09,023 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2019-09-03 20:57:09,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:09,024 INFO L225 Difference]: With dead ends: 31 [2019-09-03 20:57:09,024 INFO L226 Difference]: Without dead ends: 28 [2019-09-03 20:57:09,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=337, Unknown=0, NotChecked=0, Total=506 [2019-09-03 20:57:09,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-03 20:57:09,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-09-03 20:57:09,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-03 20:57:09,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-09-03 20:57:09,032 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2019-09-03 20:57:09,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:09,032 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-09-03 20:57:09,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 20:57:09,032 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-09-03 20:57:09,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-03 20:57:09,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:09,035 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:09,035 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:09,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:09,036 INFO L82 PathProgramCache]: Analyzing trace with hash -2008411239, now seen corresponding path program 8 times [2019-09-03 20:57:09,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:09,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:09,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:09,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:09,037 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:09,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:09,184 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:09,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:09,184 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:09,184 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:09,185 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:09,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:09,185 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:09,196 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:57:09,196 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:57:09,222 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-03 20:57:09,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:09,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 20:57:09,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:09,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:09,266 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:09,266 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:09,454 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:57:09,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:09,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2019-09-03 20:57:09,459 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:09,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 20:57:09,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 20:57:09,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2019-09-03 20:57:09,461 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 15 states. [2019-09-03 20:57:09,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:09,499 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-09-03 20:57:09,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 20:57:09,499 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2019-09-03 20:57:09,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:09,500 INFO L225 Difference]: With dead ends: 33 [2019-09-03 20:57:09,500 INFO L226 Difference]: Without dead ends: 30 [2019-09-03 20:57:09,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=394, Unknown=0, NotChecked=0, Total=600 [2019-09-03 20:57:09,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-03 20:57:09,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-09-03 20:57:09,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-03 20:57:09,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-09-03 20:57:09,505 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2019-09-03 20:57:09,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:09,505 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-09-03 20:57:09,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 20:57:09,505 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-09-03 20:57:09,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 20:57:09,506 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:09,506 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:09,507 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:09,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:09,507 INFO L82 PathProgramCache]: Analyzing trace with hash -509370955, now seen corresponding path program 9 times [2019-09-03 20:57:09,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:09,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:09,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:09,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:09,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:09,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:09,626 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:09,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:09,627 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:09,627 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:09,628 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:09,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:09,628 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:09,638 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:57:09,639 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:57:09,671 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:57:09,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:09,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 20:57:09,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:09,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:09,711 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:09,712 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:09,905 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:09,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:09,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 26 [2019-09-03 20:57:09,908 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:09,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 20:57:09,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 20:57:09,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=409, Unknown=0, NotChecked=0, Total=650 [2019-09-03 20:57:09,909 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 16 states. [2019-09-03 20:57:09,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:09,956 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-09-03 20:57:09,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 20:57:09,956 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2019-09-03 20:57:09,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:09,957 INFO L225 Difference]: With dead ends: 35 [2019-09-03 20:57:09,957 INFO L226 Difference]: Without dead ends: 32 [2019-09-03 20:57:09,958 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=247, Invalid=455, Unknown=0, NotChecked=0, Total=702 [2019-09-03 20:57:09,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-03 20:57:09,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-09-03 20:57:09,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-03 20:57:09,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-09-03 20:57:09,961 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2019-09-03 20:57:09,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:09,962 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-09-03 20:57:09,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 20:57:09,962 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-09-03 20:57:09,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-03 20:57:09,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:09,963 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:09,963 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:09,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:09,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1254297809, now seen corresponding path program 10 times [2019-09-03 20:57:09,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:09,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:09,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:09,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:09,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:10,084 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:10,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:10,085 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:10,085 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:10,085 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:10,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:10,085 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:10,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:10,110 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:57:10,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:10,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-03 20:57:10,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:10,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:10,157 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:10,158 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:10,411 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:10,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:10,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2019-09-03 20:57:10,416 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:10,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 20:57:10,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 20:57:10,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=470, Unknown=0, NotChecked=0, Total=756 [2019-09-03 20:57:10,418 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 17 states. [2019-09-03 20:57:10,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:10,480 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-09-03 20:57:10,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 20:57:10,481 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-09-03 20:57:10,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:10,482 INFO L225 Difference]: With dead ends: 37 [2019-09-03 20:57:10,482 INFO L226 Difference]: Without dead ends: 34 [2019-09-03 20:57:10,482 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=292, Invalid=520, Unknown=0, NotChecked=0, Total=812 [2019-09-03 20:57:10,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-03 20:57:10,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-09-03 20:57:10,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-03 20:57:10,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-09-03 20:57:10,489 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2019-09-03 20:57:10,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:10,489 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-09-03 20:57:10,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 20:57:10,490 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-09-03 20:57:10,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-03 20:57:10,490 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:10,491 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:10,491 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:10,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:10,491 INFO L82 PathProgramCache]: Analyzing trace with hash -372101907, now seen corresponding path program 11 times [2019-09-03 20:57:10,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:10,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:10,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:10,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:10,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:10,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:10,640 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:10,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:10,640 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:10,641 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:10,641 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:10,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:10,641 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) [2019-09-03 20:57:10,659 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:57:10,659 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:10,698 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-03 20:57:10,698 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:10,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 20:57:10,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:10,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:10,740 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:10,740 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:10,992 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:10,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:10,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2019-09-03 20:57:10,997 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:10,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 20:57:10,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 20:57:10,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=535, Unknown=0, NotChecked=0, Total=870 [2019-09-03 20:57:10,998 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 18 states. [2019-09-03 20:57:11,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:11,057 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-09-03 20:57:11,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 20:57:11,058 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2019-09-03 20:57:11,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:11,059 INFO L225 Difference]: With dead ends: 39 [2019-09-03 20:57:11,059 INFO L226 Difference]: Without dead ends: 36 [2019-09-03 20:57:11,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=341, Invalid=589, Unknown=0, NotChecked=0, Total=930 [2019-09-03 20:57:11,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-03 20:57:11,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-09-03 20:57:11,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-03 20:57:11,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-09-03 20:57:11,064 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2019-09-03 20:57:11,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:11,065 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-09-03 20:57:11,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 20:57:11,065 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-09-03 20:57:11,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-03 20:57:11,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:11,066 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:11,066 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:11,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:11,067 INFO L82 PathProgramCache]: Analyzing trace with hash 25866761, now seen corresponding path program 12 times [2019-09-03 20:57:11,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:11,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:11,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:11,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:11,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:11,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:11,209 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:11,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:11,210 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:11,210 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:11,210 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:11,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:11,210 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:57:11,232 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:57:11,233 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:11,261 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:57:11,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:11,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-03 20:57:11,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:11,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:11,308 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:11,308 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:11,606 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:11,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:11,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2019-09-03 20:57:11,611 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:11,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 20:57:11,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 20:57:11,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=604, Unknown=0, NotChecked=0, Total=992 [2019-09-03 20:57:11,614 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 19 states. [2019-09-03 20:57:11,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:11,672 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-09-03 20:57:11,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 20:57:11,672 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 34 [2019-09-03 20:57:11,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:11,673 INFO L225 Difference]: With dead ends: 41 [2019-09-03 20:57:11,673 INFO L226 Difference]: Without dead ends: 38 [2019-09-03 20:57:11,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=662, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 20:57:11,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-03 20:57:11,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-09-03 20:57:11,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-03 20:57:11,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-09-03 20:57:11,679 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2019-09-03 20:57:11,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:11,679 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-09-03 20:57:11,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 20:57:11,679 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-09-03 20:57:11,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-03 20:57:11,680 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:11,680 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:11,681 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:11,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:11,681 INFO L82 PathProgramCache]: Analyzing trace with hash 221667365, now seen corresponding path program 13 times [2019-09-03 20:57:11,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:11,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:11,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:11,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:11,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:11,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:11,852 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:11,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:11,852 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:11,853 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:11,853 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:11,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:11,853 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:11,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:11,868 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:57:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:11,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 20:57:11,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:11,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:11,934 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:11,934 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:12,236 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:12,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:12,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2019-09-03 20:57:12,240 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:12,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 20:57:12,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 20:57:12,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=677, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 20:57:12,241 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 20 states. [2019-09-03 20:57:12,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:12,285 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-09-03 20:57:12,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-03 20:57:12,285 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2019-09-03 20:57:12,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:12,286 INFO L225 Difference]: With dead ends: 43 [2019-09-03 20:57:12,287 INFO L226 Difference]: Without dead ends: 40 [2019-09-03 20:57:12,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=451, Invalid=739, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 20:57:12,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-03 20:57:12,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-09-03 20:57:12,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-03 20:57:12,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-09-03 20:57:12,292 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2019-09-03 20:57:12,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:12,292 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-09-03 20:57:12,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 20:57:12,292 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-09-03 20:57:12,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-03 20:57:12,293 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:12,293 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:12,293 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:12,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:12,294 INFO L82 PathProgramCache]: Analyzing trace with hash -592513215, now seen corresponding path program 14 times [2019-09-03 20:57:12,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:12,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:12,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:12,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:12,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:12,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:12,454 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:12,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:12,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:12,455 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:12,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:12,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:12,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:12,466 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:57:12,466 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:57:12,499 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-03 20:57:12,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:12,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 20:57:12,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:12,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:12,546 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:12,546 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:12,859 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:12,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:12,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 36 [2019-09-03 20:57:12,863 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:12,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 20:57:12,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 20:57:12,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=506, Invalid=754, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 20:57:12,865 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 21 states. [2019-09-03 20:57:12,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:12,916 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-09-03 20:57:12,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 20:57:12,917 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2019-09-03 20:57:12,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:12,917 INFO L225 Difference]: With dead ends: 45 [2019-09-03 20:57:12,917 INFO L226 Difference]: Without dead ends: 42 [2019-09-03 20:57:12,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=512, Invalid=820, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 20:57:12,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-03 20:57:12,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-09-03 20:57:12,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-03 20:57:12,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-09-03 20:57:12,922 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2019-09-03 20:57:12,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:12,922 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-09-03 20:57:12,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 20:57:12,923 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-09-03 20:57:12,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-03 20:57:12,923 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:12,923 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:12,924 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:12,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:12,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1336002723, now seen corresponding path program 15 times [2019-09-03 20:57:12,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:12,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:12,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:12,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:12,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:12,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:13,163 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:13,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:13,163 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:13,163 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:13,164 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:13,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:13,164 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) [2019-09-03 20:57:13,190 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:57:13,190 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:13,231 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:57:13,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:13,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 20:57:13,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:13,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:13,316 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:13,316 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:13,755 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:13,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:13,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 38 [2019-09-03 20:57:13,759 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:13,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 20:57:13,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 20:57:13,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=571, Invalid=835, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 20:57:13,761 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 22 states. [2019-09-03 20:57:13,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:13,813 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-09-03 20:57:13,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 20:57:13,814 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2019-09-03 20:57:13,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:13,814 INFO L225 Difference]: With dead ends: 47 [2019-09-03 20:57:13,815 INFO L226 Difference]: Without dead ends: 44 [2019-09-03 20:57:13,817 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=577, Invalid=905, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 20:57:13,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-03 20:57:13,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-09-03 20:57:13,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-03 20:57:13,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-09-03 20:57:13,821 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2019-09-03 20:57:13,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:13,826 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-09-03 20:57:13,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 20:57:13,826 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-09-03 20:57:13,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-03 20:57:13,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:13,828 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:13,828 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:13,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:13,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1430118521, now seen corresponding path program 16 times [2019-09-03 20:57:13,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:13,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:13,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:13,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:13,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:13,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:14,065 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:14,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:14,066 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:14,066 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:14,066 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:14,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:14,066 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:14,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:14,079 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:57:14,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:14,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 20:57:14,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:14,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:14,146 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:14,146 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:14,610 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:14,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:14,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2019-09-03 20:57:14,613 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:14,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 20:57:14,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 20:57:14,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=640, Invalid=920, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 20:57:14,615 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 23 states. [2019-09-03 20:57:14,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:14,674 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-09-03 20:57:14,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 20:57:14,674 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 42 [2019-09-03 20:57:14,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:14,675 INFO L225 Difference]: With dead ends: 49 [2019-09-03 20:57:14,675 INFO L226 Difference]: Without dead ends: 46 [2019-09-03 20:57:14,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=646, Invalid=994, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 20:57:14,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-03 20:57:14,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-09-03 20:57:14,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-03 20:57:14,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-09-03 20:57:14,680 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2019-09-03 20:57:14,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:14,681 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-09-03 20:57:14,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 20:57:14,681 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-09-03 20:57:14,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-03 20:57:14,682 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:14,682 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:14,682 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:14,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:14,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1087877781, now seen corresponding path program 17 times [2019-09-03 20:57:14,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:14,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:14,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:14,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:14,683 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:14,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:14,891 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:14,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:14,892 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:14,892 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:14,892 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:14,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:14,892 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:14,903 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:57:14,903 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:57:14,950 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-03 20:57:14,950 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:14,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 20:57:14,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:14,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:14,985 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:14,985 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:15,421 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:15,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:15,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 42 [2019-09-03 20:57:15,424 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:15,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 20:57:15,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 20:57:15,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=713, Invalid=1009, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 20:57:15,426 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 24 states. [2019-09-03 20:57:15,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:15,480 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-09-03 20:57:15,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-03 20:57:15,481 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2019-09-03 20:57:15,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:15,481 INFO L225 Difference]: With dead ends: 51 [2019-09-03 20:57:15,482 INFO L226 Difference]: Without dead ends: 48 [2019-09-03 20:57:15,482 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=719, Invalid=1087, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 20:57:15,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-03 20:57:15,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-09-03 20:57:15,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-03 20:57:15,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-09-03 20:57:15,494 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2019-09-03 20:57:15,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:15,494 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-09-03 20:57:15,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 20:57:15,495 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-09-03 20:57:15,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-03 20:57:15,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:15,496 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:15,496 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:15,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:15,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1387958863, now seen corresponding path program 18 times [2019-09-03 20:57:15,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:15,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:15,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:15,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:15,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:15,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:15,735 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:15,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:15,736 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:15,736 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:15,736 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:15,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:15,736 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:15,747 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:57:15,747 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:57:15,786 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:57:15,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:15,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-03 20:57:15,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:15,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:15,825 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:15,826 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:16,301 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (19)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:57:16,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:16,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 44 [2019-09-03 20:57:16,311 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:16,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 20:57:16,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 20:57:16,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=790, Invalid=1102, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 20:57:16,312 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 25 states. [2019-09-03 20:57:16,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:16,366 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-09-03 20:57:16,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 20:57:16,368 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2019-09-03 20:57:16,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:16,368 INFO L225 Difference]: With dead ends: 53 [2019-09-03 20:57:16,369 INFO L226 Difference]: Without dead ends: 50 [2019-09-03 20:57:16,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=796, Invalid=1184, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 20:57:16,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-03 20:57:16,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-09-03 20:57:16,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-03 20:57:16,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-09-03 20:57:16,374 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2019-09-03 20:57:16,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:16,374 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-09-03 20:57:16,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 20:57:16,375 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-09-03 20:57:16,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-03 20:57:16,375 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:16,375 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:16,376 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:16,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:16,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1255091763, now seen corresponding path program 19 times [2019-09-03 20:57:16,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:16,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:16,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:16,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:16,377 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:16,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:16,613 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:16,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:16,613 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:16,613 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:16,613 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:16,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:16,613 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:16,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:16,624 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:57:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:16,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 20:57:16,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:16,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:16,706 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:16,707 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:17,223 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:17,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:17,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 46 [2019-09-03 20:57:17,226 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:17,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 20:57:17,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 20:57:17,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=871, Invalid=1199, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 20:57:17,228 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 26 states. [2019-09-03 20:57:17,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:17,303 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-09-03 20:57:17,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 20:57:17,303 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2019-09-03 20:57:17,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:17,304 INFO L225 Difference]: With dead ends: 55 [2019-09-03 20:57:17,304 INFO L226 Difference]: Without dead ends: 52 [2019-09-03 20:57:17,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=877, Invalid=1285, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 20:57:17,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-03 20:57:17,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-09-03 20:57:17,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-03 20:57:17,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-09-03 20:57:17,310 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2019-09-03 20:57:17,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:17,310 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-09-03 20:57:17,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 20:57:17,310 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-09-03 20:57:17,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-03 20:57:17,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:17,311 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:17,311 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:17,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:17,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1876139753, now seen corresponding path program 20 times [2019-09-03 20:57:17,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:17,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:17,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:17,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:17,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:17,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:17,627 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:17,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:17,628 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:17,628 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:17,628 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:17,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:17,629 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) [2019-09-03 20:57:17,665 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:57:17,665 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:17,718 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-03 20:57:17,718 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:17,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 20:57:17,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:17,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:17,759 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:17,759 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:18,332 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:18,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:18,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2019-09-03 20:57:18,336 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:18,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 20:57:18,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 20:57:18,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=956, Invalid=1300, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 20:57:18,338 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 27 states. [2019-09-03 20:57:18,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:18,401 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-09-03 20:57:18,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 20:57:18,403 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 50 [2019-09-03 20:57:18,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:18,404 INFO L225 Difference]: With dead ends: 57 [2019-09-03 20:57:18,405 INFO L226 Difference]: Without dead ends: 54 [2019-09-03 20:57:18,406 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=962, Invalid=1390, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 20:57:18,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-03 20:57:18,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-09-03 20:57:18,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-03 20:57:18,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-09-03 20:57:18,409 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2019-09-03 20:57:18,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:18,409 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-09-03 20:57:18,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 20:57:18,410 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-09-03 20:57:18,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-03 20:57:18,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:18,410 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:18,411 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:18,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:18,411 INFO L82 PathProgramCache]: Analyzing trace with hash 217552133, now seen corresponding path program 21 times [2019-09-03 20:57:18,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:18,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:18,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:18,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:18,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:18,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:18,661 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:18,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:18,662 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:18,662 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:18,662 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:18,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:18,662 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:18,672 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:57:18,673 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:57:18,723 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:57:18,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:18,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 20:57:18,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:18,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:18,776 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:18,776 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:19,376 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:19,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:19,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 50 [2019-09-03 20:57:19,379 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:19,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 20:57:19,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 20:57:19,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1045, Invalid=1405, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 20:57:19,381 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 28 states. [2019-09-03 20:57:19,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:19,458 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-09-03 20:57:19,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 20:57:19,459 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2019-09-03 20:57:19,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:19,460 INFO L225 Difference]: With dead ends: 59 [2019-09-03 20:57:19,460 INFO L226 Difference]: Without dead ends: 56 [2019-09-03 20:57:19,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1051, Invalid=1499, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 20:57:19,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-03 20:57:19,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-09-03 20:57:19,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-03 20:57:19,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-09-03 20:57:19,465 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2019-09-03 20:57:19,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:19,465 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-09-03 20:57:19,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 20:57:19,465 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-09-03 20:57:19,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-03 20:57:19,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:19,466 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:19,466 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:19,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:19,467 INFO L82 PathProgramCache]: Analyzing trace with hash -252283871, now seen corresponding path program 22 times [2019-09-03 20:57:19,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:19,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:19,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:19,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:19,468 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:19,792 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:19,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:19,792 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:19,793 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:19,793 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:19,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:19,793 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:57:19,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:19,806 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:19,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:19,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-03 20:57:19,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:19,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:19,886 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:19,887 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:20,588 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:20,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:20,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 52 [2019-09-03 20:57:20,591 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:20,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 20:57:20,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 20:57:20,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1138, Invalid=1514, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 20:57:20,593 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 29 states. [2019-09-03 20:57:20,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:20,658 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-09-03 20:57:20,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 20:57:20,659 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 54 [2019-09-03 20:57:20,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:20,659 INFO L225 Difference]: With dead ends: 61 [2019-09-03 20:57:20,660 INFO L226 Difference]: Without dead ends: 58 [2019-09-03 20:57:20,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1144, Invalid=1612, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 20:57:20,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-03 20:57:20,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-09-03 20:57:20,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-03 20:57:20,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-09-03 20:57:20,665 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2019-09-03 20:57:20,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:20,665 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-09-03 20:57:20,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 20:57:20,665 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-09-03 20:57:20,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-03 20:57:20,666 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:20,666 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:20,666 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:20,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:20,667 INFO L82 PathProgramCache]: Analyzing trace with hash -793117635, now seen corresponding path program 23 times [2019-09-03 20:57:20,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:20,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:20,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:20,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:20,668 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:20,968 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:20,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:20,968 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:20,969 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:20,969 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:20,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:20,969 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:20,982 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:57:20,983 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:57:21,037 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-09-03 20:57:21,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:21,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 20:57:21,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:21,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:21,079 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:21,079 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:21,856 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:21,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:21,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 54 [2019-09-03 20:57:21,861 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:21,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 20:57:21,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 20:57:21,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1235, Invalid=1627, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 20:57:21,863 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 30 states. [2019-09-03 20:57:21,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:21,916 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-09-03 20:57:21,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-03 20:57:21,916 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2019-09-03 20:57:21,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:21,917 INFO L225 Difference]: With dead ends: 63 [2019-09-03 20:57:21,917 INFO L226 Difference]: Without dead ends: 60 [2019-09-03 20:57:21,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1241, Invalid=1729, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 20:57:21,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-03 20:57:21,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-09-03 20:57:21,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-03 20:57:21,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-09-03 20:57:21,920 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2019-09-03 20:57:21,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:21,921 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-09-03 20:57:21,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 20:57:21,921 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-09-03 20:57:21,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-03 20:57:21,924 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:21,924 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:21,924 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:21,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:21,925 INFO L82 PathProgramCache]: Analyzing trace with hash -843322023, now seen corresponding path program 24 times [2019-09-03 20:57:21,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:21,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:21,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:21,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:21,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:21,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:22,307 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:22,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:22,307 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:22,307 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:22,308 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:22,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:22,308 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:57:22,327 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:57:22,327 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:22,364 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:57:22,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:22,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-03 20:57:22,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:22,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:22,426 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:22,426 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:23,156 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:23,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:23,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 56 [2019-09-03 20:57:23,159 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:23,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 20:57:23,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 20:57:23,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1336, Invalid=1744, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 20:57:23,162 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 31 states. [2019-09-03 20:57:23,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:23,217 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-09-03 20:57:23,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 20:57:23,218 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 58 [2019-09-03 20:57:23,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:23,219 INFO L225 Difference]: With dead ends: 65 [2019-09-03 20:57:23,219 INFO L226 Difference]: Without dead ends: 62 [2019-09-03 20:57:23,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1342, Invalid=1850, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 20:57:23,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-03 20:57:23,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-09-03 20:57:23,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-03 20:57:23,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-09-03 20:57:23,223 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2019-09-03 20:57:23,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:23,224 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-09-03 20:57:23,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 20:57:23,224 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-09-03 20:57:23,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-03 20:57:23,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:23,225 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:23,225 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:23,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:23,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1845098635, now seen corresponding path program 25 times [2019-09-03 20:57:23,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:23,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:23,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:23,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:23,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:23,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:23,628 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:23,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:23,629 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:23,629 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:23,629 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:23,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:23,629 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:23,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:23,639 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:57:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:23,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 20:57:23,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:23,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:23,731 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:23,731 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:24,644 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:24,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:24,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 58 [2019-09-03 20:57:24,647 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:24,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 20:57:24,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 20:57:24,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1441, Invalid=1865, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 20:57:24,649 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 32 states. [2019-09-03 20:57:24,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:24,725 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-09-03 20:57:24,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-03 20:57:24,725 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2019-09-03 20:57:24,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:24,726 INFO L225 Difference]: With dead ends: 67 [2019-09-03 20:57:24,726 INFO L226 Difference]: Without dead ends: 64 [2019-09-03 20:57:24,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1447, Invalid=1975, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 20:57:24,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-03 20:57:24,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-09-03 20:57:24,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-03 20:57:24,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-09-03 20:57:24,730 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2019-09-03 20:57:24,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:24,731 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-09-03 20:57:24,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 20:57:24,731 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-09-03 20:57:24,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-03 20:57:24,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:24,732 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:24,732 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:24,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:24,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1815218833, now seen corresponding path program 26 times [2019-09-03 20:57:24,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:24,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:24,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:24,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:24,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:24,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:25,164 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:25,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:25,165 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:25,165 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:25,165 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:25,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:25,166 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:57:25,182 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:57:25,182 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:25,264 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-09-03 20:57:25,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:25,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 20:57:25,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:25,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:25,311 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:25,311 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:26,208 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:26,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:26,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 60 [2019-09-03 20:57:26,211 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:26,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 20:57:26,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 20:57:26,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1550, Invalid=1990, Unknown=0, NotChecked=0, Total=3540 [2019-09-03 20:57:26,213 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 33 states. [2019-09-03 20:57:26,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:26,291 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-09-03 20:57:26,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 20:57:26,291 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 62 [2019-09-03 20:57:26,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:26,292 INFO L225 Difference]: With dead ends: 69 [2019-09-03 20:57:26,293 INFO L226 Difference]: Without dead ends: 66 [2019-09-03 20:57:26,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1556, Invalid=2104, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 20:57:26,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-03 20:57:26,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-09-03 20:57:26,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-03 20:57:26,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-09-03 20:57:26,296 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2019-09-03 20:57:26,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:26,296 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-09-03 20:57:26,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 20:57:26,296 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-09-03 20:57:26,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-03 20:57:26,296 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:26,296 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:26,297 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:26,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:26,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1802090157, now seen corresponding path program 27 times [2019-09-03 20:57:26,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:26,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:26,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:26,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:26,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:26,735 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:26,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:26,735 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:26,735 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:26,736 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:26,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:26,736 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:57:26,756 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:57:26,756 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:26,799 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:57:26,800 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:26,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 20:57:26,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:26,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:26,873 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:26,873 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:27,830 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:27,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:27,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 62 [2019-09-03 20:57:27,833 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:27,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-03 20:57:27,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-03 20:57:27,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1663, Invalid=2119, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 20:57:27,835 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 34 states. [2019-09-03 20:57:27,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:27,937 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-09-03 20:57:27,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-03 20:57:27,937 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2019-09-03 20:57:27,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:27,938 INFO L225 Difference]: With dead ends: 71 [2019-09-03 20:57:27,938 INFO L226 Difference]: Without dead ends: 68 [2019-09-03 20:57:27,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1669, Invalid=2237, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 20:57:27,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-03 20:57:27,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-09-03 20:57:27,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-03 20:57:27,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-09-03 20:57:27,942 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2019-09-03 20:57:27,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:27,943 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-09-03 20:57:27,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-03 20:57:27,943 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-09-03 20:57:27,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-03 20:57:27,943 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:27,944 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:27,944 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:27,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:27,944 INFO L82 PathProgramCache]: Analyzing trace with hash 2070334409, now seen corresponding path program 28 times [2019-09-03 20:57:27,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:27,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:27,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:27,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:27,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:27,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:28,345 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:28,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:28,346 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:28,346 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:28,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:28,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:28,346 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:28,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:28,356 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:57:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:28,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-03 20:57:28,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:28,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:28,441 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:28,441 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:29,399 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:29,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:29,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 64 [2019-09-03 20:57:29,402 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:29,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-03 20:57:29,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-03 20:57:29,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1780, Invalid=2252, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 20:57:29,403 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 35 states. [2019-09-03 20:57:29,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:29,481 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-09-03 20:57:29,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 20:57:29,482 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 66 [2019-09-03 20:57:29,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:29,483 INFO L225 Difference]: With dead ends: 73 [2019-09-03 20:57:29,483 INFO L226 Difference]: Without dead ends: 70 [2019-09-03 20:57:29,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1786, Invalid=2374, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 20:57:29,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-03 20:57:29,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-09-03 20:57:29,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-03 20:57:29,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-09-03 20:57:29,486 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2019-09-03 20:57:29,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:29,487 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-09-03 20:57:29,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-03 20:57:29,487 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-09-03 20:57:29,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-03 20:57:29,487 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:29,487 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:29,488 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:29,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:29,488 INFO L82 PathProgramCache]: Analyzing trace with hash -2139944475, now seen corresponding path program 29 times [2019-09-03 20:57:29,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:29,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:29,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:29,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:29,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:29,909 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:29,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:29,909 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:29,909 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:29,910 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:29,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:29,910 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:29,920 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:57:29,920 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:57:29,999 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-09-03 20:57:29,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:30,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 20:57:30,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:30,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:30,050 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:30,050 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:31,147 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:31,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:31,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 66 [2019-09-03 20:57:31,151 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:31,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 20:57:31,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 20:57:31,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1901, Invalid=2389, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 20:57:31,152 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 36 states. [2019-09-03 20:57:31,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:31,235 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-09-03 20:57:31,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-03 20:57:31,235 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 68 [2019-09-03 20:57:31,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:31,236 INFO L225 Difference]: With dead ends: 75 [2019-09-03 20:57:31,236 INFO L226 Difference]: Without dead ends: 72 [2019-09-03 20:57:31,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1907, Invalid=2515, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 20:57:31,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-03 20:57:31,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-09-03 20:57:31,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-03 20:57:31,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-09-03 20:57:31,239 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2019-09-03 20:57:31,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:31,240 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-09-03 20:57:31,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 20:57:31,240 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-09-03 20:57:31,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-03 20:57:31,240 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:31,240 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:31,241 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:31,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:31,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1936208129, now seen corresponding path program 30 times [2019-09-03 20:57:31,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:31,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:31,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:31,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:31,242 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:31,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:31,731 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:31,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:31,731 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:31,731 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:31,731 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:31,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:31,732 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:31,742 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:57:31,743 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:57:31,789 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:57:31,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:31,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-03 20:57:31,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:31,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:31,847 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:31,848 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:32,945 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:32,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:32,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 68 [2019-09-03 20:57:32,948 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:32,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 20:57:32,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 20:57:32,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2026, Invalid=2530, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 20:57:32,949 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 37 states. [2019-09-03 20:57:33,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:33,046 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-09-03 20:57:33,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 20:57:33,046 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 70 [2019-09-03 20:57:33,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:33,047 INFO L225 Difference]: With dead ends: 77 [2019-09-03 20:57:33,047 INFO L226 Difference]: Without dead ends: 74 [2019-09-03 20:57:33,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2032, Invalid=2660, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 20:57:33,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-03 20:57:33,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-09-03 20:57:33,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-03 20:57:33,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-09-03 20:57:33,051 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2019-09-03 20:57:33,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:33,051 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-09-03 20:57:33,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 20:57:33,051 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-09-03 20:57:33,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-03 20:57:33,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:33,052 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:33,052 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:33,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:33,052 INFO L82 PathProgramCache]: Analyzing trace with hash 2108686621, now seen corresponding path program 31 times [2019-09-03 20:57:33,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:33,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:33,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:33,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:33,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:33,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:33,670 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:33,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:33,671 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:33,671 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:33,671 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:33,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:33,671 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:33,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:33,681 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:57:33,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:33,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 20:57:33,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:33,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:33,791 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:33,792 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:34,995 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:34,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:34,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 70 [2019-09-03 20:57:34,998 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:34,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-03 20:57:34,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-03 20:57:34,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2155, Invalid=2675, Unknown=0, NotChecked=0, Total=4830 [2019-09-03 20:57:35,000 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 38 states. [2019-09-03 20:57:35,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:35,103 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-09-03 20:57:35,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-03 20:57:35,103 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2019-09-03 20:57:35,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:35,104 INFO L225 Difference]: With dead ends: 79 [2019-09-03 20:57:35,105 INFO L226 Difference]: Without dead ends: 76 [2019-09-03 20:57:35,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2161, Invalid=2809, Unknown=0, NotChecked=0, Total=4970 [2019-09-03 20:57:35,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-03 20:57:35,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-09-03 20:57:35,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-03 20:57:35,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-09-03 20:57:35,108 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2019-09-03 20:57:35,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:35,109 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-09-03 20:57:35,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-03 20:57:35,109 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-09-03 20:57:35,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-03 20:57:35,109 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:35,110 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:35,110 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:35,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:35,110 INFO L82 PathProgramCache]: Analyzing trace with hash 356792889, now seen corresponding path program 32 times [2019-09-03 20:57:35,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:35,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:35,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:35,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:35,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:35,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:35,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:35,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:35,616 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:35,616 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:35,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:35,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:35,616 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:35,628 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:57:35,629 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:57:35,713 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-09-03 20:57:35,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:35,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-03 20:57:35,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:35,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:35,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:35,780 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:36,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:36,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:36,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 72 [2019-09-03 20:57:36,988 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:36,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-03 20:57:36,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-03 20:57:36,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2288, Invalid=2824, Unknown=0, NotChecked=0, Total=5112 [2019-09-03 20:57:36,989 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 39 states. [2019-09-03 20:57:37,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:37,072 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-09-03 20:57:37,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-03 20:57:37,078 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 74 [2019-09-03 20:57:37,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:37,079 INFO L225 Difference]: With dead ends: 81 [2019-09-03 20:57:37,079 INFO L226 Difference]: Without dead ends: 78 [2019-09-03 20:57:37,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2294, Invalid=2962, Unknown=0, NotChecked=0, Total=5256 [2019-09-03 20:57:37,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-03 20:57:37,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-09-03 20:57:37,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-03 20:57:37,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-09-03 20:57:37,081 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2019-09-03 20:57:37,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:37,082 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-09-03 20:57:37,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-03 20:57:37,082 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-09-03 20:57:37,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-03 20:57:37,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:37,082 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:37,083 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:37,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:37,083 INFO L82 PathProgramCache]: Analyzing trace with hash 414096469, now seen corresponding path program 33 times [2019-09-03 20:57:37,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:37,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:37,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:37,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:37,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:37,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:37,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:37,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:37,762 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:37,762 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:37,762 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:37,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:37,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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:57:37,778 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:57:37,778 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:37,828 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:57:37,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:37,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 20:57:37,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:37,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:37,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:37,874 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:39,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (34)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:57:39,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:39,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 74 [2019-09-03 20:57:39,186 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:39,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-03 20:57:39,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-03 20:57:39,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2019-09-03 20:57:39,187 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 40 states. [2019-09-03 20:57:39,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:39,303 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-09-03 20:57:39,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-03 20:57:39,303 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2019-09-03 20:57:39,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:39,303 INFO L225 Difference]: With dead ends: 83 [2019-09-03 20:57:39,304 INFO L226 Difference]: Without dead ends: 80 [2019-09-03 20:57:39,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2431, Invalid=3119, Unknown=0, NotChecked=0, Total=5550 [2019-09-03 20:57:39,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-03 20:57:39,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-09-03 20:57:39,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-03 20:57:39,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-09-03 20:57:39,307 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2019-09-03 20:57:39,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:39,307 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-09-03 20:57:39,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-03 20:57:39,307 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-09-03 20:57:39,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-03 20:57:39,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:39,308 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:39,308 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:39,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:39,308 INFO L82 PathProgramCache]: Analyzing trace with hash -351737999, now seen corresponding path program 34 times [2019-09-03 20:57:39,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:39,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:39,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:39,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:39,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:39,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:39,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:39,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:39,894 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:39,894 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:39,894 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:39,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:39,894 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:39,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:39,904 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:57:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:39,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-03 20:57:39,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:39,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:39,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:39,995 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:41,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:41,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:41,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 76 [2019-09-03 20:57:41,341 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:41,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-03 20:57:41,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-03 20:57:41,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2566, Invalid=3134, Unknown=0, NotChecked=0, Total=5700 [2019-09-03 20:57:41,343 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 41 states. [2019-09-03 20:57:41,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:41,439 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-09-03 20:57:41,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 20:57:41,439 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 78 [2019-09-03 20:57:41,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:41,440 INFO L225 Difference]: With dead ends: 85 [2019-09-03 20:57:41,440 INFO L226 Difference]: Without dead ends: 82 [2019-09-03 20:57:41,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2572, Invalid=3280, Unknown=0, NotChecked=0, Total=5852 [2019-09-03 20:57:41,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-03 20:57:41,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-09-03 20:57:41,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-03 20:57:41,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-09-03 20:57:41,444 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2019-09-03 20:57:41,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:41,445 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-09-03 20:57:41,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-03 20:57:41,445 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-09-03 20:57:41,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-03 20:57:41,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:41,446 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:41,446 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:41,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:41,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1879254131, now seen corresponding path program 35 times [2019-09-03 20:57:41,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:41,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:41,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:41,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:41,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:41,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:42,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:42,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:42,287 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:42,287 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:42,288 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:42,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:42,288 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:57:42,307 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:57:42,307 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:42,403 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-09-03 20:57:42,403 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:42,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 20:57:42,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:42,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:42,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:42,473 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:43,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:43,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:43,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 78 [2019-09-03 20:57:43,952 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:43,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-03 20:57:43,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-03 20:57:43,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2711, Invalid=3295, Unknown=0, NotChecked=0, Total=6006 [2019-09-03 20:57:43,953 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 42 states. [2019-09-03 20:57:44,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:44,093 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-09-03 20:57:44,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-03 20:57:44,094 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2019-09-03 20:57:44,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:44,095 INFO L225 Difference]: With dead ends: 87 [2019-09-03 20:57:44,095 INFO L226 Difference]: Without dead ends: 84 [2019-09-03 20:57:44,096 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2717, Invalid=3445, Unknown=0, NotChecked=0, Total=6162 [2019-09-03 20:57:44,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-09-03 20:57:44,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2019-09-03 20:57:44,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-03 20:57:44,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-09-03 20:57:44,105 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2019-09-03 20:57:44,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:44,108 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-09-03 20:57:44,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-03 20:57:44,109 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-09-03 20:57:44,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-03 20:57:44,109 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:44,109 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:44,110 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:44,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:44,110 INFO L82 PathProgramCache]: Analyzing trace with hash -943441751, now seen corresponding path program 36 times [2019-09-03 20:57:44,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:44,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:44,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:44,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:44,113 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:44,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:44,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:44,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:44,761 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:44,761 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:44,761 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:44,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:44,761 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:44,773 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:57:44,773 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:57:44,829 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:57:44,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:44,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-03 20:57:44,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:44,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:44,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:44,884 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:46,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:46,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:46,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 80 [2019-09-03 20:57:46,429 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:46,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-03 20:57:46,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-03 20:57:46,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2860, Invalid=3460, Unknown=0, NotChecked=0, Total=6320 [2019-09-03 20:57:46,431 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 43 states. [2019-09-03 20:57:46,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:46,527 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-09-03 20:57:46,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-03 20:57:46,528 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 82 [2019-09-03 20:57:46,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:46,529 INFO L225 Difference]: With dead ends: 89 [2019-09-03 20:57:46,529 INFO L226 Difference]: Without dead ends: 86 [2019-09-03 20:57:46,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2866, Invalid=3614, Unknown=0, NotChecked=0, Total=6480 [2019-09-03 20:57:46,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-09-03 20:57:46,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-09-03 20:57:46,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-03 20:57:46,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-09-03 20:57:46,532 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2019-09-03 20:57:46,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:46,533 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-09-03 20:57:46,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-03 20:57:46,533 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-09-03 20:57:46,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-03 20:57:46,533 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:46,534 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:46,534 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:46,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:46,534 INFO L82 PathProgramCache]: Analyzing trace with hash 724090565, now seen corresponding path program 37 times [2019-09-03 20:57:46,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:46,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:46,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:46,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:46,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:46,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:47,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:47,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:47,151 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:47,151 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:47,151 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:47,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:47,151 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:47,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:47,161 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:57:47,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:47,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 20:57:47,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:47,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:47,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:47,277 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:48,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:48,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:48,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 82 [2019-09-03 20:57:48,867 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:48,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-03 20:57:48,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-03 20:57:48,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3013, Invalid=3629, Unknown=0, NotChecked=0, Total=6642 [2019-09-03 20:57:48,868 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 44 states. [2019-09-03 20:57:48,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:48,988 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-09-03 20:57:48,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-03 20:57:48,988 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 84 [2019-09-03 20:57:48,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:48,989 INFO L225 Difference]: With dead ends: 91 [2019-09-03 20:57:48,989 INFO L226 Difference]: Without dead ends: 88 [2019-09-03 20:57:48,990 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3019, Invalid=3787, Unknown=0, NotChecked=0, Total=6806 [2019-09-03 20:57:48,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-03 20:57:48,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-09-03 20:57:48,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-03 20:57:48,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-09-03 20:57:48,994 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2019-09-03 20:57:48,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:48,994 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-09-03 20:57:48,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-03 20:57:48,995 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-09-03 20:57:48,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-03 20:57:48,996 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:48,996 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:48,996 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:48,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:48,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1199844833, now seen corresponding path program 38 times [2019-09-03 20:57:48,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:48,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:48,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:48,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:48,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:49,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:49,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:49,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:49,673 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:49,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:49,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:49,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 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:49,683 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:57:49,684 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:57:49,777 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-09-03 20:57:49,777 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:49,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-03 20:57:49,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:49,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:49,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:49,866 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:51,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (39)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:57:51,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:51,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 84 [2019-09-03 20:57:51,558 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:51,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-03 20:57:51,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-03 20:57:51,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3170, Invalid=3802, Unknown=0, NotChecked=0, Total=6972 [2019-09-03 20:57:51,560 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 45 states. [2019-09-03 20:57:51,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:51,674 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-09-03 20:57:51,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-03 20:57:51,674 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 86 [2019-09-03 20:57:51,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:51,675 INFO L225 Difference]: With dead ends: 93 [2019-09-03 20:57:51,675 INFO L226 Difference]: Without dead ends: 90 [2019-09-03 20:57:51,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3176, Invalid=3964, Unknown=0, NotChecked=0, Total=7140 [2019-09-03 20:57:51,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-03 20:57:51,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-09-03 20:57:51,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-09-03 20:57:51,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-09-03 20:57:51,679 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2019-09-03 20:57:51,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:51,680 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-09-03 20:57:51,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-03 20:57:51,680 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-09-03 20:57:51,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-03 20:57:51,680 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:51,681 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:51,681 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:51,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:51,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1161804291, now seen corresponding path program 39 times [2019-09-03 20:57:51,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:51,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:51,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:51,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:51,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:52,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:52,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:52,632 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:52,632 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:52,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:52,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:52,633 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:57:52,653 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:57:52,653 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:52,712 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:57:52,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:52,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-03 20:57:52,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:52,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:52,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:52,768 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:54,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:54,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:54,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 86 [2019-09-03 20:57:54,493 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:54,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-03 20:57:54,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-03 20:57:54,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3331, Invalid=3979, Unknown=0, NotChecked=0, Total=7310 [2019-09-03 20:57:54,494 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 46 states. [2019-09-03 20:57:54,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:54,599 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-09-03 20:57:54,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-03 20:57:54,599 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88 [2019-09-03 20:57:54,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:54,600 INFO L225 Difference]: With dead ends: 95 [2019-09-03 20:57:54,600 INFO L226 Difference]: Without dead ends: 92 [2019-09-03 20:57:54,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3337, Invalid=4145, Unknown=0, NotChecked=0, Total=7482 [2019-09-03 20:57:54,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-09-03 20:57:54,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-09-03 20:57:54,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-03 20:57:54,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-09-03 20:57:54,603 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2019-09-03 20:57:54,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:54,604 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-09-03 20:57:54,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-03 20:57:54,604 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-09-03 20:57:54,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-03 20:57:54,604 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:54,604 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:54,604 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:54,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:54,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1331087129, now seen corresponding path program 40 times [2019-09-03 20:57:54,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:54,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:54,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:57:54,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:54,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:55,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:55,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:55,302 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:55,302 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:55,302 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:55,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:55,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:55,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:55,313 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:57:55,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:55,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-03 20:57:55,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:55,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:55,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:55,440 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:57:57,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:57,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:57:57,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 88 [2019-09-03 20:57:57,281 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:57:57,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-03 20:57:57,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-03 20:57:57,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3496, Invalid=4160, Unknown=0, NotChecked=0, Total=7656 [2019-09-03 20:57:57,282 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 47 states. [2019-09-03 20:57:57,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:57:57,386 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-09-03 20:57:57,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-03 20:57:57,386 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 90 [2019-09-03 20:57:57,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:57:57,387 INFO L225 Difference]: With dead ends: 97 [2019-09-03 20:57:57,387 INFO L226 Difference]: Without dead ends: 94 [2019-09-03 20:57:57,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3502, Invalid=4330, Unknown=0, NotChecked=0, Total=7832 [2019-09-03 20:57:57,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-03 20:57:57,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-09-03 20:57:57,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-09-03 20:57:57,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-09-03 20:57:57,391 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2019-09-03 20:57:57,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:57:57,391 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-09-03 20:57:57,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-03 20:57:57,391 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-09-03 20:57:57,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-03 20:57:57,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:57:57,392 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:57:57,392 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:57:57,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:57:57,392 INFO L82 PathProgramCache]: Analyzing trace with hash 407990581, now seen corresponding path program 41 times [2019-09-03 20:57:57,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:57:57,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:57,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:57:57,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:57:57,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:57:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:57:58,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:58,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:58,117 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:57:58,118 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:57:58,118 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:57:58,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:57:58,118 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:57:58,128 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:57:58,128 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:57:58,231 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-09-03 20:57:58,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:57:58,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-03 20:57:58,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:57:58,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:57:58,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:57:58,282 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:00,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:00,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:00,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 90 [2019-09-03 20:58:00,226 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:00,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-03 20:58:00,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-03 20:58:00,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3665, Invalid=4345, Unknown=0, NotChecked=0, Total=8010 [2019-09-03 20:58:00,228 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 48 states. [2019-09-03 20:58:00,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:00,314 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-09-03 20:58:00,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-03 20:58:00,314 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 92 [2019-09-03 20:58:00,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:00,315 INFO L225 Difference]: With dead ends: 99 [2019-09-03 20:58:00,315 INFO L226 Difference]: Without dead ends: 96 [2019-09-03 20:58:00,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3671, Invalid=4519, Unknown=0, NotChecked=0, Total=8190 [2019-09-03 20:58:00,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-03 20:58:00,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-09-03 20:58:00,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-03 20:58:00,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-09-03 20:58:00,320 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2019-09-03 20:58:00,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:00,320 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-09-03 20:58:00,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-03 20:58:00,320 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-09-03 20:58:00,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-03 20:58:00,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:00,321 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:00,321 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:00,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:00,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1924529071, now seen corresponding path program 42 times [2019-09-03 20:58:00,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:00,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:00,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:00,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:00,323 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:00,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:01,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:01,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:01,244 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:01,244 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:01,244 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:01,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:01,244 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:01,254 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:58:01,254 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:58:01,315 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:58:01,315 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:01,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-03 20:58:01,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:01,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:01,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:01,390 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:03,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:03,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:03,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 92 [2019-09-03 20:58:03,938 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:03,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-03 20:58:03,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-03 20:58:03,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3838, Invalid=4534, Unknown=0, NotChecked=0, Total=8372 [2019-09-03 20:58:03,939 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 49 states. [2019-09-03 20:58:04,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:04,032 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-09-03 20:58:04,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-03 20:58:04,033 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 94 [2019-09-03 20:58:04,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:04,034 INFO L225 Difference]: With dead ends: 101 [2019-09-03 20:58:04,034 INFO L226 Difference]: Without dead ends: 98 [2019-09-03 20:58:04,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3844, Invalid=4712, Unknown=0, NotChecked=0, Total=8556 [2019-09-03 20:58:04,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-03 20:58:04,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-09-03 20:58:04,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-03 20:58:04,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-09-03 20:58:04,039 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2019-09-03 20:58:04,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:04,040 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-09-03 20:58:04,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-03 20:58:04,040 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-09-03 20:58:04,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-03 20:58:04,040 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:04,041 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:04,041 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:04,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:04,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1502986131, now seen corresponding path program 43 times [2019-09-03 20:58:04,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:04,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:04,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:04,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:04,042 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:04,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:04,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:04,933 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:04,933 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:04,933 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:04,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:04,933 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:04,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:04,945 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:58:05,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:05,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-03 20:58:05,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:05,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:05,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:05,060 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:07,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (44)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:58:07,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:07,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 94 [2019-09-03 20:58:07,138 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:07,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-03 20:58:07,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-03 20:58:07,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4015, Invalid=4727, Unknown=0, NotChecked=0, Total=8742 [2019-09-03 20:58:07,140 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 50 states. [2019-09-03 20:58:07,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:07,266 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-09-03 20:58:07,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-03 20:58:07,267 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2019-09-03 20:58:07,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:07,268 INFO L225 Difference]: With dead ends: 103 [2019-09-03 20:58:07,268 INFO L226 Difference]: Without dead ends: 100 [2019-09-03 20:58:07,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4021, Invalid=4909, Unknown=0, NotChecked=0, Total=8930 [2019-09-03 20:58:07,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-03 20:58:07,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2019-09-03 20:58:07,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-09-03 20:58:07,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-09-03 20:58:07,272 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2019-09-03 20:58:07,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:07,273 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-09-03 20:58:07,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-03 20:58:07,273 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-09-03 20:58:07,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-03 20:58:07,273 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:07,274 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:07,274 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:07,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:07,274 INFO L82 PathProgramCache]: Analyzing trace with hash -127146615, now seen corresponding path program 44 times [2019-09-03 20:58:07,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:07,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:07,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:07,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:07,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:08,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:08,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:08,106 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:08,106 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:08,106 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:08,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:08,106 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:08,116 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:58:08,116 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:58:08,229 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-09-03 20:58:08,229 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:08,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-03 20:58:08,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:08,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:08,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:08,302 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:10,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:10,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:10,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 96 [2019-09-03 20:58:10,480 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:10,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-03 20:58:10,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-03 20:58:10,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4196, Invalid=4924, Unknown=0, NotChecked=0, Total=9120 [2019-09-03 20:58:10,482 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 51 states. [2019-09-03 20:58:10,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:10,637 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-09-03 20:58:10,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-03 20:58:10,638 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 98 [2019-09-03 20:58:10,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:10,638 INFO L225 Difference]: With dead ends: 105 [2019-09-03 20:58:10,639 INFO L226 Difference]: Without dead ends: 102 [2019-09-03 20:58:10,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4202, Invalid=5110, Unknown=0, NotChecked=0, Total=9312 [2019-09-03 20:58:10,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-09-03 20:58:10,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-09-03 20:58:10,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-03 20:58:10,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-09-03 20:58:10,643 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2019-09-03 20:58:10,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:10,643 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-09-03 20:58:10,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-03 20:58:10,643 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-09-03 20:58:10,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-03 20:58:10,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:10,645 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:10,645 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:10,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:10,645 INFO L82 PathProgramCache]: Analyzing trace with hash -795298907, now seen corresponding path program 45 times [2019-09-03 20:58:10,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:10,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:10,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:10,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:10,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:10,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:11,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:11,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:11,661 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:11,661 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:11,662 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:11,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:11,662 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:58:11,679 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:58:11,680 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:11,746 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:58:11,746 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:11,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-03 20:58:11,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:11,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:11,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:11,848 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:14,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:14,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:14,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 98 [2019-09-03 20:58:14,104 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:14,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-03 20:58:14,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-03 20:58:14,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4381, Invalid=5125, Unknown=0, NotChecked=0, Total=9506 [2019-09-03 20:58:14,105 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 52 states. [2019-09-03 20:58:14,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:14,236 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-09-03 20:58:14,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-03 20:58:14,237 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 100 [2019-09-03 20:58:14,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:14,238 INFO L225 Difference]: With dead ends: 107 [2019-09-03 20:58:14,239 INFO L226 Difference]: Without dead ends: 104 [2019-09-03 20:58:14,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4387, Invalid=5315, Unknown=0, NotChecked=0, Total=9702 [2019-09-03 20:58:14,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-03 20:58:14,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-09-03 20:58:14,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-03 20:58:14,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-09-03 20:58:14,242 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2019-09-03 20:58:14,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:14,243 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-09-03 20:58:14,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-03 20:58:14,243 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-09-03 20:58:14,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-03 20:58:14,244 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:14,244 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:14,244 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:14,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:14,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1355442881, now seen corresponding path program 46 times [2019-09-03 20:58:14,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:14,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:14,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:14,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:14,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:15,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:15,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:15,495 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:15,496 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:15,496 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:15,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:15,496 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:15,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:15,532 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:58:15,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:15,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-03 20:58:15,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:15,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:15,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:15,662 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:18,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:18,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:18,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 100 [2019-09-03 20:58:18,107 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:18,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-03 20:58:18,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-03 20:58:18,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4570, Invalid=5330, Unknown=0, NotChecked=0, Total=9900 [2019-09-03 20:58:18,109 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 53 states. [2019-09-03 20:58:18,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:18,254 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-09-03 20:58:18,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-03 20:58:18,254 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 102 [2019-09-03 20:58:18,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:18,255 INFO L225 Difference]: With dead ends: 109 [2019-09-03 20:58:18,255 INFO L226 Difference]: Without dead ends: 106 [2019-09-03 20:58:18,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4576, Invalid=5524, Unknown=0, NotChecked=0, Total=10100 [2019-09-03 20:58:18,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-09-03 20:58:18,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-09-03 20:58:18,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-09-03 20:58:18,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-09-03 20:58:18,262 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2019-09-03 20:58:18,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:18,263 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-09-03 20:58:18,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-03 20:58:18,263 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-09-03 20:58:18,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-03 20:58:18,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:18,264 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:18,264 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:18,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:18,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1955935523, now seen corresponding path program 47 times [2019-09-03 20:58:18,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:18,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:18,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:18,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:18,266 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:18,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:19,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:19,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:19,226 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:19,226 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:19,226 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:19,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:19,226 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:19,236 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:58:19,236 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:58:19,349 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-09-03 20:58:19,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:19,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-03 20:58:19,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:19,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:19,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:19,404 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:21,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:21,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:21,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 102 [2019-09-03 20:58:21,905 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:21,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-03 20:58:21,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-03 20:58:21,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4763, Invalid=5539, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 20:58:21,907 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 54 states. [2019-09-03 20:58:22,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:22,056 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-09-03 20:58:22,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-03 20:58:22,057 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 104 [2019-09-03 20:58:22,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:22,058 INFO L225 Difference]: With dead ends: 111 [2019-09-03 20:58:22,058 INFO L226 Difference]: Without dead ends: 108 [2019-09-03 20:58:22,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4769, Invalid=5737, Unknown=0, NotChecked=0, Total=10506 [2019-09-03 20:58:22,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-09-03 20:58:22,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-09-03 20:58:22,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-09-03 20:58:22,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-09-03 20:58:22,063 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2019-09-03 20:58:22,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:22,063 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-09-03 20:58:22,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-03 20:58:22,063 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-09-03 20:58:22,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-03 20:58:22,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:22,064 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:22,064 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:22,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:22,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1619815431, now seen corresponding path program 48 times [2019-09-03 20:58:22,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:22,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:22,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:22,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:22,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:22,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:23,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:23,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:23,057 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:23,057 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:23,057 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:23,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:23,057 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:23,069 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:58:23,069 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:58:23,143 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:58:23,143 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:23,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-03 20:58:23,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:23,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:23,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:23,208 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:25,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:25,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:25,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 104 [2019-09-03 20:58:25,785 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:25,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-03 20:58:25,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-03 20:58:25,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4960, Invalid=5752, Unknown=0, NotChecked=0, Total=10712 [2019-09-03 20:58:25,788 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 55 states. [2019-09-03 20:58:25,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:25,899 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-09-03 20:58:25,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-03 20:58:25,899 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 106 [2019-09-03 20:58:25,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:25,900 INFO L225 Difference]: With dead ends: 113 [2019-09-03 20:58:25,900 INFO L226 Difference]: Without dead ends: 110 [2019-09-03 20:58:25,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4966, Invalid=5954, Unknown=0, NotChecked=0, Total=10920 [2019-09-03 20:58:25,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-03 20:58:25,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-09-03 20:58:25,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-09-03 20:58:25,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-09-03 20:58:25,904 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2019-09-03 20:58:25,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:25,905 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-09-03 20:58:25,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-03 20:58:25,905 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-09-03 20:58:25,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-03 20:58:25,906 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:25,906 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:25,906 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:25,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:25,906 INFO L82 PathProgramCache]: Analyzing trace with hash -730954219, now seen corresponding path program 49 times [2019-09-03 20:58:25,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:25,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:25,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:25,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:25,907 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:26,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:26,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:26,903 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:26,903 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:26,903 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:26,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:26,903 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:26,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:26,914 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:58:26,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:26,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-03 20:58:26,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:27,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:27,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:27,089 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:29,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:29,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:29,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 106 [2019-09-03 20:58:29,736 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:29,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-03 20:58:29,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-03 20:58:29,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5161, Invalid=5969, Unknown=0, NotChecked=0, Total=11130 [2019-09-03 20:58:29,737 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 56 states. [2019-09-03 20:58:29,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:29,868 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-09-03 20:58:29,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-03 20:58:29,868 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 108 [2019-09-03 20:58:29,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:29,870 INFO L225 Difference]: With dead ends: 115 [2019-09-03 20:58:29,870 INFO L226 Difference]: Without dead ends: 112 [2019-09-03 20:58:29,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5167, Invalid=6175, Unknown=0, NotChecked=0, Total=11342 [2019-09-03 20:58:29,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-03 20:58:29,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2019-09-03 20:58:29,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-09-03 20:58:29,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-09-03 20:58:29,874 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2019-09-03 20:58:29,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:29,874 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-09-03 20:58:29,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-03 20:58:29,874 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-09-03 20:58:29,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-03 20:58:29,875 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:29,875 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:29,875 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:29,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:29,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1233821391, now seen corresponding path program 50 times [2019-09-03 20:58:29,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:29,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:29,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:29,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:29,877 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:30,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:30,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:30,908 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:30,908 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:30,909 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:30,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:30,909 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:30,919 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:58:30,919 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:58:31,045 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-09-03 20:58:31,046 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:31,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-03 20:58:31,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:31,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:31,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:31,144 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:33,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:33,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:33,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 108 [2019-09-03 20:58:33,963 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:33,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-03 20:58:33,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-03 20:58:33,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5366, Invalid=6190, Unknown=0, NotChecked=0, Total=11556 [2019-09-03 20:58:33,965 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 57 states. [2019-09-03 20:58:34,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:34,099 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-09-03 20:58:34,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-03 20:58:34,100 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 110 [2019-09-03 20:58:34,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:34,101 INFO L225 Difference]: With dead ends: 117 [2019-09-03 20:58:34,101 INFO L226 Difference]: Without dead ends: 114 [2019-09-03 20:58:34,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5372, Invalid=6400, Unknown=0, NotChecked=0, Total=11772 [2019-09-03 20:58:34,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-03 20:58:34,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2019-09-03 20:58:34,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-09-03 20:58:34,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-09-03 20:58:34,106 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2019-09-03 20:58:34,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:34,106 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-09-03 20:58:34,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-03 20:58:34,107 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-09-03 20:58:34,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-03 20:58:34,107 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:34,107 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:34,107 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:34,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:34,108 INFO L82 PathProgramCache]: Analyzing trace with hash 842130765, now seen corresponding path program 51 times [2019-09-03 20:58:34,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:34,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:34,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:34,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:34,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:34,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:35,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:35,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:35,931 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:35,931 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:35,931 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:35,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:35,931 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:58:35,950 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:58:35,950 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:36,022 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:58:36,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:36,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-03 20:58:36,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:36,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:36,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:36,086 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:38,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:38,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:38,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 110 [2019-09-03 20:58:38,963 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:38,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-03 20:58:38,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-03 20:58:38,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5575, Invalid=6415, Unknown=0, NotChecked=0, Total=11990 [2019-09-03 20:58:38,969 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 58 states. [2019-09-03 20:58:39,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:39,081 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-09-03 20:58:39,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-03 20:58:39,081 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2019-09-03 20:58:39,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:39,082 INFO L225 Difference]: With dead ends: 119 [2019-09-03 20:58:39,082 INFO L226 Difference]: Without dead ends: 116 [2019-09-03 20:58:39,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5581, Invalid=6629, Unknown=0, NotChecked=0, Total=12210 [2019-09-03 20:58:39,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-03 20:58:39,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-09-03 20:58:39,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-03 20:58:39,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-09-03 20:58:39,086 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2019-09-03 20:58:39,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:39,086 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-09-03 20:58:39,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-03 20:58:39,087 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-09-03 20:58:39,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-03 20:58:39,087 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:39,087 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:39,088 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:39,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:39,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1327639959, now seen corresponding path program 52 times [2019-09-03 20:58:39,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:39,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:39,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:39,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:39,089 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:39,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:40,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:40,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:40,193 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:40,194 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:40,194 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:40,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:40,194 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:58:40,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:40,207 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:40,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:40,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-03 20:58:40,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:40,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:40,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:40,346 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:43,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:43,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:43,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 112 [2019-09-03 20:58:43,288 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:43,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-03 20:58:43,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-03 20:58:43,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5788, Invalid=6644, Unknown=0, NotChecked=0, Total=12432 [2019-09-03 20:58:43,290 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 59 states. [2019-09-03 20:58:43,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:43,401 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2019-09-03 20:58:43,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-03 20:58:43,402 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 114 [2019-09-03 20:58:43,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:43,403 INFO L225 Difference]: With dead ends: 121 [2019-09-03 20:58:43,403 INFO L226 Difference]: Without dead ends: 118 [2019-09-03 20:58:43,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5794, Invalid=6862, Unknown=0, NotChecked=0, Total=12656 [2019-09-03 20:58:43,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-03 20:58:43,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-09-03 20:58:43,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-09-03 20:58:43,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-09-03 20:58:43,407 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2019-09-03 20:58:43,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:43,407 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-09-03 20:58:43,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-03 20:58:43,408 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-09-03 20:58:43,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-03 20:58:43,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:43,408 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:43,409 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:43,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:43,409 INFO L82 PathProgramCache]: Analyzing trace with hash 876800133, now seen corresponding path program 53 times [2019-09-03 20:58:43,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:43,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:43,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:43,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:43,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:44,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:44,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:44,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:44,723 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:44,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:44,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:44,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:44,735 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:58:44,736 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:58:44,863 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-09-03 20:58:44,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:44,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-03 20:58:44,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:44,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:44,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:44,925 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:47,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:47,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:47,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 114 [2019-09-03 20:58:47,971 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:47,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-03 20:58:47,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-03 20:58:47,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6005, Invalid=6877, Unknown=0, NotChecked=0, Total=12882 [2019-09-03 20:58:47,973 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 60 states. [2019-09-03 20:58:48,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:48,092 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2019-09-03 20:58:48,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-03 20:58:48,093 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 116 [2019-09-03 20:58:48,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:48,095 INFO L225 Difference]: With dead ends: 123 [2019-09-03 20:58:48,095 INFO L226 Difference]: Without dead ends: 120 [2019-09-03 20:58:48,096 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6011, Invalid=7099, Unknown=0, NotChecked=0, Total=13110 [2019-09-03 20:58:48,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-03 20:58:48,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2019-09-03 20:58:48,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-03 20:58:48,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2019-09-03 20:58:48,099 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2019-09-03 20:58:48,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:48,099 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2019-09-03 20:58:48,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-03 20:58:48,100 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2019-09-03 20:58:48,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-03 20:58:48,100 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:48,100 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:48,101 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:48,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:48,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1924851617, now seen corresponding path program 54 times [2019-09-03 20:58:48,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:48,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:48,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:48,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:48,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:48,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:49,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:49,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:49,498 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:49,498 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:49,498 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:49,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:49,498 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:49,514 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:58:49,514 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:58:49,591 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:58:49,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:49,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-03 20:58:49,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:49,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:49,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:49,664 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:52,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:52,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:52,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 116 [2019-09-03 20:58:52,854 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:52,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-03 20:58:52,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-03 20:58:52,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6226, Invalid=7114, Unknown=0, NotChecked=0, Total=13340 [2019-09-03 20:58:52,856 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 61 states. [2019-09-03 20:58:53,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:53,005 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2019-09-03 20:58:53,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-03 20:58:53,005 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 118 [2019-09-03 20:58:53,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:53,008 INFO L225 Difference]: With dead ends: 125 [2019-09-03 20:58:53,008 INFO L226 Difference]: Without dead ends: 122 [2019-09-03 20:58:53,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6232, Invalid=7340, Unknown=0, NotChecked=0, Total=13572 [2019-09-03 20:58:53,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-09-03 20:58:53,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-09-03 20:58:53,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-09-03 20:58:53,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-09-03 20:58:53,012 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2019-09-03 20:58:53,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:53,012 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-09-03 20:58:53,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-03 20:58:53,013 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-09-03 20:58:53,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-03 20:58:53,013 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:53,013 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:53,014 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:53,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:53,014 INFO L82 PathProgramCache]: Analyzing trace with hash -214986819, now seen corresponding path program 55 times [2019-09-03 20:58:53,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:53,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:53,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:58:53,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:53,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:53,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:54,202 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:54,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:54,202 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:54,202 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:54,202 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:54,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:54,202 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:54,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:54,214 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:58:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:54,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-03 20:58:54,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:54,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:54,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:54,402 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:58:57,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:57,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:58:57,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 118 [2019-09-03 20:58:57,729 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:58:57,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-03 20:58:57,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-03 20:58:57,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6451, Invalid=7355, Unknown=0, NotChecked=0, Total=13806 [2019-09-03 20:58:57,731 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 62 states. [2019-09-03 20:58:57,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:58:57,881 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2019-09-03 20:58:57,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-03 20:58:57,881 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 120 [2019-09-03 20:58:57,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:58:57,882 INFO L225 Difference]: With dead ends: 127 [2019-09-03 20:58:57,883 INFO L226 Difference]: Without dead ends: 124 [2019-09-03 20:58:57,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6457, Invalid=7585, Unknown=0, NotChecked=0, Total=14042 [2019-09-03 20:58:57,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-09-03 20:58:57,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2019-09-03 20:58:57,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-09-03 20:58:57,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2019-09-03 20:58:57,887 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2019-09-03 20:58:57,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:58:57,888 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2019-09-03 20:58:57,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-03 20:58:57,888 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2019-09-03 20:58:57,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-03 20:58:57,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:58:57,889 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:58:57,889 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:58:57,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:58:57,889 INFO L82 PathProgramCache]: Analyzing trace with hash 689610969, now seen corresponding path program 56 times [2019-09-03 20:58:57,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:58:57,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:57,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:58:57,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:58:57,890 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:58:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:58:59,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:59,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:59,207 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:58:59,207 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:58:59,207 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:58:59,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:58:59,207 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:58:59,217 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:58:59,217 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:58:59,355 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-09-03 20:58:59,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:58:59,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-03 20:58:59,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:58:59,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:58:59,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:58:59,437 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:02,834 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:02,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:02,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 120 [2019-09-03 20:59:02,837 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:02,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-03 20:59:02,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-03 20:59:02,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6680, Invalid=7600, Unknown=0, NotChecked=0, Total=14280 [2019-09-03 20:59:02,840 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 63 states. [2019-09-03 20:59:02,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:02,973 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2019-09-03 20:59:02,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-03 20:59:02,973 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 122 [2019-09-03 20:59:02,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:02,974 INFO L225 Difference]: With dead ends: 129 [2019-09-03 20:59:02,974 INFO L226 Difference]: Without dead ends: 126 [2019-09-03 20:59:02,975 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6686, Invalid=7834, Unknown=0, NotChecked=0, Total=14520 [2019-09-03 20:59:02,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-09-03 20:59:02,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-09-03 20:59:02,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-09-03 20:59:02,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2019-09-03 20:59:02,978 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2019-09-03 20:59:02,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:02,978 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2019-09-03 20:59:02,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-03 20:59:02,979 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2019-09-03 20:59:02,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-03 20:59:02,979 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:02,980 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:02,980 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:02,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:02,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1870275851, now seen corresponding path program 57 times [2019-09-03 20:59:02,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:02,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:02,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:59:02,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:02,981 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:03,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:04,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:04,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:04,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:04,296 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:04,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:59:04,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:04,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:04,306 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:59:04,306 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:59:04,390 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:59:04,390 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:59:04,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-03 20:59:04,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:04,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:04,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:04,458 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:07,954 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:07,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:07,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 122 [2019-09-03 20:59:07,958 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:07,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-03 20:59:07,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-03 20:59:07,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6913, Invalid=7849, Unknown=0, NotChecked=0, Total=14762 [2019-09-03 20:59:07,960 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 64 states. [2019-09-03 20:59:08,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:08,120 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2019-09-03 20:59:08,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-03 20:59:08,121 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 124 [2019-09-03 20:59:08,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:08,122 INFO L225 Difference]: With dead ends: 131 [2019-09-03 20:59:08,122 INFO L226 Difference]: Without dead ends: 128 [2019-09-03 20:59:08,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6919, Invalid=8087, Unknown=0, NotChecked=0, Total=15006 [2019-09-03 20:59:08,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-03 20:59:08,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-09-03 20:59:08,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-09-03 20:59:08,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2019-09-03 20:59:08,127 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2019-09-03 20:59:08,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:08,127 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2019-09-03 20:59:08,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-03 20:59:08,128 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2019-09-03 20:59:08,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-03 20:59:08,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:08,129 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:08,129 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:08,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:08,129 INFO L82 PathProgramCache]: Analyzing trace with hash -905249263, now seen corresponding path program 58 times [2019-09-03 20:59:08,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:08,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:08,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:59:08,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:08,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:08,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:09,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:09,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:09,446 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:09,446 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:09,446 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:59:09,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:09,446 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:09,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:09,459 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:59:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:09,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-03 20:59:09,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:09,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:09,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:09,637 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:13,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:13,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:13,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 124 [2019-09-03 20:59:13,442 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:13,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-03 20:59:13,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-03 20:59:13,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7150, Invalid=8102, Unknown=0, NotChecked=0, Total=15252 [2019-09-03 20:59:13,444 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 65 states. [2019-09-03 20:59:13,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:13,599 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2019-09-03 20:59:13,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-03 20:59:13,600 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 126 [2019-09-03 20:59:13,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:13,601 INFO L225 Difference]: With dead ends: 133 [2019-09-03 20:59:13,601 INFO L226 Difference]: Without dead ends: 130 [2019-09-03 20:59:13,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7156, Invalid=8344, Unknown=0, NotChecked=0, Total=15500 [2019-09-03 20:59:13,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-09-03 20:59:13,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2019-09-03 20:59:13,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-09-03 20:59:13,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2019-09-03 20:59:13,605 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 126 [2019-09-03 20:59:13,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:13,606 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2019-09-03 20:59:13,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-03 20:59:13,606 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2019-09-03 20:59:13,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-03 20:59:13,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:13,607 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:13,607 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:13,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:13,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1227634131, now seen corresponding path program 59 times [2019-09-03 20:59:13,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:13,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:13,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:13,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:13,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:14,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:14,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:14,982 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:14,983 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:14,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:59:14,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:14,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 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:14,993 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:59:14,993 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:59:15,138 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-09-03 20:59:15,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:59:15,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 66 conjunts are in the unsatisfiable core [2019-09-03 20:59:15,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:15,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:15,223 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:15,223 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:18,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:18,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:18,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 126 [2019-09-03 20:59:18,989 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:18,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-03 20:59:18,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-03 20:59:18,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7391, Invalid=8359, Unknown=0, NotChecked=0, Total=15750 [2019-09-03 20:59:18,991 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 66 states. [2019-09-03 20:59:19,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:19,155 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-09-03 20:59:19,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-03 20:59:19,155 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 128 [2019-09-03 20:59:19,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:19,156 INFO L225 Difference]: With dead ends: 135 [2019-09-03 20:59:19,156 INFO L226 Difference]: Without dead ends: 132 [2019-09-03 20:59:19,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7397, Invalid=8605, Unknown=0, NotChecked=0, Total=16002 [2019-09-03 20:59:19,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-09-03 20:59:19,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2019-09-03 20:59:19,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-09-03 20:59:19,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2019-09-03 20:59:19,160 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 128 [2019-09-03 20:59:19,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:19,161 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2019-09-03 20:59:19,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-03 20:59:19,161 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2019-09-03 20:59:19,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-03 20:59:19,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:19,162 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:19,162 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:19,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:19,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1801846967, now seen corresponding path program 60 times [2019-09-03 20:59:19,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:19,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:19,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:59:19,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:19,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:19,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:20,602 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:20,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:20,602 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:20,602 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:20,602 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:59:20,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:20,603 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:20,613 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:59:20,613 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:59:20,705 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:59:20,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:59:20,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 67 conjunts are in the unsatisfiable core [2019-09-03 20:59:20,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:20,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:20,776 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:20,776 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:24,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:24,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:24,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 128 [2019-09-03 20:59:24,640 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:24,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-03 20:59:24,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-03 20:59:24,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7636, Invalid=8620, Unknown=0, NotChecked=0, Total=16256 [2019-09-03 20:59:24,642 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 67 states. [2019-09-03 20:59:24,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:24,805 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2019-09-03 20:59:24,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-03 20:59:24,805 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 130 [2019-09-03 20:59:24,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:24,806 INFO L225 Difference]: With dead ends: 137 [2019-09-03 20:59:24,806 INFO L226 Difference]: Without dead ends: 134 [2019-09-03 20:59:24,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7642, Invalid=8870, Unknown=0, NotChecked=0, Total=16512 [2019-09-03 20:59:24,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-09-03 20:59:24,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2019-09-03 20:59:24,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-09-03 20:59:24,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2019-09-03 20:59:24,810 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 130 [2019-09-03 20:59:24,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:24,810 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2019-09-03 20:59:24,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-03 20:59:24,810 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2019-09-03 20:59:24,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-03 20:59:24,811 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:24,811 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:24,811 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:24,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:24,811 INFO L82 PathProgramCache]: Analyzing trace with hash 430398821, now seen corresponding path program 61 times [2019-09-03 20:59:24,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:24,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:24,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:59:24,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:24,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:24,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:26,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:26,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:26,257 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:26,257 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:26,257 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:59:26,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:26,257 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:26,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:26,267 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:59:26,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:26,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-03 20:59:26,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:26,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:26,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:26,432 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:30,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:30,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:30,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 130 [2019-09-03 20:59:30,437 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:30,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-03 20:59:30,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-03 20:59:30,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7885, Invalid=8885, Unknown=0, NotChecked=0, Total=16770 [2019-09-03 20:59:30,441 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 68 states. [2019-09-03 20:59:30,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:30,611 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2019-09-03 20:59:30,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-03 20:59:30,611 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132 [2019-09-03 20:59:30,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:30,612 INFO L225 Difference]: With dead ends: 139 [2019-09-03 20:59:30,612 INFO L226 Difference]: Without dead ends: 136 [2019-09-03 20:59:30,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7891, Invalid=9139, Unknown=0, NotChecked=0, Total=17030 [2019-09-03 20:59:30,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-03 20:59:30,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2019-09-03 20:59:30,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-03 20:59:30,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2019-09-03 20:59:30,615 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 132 [2019-09-03 20:59:30,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:30,616 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2019-09-03 20:59:30,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-03 20:59:30,616 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2019-09-03 20:59:30,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-03 20:59:30,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:30,616 INFO L399 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:30,617 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:30,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:30,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1865046911, now seen corresponding path program 62 times [2019-09-03 20:59:30,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:30,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:30,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:30,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:30,618 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:32,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:32,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:32,339 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:32,339 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:32,339 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:59:32,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:32,339 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:32,350 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:59:32,350 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:59:32,496 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-09-03 20:59:32,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:59:32,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-03 20:59:32,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:32,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:32,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:32,594 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:36,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:36,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:36,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 132 [2019-09-03 20:59:36,746 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:36,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-03 20:59:36,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-03 20:59:36,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8138, Invalid=9154, Unknown=0, NotChecked=0, Total=17292 [2019-09-03 20:59:36,748 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 69 states. [2019-09-03 20:59:36,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:36,909 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2019-09-03 20:59:36,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-03 20:59:36,909 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 134 [2019-09-03 20:59:36,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:36,910 INFO L225 Difference]: With dead ends: 141 [2019-09-03 20:59:36,910 INFO L226 Difference]: Without dead ends: 138 [2019-09-03 20:59:36,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8144, Invalid=9412, Unknown=0, NotChecked=0, Total=17556 [2019-09-03 20:59:36,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-09-03 20:59:36,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2019-09-03 20:59:36,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-09-03 20:59:36,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2019-09-03 20:59:36,913 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 134 [2019-09-03 20:59:36,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:36,914 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2019-09-03 20:59:36,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-03 20:59:36,914 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2019-09-03 20:59:36,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-03 20:59:36,915 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:36,915 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:36,915 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:36,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:36,915 INFO L82 PathProgramCache]: Analyzing trace with hash -175205219, now seen corresponding path program 63 times [2019-09-03 20:59:36,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:36,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:36,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:59:36,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:36,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:36,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:38,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:38,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:38,405 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:38,405 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:38,405 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:59:38,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:38,405 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:38,415 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:59:38,415 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:59:38,506 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:59:38,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:59:38,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-03 20:59:38,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:38,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:38,582 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:38,582 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:42,926 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:42,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:42,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 134 [2019-09-03 20:59:42,929 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:42,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-03 20:59:42,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-03 20:59:42,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8395, Invalid=9427, Unknown=0, NotChecked=0, Total=17822 [2019-09-03 20:59:42,931 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 70 states. [2019-09-03 20:59:43,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:43,109 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2019-09-03 20:59:43,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-03 20:59:43,109 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 136 [2019-09-03 20:59:43,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:43,110 INFO L225 Difference]: With dead ends: 143 [2019-09-03 20:59:43,110 INFO L226 Difference]: Without dead ends: 140 [2019-09-03 20:59:43,111 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8401, Invalid=9689, Unknown=0, NotChecked=0, Total=18090 [2019-09-03 20:59:43,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-09-03 20:59:43,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2019-09-03 20:59:43,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-09-03 20:59:43,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2019-09-03 20:59:43,114 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 136 [2019-09-03 20:59:43,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:43,114 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2019-09-03 20:59:43,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-03 20:59:43,114 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2019-09-03 20:59:43,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-03 20:59:43,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:43,115 INFO L399 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:43,115 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:43,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:43,116 INFO L82 PathProgramCache]: Analyzing trace with hash 265022905, now seen corresponding path program 64 times [2019-09-03 20:59:43,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:43,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:43,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:59:43,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:43,117 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:43,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:44,663 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:44,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:44,664 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:44,664 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:44,664 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:59:44,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:44,664 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:44,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:44,676 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:59:44,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:44,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 728 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-03 20:59:44,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:44,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:44,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:44,901 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:49,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:49,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:49,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 136 [2019-09-03 20:59:49,362 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:49,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-03 20:59:49,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-03 20:59:49,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8656, Invalid=9704, Unknown=0, NotChecked=0, Total=18360 [2019-09-03 20:59:49,363 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 71 states. [2019-09-03 20:59:49,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:49,520 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2019-09-03 20:59:49,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-03 20:59:49,520 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 138 [2019-09-03 20:59:49,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:49,521 INFO L225 Difference]: With dead ends: 145 [2019-09-03 20:59:49,521 INFO L226 Difference]: Without dead ends: 142 [2019-09-03 20:59:49,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8662, Invalid=9970, Unknown=0, NotChecked=0, Total=18632 [2019-09-03 20:59:49,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-09-03 20:59:49,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2019-09-03 20:59:49,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-09-03 20:59:49,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-09-03 20:59:49,524 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 138 [2019-09-03 20:59:49,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:49,524 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2019-09-03 20:59:49,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-03 20:59:49,524 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2019-09-03 20:59:49,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-03 20:59:49,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:49,525 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:49,525 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:49,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:49,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1877512235, now seen corresponding path program 65 times [2019-09-03 20:59:49,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:49,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:49,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:59:49,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:49,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:51,106 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:51,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:51,106 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:51,106 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:51,106 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:59:51,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:51,107 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:51,116 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:59:51,116 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:59:51,284 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-09-03 20:59:51,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:59:51,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-03 20:59:51,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:51,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:51,363 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:51,364 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:59:55,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:55,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:59:55,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 138 [2019-09-03 20:59:55,902 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:59:55,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-03 20:59:55,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-03 20:59:55,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8921, Invalid=9985, Unknown=0, NotChecked=0, Total=18906 [2019-09-03 20:59:55,904 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 72 states. [2019-09-03 20:59:56,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:59:56,039 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2019-09-03 20:59:56,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-03 20:59:56,039 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 140 [2019-09-03 20:59:56,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:59:56,040 INFO L225 Difference]: With dead ends: 147 [2019-09-03 20:59:56,040 INFO L226 Difference]: Without dead ends: 144 [2019-09-03 20:59:56,041 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=8927, Invalid=10255, Unknown=0, NotChecked=0, Total=19182 [2019-09-03 20:59:56,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-09-03 20:59:56,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2019-09-03 20:59:56,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-09-03 20:59:56,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2019-09-03 20:59:56,044 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 140 [2019-09-03 20:59:56,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:59:56,044 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2019-09-03 20:59:56,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-03 20:59:56,045 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2019-09-03 20:59:56,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-03 20:59:56,045 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:59:56,045 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:59:56,046 INFO L418 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:59:56,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:59:56,046 INFO L82 PathProgramCache]: Analyzing trace with hash 730520305, now seen corresponding path program 66 times [2019-09-03 20:59:56,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:59:56,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:56,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:59:56,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:59:56,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:59:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:59:57,705 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:57,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:57,705 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:59:57,705 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:59:57,705 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:59:57,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:59:57,706 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:59:57,715 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:59:57,715 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:59:57,810 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:59:57,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:59:57,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 73 conjunts are in the unsatisfiable core [2019-09-03 20:59:57,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:59:57,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:59:57,886 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:59:57,887 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:02,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:00:02,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:02,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 140 [2019-09-03 21:00:02,596 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:02,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-03 21:00:02,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-03 21:00:02,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9190, Invalid=10270, Unknown=0, NotChecked=0, Total=19460 [2019-09-03 21:00:02,598 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 73 states. [2019-09-03 21:00:02,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:02,754 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2019-09-03 21:00:02,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-03 21:00:02,755 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 142 [2019-09-03 21:00:02,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:02,756 INFO L225 Difference]: With dead ends: 149 [2019-09-03 21:00:02,756 INFO L226 Difference]: Without dead ends: 146 [2019-09-03 21:00:02,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9196, Invalid=10544, Unknown=0, NotChecked=0, Total=19740 [2019-09-03 21:00:02,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-09-03 21:00:02,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-09-03 21:00:02,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-09-03 21:00:02,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2019-09-03 21:00:02,760 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 142 [2019-09-03 21:00:02,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:02,760 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2019-09-03 21:00:02,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-03 21:00:02,760 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2019-09-03 21:00:02,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-03 21:00:02,760 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:02,761 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:02,761 INFO L418 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:02,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:02,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1211109619, now seen corresponding path program 67 times [2019-09-03 21:00:02,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:02,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:02,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:00:02,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:02,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:02,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:04,463 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:00:04,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:04,463 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:04,463 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:04,464 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:00:04,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:04,464 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:04,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:00:04,474 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:00:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:04,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-03 21:00:04,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:04,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:04,647 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:00:04,648 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:09,491 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:00:09,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:09,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 142 [2019-09-03 21:00:09,494 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:09,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-03 21:00:09,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-03 21:00:09,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9463, Invalid=10559, Unknown=0, NotChecked=0, Total=20022 [2019-09-03 21:00:09,497 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 74 states. [2019-09-03 21:00:09,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:09,646 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2019-09-03 21:00:09,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-03 21:00:09,646 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 144 [2019-09-03 21:00:09,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:09,648 INFO L225 Difference]: With dead ends: 151 [2019-09-03 21:00:09,648 INFO L226 Difference]: Without dead ends: 148 [2019-09-03 21:00:09,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9469, Invalid=10837, Unknown=0, NotChecked=0, Total=20306 [2019-09-03 21:00:09,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-09-03 21:00:09,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2019-09-03 21:00:09,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-09-03 21:00:09,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2019-09-03 21:00:09,652 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 144 [2019-09-03 21:00:09,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:09,653 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2019-09-03 21:00:09,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-03 21:00:09,653 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2019-09-03 21:00:09,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-03 21:00:09,653 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:09,654 INFO L399 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:09,654 INFO L418 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:09,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:09,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1193307177, now seen corresponding path program 68 times [2019-09-03 21:00:09,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:09,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:09,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:00:09,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:09,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:11,432 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:00:11,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:11,432 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:11,432 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:11,432 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:00:11,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:11,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:11,444 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:00:11,444 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:00:11,617 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2019-09-03 21:00:11,617 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:00:11,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 75 conjunts are in the unsatisfiable core [2019-09-03 21:00:11,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:11,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:11,698 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:00:11,699 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:16,728 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:00:16,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:16,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 144 [2019-09-03 21:00:16,731 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:16,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-03 21:00:16,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-03 21:00:16,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9740, Invalid=10852, Unknown=0, NotChecked=0, Total=20592 [2019-09-03 21:00:16,733 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 75 states. [2019-09-03 21:00:16,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:16,883 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2019-09-03 21:00:16,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-03 21:00:16,883 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 146 [2019-09-03 21:00:16,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:16,884 INFO L225 Difference]: With dead ends: 153 [2019-09-03 21:00:16,885 INFO L226 Difference]: Without dead ends: 150 [2019-09-03 21:00:16,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=9746, Invalid=11134, Unknown=0, NotChecked=0, Total=20880 [2019-09-03 21:00:16,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-09-03 21:00:16,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-09-03 21:00:16,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-09-03 21:00:16,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2019-09-03 21:00:16,889 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 146 [2019-09-03 21:00:16,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:16,889 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2019-09-03 21:00:16,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-03 21:00:16,889 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2019-09-03 21:00:16,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-03 21:00:16,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:16,890 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:16,890 INFO L418 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:16,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:16,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1145442885, now seen corresponding path program 69 times [2019-09-03 21:00:16,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:16,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:16,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:00:16,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:16,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:16,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:18,674 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:00:18,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:18,675 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:18,675 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:18,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:00:18,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:18,675 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:18,685 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:00:18,686 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:00:18,784 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:00:18,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:00:18,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 783 conjuncts, 76 conjunts are in the unsatisfiable core [2019-09-03 21:00:18,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:18,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:18,900 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:00:18,900 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:24,016 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:00:24,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:24,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 146 [2019-09-03 21:00:24,019 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:24,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-03 21:00:24,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-03 21:00:24,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10021, Invalid=11149, Unknown=0, NotChecked=0, Total=21170 [2019-09-03 21:00:24,021 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 76 states. [2019-09-03 21:00:24,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:24,236 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-09-03 21:00:24,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-03 21:00:24,236 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 148 [2019-09-03 21:00:24,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:24,238 INFO L225 Difference]: With dead ends: 155 [2019-09-03 21:00:24,238 INFO L226 Difference]: Without dead ends: 152 [2019-09-03 21:00:24,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=10027, Invalid=11435, Unknown=0, NotChecked=0, Total=21462 [2019-09-03 21:00:24,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-03 21:00:24,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2019-09-03 21:00:24,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-09-03 21:00:24,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2019-09-03 21:00:24,242 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 148 [2019-09-03 21:00:24,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:24,243 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2019-09-03 21:00:24,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-03 21:00:24,243 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2019-09-03 21:00:24,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-03 21:00:24,244 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:24,244 INFO L399 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:24,244 INFO L418 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:24,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:24,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1902468767, now seen corresponding path program 70 times [2019-09-03 21:00:24,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:24,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:24,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:00:24,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:24,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:24,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:26,117 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:00:26,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:26,118 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:26,118 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:26,118 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:00:26,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:26,118 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:26,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:00:26,129 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:00:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:26,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-03 21:00:26,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:26,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:26,322 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:00:26,322 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:31,592 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:00:31,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:31,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 148 [2019-09-03 21:00:31,597 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:31,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-03 21:00:31,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-03 21:00:31,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10306, Invalid=11450, Unknown=0, NotChecked=0, Total=21756 [2019-09-03 21:00:31,599 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 77 states. [2019-09-03 21:00:31,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:31,763 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2019-09-03 21:00:31,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-03 21:00:31,764 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 150 [2019-09-03 21:00:31,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:31,765 INFO L225 Difference]: With dead ends: 157 [2019-09-03 21:00:31,765 INFO L226 Difference]: Without dead ends: 154 [2019-09-03 21:00:31,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=10312, Invalid=11740, Unknown=0, NotChecked=0, Total=22052 [2019-09-03 21:00:31,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-09-03 21:00:31,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2019-09-03 21:00:31,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-09-03 21:00:31,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2019-09-03 21:00:31,769 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 150 [2019-09-03 21:00:31,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:31,769 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2019-09-03 21:00:31,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-03 21:00:31,769 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2019-09-03 21:00:31,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-03 21:00:31,770 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:31,770 INFO L399 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:31,771 INFO L418 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:31,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:31,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1777870467, now seen corresponding path program 71 times [2019-09-03 21:00:31,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:31,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:31,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:00:31,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:31,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:31,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:33,673 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:00:33,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:33,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:33,673 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:33,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:00:33,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:33,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:33,682 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:00:33,682 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:00:33,863 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2019-09-03 21:00:33,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:00:33,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-03 21:00:33,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:33,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:33,947 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:00:33,948 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:39,414 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:00:39,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:39,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 150 [2019-09-03 21:00:39,418 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:39,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-03 21:00:39,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-03 21:00:39,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10595, Invalid=11755, Unknown=0, NotChecked=0, Total=22350 [2019-09-03 21:00:39,420 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 78 states. [2019-09-03 21:00:39,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:39,693 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2019-09-03 21:00:39,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-03 21:00:39,693 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 152 [2019-09-03 21:00:39,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:39,695 INFO L225 Difference]: With dead ends: 159 [2019-09-03 21:00:39,695 INFO L226 Difference]: Without dead ends: 156 [2019-09-03 21:00:39,696 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=10601, Invalid=12049, Unknown=0, NotChecked=0, Total=22650 [2019-09-03 21:00:39,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-09-03 21:00:39,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2019-09-03 21:00:39,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-09-03 21:00:39,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2019-09-03 21:00:39,700 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 152 [2019-09-03 21:00:39,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:39,701 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2019-09-03 21:00:39,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-03 21:00:39,701 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2019-09-03 21:00:39,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-03 21:00:39,702 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:39,703 INFO L399 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:39,703 INFO L418 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:39,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:39,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1996978841, now seen corresponding path program 72 times [2019-09-03 21:00:39,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:39,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:39,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:00:39,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:39,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:39,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:41,916 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:00:41,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:41,917 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:41,917 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:41,917 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:00:41,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:41,917 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:41,928 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:00:41,929 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:00:42,033 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:00:42,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:00:42,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 79 conjunts are in the unsatisfiable core [2019-09-03 21:00:42,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:42,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:42,116 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:00:42,116 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:47,686 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:00:47,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:47,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 152 [2019-09-03 21:00:47,690 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:47,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-03 21:00:47,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-03 21:00:47,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10888, Invalid=12064, Unknown=0, NotChecked=0, Total=22952 [2019-09-03 21:00:47,692 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 79 states. [2019-09-03 21:00:47,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:47,911 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2019-09-03 21:00:47,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-03 21:00:47,912 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 154 [2019-09-03 21:00:47,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:47,913 INFO L225 Difference]: With dead ends: 161 [2019-09-03 21:00:47,913 INFO L226 Difference]: Without dead ends: 158 [2019-09-03 21:00:47,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=10894, Invalid=12362, Unknown=0, NotChecked=0, Total=23256 [2019-09-03 21:00:47,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-09-03 21:00:47,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2019-09-03 21:00:47,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-09-03 21:00:47,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2019-09-03 21:00:47,917 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 154 [2019-09-03 21:00:47,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:47,917 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2019-09-03 21:00:47,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-03 21:00:47,917 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2019-09-03 21:00:47,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-03 21:00:47,918 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:47,918 INFO L399 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:47,918 INFO L418 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:47,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:47,919 INFO L82 PathProgramCache]: Analyzing trace with hash 379798709, now seen corresponding path program 73 times [2019-09-03 21:00:47,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:47,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:47,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:00:47,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:47,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:47,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:49,972 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:00:49,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:49,973 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:49,973 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:49,973 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:00:49,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:49,973 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:49,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:00:49,985 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:00:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:50,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 827 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-03 21:00:50,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:50,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:50,171 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:00:50,171 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:00:55,877 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:00:55,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:00:55,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 154 [2019-09-03 21:00:55,881 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:00:55,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-09-03 21:00:55,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-09-03 21:00:55,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11185, Invalid=12377, Unknown=0, NotChecked=0, Total=23562 [2019-09-03 21:00:55,882 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 80 states. [2019-09-03 21:00:56,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:00:56,048 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2019-09-03 21:00:56,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-09-03 21:00:56,049 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 156 [2019-09-03 21:00:56,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:00:56,049 INFO L225 Difference]: With dead ends: 163 [2019-09-03 21:00:56,050 INFO L226 Difference]: Without dead ends: 160 [2019-09-03 21:00:56,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=11191, Invalid=12679, Unknown=0, NotChecked=0, Total=23870 [2019-09-03 21:00:56,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-09-03 21:00:56,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2019-09-03 21:00:56,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-09-03 21:00:56,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2019-09-03 21:00:56,053 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 156 [2019-09-03 21:00:56,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:00:56,054 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2019-09-03 21:00:56,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-09-03 21:00:56,054 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2019-09-03 21:00:56,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-03 21:00:56,054 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:00:56,054 INFO L399 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:00:56,055 INFO L418 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:00:56,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:00:56,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1047853009, now seen corresponding path program 74 times [2019-09-03 21:00:56,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:00:56,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:56,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:00:56,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:00:56,056 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:00:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:00:58,136 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:00:58,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:58,136 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:00:58,136 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:00:58,136 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:00:58,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:00:58,136 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:00:58,147 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:00:58,147 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:00:58,343 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2019-09-03 21:00:58,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:00:58,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 81 conjunts are in the unsatisfiable core [2019-09-03 21:00:58,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:00:58,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:00:58,430 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:00:58,430 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:01:04,421 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:01:04,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:01:04,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 156 [2019-09-03 21:01:04,425 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:01:04,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-03 21:01:04,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-03 21:01:04,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11486, Invalid=12694, Unknown=0, NotChecked=0, Total=24180 [2019-09-03 21:01:04,427 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 81 states. [2019-09-03 21:01:04,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:01:04,606 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2019-09-03 21:01:04,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-03 21:01:04,607 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 158 [2019-09-03 21:01:04,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:01:04,608 INFO L225 Difference]: With dead ends: 165 [2019-09-03 21:01:04,608 INFO L226 Difference]: Without dead ends: 162 [2019-09-03 21:01:04,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=11492, Invalid=13000, Unknown=0, NotChecked=0, Total=24492 [2019-09-03 21:01:04,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-03 21:01:04,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2019-09-03 21:01:04,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-09-03 21:01:04,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2019-09-03 21:01:04,612 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 158 [2019-09-03 21:01:04,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:01:04,613 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2019-09-03 21:01:04,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-03 21:01:04,613 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2019-09-03 21:01:04,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-03 21:01:04,614 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:01:04,614 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:01:04,614 INFO L418 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:01:04,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:01:04,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1197059091, now seen corresponding path program 75 times [2019-09-03 21:01:04,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:01:04,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:04,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:01:04,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:04,615 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:01:04,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:06,702 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:01:06,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:06,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:01:06,702 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:01:06,702 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:01:06,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:06,703 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:01:06,713 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:01:06,713 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:01:06,818 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:01:06,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:01:06,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 849 conjuncts, 82 conjunts are in the unsatisfiable core [2019-09-03 21:01:06,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:01:06,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:06,922 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:01:06,922 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:01:12,947 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:01:12,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:01:12,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 158 [2019-09-03 21:01:12,951 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:01:12,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-03 21:01:12,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-03 21:01:12,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11791, Invalid=13015, Unknown=0, NotChecked=0, Total=24806 [2019-09-03 21:01:12,953 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 82 states. [2019-09-03 21:01:13,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:01:13,191 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2019-09-03 21:01:13,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-09-03 21:01:13,191 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 160 [2019-09-03 21:01:13,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:01:13,192 INFO L225 Difference]: With dead ends: 167 [2019-09-03 21:01:13,192 INFO L226 Difference]: Without dead ends: 164 [2019-09-03 21:01:13,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=11797, Invalid=13325, Unknown=0, NotChecked=0, Total=25122 [2019-09-03 21:01:13,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-09-03 21:01:13,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2019-09-03 21:01:13,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-09-03 21:01:13,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2019-09-03 21:01:13,195 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 160 [2019-09-03 21:01:13,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:01:13,195 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2019-09-03 21:01:13,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-03 21:01:13,196 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2019-09-03 21:01:13,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-03 21:01:13,197 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:01:13,197 INFO L399 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:01:13,197 INFO L418 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:01:13,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:01:13,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1810962697, now seen corresponding path program 76 times [2019-09-03 21:01:13,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:01:13,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:13,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:01:13,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:13,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:01:13,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:15,467 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:01:15,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:15,467 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:01:15,467 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:01:15,467 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:01:15,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:15,468 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:01:15,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:01:15,478 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:01:15,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:15,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 860 conjuncts, 83 conjunts are in the unsatisfiable core [2019-09-03 21:01:15,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:01:15,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:15,681 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:01:15,682 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:01:21,834 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:01:21,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:01:21,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 160 [2019-09-03 21:01:21,837 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:01:21,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-09-03 21:01:21,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-09-03 21:01:21,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12100, Invalid=13340, Unknown=0, NotChecked=0, Total=25440 [2019-09-03 21:01:21,839 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 83 states. [2019-09-03 21:01:22,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:01:22,091 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2019-09-03 21:01:22,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-03 21:01:22,091 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 162 [2019-09-03 21:01:22,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:01:22,092 INFO L225 Difference]: With dead ends: 169 [2019-09-03 21:01:22,092 INFO L226 Difference]: Without dead ends: 166 [2019-09-03 21:01:22,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=12106, Invalid=13654, Unknown=0, NotChecked=0, Total=25760 [2019-09-03 21:01:22,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-09-03 21:01:22,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2019-09-03 21:01:22,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-09-03 21:01:22,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2019-09-03 21:01:22,095 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 162 [2019-09-03 21:01:22,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:01:22,095 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2019-09-03 21:01:22,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-09-03 21:01:22,095 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2019-09-03 21:01:22,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-03 21:01:22,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:01:22,096 INFO L399 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:01:22,096 INFO L418 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:01:22,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:01:22,097 INFO L82 PathProgramCache]: Analyzing trace with hash 2006910757, now seen corresponding path program 77 times [2019-09-03 21:01:22,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:01:22,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:22,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:01:22,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:22,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:01:22,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:24,289 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:01:24,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:24,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:01:24,290 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:01:24,290 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:01:24,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:24,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:01:24,300 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:01:24,300 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:01:24,498 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2019-09-03 21:01:24,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:01:24,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 871 conjuncts, 84 conjunts are in the unsatisfiable core [2019-09-03 21:01:24,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:01:24,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:24,593 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:01:24,594 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:01:30,905 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:01:30,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:01:30,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 162 [2019-09-03 21:01:30,909 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:01:30,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-09-03 21:01:30,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-09-03 21:01:30,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12413, Invalid=13669, Unknown=0, NotChecked=0, Total=26082 [2019-09-03 21:01:30,912 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 84 states. [2019-09-03 21:01:31,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:01:31,084 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2019-09-03 21:01:31,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-09-03 21:01:31,085 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 164 [2019-09-03 21:01:31,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:01:31,086 INFO L225 Difference]: With dead ends: 171 [2019-09-03 21:01:31,086 INFO L226 Difference]: Without dead ends: 168 [2019-09-03 21:01:31,087 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=12419, Invalid=13987, Unknown=0, NotChecked=0, Total=26406 [2019-09-03 21:01:31,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-03 21:01:31,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2019-09-03 21:01:31,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-03 21:01:31,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2019-09-03 21:01:31,090 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 164 [2019-09-03 21:01:31,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:01:31,091 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2019-09-03 21:01:31,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-09-03 21:01:31,091 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2019-09-03 21:01:31,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-03 21:01:31,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:01:31,091 INFO L399 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:01:31,092 INFO L418 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:01:31,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:01:31,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1334435393, now seen corresponding path program 78 times [2019-09-03 21:01:31,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:01:31,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:31,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:01:31,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:31,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:01:31,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:33,388 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:01:33,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:33,388 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:01:33,389 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:01:33,389 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:01:33,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:33,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 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:01:33,399 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:01:33,400 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:01:33,513 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:01:33,513 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:01:33,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 882 conjuncts, 85 conjunts are in the unsatisfiable core [2019-09-03 21:01:33,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:01:33,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:33,603 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:01:33,603 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:01:40,057 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:01:40,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:01:40,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 164 [2019-09-03 21:01:40,061 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:01:40,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-09-03 21:01:40,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-09-03 21:01:40,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12730, Invalid=14002, Unknown=0, NotChecked=0, Total=26732 [2019-09-03 21:01:40,064 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 85 states. [2019-09-03 21:01:40,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:01:40,324 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2019-09-03 21:01:40,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-03 21:01:40,325 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 166 [2019-09-03 21:01:40,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:01:40,326 INFO L225 Difference]: With dead ends: 173 [2019-09-03 21:01:40,326 INFO L226 Difference]: Without dead ends: 170 [2019-09-03 21:01:40,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=12736, Invalid=14324, Unknown=0, NotChecked=0, Total=27060 [2019-09-03 21:01:40,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-09-03 21:01:40,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2019-09-03 21:01:40,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-09-03 21:01:40,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2019-09-03 21:01:40,330 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 166 [2019-09-03 21:01:40,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:01:40,331 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2019-09-03 21:01:40,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-09-03 21:01:40,331 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2019-09-03 21:01:40,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-03 21:01:40,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:01:40,331 INFO L399 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:01:40,332 INFO L418 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:01:40,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:01:40,332 INFO L82 PathProgramCache]: Analyzing trace with hash -669295011, now seen corresponding path program 79 times [2019-09-03 21:01:40,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:01:40,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:40,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:01:40,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:40,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:01:40,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:42,630 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:01:42,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:42,630 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:01:42,630 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:01:42,630 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:01:42,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:42,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 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:01:42,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:01:42,641 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:01:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:42,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 893 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-03 21:01:42,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:01:42,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:42,849 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:01:42,849 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:01:49,487 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:01:49,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:01:49,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 166 [2019-09-03 21:01:49,490 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:01:49,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-09-03 21:01:49,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-09-03 21:01:49,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13051, Invalid=14339, Unknown=0, NotChecked=0, Total=27390 [2019-09-03 21:01:49,492 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 86 states. [2019-09-03 21:01:49,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:01:49,754 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2019-09-03 21:01:49,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-03 21:01:49,754 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 168 [2019-09-03 21:01:49,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:01:49,755 INFO L225 Difference]: With dead ends: 175 [2019-09-03 21:01:49,756 INFO L226 Difference]: Without dead ends: 172 [2019-09-03 21:01:49,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=13057, Invalid=14665, Unknown=0, NotChecked=0, Total=27722 [2019-09-03 21:01:49,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-09-03 21:01:49,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2019-09-03 21:01:49,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-09-03 21:01:49,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2019-09-03 21:01:49,759 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 168 [2019-09-03 21:01:49,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:01:49,760 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2019-09-03 21:01:49,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-09-03 21:01:49,760 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2019-09-03 21:01:49,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-03 21:01:49,760 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:01:49,760 INFO L399 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:01:49,761 INFO L418 AbstractCegarLoop]: === Iteration 82 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:01:49,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:01:49,761 INFO L82 PathProgramCache]: Analyzing trace with hash -2108864647, now seen corresponding path program 80 times [2019-09-03 21:01:49,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:01:49,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:49,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:01:49,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:49,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:01:49,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:01:52,107 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:01:52,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:52,108 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:01:52,108 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:01:52,108 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:01:52,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:01:52,108 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:01:52,119 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:01:52,119 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:01:52,338 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2019-09-03 21:01:52,339 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:01:52,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 904 conjuncts, 87 conjunts are in the unsatisfiable core [2019-09-03 21:01:52,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:01:52,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:01:52,431 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:01:52,431 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:01:59,222 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:01:59,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:01:59,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 168 [2019-09-03 21:01:59,226 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:01:59,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-09-03 21:01:59,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-09-03 21:01:59,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13376, Invalid=14680, Unknown=0, NotChecked=0, Total=28056 [2019-09-03 21:01:59,228 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 87 states. [2019-09-03 21:01:59,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:01:59,459 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2019-09-03 21:01:59,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-09-03 21:01:59,459 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 170 [2019-09-03 21:01:59,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:01:59,461 INFO L225 Difference]: With dead ends: 177 [2019-09-03 21:01:59,461 INFO L226 Difference]: Without dead ends: 174 [2019-09-03 21:01:59,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=13382, Invalid=15010, Unknown=0, NotChecked=0, Total=28392 [2019-09-03 21:01:59,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-09-03 21:01:59,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2019-09-03 21:01:59,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-09-03 21:01:59,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2019-09-03 21:01:59,465 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 170 [2019-09-03 21:01:59,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:01:59,465 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2019-09-03 21:01:59,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-09-03 21:01:59,466 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2019-09-03 21:01:59,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-03 21:01:59,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:01:59,467 INFO L399 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:01:59,467 INFO L418 AbstractCegarLoop]: === Iteration 83 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:01:59,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:01:59,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1739151765, now seen corresponding path program 81 times [2019-09-03 21:01:59,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:01:59,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:59,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:01:59,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:01:59,468 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:01:59,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:01,880 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:02:01,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:01,881 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:02:01,881 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:02:01,881 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:02:01,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:01,881 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:02:01,892 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:02:01,892 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:02:02,007 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:02:02,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:02:02,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 915 conjuncts, 88 conjunts are in the unsatisfiable core [2019-09-03 21:02:02,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:02:02,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:02,102 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:02:02,102 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:02:09,073 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:02:09,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:02:09,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 170 [2019-09-03 21:02:09,077 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:02:09,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-09-03 21:02:09,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-09-03 21:02:09,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13705, Invalid=15025, Unknown=0, NotChecked=0, Total=28730 [2019-09-03 21:02:09,078 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 88 states. [2019-09-03 21:02:09,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:02:09,298 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2019-09-03 21:02:09,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-09-03 21:02:09,298 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 172 [2019-09-03 21:02:09,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:02:09,299 INFO L225 Difference]: With dead ends: 179 [2019-09-03 21:02:09,299 INFO L226 Difference]: Without dead ends: 176 [2019-09-03 21:02:09,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=13711, Invalid=15359, Unknown=0, NotChecked=0, Total=29070 [2019-09-03 21:02:09,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-09-03 21:02:09,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2019-09-03 21:02:09,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-03 21:02:09,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2019-09-03 21:02:09,303 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 172 [2019-09-03 21:02:09,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:02:09,303 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2019-09-03 21:02:09,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-09-03 21:02:09,304 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2019-09-03 21:02:09,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-03 21:02:09,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:02:09,305 INFO L399 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:02:09,305 INFO L418 AbstractCegarLoop]: === Iteration 84 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:02:09,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:02:09,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1716081841, now seen corresponding path program 82 times [2019-09-03 21:02:09,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:02:09,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:09,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:02:09,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:09,306 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:02:09,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:11,778 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:02:11,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:11,778 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:02:11,778 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:02:11,779 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:02:11,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:11,779 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:02:11,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:02:11,789 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:02:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:11,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 926 conjuncts, 89 conjunts are in the unsatisfiable core [2019-09-03 21:02:11,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:02:11,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:12,015 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:02:12,016 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:02:19,192 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:02:19,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:02:19,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 172 [2019-09-03 21:02:19,195 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:02:19,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-09-03 21:02:19,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-09-03 21:02:19,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14038, Invalid=15374, Unknown=0, NotChecked=0, Total=29412 [2019-09-03 21:02:19,198 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 89 states. [2019-09-03 21:02:19,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:02:19,464 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2019-09-03 21:02:19,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-03 21:02:19,465 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 174 [2019-09-03 21:02:19,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:02:19,466 INFO L225 Difference]: With dead ends: 181 [2019-09-03 21:02:19,466 INFO L226 Difference]: Without dead ends: 178 [2019-09-03 21:02:19,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=14044, Invalid=15712, Unknown=0, NotChecked=0, Total=29756 [2019-09-03 21:02:19,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-09-03 21:02:19,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2019-09-03 21:02:19,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-03 21:02:19,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2019-09-03 21:02:19,470 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 174 [2019-09-03 21:02:19,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:02:19,470 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2019-09-03 21:02:19,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-09-03 21:02:19,470 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2019-09-03 21:02:19,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-03 21:02:19,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:02:19,471 INFO L399 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:02:19,472 INFO L418 AbstractCegarLoop]: === Iteration 85 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:02:19,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:02:19,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1020721357, now seen corresponding path program 83 times [2019-09-03 21:02:19,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:02:19,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:19,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:02:19,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:19,473 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:02:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:21,981 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:02:21,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:21,981 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:02:21,981 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:02:21,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:02:21,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:21,982 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 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:02:21,991 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:02:21,991 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:02:22,216 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2019-09-03 21:02:22,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:02:22,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 937 conjuncts, 90 conjunts are in the unsatisfiable core [2019-09-03 21:02:22,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:02:22,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:22,317 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:02:22,317 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:02:29,609 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:02:29,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:02:29,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 174 [2019-09-03 21:02:29,614 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:02:29,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-09-03 21:02:29,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-09-03 21:02:29,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14375, Invalid=15727, Unknown=0, NotChecked=0, Total=30102 [2019-09-03 21:02:29,616 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 90 states. [2019-09-03 21:02:29,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:02:29,893 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2019-09-03 21:02:29,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-09-03 21:02:29,893 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 176 [2019-09-03 21:02:29,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:02:29,895 INFO L225 Difference]: With dead ends: 183 [2019-09-03 21:02:29,895 INFO L226 Difference]: Without dead ends: 180 [2019-09-03 21:02:29,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=14381, Invalid=16069, Unknown=0, NotChecked=0, Total=30450 [2019-09-03 21:02:29,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-03 21:02:29,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 179. [2019-09-03 21:02:29,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-09-03 21:02:29,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2019-09-03 21:02:29,900 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 176 [2019-09-03 21:02:29,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:02:29,900 INFO L475 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2019-09-03 21:02:29,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-09-03 21:02:29,900 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2019-09-03 21:02:29,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-03 21:02:29,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:02:29,901 INFO L399 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:02:29,902 INFO L418 AbstractCegarLoop]: === Iteration 86 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:02:29,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:02:29,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1500772887, now seen corresponding path program 84 times [2019-09-03 21:02:29,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:02:29,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:29,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:02:29,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:29,903 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:02:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:32,506 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:02:32,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:32,507 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:02:32,507 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:02:32,507 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:02:32,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:32,507 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 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:02:32,517 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:02:32,518 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:02:32,639 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:02:32,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:02:32,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 948 conjuncts, 91 conjunts are in the unsatisfiable core [2019-09-03 21:02:32,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:02:32,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:32,736 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:02:32,736 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:02:40,204 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:02:40,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:02:40,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 176 [2019-09-03 21:02:40,208 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:02:40,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-09-03 21:02:40,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-09-03 21:02:40,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14716, Invalid=16084, Unknown=0, NotChecked=0, Total=30800 [2019-09-03 21:02:40,214 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 91 states. [2019-09-03 21:02:40,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:02:40,404 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2019-09-03 21:02:40,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-03 21:02:40,405 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 178 [2019-09-03 21:02:40,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:02:40,406 INFO L225 Difference]: With dead ends: 185 [2019-09-03 21:02:40,406 INFO L226 Difference]: Without dead ends: 182 [2019-09-03 21:02:40,407 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=14722, Invalid=16430, Unknown=0, NotChecked=0, Total=31152 [2019-09-03 21:02:40,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-03 21:02:40,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2019-09-03 21:02:40,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-09-03 21:02:40,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2019-09-03 21:02:40,410 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 178 [2019-09-03 21:02:40,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:02:40,411 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2019-09-03 21:02:40,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-09-03 21:02:40,411 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2019-09-03 21:02:40,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-03 21:02:40,412 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:02:40,412 INFO L399 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:02:40,412 INFO L418 AbstractCegarLoop]: === Iteration 87 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:02:40,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:02:40,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1999780869, now seen corresponding path program 85 times [2019-09-03 21:02:40,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:02:40,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:40,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:02:40,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:40,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:02:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:43,048 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:02:43,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:43,048 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:02:43,049 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:02:43,049 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:02:43,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:43,049 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 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:02:43,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:02:43,060 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:02:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:43,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 959 conjuncts, 92 conjunts are in the unsatisfiable core [2019-09-03 21:02:43,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:02:43,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:43,303 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:02:43,303 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:02:50,951 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:02:50,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:02:50,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 178 [2019-09-03 21:02:50,955 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:02:50,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-09-03 21:02:50,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-09-03 21:02:50,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15061, Invalid=16445, Unknown=0, NotChecked=0, Total=31506 [2019-09-03 21:02:50,958 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 92 states. [2019-09-03 21:02:51,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:02:51,244 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2019-09-03 21:02:51,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-03 21:02:51,245 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 180 [2019-09-03 21:02:51,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:02:51,245 INFO L225 Difference]: With dead ends: 187 [2019-09-03 21:02:51,245 INFO L226 Difference]: Without dead ends: 184 [2019-09-03 21:02:51,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=15067, Invalid=16795, Unknown=0, NotChecked=0, Total=31862 [2019-09-03 21:02:51,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-09-03 21:02:51,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2019-09-03 21:02:51,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-09-03 21:02:51,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2019-09-03 21:02:51,249 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 180 [2019-09-03 21:02:51,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:02:51,249 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2019-09-03 21:02:51,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-09-03 21:02:51,249 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2019-09-03 21:02:51,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-03 21:02:51,250 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:02:51,250 INFO L399 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:02:51,250 INFO L418 AbstractCegarLoop]: === Iteration 88 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:02:51,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:02:51,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1222419679, now seen corresponding path program 86 times [2019-09-03 21:02:51,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:02:51,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:51,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:02:51,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:02:51,251 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:02:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:02:53,961 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:02:53,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:53,962 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:02:53,962 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:02:53,963 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:02:53,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:02:53,963 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:02:53,973 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:02:53,973 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:02:54,216 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 87 check-sat command(s) [2019-09-03 21:02:54,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:02:54,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 970 conjuncts, 93 conjunts are in the unsatisfiable core [2019-09-03 21:02:54,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:02:54,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:02:54,318 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:02:54,319 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:03:02,299 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:03:02,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:03:02,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 180 [2019-09-03 21:03:02,304 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:03:02,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-09-03 21:03:02,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-09-03 21:03:02,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15410, Invalid=16810, Unknown=0, NotChecked=0, Total=32220 [2019-09-03 21:03:02,306 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 93 states. [2019-09-03 21:03:02,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:03:02,606 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2019-09-03 21:03:02,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-03 21:03:02,606 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 182 [2019-09-03 21:03:02,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:03:02,607 INFO L225 Difference]: With dead ends: 189 [2019-09-03 21:03:02,607 INFO L226 Difference]: Without dead ends: 186 [2019-09-03 21:03:02,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=15416, Invalid=17164, Unknown=0, NotChecked=0, Total=32580 [2019-09-03 21:03:02,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-09-03 21:03:02,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2019-09-03 21:03:02,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-09-03 21:03:02,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2019-09-03 21:03:02,612 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 182 [2019-09-03 21:03:02,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:03:02,612 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2019-09-03 21:03:02,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-09-03 21:03:02,612 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2019-09-03 21:03:02,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-03 21:03:02,613 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:03:02,613 INFO L399 BasicCegarLoop]: trace histogram [87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:03:02,614 INFO L418 AbstractCegarLoop]: === Iteration 89 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:03:02,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:03:02,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1085725891, now seen corresponding path program 87 times [2019-09-03 21:03:02,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:03:02,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:02,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:03:02,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:02,615 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:03:02,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:05,371 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:03:05,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:05,372 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:03:05,372 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:03:05,372 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:03:05,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:05,372 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 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:03:05,400 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:03:05,400 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:03:05,525 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:03:05,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:03:05,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 981 conjuncts, 94 conjunts are in the unsatisfiable core [2019-09-03 21:03:05,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:03:05,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:05,627 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:03:05,627 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:03:13,584 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:03:13,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:03:13,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 182 [2019-09-03 21:03:13,588 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:03:13,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-09-03 21:03:13,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-09-03 21:03:13,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15763, Invalid=17179, Unknown=0, NotChecked=0, Total=32942 [2019-09-03 21:03:13,590 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 94 states. [2019-09-03 21:03:13,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:03:13,845 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2019-09-03 21:03:13,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-09-03 21:03:13,846 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 184 [2019-09-03 21:03:13,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:03:13,847 INFO L225 Difference]: With dead ends: 191 [2019-09-03 21:03:13,847 INFO L226 Difference]: Without dead ends: 188 [2019-09-03 21:03:13,848 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=15769, Invalid=17537, Unknown=0, NotChecked=0, Total=33306 [2019-09-03 21:03:13,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-03 21:03:13,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 187. [2019-09-03 21:03:13,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-09-03 21:03:13,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2019-09-03 21:03:13,851 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 184 [2019-09-03 21:03:13,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:03:13,852 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2019-09-03 21:03:13,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-09-03 21:03:13,852 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2019-09-03 21:03:13,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-03 21:03:13,853 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:03:13,853 INFO L399 BasicCegarLoop]: trace histogram [88, 88, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:03:13,853 INFO L418 AbstractCegarLoop]: === Iteration 90 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:03:13,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:03:13,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1427985497, now seen corresponding path program 88 times [2019-09-03 21:03:13,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:03:13,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:13,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:03:13,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:13,855 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:03:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:16,689 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:03:16,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:16,689 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:03:16,689 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:03:16,690 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:03:16,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:16,690 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 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:03:16,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:03:16,700 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:03:16,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:16,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 992 conjuncts, 95 conjunts are in the unsatisfiable core [2019-09-03 21:03:16,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:03:16,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:16,929 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:03:16,929 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:03:25,110 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:03:25,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:03:25,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 184 [2019-09-03 21:03:25,113 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:03:25,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-09-03 21:03:25,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-09-03 21:03:25,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16120, Invalid=17552, Unknown=0, NotChecked=0, Total=33672 [2019-09-03 21:03:25,115 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 95 states. [2019-09-03 21:03:25,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:03:25,375 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2019-09-03 21:03:25,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-09-03 21:03:25,376 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 186 [2019-09-03 21:03:25,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:03:25,376 INFO L225 Difference]: With dead ends: 193 [2019-09-03 21:03:25,376 INFO L226 Difference]: Without dead ends: 190 [2019-09-03 21:03:25,377 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=16126, Invalid=17914, Unknown=0, NotChecked=0, Total=34040 [2019-09-03 21:03:25,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-09-03 21:03:25,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2019-09-03 21:03:25,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-03 21:03:25,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2019-09-03 21:03:25,380 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 186 [2019-09-03 21:03:25,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:03:25,380 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2019-09-03 21:03:25,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-09-03 21:03:25,380 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2019-09-03 21:03:25,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-03 21:03:25,381 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:03:25,381 INFO L399 BasicCegarLoop]: trace histogram [89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:03:25,381 INFO L418 AbstractCegarLoop]: === Iteration 91 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:03:25,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:03:25,382 INFO L82 PathProgramCache]: Analyzing trace with hash -961958283, now seen corresponding path program 89 times [2019-09-03 21:03:25,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:03:25,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:25,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:03:25,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:25,383 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:03:25,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:28,249 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:03:28,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:28,250 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:03:28,250 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:03:28,250 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:03:28,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:28,250 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 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:03:28,260 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:03:28,260 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:03:28,509 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 90 check-sat command(s) [2019-09-03 21:03:28,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:03:28,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 1003 conjuncts, 96 conjunts are in the unsatisfiable core [2019-09-03 21:03:28,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:03:28,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:28,638 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:03:28,638 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:03:36,980 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:03:36,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:03:36,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 186 [2019-09-03 21:03:36,984 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:03:36,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-09-03 21:03:36,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-09-03 21:03:36,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16481, Invalid=17929, Unknown=0, NotChecked=0, Total=34410 [2019-09-03 21:03:36,987 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 96 states. [2019-09-03 21:03:37,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:03:37,308 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-09-03 21:03:37,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-09-03 21:03:37,309 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 188 [2019-09-03 21:03:37,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:03:37,310 INFO L225 Difference]: With dead ends: 195 [2019-09-03 21:03:37,310 INFO L226 Difference]: Without dead ends: 192 [2019-09-03 21:03:37,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=16487, Invalid=18295, Unknown=0, NotChecked=0, Total=34782 [2019-09-03 21:03:37,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-09-03 21:03:37,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 191. [2019-09-03 21:03:37,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-03 21:03:37,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2019-09-03 21:03:37,315 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 188 [2019-09-03 21:03:37,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:03:37,316 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2019-09-03 21:03:37,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-09-03 21:03:37,316 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2019-09-03 21:03:37,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-03 21:03:37,317 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:03:37,317 INFO L399 BasicCegarLoop]: trace histogram [90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:03:37,317 INFO L418 AbstractCegarLoop]: === Iteration 92 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:03:37,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:03:37,318 INFO L82 PathProgramCache]: Analyzing trace with hash 109572497, now seen corresponding path program 90 times [2019-09-03 21:03:37,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:03:37,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:37,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:03:37,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:37,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:03:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:40,263 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:03:40,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:40,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:03:40,263 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:03:40,263 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:03:40,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:40,264 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 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:03:40,277 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:03:40,277 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:03:40,409 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:03:40,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:03:40,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 1014 conjuncts, 97 conjunts are in the unsatisfiable core [2019-09-03 21:03:40,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:03:40,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:40,514 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:03:40,514 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:03:49,045 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:03:49,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:03:49,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 188 [2019-09-03 21:03:49,049 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:03:49,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-09-03 21:03:49,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-09-03 21:03:49,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16846, Invalid=18310, Unknown=0, NotChecked=0, Total=35156 [2019-09-03 21:03:49,051 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 97 states. [2019-09-03 21:03:49,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:03:49,381 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2019-09-03 21:03:49,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-03 21:03:49,382 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 190 [2019-09-03 21:03:49,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:03:49,383 INFO L225 Difference]: With dead ends: 197 [2019-09-03 21:03:49,383 INFO L226 Difference]: Without dead ends: 194 [2019-09-03 21:03:49,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=16852, Invalid=18680, Unknown=0, NotChecked=0, Total=35532 [2019-09-03 21:03:49,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-09-03 21:03:49,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2019-09-03 21:03:49,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-09-03 21:03:49,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2019-09-03 21:03:49,387 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 190 [2019-09-03 21:03:49,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:03:49,388 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2019-09-03 21:03:49,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-09-03 21:03:49,388 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2019-09-03 21:03:49,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-03 21:03:49,388 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:03:49,389 INFO L399 BasicCegarLoop]: trace histogram [91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:03:49,389 INFO L418 AbstractCegarLoop]: === Iteration 93 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:03:49,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:03:49,389 INFO L82 PathProgramCache]: Analyzing trace with hash -941498963, now seen corresponding path program 91 times [2019-09-03 21:03:49,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:03:49,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:49,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:03:49,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:03:49,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:03:49,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:52,380 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 8281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:03:52,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:52,381 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:03:52,381 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:03:52,381 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:03:52,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:03:52,381 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 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:03:52,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:03:52,390 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:03:52,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:03:52,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 1025 conjuncts, 98 conjunts are in the unsatisfiable core [2019-09-03 21:03:52,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:03:52,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:03:52,631 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 8281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:03:52,631 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:01,746 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 8281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:01,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:01,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 190 [2019-09-03 21:04:01,750 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:01,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-09-03 21:04:01,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-09-03 21:04:01,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17215, Invalid=18695, Unknown=0, NotChecked=0, Total=35910 [2019-09-03 21:04:01,754 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 98 states. [2019-09-03 21:04:01,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:01,975 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2019-09-03 21:04:01,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-09-03 21:04:01,976 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 192 [2019-09-03 21:04:01,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:01,976 INFO L225 Difference]: With dead ends: 199 [2019-09-03 21:04:01,977 INFO L226 Difference]: Without dead ends: 196 [2019-09-03 21:04:01,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=17221, Invalid=19069, Unknown=0, NotChecked=0, Total=36290 [2019-09-03 21:04:01,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-09-03 21:04:01,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 195. [2019-09-03 21:04:01,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-03 21:04:01,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2019-09-03 21:04:01,980 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 192 [2019-09-03 21:04:01,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:01,981 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2019-09-03 21:04:01,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-09-03 21:04:01,981 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2019-09-03 21:04:01,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-03 21:04:01,981 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:01,982 INFO L399 BasicCegarLoop]: trace histogram [92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:01,982 INFO L418 AbstractCegarLoop]: === Iteration 94 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:01,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:01,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1703857463, now seen corresponding path program 92 times [2019-09-03 21:04:01,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:01,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:01,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:01,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:01,983 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:02,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:05,034 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:05,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:05,035 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:05,035 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:05,035 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:05,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:05,035 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 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:05,045 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:04:05,046 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:04:05,302 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 93 check-sat command(s) [2019-09-03 21:04:05,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:05,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 1036 conjuncts, 99 conjunts are in the unsatisfiable core [2019-09-03 21:04:05,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:05,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:04:05,411 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:05,411 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:14,303 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:14,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:14,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 192 [2019-09-03 21:04:14,307 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:14,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-09-03 21:04:14,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-09-03 21:04:14,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17588, Invalid=19084, Unknown=0, NotChecked=0, Total=36672 [2019-09-03 21:04:14,310 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 99 states. [2019-09-03 21:04:14,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:14,660 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2019-09-03 21:04:14,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-09-03 21:04:14,660 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 194 [2019-09-03 21:04:14,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:14,662 INFO L225 Difference]: With dead ends: 201 [2019-09-03 21:04:14,662 INFO L226 Difference]: Without dead ends: 198 [2019-09-03 21:04:14,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=17594, Invalid=19462, Unknown=0, NotChecked=0, Total=37056 [2019-09-03 21:04:14,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-09-03 21:04:14,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2019-09-03 21:04:14,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-03 21:04:14,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2019-09-03 21:04:14,666 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 194 [2019-09-03 21:04:14,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:14,666 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2019-09-03 21:04:14,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-09-03 21:04:14,667 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2019-09-03 21:04:14,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-03 21:04:14,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:14,668 INFO L399 BasicCegarLoop]: trace histogram [93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:14,668 INFO L418 AbstractCegarLoop]: === Iteration 95 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:14,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:14,668 INFO L82 PathProgramCache]: Analyzing trace with hash 109031653, now seen corresponding path program 93 times [2019-09-03 21:04:14,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:14,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:14,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:14,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:14,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:17,900 INFO L134 CoverageAnalysis]: Checked inductivity of 8649 backedges. 0 proven. 8649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:17,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:17,900 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:17,901 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:17,901 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:17,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:17,901 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 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:17,911 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:04:17,911 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:04:18,047 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:04:18,047 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:18,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 1047 conjuncts, 100 conjunts are in the unsatisfiable core [2019-09-03 21:04:18,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:18,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:04:18,158 INFO L134 CoverageAnalysis]: Checked inductivity of 8649 backedges. 0 proven. 8649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:18,158 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:27,307 INFO L134 CoverageAnalysis]: Checked inductivity of 8649 backedges. 0 proven. 8649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:27,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:27,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 194 [2019-09-03 21:04:27,311 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:27,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-09-03 21:04:27,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-09-03 21:04:27,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17965, Invalid=19477, Unknown=0, NotChecked=0, Total=37442 [2019-09-03 21:04:27,313 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 100 states. [2019-09-03 21:04:27,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:27,638 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2019-09-03 21:04:27,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-09-03 21:04:27,639 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 196 [2019-09-03 21:04:27,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:27,640 INFO L225 Difference]: With dead ends: 203 [2019-09-03 21:04:27,640 INFO L226 Difference]: Without dead ends: 200 [2019-09-03 21:04:27,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=17971, Invalid=19859, Unknown=0, NotChecked=0, Total=37830 [2019-09-03 21:04:27,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-09-03 21:04:27,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2019-09-03 21:04:27,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-03 21:04:27,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2019-09-03 21:04:27,644 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 196 [2019-09-03 21:04:27,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:27,645 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2019-09-03 21:04:27,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-09-03 21:04:27,645 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2019-09-03 21:04:27,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-03 21:04:27,646 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:27,646 INFO L399 BasicCegarLoop]: trace histogram [94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:27,646 INFO L418 AbstractCegarLoop]: === Iteration 96 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:27,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:27,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1461250047, now seen corresponding path program 94 times [2019-09-03 21:04:27,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:27,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:27,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:27,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:27,648 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:30,907 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:30,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:30,908 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:30,908 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:30,908 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:30,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:30,908 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 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:30,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:30,919 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:04:31,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:31,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 1058 conjuncts, 101 conjunts are in the unsatisfiable core [2019-09-03 21:04:31,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:31,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:04:31,166 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:31,166 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:40,462 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:40,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:40,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 196 [2019-09-03 21:04:40,466 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:40,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-09-03 21:04:40,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-09-03 21:04:40,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18346, Invalid=19874, Unknown=0, NotChecked=0, Total=38220 [2019-09-03 21:04:40,468 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 101 states. [2019-09-03 21:04:40,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:40,740 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2019-09-03 21:04:40,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-03 21:04:40,740 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 198 [2019-09-03 21:04:40,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:40,741 INFO L225 Difference]: With dead ends: 205 [2019-09-03 21:04:40,741 INFO L226 Difference]: Without dead ends: 202 [2019-09-03 21:04:40,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=18352, Invalid=20260, Unknown=0, NotChecked=0, Total=38612 [2019-09-03 21:04:40,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-03 21:04:40,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2019-09-03 21:04:40,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-09-03 21:04:40,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2019-09-03 21:04:40,745 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 198 [2019-09-03 21:04:40,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:40,745 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2019-09-03 21:04:40,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-09-03 21:04:40,745 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2019-09-03 21:04:40,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-03 21:04:40,746 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:40,746 INFO L399 BasicCegarLoop]: trace histogram [95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:40,746 INFO L418 AbstractCegarLoop]: === Iteration 97 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:40,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:40,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1326524445, now seen corresponding path program 95 times [2019-09-03 21:04:40,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:40,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:40,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:04:40,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:40,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:40,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:44,014 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 0 proven. 9025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:44,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:44,015 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:44,015 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:44,015 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:44,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:44,015 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 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:44,028 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:04:44,028 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:04:44,327 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 96 check-sat command(s) [2019-09-03 21:04:44,327 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:44,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 1069 conjuncts, 102 conjunts are in the unsatisfiable core [2019-09-03 21:04:44,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:44,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:04:44,439 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 0 proven. 9025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:44,439 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:04:54,061 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 0 proven. 9025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:54,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:04:54,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 198 [2019-09-03 21:04:54,065 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:04:54,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-09-03 21:04:54,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-09-03 21:04:54,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18731, Invalid=20275, Unknown=0, NotChecked=0, Total=39006 [2019-09-03 21:04:54,068 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 102 states. [2019-09-03 21:04:54,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:04:54,362 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2019-09-03 21:04:54,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-09-03 21:04:54,362 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 200 [2019-09-03 21:04:54,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:04:54,363 INFO L225 Difference]: With dead ends: 207 [2019-09-03 21:04:54,364 INFO L226 Difference]: Without dead ends: 204 [2019-09-03 21:04:54,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=18737, Invalid=20665, Unknown=0, NotChecked=0, Total=39402 [2019-09-03 21:04:54,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-09-03 21:04:54,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 203. [2019-09-03 21:04:54,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-03 21:04:54,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2019-09-03 21:04:54,368 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 200 [2019-09-03 21:04:54,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:04:54,368 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2019-09-03 21:04:54,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-09-03 21:04:54,368 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2019-09-03 21:04:54,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-03 21:04:54,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:04:54,369 INFO L399 BasicCegarLoop]: trace histogram [96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:04:54,369 INFO L418 AbstractCegarLoop]: === Iteration 98 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:04:54,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:04:54,370 INFO L82 PathProgramCache]: Analyzing trace with hash 318218553, now seen corresponding path program 96 times [2019-09-03 21:04:54,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:04:54,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:54,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:04:54,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:04:54,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:04:54,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:04:57,723 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 0 proven. 9216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:57,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:57,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:04:57,723 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:04:57,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:04:57,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:04:57,723 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 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:04:57,733 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:04:57,733 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:04:57,875 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:04:57,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:04:57,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 1080 conjuncts, 103 conjunts are in the unsatisfiable core [2019-09-03 21:04:57,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:04:57,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:04:58,037 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 0 proven. 9216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:04:58,037 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:05:07,880 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 0 proven. 9216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:05:07,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:05:07,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 200 [2019-09-03 21:05:07,884 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:05:07,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-09-03 21:05:07,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-09-03 21:05:07,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19120, Invalid=20680, Unknown=0, NotChecked=0, Total=39800 [2019-09-03 21:05:07,886 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 103 states. [2019-09-03 21:05:08,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:05:08,234 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2019-09-03 21:05:08,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-03 21:05:08,235 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 202 [2019-09-03 21:05:08,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:05:08,236 INFO L225 Difference]: With dead ends: 209 [2019-09-03 21:05:08,236 INFO L226 Difference]: Without dead ends: 206 [2019-09-03 21:05:08,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=19126, Invalid=21074, Unknown=0, NotChecked=0, Total=40200 [2019-09-03 21:05:08,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-09-03 21:05:08,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2019-09-03 21:05:08,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-03 21:05:08,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2019-09-03 21:05:08,240 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 202 [2019-09-03 21:05:08,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:05:08,240 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2019-09-03 21:05:08,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-09-03 21:05:08,240 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2019-09-03 21:05:08,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-03 21:05:08,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:05:08,241 INFO L399 BasicCegarLoop]: trace histogram [97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:05:08,241 INFO L418 AbstractCegarLoop]: === Iteration 99 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:05:08,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:05:08,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1998865237, now seen corresponding path program 97 times [2019-09-03 21:05:08,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:05:08,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:08,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:05:08,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:08,242 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:05:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:11,609 INFO L134 CoverageAnalysis]: Checked inductivity of 9409 backedges. 0 proven. 9409 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:05:11,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:11,609 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:05:11,609 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:05:11,609 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:05:11,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:11,609 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 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:05:11,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:05:11,621 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:05:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:11,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 1091 conjuncts, 104 conjunts are in the unsatisfiable core [2019-09-03 21:05:11,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:05:11,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:05:11,877 INFO L134 CoverageAnalysis]: Checked inductivity of 9409 backedges. 0 proven. 9409 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:05:11,877 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:05:21,853 INFO L134 CoverageAnalysis]: Checked inductivity of 9409 backedges. 0 proven. 9409 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:05:21,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:05:21,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 202 [2019-09-03 21:05:21,857 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:05:21,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-09-03 21:05:21,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-09-03 21:05:21,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19513, Invalid=21089, Unknown=0, NotChecked=0, Total=40602 [2019-09-03 21:05:21,860 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 104 states. [2019-09-03 21:05:22,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:05:22,309 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2019-09-03 21:05:22,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-09-03 21:05:22,309 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 204 [2019-09-03 21:05:22,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:05:22,310 INFO L225 Difference]: With dead ends: 211 [2019-09-03 21:05:22,310 INFO L226 Difference]: Without dead ends: 208 [2019-09-03 21:05:22,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=19519, Invalid=21487, Unknown=0, NotChecked=0, Total=41006 [2019-09-03 21:05:22,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-09-03 21:05:22,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 207. [2019-09-03 21:05:22,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-09-03 21:05:22,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2019-09-03 21:05:22,315 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 204 [2019-09-03 21:05:22,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:05:22,315 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2019-09-03 21:05:22,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-09-03 21:05:22,315 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2019-09-03 21:05:22,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-09-03 21:05:22,316 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:05:22,316 INFO L399 BasicCegarLoop]: trace histogram [98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:05:22,317 INFO L418 AbstractCegarLoop]: === Iteration 100 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:05:22,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:05:22,317 INFO L82 PathProgramCache]: Analyzing trace with hash -2102342031, now seen corresponding path program 98 times [2019-09-03 21:05:22,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:05:22,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:22,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:05:22,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:22,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:05:22,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:25,811 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 9604 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:05:25,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:25,811 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:05:25,812 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:05:25,812 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:05:25,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:25,812 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 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:05:25,822 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:05:25,822 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:05:26,111 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 99 check-sat command(s) [2019-09-03 21:05:26,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:05:26,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 1102 conjuncts, 105 conjunts are in the unsatisfiable core [2019-09-03 21:05:26,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:05:26,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:05:26,232 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 9604 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:05:26,233 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:05:36,403 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 9604 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:05:36,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:05:36,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 204 [2019-09-03 21:05:36,407 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:05:36,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-09-03 21:05:36,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-09-03 21:05:36,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19910, Invalid=21502, Unknown=0, NotChecked=0, Total=41412 [2019-09-03 21:05:36,410 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 105 states. [2019-09-03 21:05:36,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:05:36,741 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2019-09-03 21:05:36,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-09-03 21:05:36,742 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 206 [2019-09-03 21:05:36,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:05:36,743 INFO L225 Difference]: With dead ends: 213 [2019-09-03 21:05:36,743 INFO L226 Difference]: Without dead ends: 210 [2019-09-03 21:05:36,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=19916, Invalid=21904, Unknown=0, NotChecked=0, Total=41820 [2019-09-03 21:05:36,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-03 21:05:36,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2019-09-03 21:05:36,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-09-03 21:05:36,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2019-09-03 21:05:36,747 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 206 [2019-09-03 21:05:36,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:05:36,748 INFO L475 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2019-09-03 21:05:36,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-09-03 21:05:36,748 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2019-09-03 21:05:36,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-03 21:05:36,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:05:36,749 INFO L399 BasicCegarLoop]: trace histogram [99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:05:36,749 INFO L418 AbstractCegarLoop]: === Iteration 101 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:05:36,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:05:36,749 INFO L82 PathProgramCache]: Analyzing trace with hash -582548851, now seen corresponding path program 99 times [2019-09-03 21:05:36,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:05:36,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:36,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:05:36,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:36,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:05:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:40,338 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:05:40,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:40,338 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:05:40,338 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:05:40,339 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:05:40,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:40,339 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:05:40,349 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:05:40,349 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:05:40,497 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:05:40,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:05:40,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 1113 conjuncts, 106 conjunts are in the unsatisfiable core [2019-09-03 21:05:40,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:05:40,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:05:40,613 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:05:40,613 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:05:50,985 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:05:50,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:05:50,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 206 [2019-09-03 21:05:50,989 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:05:50,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-09-03 21:05:50,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-09-03 21:05:50,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20311, Invalid=21919, Unknown=0, NotChecked=0, Total=42230 [2019-09-03 21:05:50,992 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 106 states. [2019-09-03 21:05:51,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:05:51,430 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2019-09-03 21:05:51,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-09-03 21:05:51,430 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 208 [2019-09-03 21:05:51,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:05:51,431 INFO L225 Difference]: With dead ends: 215 [2019-09-03 21:05:51,431 INFO L226 Difference]: Without dead ends: 212 [2019-09-03 21:05:51,434 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 696 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=20317, Invalid=22325, Unknown=0, NotChecked=0, Total=42642 [2019-09-03 21:05:51,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-09-03 21:05:51,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 211. [2019-09-03 21:05:51,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-09-03 21:05:51,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2019-09-03 21:05:51,437 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 208 [2019-09-03 21:05:51,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:05:51,437 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2019-09-03 21:05:51,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-09-03 21:05:51,437 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2019-09-03 21:05:51,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-03 21:05:51,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:05:51,439 INFO L399 BasicCegarLoop]: trace histogram [100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:05:51,439 INFO L418 AbstractCegarLoop]: === Iteration 102 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:05:51,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:05:51,439 INFO L82 PathProgramCache]: Analyzing trace with hash -350183511, now seen corresponding path program 100 times [2019-09-03 21:05:51,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:05:51,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:51,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:05:51,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:05:51,440 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:05:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:55,090 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 10000 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:05:55,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:55,090 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:05:55,090 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:05:55,090 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:05:55,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:05:55,090 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 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:05:55,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:05:55,101 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:05:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:05:55,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 1124 conjuncts, 107 conjunts are in the unsatisfiable core [2019-09-03 21:05:55,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:05:55,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:05:55,363 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 10000 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:05:55,364 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:06:05,924 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 10000 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:06:05,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:06:05,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 208 [2019-09-03 21:06:05,928 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:06:05,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-09-03 21:06:05,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-09-03 21:06:05,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20716, Invalid=22340, Unknown=0, NotChecked=0, Total=43056 [2019-09-03 21:06:05,931 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 107 states. [2019-09-03 21:06:06,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:06:06,241 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2019-09-03 21:06:06,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-09-03 21:06:06,241 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 210 [2019-09-03 21:06:06,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:06:06,243 INFO L225 Difference]: With dead ends: 217 [2019-09-03 21:06:06,243 INFO L226 Difference]: Without dead ends: 214 [2019-09-03 21:06:06,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=20722, Invalid=22750, Unknown=0, NotChecked=0, Total=43472 [2019-09-03 21:06:06,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-03 21:06:06,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2019-09-03 21:06:06,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-09-03 21:06:06,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2019-09-03 21:06:06,248 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 210 [2019-09-03 21:06:06,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:06:06,248 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2019-09-03 21:06:06,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-09-03 21:06:06,248 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2019-09-03 21:06:06,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-03 21:06:06,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:06:06,249 INFO L399 BasicCegarLoop]: trace histogram [101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:06:06,250 INFO L418 AbstractCegarLoop]: === Iteration 103 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:06:06,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:06:06,250 INFO L82 PathProgramCache]: Analyzing trace with hash -385391163, now seen corresponding path program 101 times [2019-09-03 21:06:06,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:06:06,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:06,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:06:06,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:06,251 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:06:06,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:06:09,947 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 0 proven. 10201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:06:09,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:09,948 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:06:09,948 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:06:09,948 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:06:09,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:09,948 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:06:09,958 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:06:09,958 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:06:10,272 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 102 check-sat command(s) [2019-09-03 21:06:10,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:06:10,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 1135 conjuncts, 108 conjunts are in the unsatisfiable core [2019-09-03 21:06:10,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:06:10,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:06:10,407 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 0 proven. 10201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:06:10,407 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:06:21,214 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 0 proven. 10201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:06:21,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:06:21,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 210 [2019-09-03 21:06:21,219 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:06:21,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-09-03 21:06:21,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-09-03 21:06:21,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21125, Invalid=22765, Unknown=0, NotChecked=0, Total=43890 [2019-09-03 21:06:21,221 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 108 states. [2019-09-03 21:06:21,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:06:21,540 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2019-09-03 21:06:21,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-09-03 21:06:21,541 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 212 [2019-09-03 21:06:21,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:06:21,542 INFO L225 Difference]: With dead ends: 219 [2019-09-03 21:06:21,542 INFO L226 Difference]: Without dead ends: 216 [2019-09-03 21:06:21,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=21131, Invalid=23179, Unknown=0, NotChecked=0, Total=44310 [2019-09-03 21:06:21,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-09-03 21:06:21,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 215. [2019-09-03 21:06:21,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-09-03 21:06:21,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2019-09-03 21:06:21,546 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 212 [2019-09-03 21:06:21,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:06:21,547 INFO L475 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2019-09-03 21:06:21,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-09-03 21:06:21,547 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2019-09-03 21:06:21,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-09-03 21:06:21,548 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:06:21,548 INFO L399 BasicCegarLoop]: trace histogram [102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:06:21,548 INFO L418 AbstractCegarLoop]: === Iteration 104 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:06:21,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:06:21,549 INFO L82 PathProgramCache]: Analyzing trace with hash 139793633, now seen corresponding path program 102 times [2019-09-03 21:06:21,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:06:21,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:21,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:06:21,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:21,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:06:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:06:25,238 INFO L134 CoverageAnalysis]: Checked inductivity of 10404 backedges. 0 proven. 10404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:06:25,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:25,239 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:06:25,239 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:06:25,239 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:06:25,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:25,239 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 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:06:25,253 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:06:25,253 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:06:25,406 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:06:25,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:06:25,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 1146 conjuncts, 109 conjunts are in the unsatisfiable core [2019-09-03 21:06:25,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:06:25,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:06:25,540 INFO L134 CoverageAnalysis]: Checked inductivity of 10404 backedges. 0 proven. 10404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:06:25,540 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:06:36,491 INFO L134 CoverageAnalysis]: Checked inductivity of 10404 backedges. 0 proven. 10404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:06:36,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:06:36,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 212 [2019-09-03 21:06:36,494 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:06:36,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-09-03 21:06:36,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-09-03 21:06:36,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21538, Invalid=23194, Unknown=0, NotChecked=0, Total=44732 [2019-09-03 21:06:36,497 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 109 states. [2019-09-03 21:06:36,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:06:36,747 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2019-09-03 21:06:36,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-09-03 21:06:36,747 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 214 [2019-09-03 21:06:36,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:06:36,748 INFO L225 Difference]: With dead ends: 221 [2019-09-03 21:06:36,748 INFO L226 Difference]: Without dead ends: 218 [2019-09-03 21:06:36,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 717 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=21544, Invalid=23612, Unknown=0, NotChecked=0, Total=45156 [2019-09-03 21:06:36,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-09-03 21:06:36,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2019-09-03 21:06:36,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-09-03 21:06:36,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2019-09-03 21:06:36,753 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 214 [2019-09-03 21:06:36,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:06:36,753 INFO L475 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2019-09-03 21:06:36,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-09-03 21:06:36,753 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2019-09-03 21:06:36,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-03 21:06:36,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:06:36,754 INFO L399 BasicCegarLoop]: trace histogram [103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:06:36,754 INFO L418 AbstractCegarLoop]: === Iteration 105 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:06:36,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:06:36,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1963758339, now seen corresponding path program 103 times [2019-09-03 21:06:36,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:06:36,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:36,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:06:36,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:36,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:06:36,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:06:40,555 INFO L134 CoverageAnalysis]: Checked inductivity of 10609 backedges. 0 proven. 10609 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:06:40,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:40,555 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:06:40,556 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:06:40,556 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:06:40,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:40,556 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 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:06:40,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:06:40,566 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:06:40,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:06:40,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 1157 conjuncts, 110 conjunts are in the unsatisfiable core [2019-09-03 21:06:40,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:06:40,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:06:40,838 INFO L134 CoverageAnalysis]: Checked inductivity of 10609 backedges. 0 proven. 10609 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:06:40,838 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:06:51,983 INFO L134 CoverageAnalysis]: Checked inductivity of 10609 backedges. 0 proven. 10609 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:06:51,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:06:51,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 214 [2019-09-03 21:06:51,986 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:06:51,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-09-03 21:06:51,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-09-03 21:06:51,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21955, Invalid=23627, Unknown=0, NotChecked=0, Total=45582 [2019-09-03 21:06:51,989 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 110 states. [2019-09-03 21:06:52,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:06:52,320 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2019-09-03 21:06:52,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-09-03 21:06:52,320 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 216 [2019-09-03 21:06:52,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:06:52,321 INFO L225 Difference]: With dead ends: 223 [2019-09-03 21:06:52,321 INFO L226 Difference]: Without dead ends: 220 [2019-09-03 21:06:52,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=21961, Invalid=24049, Unknown=0, NotChecked=0, Total=46010 [2019-09-03 21:06:52,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-09-03 21:06:52,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 219. [2019-09-03 21:06:52,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-09-03 21:06:52,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2019-09-03 21:06:52,326 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 216 [2019-09-03 21:06:52,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:06:52,326 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 219 transitions. [2019-09-03 21:06:52,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-09-03 21:06:52,326 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 219 transitions. [2019-09-03 21:06:52,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-03 21:06:52,327 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:06:52,327 INFO L399 BasicCegarLoop]: trace histogram [104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:06:52,327 INFO L418 AbstractCegarLoop]: === Iteration 106 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:06:52,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:06:52,328 INFO L82 PathProgramCache]: Analyzing trace with hash -547607015, now seen corresponding path program 104 times [2019-09-03 21:06:52,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:06:52,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:52,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:06:52,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:06:52,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:06:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:06:56,196 INFO L134 CoverageAnalysis]: Checked inductivity of 10816 backedges. 0 proven. 10816 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:06:56,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:56,196 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:06:56,197 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:06:56,197 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:06:56,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:06:56,197 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 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:06:56,208 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:06:56,208 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:06:56,544 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 105 check-sat command(s) [2019-09-03 21:06:56,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:06:56,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 1168 conjuncts, 111 conjunts are in the unsatisfiable core [2019-09-03 21:06:56,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:06:56,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:06:56,693 INFO L134 CoverageAnalysis]: Checked inductivity of 10816 backedges. 0 proven. 10816 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:06:56,716 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:07:08,024 INFO L134 CoverageAnalysis]: Checked inductivity of 10816 backedges. 0 proven. 10816 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:07:08,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:07:08,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 216 [2019-09-03 21:07:08,029 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:07:08,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-09-03 21:07:08,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-09-03 21:07:08,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22376, Invalid=24064, Unknown=0, NotChecked=0, Total=46440 [2019-09-03 21:07:08,032 INFO L87 Difference]: Start difference. First operand 219 states and 219 transitions. Second operand 111 states. [2019-09-03 21:07:08,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:07:08,435 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2019-09-03 21:07:08,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-09-03 21:07:08,436 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 218 [2019-09-03 21:07:08,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:07:08,436 INFO L225 Difference]: With dead ends: 225 [2019-09-03 21:07:08,437 INFO L226 Difference]: Without dead ends: 222 [2019-09-03 21:07:08,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=22382, Invalid=24490, Unknown=0, NotChecked=0, Total=46872 [2019-09-03 21:07:08,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-09-03 21:07:08,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2019-09-03 21:07:08,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-09-03 21:07:08,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2019-09-03 21:07:08,440 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 218 [2019-09-03 21:07:08,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:07:08,441 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2019-09-03 21:07:08,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-09-03 21:07:08,441 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2019-09-03 21:07:08,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-03 21:07:08,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:07:08,442 INFO L399 BasicCegarLoop]: trace histogram [105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:07:08,442 INFO L418 AbstractCegarLoop]: === Iteration 107 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:07:08,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:07:08,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1130817483, now seen corresponding path program 105 times [2019-09-03 21:07:08,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:07:08,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:08,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:07:08,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:08,443 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:07:08,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:07:12,543 INFO L134 CoverageAnalysis]: Checked inductivity of 11025 backedges. 0 proven. 11025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:07:12,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:12,543 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:07:12,543 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:07:12,544 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:07:12,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:12,544 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 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:07:12,554 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:07:12,554 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:07:12,712 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:07:12,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:07:12,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 1179 conjuncts, 112 conjunts are in the unsatisfiable core [2019-09-03 21:07:12,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:07:12,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:07:12,841 INFO L134 CoverageAnalysis]: Checked inductivity of 11025 backedges. 0 proven. 11025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:07:12,841 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:07:24,463 INFO L134 CoverageAnalysis]: Checked inductivity of 11025 backedges. 0 proven. 11025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:07:24,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:07:24,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110, 110] total 218 [2019-09-03 21:07:24,467 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:07:24,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-09-03 21:07:24,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-09-03 21:07:24,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22801, Invalid=24505, Unknown=0, NotChecked=0, Total=47306 [2019-09-03 21:07:24,470 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 112 states. [2019-09-03 21:07:24,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:07:24,886 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2019-09-03 21:07:24,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-09-03 21:07:24,887 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 220 [2019-09-03 21:07:24,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:07:24,888 INFO L225 Difference]: With dead ends: 227 [2019-09-03 21:07:24,888 INFO L226 Difference]: Without dead ends: 224 [2019-09-03 21:07:24,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 738 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=22807, Invalid=24935, Unknown=0, NotChecked=0, Total=47742 [2019-09-03 21:07:24,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-09-03 21:07:24,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 223. [2019-09-03 21:07:24,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-09-03 21:07:24,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2019-09-03 21:07:24,892 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 220 [2019-09-03 21:07:24,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:07:24,892 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2019-09-03 21:07:24,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-09-03 21:07:24,893 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2019-09-03 21:07:24,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-03 21:07:24,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:07:24,893 INFO L399 BasicCegarLoop]: trace histogram [106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:07:24,894 INFO L418 AbstractCegarLoop]: === Iteration 108 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:07:24,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:07:24,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1044638545, now seen corresponding path program 106 times [2019-09-03 21:07:24,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:07:24,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:24,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:07:24,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:24,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:07:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:07:28,921 INFO L134 CoverageAnalysis]: Checked inductivity of 11236 backedges. 0 proven. 11236 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:07:28,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:28,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:07:28,922 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:07:28,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:07:28,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:28,922 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 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:07:28,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:07:28,931 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:07:29,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:07:29,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 1190 conjuncts, 113 conjunts are in the unsatisfiable core [2019-09-03 21:07:29,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:07:29,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:07:29,210 INFO L134 CoverageAnalysis]: Checked inductivity of 11236 backedges. 0 proven. 11236 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:07:29,211 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:07:40,979 INFO L134 CoverageAnalysis]: Checked inductivity of 11236 backedges. 0 proven. 11236 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:07:40,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:07:40,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 220 [2019-09-03 21:07:40,983 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:07:40,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-09-03 21:07:40,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-09-03 21:07:40,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23230, Invalid=24950, Unknown=0, NotChecked=0, Total=48180 [2019-09-03 21:07:40,986 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 113 states. [2019-09-03 21:07:41,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:07:41,408 INFO L93 Difference]: Finished difference Result 229 states and 229 transitions. [2019-09-03 21:07:41,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-09-03 21:07:41,408 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 222 [2019-09-03 21:07:41,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:07:41,409 INFO L225 Difference]: With dead ends: 229 [2019-09-03 21:07:41,409 INFO L226 Difference]: Without dead ends: 226 [2019-09-03 21:07:41,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 555 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=23236, Invalid=25384, Unknown=0, NotChecked=0, Total=48620 [2019-09-03 21:07:41,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-09-03 21:07:41,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2019-09-03 21:07:41,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-09-03 21:07:41,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2019-09-03 21:07:41,415 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 222 [2019-09-03 21:07:41,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:07:41,415 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2019-09-03 21:07:41,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-09-03 21:07:41,415 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2019-09-03 21:07:41,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-09-03 21:07:41,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:07:41,416 INFO L399 BasicCegarLoop]: trace histogram [107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:07:41,416 INFO L418 AbstractCegarLoop]: === Iteration 109 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:07:41,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:07:41,416 INFO L82 PathProgramCache]: Analyzing trace with hash 8808301, now seen corresponding path program 107 times [2019-09-03 21:07:41,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:07:41,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:41,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:07:41,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:41,417 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:07:41,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:07:45,469 INFO L134 CoverageAnalysis]: Checked inductivity of 11449 backedges. 0 proven. 11449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:07:45,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:45,470 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:07:45,470 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:07:45,470 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:07:45,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:07:45,470 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 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:07:45,481 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:07:45,481 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:07:45,811 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 108 check-sat command(s) [2019-09-03 21:07:45,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:07:45,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 1201 conjuncts, 114 conjunts are in the unsatisfiable core [2019-09-03 21:07:45,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:07:45,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:07:45,938 INFO L134 CoverageAnalysis]: Checked inductivity of 11449 backedges. 0 proven. 11449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:07:45,938 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:07:57,900 INFO L134 CoverageAnalysis]: Checked inductivity of 11449 backedges. 0 proven. 11449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:07:57,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:07:57,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 112, 112] total 222 [2019-09-03 21:07:57,905 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:07:57,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-09-03 21:07:57,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-09-03 21:07:57,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23663, Invalid=25399, Unknown=0, NotChecked=0, Total=49062 [2019-09-03 21:07:57,909 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 114 states. [2019-09-03 21:07:58,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:07:58,372 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2019-09-03 21:07:58,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-09-03 21:07:58,372 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 224 [2019-09-03 21:07:58,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:07:58,373 INFO L225 Difference]: With dead ends: 231 [2019-09-03 21:07:58,373 INFO L226 Difference]: Without dead ends: 228 [2019-09-03 21:07:58,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 560 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 752 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=23669, Invalid=25837, Unknown=0, NotChecked=0, Total=49506 [2019-09-03 21:07:58,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-09-03 21:07:58,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 227. [2019-09-03 21:07:58,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-09-03 21:07:58,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2019-09-03 21:07:58,377 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 224 [2019-09-03 21:07:58,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:07:58,377 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2019-09-03 21:07:58,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-09-03 21:07:58,378 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2019-09-03 21:07:58,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-09-03 21:07:58,378 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:07:58,379 INFO L399 BasicCegarLoop]: trace histogram [108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:07:58,379 INFO L418 AbstractCegarLoop]: === Iteration 110 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:07:58,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:07:58,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1008356489, now seen corresponding path program 108 times [2019-09-03 21:07:58,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:07:58,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:58,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:07:58,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:07:58,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:07:58,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:08:02,639 INFO L134 CoverageAnalysis]: Checked inductivity of 11664 backedges. 0 proven. 11664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:08:02,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:08:02,639 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:08:02,640 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:08:02,640 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:08:02,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:08:02,640 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:08:02,650 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:08:02,651 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:08:02,815 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:08:02,816 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:08:02,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 1212 conjuncts, 115 conjunts are in the unsatisfiable core [2019-09-03 21:08:02,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:08:02,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:08:03,018 INFO L134 CoverageAnalysis]: Checked inductivity of 11664 backedges. 0 proven. 11664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:08:03,018 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:08:15,359 INFO L134 CoverageAnalysis]: Checked inductivity of 11664 backedges. 0 proven. 11664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:08:15,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:08:15,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113, 113, 113] total 224 [2019-09-03 21:08:15,363 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:08:15,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-09-03 21:08:15,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-09-03 21:08:15,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24100, Invalid=25852, Unknown=0, NotChecked=0, Total=49952 [2019-09-03 21:08:15,367 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 115 states. [2019-09-03 21:08:15,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:08:15,960 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2019-09-03 21:08:15,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-09-03 21:08:15,960 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 226 [2019-09-03 21:08:15,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:08:15,961 INFO L225 Difference]: With dead ends: 233 [2019-09-03 21:08:15,961 INFO L226 Difference]: Without dead ends: 230 [2019-09-03 21:08:15,964 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=24106, Invalid=26294, Unknown=0, NotChecked=0, Total=50400 [2019-09-03 21:08:15,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-09-03 21:08:15,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2019-09-03 21:08:15,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-09-03 21:08:15,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2019-09-03 21:08:15,966 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 226 [2019-09-03 21:08:15,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:08:15,966 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2019-09-03 21:08:15,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-09-03 21:08:15,967 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2019-09-03 21:08:15,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-03 21:08:15,968 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:08:15,968 INFO L399 BasicCegarLoop]: trace histogram [109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:08:15,968 INFO L418 AbstractCegarLoop]: === Iteration 111 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:08:15,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:08:15,968 INFO L82 PathProgramCache]: Analyzing trace with hash -498509147, now seen corresponding path program 109 times [2019-09-03 21:08:15,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:08:15,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:08:15,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:08:15,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:08:15,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:08:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:08:20,305 INFO L134 CoverageAnalysis]: Checked inductivity of 11881 backedges. 0 proven. 11881 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:08:20,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:08:20,305 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:08:20,305 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:08:20,305 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:08:20,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:08:20,305 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 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:08:20,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:08:20,316 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:08:20,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:08:20,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 1223 conjuncts, 116 conjunts are in the unsatisfiable core [2019-09-03 21:08:20,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:08:20,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:08:20,606 INFO L134 CoverageAnalysis]: Checked inductivity of 11881 backedges. 0 proven. 11881 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:08:20,606 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:08:32,996 INFO L134 CoverageAnalysis]: Checked inductivity of 11881 backedges. 0 proven. 11881 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:08:32,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:08:32,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114, 114, 114] total 226 [2019-09-03 21:08:33,000 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:08:33,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-09-03 21:08:33,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-09-03 21:08:33,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24541, Invalid=26309, Unknown=0, NotChecked=0, Total=50850 [2019-09-03 21:08:33,003 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 116 states. [2019-09-03 21:08:33,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:08:33,606 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2019-09-03 21:08:33,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-09-03 21:08:33,606 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 228 [2019-09-03 21:08:33,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:08:33,607 INFO L225 Difference]: With dead ends: 235 [2019-09-03 21:08:33,607 INFO L226 Difference]: Without dead ends: 232 [2019-09-03 21:08:33,610 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=24547, Invalid=26755, Unknown=0, NotChecked=0, Total=51302 [2019-09-03 21:08:33,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-09-03 21:08:33,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 231. [2019-09-03 21:08:33,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-09-03 21:08:33,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2019-09-03 21:08:33,612 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 228 [2019-09-03 21:08:33,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:08:33,613 INFO L475 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2019-09-03 21:08:33,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-09-03 21:08:33,613 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2019-09-03 21:08:33,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-03 21:08:33,613 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:08:33,613 INFO L399 BasicCegarLoop]: trace histogram [110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:08:33,614 INFO L418 AbstractCegarLoop]: === Iteration 112 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:08:33,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:08:33,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1192406591, now seen corresponding path program 110 times [2019-09-03 21:08:33,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:08:33,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:08:33,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:08:33,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:08:33,615 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:08:33,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:08:38,003 INFO L134 CoverageAnalysis]: Checked inductivity of 12100 backedges. 0 proven. 12100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:08:38,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:08:38,004 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:08:38,004 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:08:38,004 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:08:38,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:08:38,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 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:08:38,014 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:08:38,014 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:08:38,363 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 111 check-sat command(s) [2019-09-03 21:08:38,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:08:38,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 1234 conjuncts, 117 conjunts are in the unsatisfiable core [2019-09-03 21:08:38,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:08:38,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:08:38,497 INFO L134 CoverageAnalysis]: Checked inductivity of 12100 backedges. 0 proven. 12100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:08:38,497 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:08:51,199 INFO L134 CoverageAnalysis]: Checked inductivity of 12100 backedges. 0 proven. 12100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:08:51,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:08:51,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115, 115, 115] total 228 [2019-09-03 21:08:51,203 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:08:51,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-09-03 21:08:51,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-09-03 21:08:51,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24986, Invalid=26770, Unknown=0, NotChecked=0, Total=51756 [2019-09-03 21:08:51,207 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 117 states. [2019-09-03 21:08:51,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:08:51,818 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2019-09-03 21:08:51,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-09-03 21:08:51,819 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 230 [2019-09-03 21:08:51,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:08:51,820 INFO L225 Difference]: With dead ends: 237 [2019-09-03 21:08:51,820 INFO L226 Difference]: Without dead ends: 234 [2019-09-03 21:08:51,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=24992, Invalid=27220, Unknown=0, NotChecked=0, Total=52212 [2019-09-03 21:08:51,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-09-03 21:08:51,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2019-09-03 21:08:51,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-09-03 21:08:51,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2019-09-03 21:08:51,824 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 230 [2019-09-03 21:08:51,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:08:51,824 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2019-09-03 21:08:51,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-09-03 21:08:51,824 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2019-09-03 21:08:51,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-03 21:08:51,825 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:08:51,825 INFO L399 BasicCegarLoop]: trace histogram [111, 111, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:08:51,825 INFO L418 AbstractCegarLoop]: === Iteration 113 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:08:51,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:08:51,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1987047901, now seen corresponding path program 111 times [2019-09-03 21:08:51,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:08:51,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:08:51,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:08:51,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:08:51,826 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:08:51,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:08:56,221 INFO L134 CoverageAnalysis]: Checked inductivity of 12321 backedges. 0 proven. 12321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:08:56,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:08:56,222 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:08:56,222 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:08:56,222 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:08:56,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:08:56,222 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:08:56,232 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:08:56,232 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:08:56,396 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:08:56,397 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:08:56,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 1245 conjuncts, 118 conjunts are in the unsatisfiable core [2019-09-03 21:08:56,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:08:56,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:08:56,540 INFO L134 CoverageAnalysis]: Checked inductivity of 12321 backedges. 0 proven. 12321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:08:56,541 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:09:09,596 INFO L134 CoverageAnalysis]: Checked inductivity of 12321 backedges. 0 proven. 12321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:09:09,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 21:09:09,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116, 116, 116] total 230 [2019-09-03 21:09:09,599 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:09:09,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-09-03 21:09:09,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-09-03 21:09:09,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25435, Invalid=27235, Unknown=0, NotChecked=0, Total=52670 [2019-09-03 21:09:09,602 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 118 states. [2019-09-03 21:09:10,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:09:10,083 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2019-09-03 21:09:10,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-09-03 21:09:10,084 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 232 [2019-09-03 21:09:10,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:09:10,085 INFO L225 Difference]: With dead ends: 239 [2019-09-03 21:09:10,085 INFO L226 Difference]: Without dead ends: 236 [2019-09-03 21:09:10,087 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 580 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=25441, Invalid=27689, Unknown=0, NotChecked=0, Total=53130 [2019-09-03 21:09:10,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-09-03 21:09:10,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 235. [2019-09-03 21:09:10,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-09-03 21:09:10,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2019-09-03 21:09:10,089 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 232 [2019-09-03 21:09:10,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:09:10,090 INFO L475 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2019-09-03 21:09:10,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-09-03 21:09:10,090 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2019-09-03 21:09:10,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-09-03 21:09:10,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:09:10,090 INFO L399 BasicCegarLoop]: trace histogram [112, 112, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:09:10,091 INFO L418 AbstractCegarLoop]: === Iteration 114 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:09:10,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:09:10,091 INFO L82 PathProgramCache]: Analyzing trace with hash -573900039, now seen corresponding path program 112 times [2019-09-03 21:09:10,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:09:10,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:10,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:09:10,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:10,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:09:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:14,559 INFO L134 CoverageAnalysis]: Checked inductivity of 12544 backedges. 0 proven. 12544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:09:14,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:09:14,560 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 21:09:14,560 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:09:14,560 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:09:14,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:09:14,560 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 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:09:14,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:14,570 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:09:14,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:14,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 1256 conjuncts, 119 conjunts are in the unsatisfiable core [2019-09-03 21:09:14,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:09:14,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:09:14,869 INFO L134 CoverageAnalysis]: Checked inductivity of 12544 backedges. 0 proven. 12544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:09:14,869 INFO L322 TraceCheckSpWp]: Computing backward predicates...