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/recursive-simple/id_o200.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 03:09:18,374 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 03:09:18,378 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 03:09:18,391 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 03:09:18,392 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 03:09:18,393 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 03:09:18,395 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 03:09:18,407 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 03:09:18,409 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 03:09:18,409 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 03:09:18,410 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 03:09:18,411 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 03:09:18,412 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 03:09:18,412 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 03:09:18,416 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 03:09:18,417 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 03:09:18,419 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 03:09:18,423 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 03:09:18,425 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 03:09:18,428 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 03:09:18,432 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 03:09:18,434 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 03:09:18,436 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 03:09:18,437 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 03:09:18,439 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 03:09:18,439 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 03:09:18,440 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 03:09:18,442 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 03:09:18,443 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 03:09:18,444 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 03:09:18,444 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 03:09:18,446 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 03:09:18,446 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 03:09:18,447 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 03:09:18,448 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 03:09:18,448 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 03:09:18,449 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 03:09:18,452 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 03:09:18,452 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 03:09:18,453 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 03:09:18,454 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 03:09:18,455 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-10 03:09:18,475 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 03:09:18,475 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 03:09:18,475 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 03:09:18,476 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 03:09:18,476 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 03:09:18,477 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 03:09:18,477 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 03:09:18,477 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 03:09:18,477 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 03:09:18,477 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 03:09:18,478 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 03:09:18,478 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 03:09:18,479 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 03:09:18,479 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 03:09:18,479 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 03:09:18,479 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 03:09:18,479 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 03:09:18,480 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 03:09:18,480 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 03:09:18,480 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 03:09:18,480 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 03:09:18,481 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 03:09:18,481 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 03:09:18,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:09:18,481 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 03:09:18,481 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 03:09:18,482 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 03:09:18,482 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 03:09:18,482 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 03:09:18,482 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 03:09:18,509 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 03:09:18,524 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 03:09:18,529 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 03:09:18,531 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 03:09:18,531 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 03:09:18,532 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_o200.c [2019-09-10 03:09:18,596 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7b13077b/381c888268344e1885d212b60eb35928/FLAG231e6f12b [2019-09-10 03:09:19,017 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 03:09:19,017 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_o200.c [2019-09-10 03:09:19,024 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7b13077b/381c888268344e1885d212b60eb35928/FLAG231e6f12b [2019-09-10 03:09:19,420 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7b13077b/381c888268344e1885d212b60eb35928 [2019-09-10 03:09:19,430 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 03:09:19,432 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 03:09:19,433 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 03:09:19,433 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 03:09:19,438 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 03:09:19,439 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:09:19" (1/1) ... [2019-09-10 03:09:19,444 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78da3abb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:09:19, skipping insertion in model container [2019-09-10 03:09:19,444 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:09:19" (1/1) ... [2019-09-10 03:09:19,452 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 03:09:19,466 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 03:09:19,619 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:09:19,623 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 03:09:19,637 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:09:19,648 INFO L192 MainTranslator]: Completed translation [2019-09-10 03:09:19,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:09:19 WrapperNode [2019-09-10 03:09:19,648 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 03:09:19,649 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 03:09:19,649 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 03:09:19,649 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 03:09:19,740 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:09:19" (1/1) ... [2019-09-10 03:09:19,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:09:19" (1/1) ... [2019-09-10 03:09:19,746 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:09:19" (1/1) ... [2019-09-10 03:09:19,747 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:09:19" (1/1) ... [2019-09-10 03:09:19,752 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:09:19" (1/1) ... [2019-09-10 03:09:19,754 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:09:19" (1/1) ... [2019-09-10 03:09:19,755 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:09:19" (1/1) ... [2019-09-10 03:09:19,756 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 03:09:19,756 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 03:09:19,756 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 03:09:19,757 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 03:09:19,757 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:09:19" (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-10 03:09:19,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 03:09:19,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 03:09:19,809 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2019-09-10 03:09:19,809 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 03:09:19,809 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-10 03:09:19,809 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 03:09:19,810 INFO L130 BoogieDeclarations]: Found specification of procedure id [2019-09-10 03:09:19,810 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 03:09:19,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 03:09:19,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 03:09:19,955 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 03:09:19,955 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 03:09:19,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:09:19 BoogieIcfgContainer [2019-09-10 03:09:19,957 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 03:09:19,958 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 03:09:19,958 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 03:09:19,960 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 03:09:19,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 03:09:19" (1/3) ... [2019-09-10 03:09:19,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f1308f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:09:19, skipping insertion in model container [2019-09-10 03:09:19,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:09:19" (2/3) ... [2019-09-10 03:09:19,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f1308f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:09:19, skipping insertion in model container [2019-09-10 03:09:19,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:09:19" (3/3) ... [2019-09-10 03:09:19,964 INFO L109 eAbstractionObserver]: Analyzing ICFG id_o200.c [2019-09-10 03:09:19,973 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 03:09:19,980 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 03:09:19,996 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 03:09:20,021 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 03:09:20,022 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 03:09:20,022 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 03:09:20,022 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 03:09:20,022 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 03:09:20,022 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 03:09:20,022 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 03:09:20,023 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 03:09:20,037 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-09-10 03:09:20,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-10 03:09:20,046 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:09:20,047 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:09:20,049 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:09:20,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:09:20,054 INFO L82 PathProgramCache]: Analyzing trace with hash -872342019, now seen corresponding path program 1 times [2019-09-10 03:09:20,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:09:20,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:20,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:09:20,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:20,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:09:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:09:20,299 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-10 03:09:20,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:09:20,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:09:20,312 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:09:20,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:09:20,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:09:20,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:09:20,362 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2019-09-10 03:09:20,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:09:20,401 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2019-09-10 03:09:20,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:09:20,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-09-10 03:09:20,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:09:20,413 INFO L225 Difference]: With dead ends: 26 [2019-09-10 03:09:20,414 INFO L226 Difference]: Without dead ends: 18 [2019-09-10 03:09:20,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:09:20,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-10 03:09:20,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-10 03:09:20,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-10 03:09:20,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-09-10 03:09:20,453 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2019-09-10 03:09:20,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:09:20,454 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-09-10 03:09:20,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:09:20,454 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-09-10 03:09:20,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-10 03:09:20,456 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:09:20,456 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:09:20,456 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:09:20,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:09:20,457 INFO L82 PathProgramCache]: Analyzing trace with hash -953570577, now seen corresponding path program 1 times [2019-09-10 03:09:20,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:09:20,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:20,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:09:20,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:20,459 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:09:20,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:09:20,652 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 03:09:20,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:20,653 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:09:20,654 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2019-09-10 03:09:20,657 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [17], [20], [21], [23], [24], [25], [26], [27], [29], [30], [31], [32] [2019-09-10 03:09:20,694 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:09:20,695 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:09:20,753 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 03:09:20,809 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:09:20,812 INFO L272 AbstractInterpreter]: Visited 16 different actions 56 times. Merged at 5 different actions 21 times. Never widened. Performed 45 root evaluator evaluations with a maximum evaluation depth of 4. Performed 45 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 4 variables. [2019-09-10 03:09:20,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:09:20,815 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:09:20,860 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-10 03:09:20,861 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:09:20,903 INFO L420 sIntCurrentIteration]: We unified 18 AI predicates to 18 [2019-09-10 03:09:20,904 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:09:20,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:09:20,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-09-10 03:09:20,905 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:09:20,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 03:09:20,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 03:09:20,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:09:20,910 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 7 states. [2019-09-10 03:09:20,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:09:20,976 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-09-10 03:09:20,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:09:20,976 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-09-10 03:09:20,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:09:20,977 INFO L225 Difference]: With dead ends: 23 [2019-09-10 03:09:20,977 INFO L226 Difference]: Without dead ends: 21 [2019-09-10 03:09:20,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:09:20,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-10 03:09:20,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-10 03:09:20,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-10 03:09:20,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-09-10 03:09:20,984 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2019-09-10 03:09:20,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:09:20,985 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-09-10 03:09:20,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 03:09:20,987 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-09-10 03:09:20,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-10 03:09:20,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:09:20,989 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:09:20,989 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:09:20,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:09:20,990 INFO L82 PathProgramCache]: Analyzing trace with hash 397359997, now seen corresponding path program 2 times [2019-09-10 03:09:20,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:09:20,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:20,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:09:20,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:20,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:09:21,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:09:21,201 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 03:09:21,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:21,202 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:09:21,203 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:09:21,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:09:21,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:21,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 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 03:09:21,232 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:09:21,232 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:09:21,262 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-10 03:09:21,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:09:21,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 03:09:21,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:09:21,345 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 03:09:21,345 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:09:21,633 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 03:09:21,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:09:21,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-09-10 03:09:21,639 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:09:21,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 03:09:21,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 03:09:21,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-09-10 03:09:21,642 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 10 states. [2019-09-10 03:09:21,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:09:21,704 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2019-09-10 03:09:21,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 03:09:21,705 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-09-10 03:09:21,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:09:21,706 INFO L225 Difference]: With dead ends: 26 [2019-09-10 03:09:21,706 INFO L226 Difference]: Without dead ends: 24 [2019-09-10 03:09:21,707 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-09-10 03:09:21,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-10 03:09:21,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-10 03:09:21,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-10 03:09:21,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-09-10 03:09:21,717 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2019-09-10 03:09:21,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:09:21,717 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-09-10 03:09:21,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 03:09:21,718 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-09-10 03:09:21,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-10 03:09:21,720 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:09:21,721 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:09:21,722 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:09:21,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:09:21,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1198310127, now seen corresponding path program 3 times [2019-09-10 03:09:21,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:09:21,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:21,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:09:21,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:21,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:09:21,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:09:21,920 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 03:09:21,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:21,921 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:09:21,921 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:09:21,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:09:21,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:21,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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 03:09:21,947 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:09:21,947 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:09:21,967 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:09:21,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:09:21,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-10 03:09:21,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:09:22,007 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 03:09:22,007 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:09:22,389 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 03:09:22,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:09:22,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-09-10 03:09:22,394 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:09:22,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 03:09:22,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 03:09:22,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2019-09-10 03:09:22,396 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 12 states. [2019-09-10 03:09:22,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:09:22,457 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2019-09-10 03:09:22,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 03:09:22,458 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2019-09-10 03:09:22,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:09:22,459 INFO L225 Difference]: With dead ends: 29 [2019-09-10 03:09:22,459 INFO L226 Difference]: Without dead ends: 27 [2019-09-10 03:09:22,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2019-09-10 03:09:22,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-10 03:09:22,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-10 03:09:22,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-10 03:09:22,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-09-10 03:09:22,466 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2019-09-10 03:09:22,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:09:22,467 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-09-10 03:09:22,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 03:09:22,467 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-09-10 03:09:22,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-10 03:09:22,468 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:09:22,468 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:09:22,469 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:09:22,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:09:22,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1080764669, now seen corresponding path program 4 times [2019-09-10 03:09:22,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:09:22,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:22,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:09:22,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:22,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:09:22,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:09:22,697 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-10 03:09:22,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:22,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:09:22,698 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:09:22,698 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:09:22,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:22,698 INFO 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-10 03:09:22,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:09:22,713 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:09:22,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:09:22,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 03:09:22,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:09:22,773 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-10 03:09:22,773 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:09:23,269 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 03:09:23,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:09:23,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-09-10 03:09:23,273 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:09:23,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 03:09:23,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 03:09:23,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2019-09-10 03:09:23,278 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 14 states. [2019-09-10 03:09:23,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:09:23,363 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2019-09-10 03:09:23,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 03:09:23,364 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2019-09-10 03:09:23,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:09:23,366 INFO L225 Difference]: With dead ends: 32 [2019-09-10 03:09:23,366 INFO L226 Difference]: Without dead ends: 30 [2019-09-10 03:09:23,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2019-09-10 03:09:23,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-10 03:09:23,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-10 03:09:23,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-10 03:09:23,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-09-10 03:09:23,372 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2019-09-10 03:09:23,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:09:23,372 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-09-10 03:09:23,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 03:09:23,373 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-09-10 03:09:23,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-10 03:09:23,374 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:09:23,374 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:09:23,374 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:09:23,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:09:23,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1752970513, now seen corresponding path program 5 times [2019-09-10 03:09:23,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:09:23,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:23,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:09:23,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:23,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:09:23,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:09:23,597 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 03:09:23,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:23,597 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:09:23,598 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:09:23,598 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:09:23,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:23,598 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:09:23,611 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:09:23,611 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:09:23,637 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-10 03:09:23,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:09:23,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-10 03:09:23,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:09:23,688 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 03:09:23,688 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:09:24,329 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 03:09:24,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:09:24,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-09-10 03:09:24,333 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:09:24,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 03:09:24,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 03:09:24,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2019-09-10 03:09:24,334 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 16 states. [2019-09-10 03:09:24,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:09:24,460 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2019-09-10 03:09:24,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 03:09:24,461 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2019-09-10 03:09:24,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:09:24,462 INFO L225 Difference]: With dead ends: 35 [2019-09-10 03:09:24,462 INFO L226 Difference]: Without dead ends: 33 [2019-09-10 03:09:24,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2019-09-10 03:09:24,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-10 03:09:24,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-10 03:09:24,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-10 03:09:24,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-09-10 03:09:24,469 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2019-09-10 03:09:24,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:09:24,469 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-09-10 03:09:24,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 03:09:24,470 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-09-10 03:09:24,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-10 03:09:24,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:09:24,471 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:09:24,472 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:09:24,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:09:24,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1590630787, now seen corresponding path program 6 times [2019-09-10 03:09:24,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:09:24,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:24,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:09:24,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:24,473 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:09:24,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:09:24,758 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-10 03:09:24,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:24,759 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:09:24,759 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:09:24,759 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:09:24,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:24,760 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 03:09:24,782 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:09:24,782 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:09:24,815 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:09:24,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:09:24,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-10 03:09:24,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:09:24,892 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-10 03:09:24,892 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:09:25,922 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-10 03:09:25,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:09:25,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-09-10 03:09:25,926 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:09:25,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 03:09:25,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 03:09:25,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=904, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 03:09:25,934 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 18 states. [2019-09-10 03:09:26,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:09:26,091 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2019-09-10 03:09:26,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 03:09:26,092 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 49 [2019-09-10 03:09:26,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:09:26,094 INFO L225 Difference]: With dead ends: 38 [2019-09-10 03:09:26,094 INFO L226 Difference]: Without dead ends: 36 [2019-09-10 03:09:26,095 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=152, Invalid=904, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 03:09:26,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-10 03:09:26,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-09-10 03:09:26,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-10 03:09:26,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-09-10 03:09:26,102 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 49 [2019-09-10 03:09:26,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:09:26,103 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-09-10 03:09:26,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 03:09:26,103 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-09-10 03:09:26,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 03:09:26,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:09:26,104 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:09:26,105 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:09:26,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:09:26,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1532150511, now seen corresponding path program 7 times [2019-09-10 03:09:26,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:09:26,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:26,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:09:26,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:26,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:09:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:09:26,400 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-10 03:09:26,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:26,400 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:09:26,400 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:09:26,401 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:09:26,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:26,401 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:09:26,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:09:26,413 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:09:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:09:26,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-10 03:09:26,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:09:26,478 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-10 03:09:26,478 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:09:27,511 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-10 03:09:27,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:09:27,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-09-10 03:09:27,515 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:09:27,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 03:09:27,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 03:09:27,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1144, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 03:09:27,517 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 20 states. [2019-09-10 03:09:27,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:09:27,675 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2019-09-10 03:09:27,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 03:09:27,676 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2019-09-10 03:09:27,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:09:27,677 INFO L225 Difference]: With dead ends: 41 [2019-09-10 03:09:27,677 INFO L226 Difference]: Without dead ends: 39 [2019-09-10 03:09:27,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=188, Invalid=1144, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 03:09:27,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-10 03:09:27,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-09-10 03:09:27,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-10 03:09:27,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-09-10 03:09:27,688 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 55 [2019-09-10 03:09:27,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:09:27,688 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-09-10 03:09:27,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 03:09:27,688 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-09-10 03:09:27,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 03:09:27,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:09:27,690 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:09:27,690 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:09:27,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:09:27,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1140618237, now seen corresponding path program 8 times [2019-09-10 03:09:27,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:09:27,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:27,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:09:27,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:27,692 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:09:27,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:09:27,993 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-10 03:09:27,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:27,993 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:09:27,993 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:09:27,993 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:09:27,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:27,994 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:09:28,005 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:09:28,005 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:09:28,037 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-10 03:09:28,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:09:28,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-10 03:09:28,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:09:28,099 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-10 03:09:28,099 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:09:29,452 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 03:09:29,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:09:29,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-09-10 03:09:29,457 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:09:29,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 03:09:29,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 03:09:29,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1412, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 03:09:29,458 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 22 states. [2019-09-10 03:09:29,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:09:29,661 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2019-09-10 03:09:29,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 03:09:29,661 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 61 [2019-09-10 03:09:29,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:09:29,663 INFO L225 Difference]: With dead ends: 44 [2019-09-10 03:09:29,664 INFO L226 Difference]: Without dead ends: 42 [2019-09-10 03:09:29,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=228, Invalid=1412, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 03:09:29,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-10 03:09:29,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-09-10 03:09:29,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-10 03:09:29,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-09-10 03:09:29,671 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 61 [2019-09-10 03:09:29,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:09:29,671 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-09-10 03:09:29,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 03:09:29,671 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-09-10 03:09:29,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 03:09:29,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:09:29,673 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:09:29,673 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:09:29,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:09:29,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1749177617, now seen corresponding path program 9 times [2019-09-10 03:09:29,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:09:29,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:29,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:09:29,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:29,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:09:29,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:09:30,022 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-10 03:09:30,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:30,023 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:09:30,023 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:09:30,023 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:09:30,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:30,024 INFO 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-10 03:09:30,039 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:09:30,039 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 03:09:30,073 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:09:30,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:09:30,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-10 03:09:30,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:09:30,118 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-10 03:09:30,118 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:09:31,615 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-10 03:09:31,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:09:31,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-09-10 03:09:31,619 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:09:31,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 03:09:31,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 03:09:31,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1708, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 03:09:31,621 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 24 states. [2019-09-10 03:09:31,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:09:31,890 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2019-09-10 03:09:31,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 03:09:31,891 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 67 [2019-09-10 03:09:31,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:09:31,893 INFO L225 Difference]: With dead ends: 47 [2019-09-10 03:09:31,893 INFO L226 Difference]: Without dead ends: 45 [2019-09-10 03:09:31,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=272, Invalid=1708, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 03:09:31,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-10 03:09:31,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-09-10 03:09:31,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-10 03:09:31,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-09-10 03:09:31,900 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 67 [2019-09-10 03:09:31,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:09:31,901 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-09-10 03:09:31,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 03:09:31,901 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-09-10 03:09:31,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 03:09:31,903 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:09:31,903 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:09:31,903 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:09:31,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:09:31,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1580609155, now seen corresponding path program 10 times [2019-09-10 03:09:31,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:09:31,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:31,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:09:31,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:31,905 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:09:31,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:09:32,304 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-09-10 03:09:32,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:32,305 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:09:32,306 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:09:32,306 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:09:32,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:32,306 INFO 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-10 03:09:32,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:09:32,325 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:09:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:09:32,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-10 03:09:32,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:09:32,397 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-09-10 03:09:32,397 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:09:34,197 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-09-10 03:09:34,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:09:34,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-09-10 03:09:34,201 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:09:34,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 03:09:34,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 03:09:34,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=2032, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 03:09:34,203 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 26 states. [2019-09-10 03:09:34,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:09:34,510 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2019-09-10 03:09:34,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 03:09:34,511 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 73 [2019-09-10 03:09:34,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:09:34,512 INFO L225 Difference]: With dead ends: 50 [2019-09-10 03:09:34,512 INFO L226 Difference]: Without dead ends: 48 [2019-09-10 03:09:34,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=320, Invalid=2032, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 03:09:34,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-10 03:09:34,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-09-10 03:09:34,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-10 03:09:34,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-09-10 03:09:34,519 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 73 [2019-09-10 03:09:34,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:09:34,519 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-09-10 03:09:34,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 03:09:34,520 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-09-10 03:09:34,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 03:09:34,521 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:09:34,522 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:09:34,522 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:09:34,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:09:34,522 INFO L82 PathProgramCache]: Analyzing trace with hash -223837457, now seen corresponding path program 11 times [2019-09-10 03:09:34,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:09:34,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:34,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:09:34,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:34,523 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:09:34,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:09:34,956 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-09-10 03:09:34,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:34,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:09:34,957 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:09:34,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:09:34,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:34,957 INFO 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-10 03:09:34,990 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:09:34,991 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:09:35,051 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-10 03:09:35,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:09:35,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-10 03:09:35,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:09:35,093 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-09-10 03:09:35,093 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:09:37,175 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-09-10 03:09:37,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:09:37,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-09-10 03:09:37,181 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:09:37,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 03:09:37,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 03:09:37,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=2384, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 03:09:37,183 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 28 states. [2019-09-10 03:09:37,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:09:37,529 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2019-09-10 03:09:37,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 03:09:37,530 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 79 [2019-09-10 03:09:37,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:09:37,531 INFO L225 Difference]: With dead ends: 53 [2019-09-10 03:09:37,532 INFO L226 Difference]: Without dead ends: 51 [2019-09-10 03:09:37,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=372, Invalid=2384, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 03:09:37,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-10 03:09:37,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-09-10 03:09:37,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-10 03:09:37,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-09-10 03:09:37,539 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 79 [2019-09-10 03:09:37,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:09:37,540 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-09-10 03:09:37,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 03:09:37,540 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-09-10 03:09:37,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 03:09:37,541 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:09:37,541 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:09:37,541 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:09:37,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:09:37,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1653931773, now seen corresponding path program 12 times [2019-09-10 03:09:37,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:09:37,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:37,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:09:37,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:37,543 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:09:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:09:38,033 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-09-10 03:09:38,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:38,034 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:09:38,034 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:09:38,034 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:09:38,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:38,034 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:09:38,049 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:09:38,050 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 03:09:38,074 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:09:38,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:09:38,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-10 03:09:38,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:09:38,133 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-09-10 03:09:38,133 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:09:40,780 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-09-10 03:09:40,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:09:40,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-09-10 03:09:40,783 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:09:40,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-10 03:09:40,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-10 03:09:40,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=428, Invalid=2764, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 03:09:40,785 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 30 states. [2019-09-10 03:09:41,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:09:41,144 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2019-09-10 03:09:41,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 03:09:41,144 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 85 [2019-09-10 03:09:41,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:09:41,146 INFO L225 Difference]: With dead ends: 56 [2019-09-10 03:09:41,146 INFO L226 Difference]: Without dead ends: 54 [2019-09-10 03:09:41,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 142 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=428, Invalid=2764, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 03:09:41,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-10 03:09:41,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-09-10 03:09:41,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-10 03:09:41,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2019-09-10 03:09:41,159 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 85 [2019-09-10 03:09:41,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:09:41,160 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2019-09-10 03:09:41,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-10 03:09:41,160 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2019-09-10 03:09:41,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 03:09:41,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:09:41,165 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:09:41,165 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:09:41,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:09:41,166 INFO L82 PathProgramCache]: Analyzing trace with hash -218674449, now seen corresponding path program 13 times [2019-09-10 03:09:41,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:09:41,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:41,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:09:41,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:41,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:09:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:09:41,810 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-09-10 03:09:41,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:41,810 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:09:41,810 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:09:41,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:09:41,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:41,811 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:09:41,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:09:41,831 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:09:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:09:41,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-10 03:09:41,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:09:41,913 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-09-10 03:09:41,913 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:09:44,769 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-09-10 03:09:44,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:09:44,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-09-10 03:09:44,773 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:09:44,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-10 03:09:44,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-10 03:09:44,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=488, Invalid=3172, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 03:09:44,783 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 32 states. [2019-09-10 03:09:45,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:09:45,191 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2019-09-10 03:09:45,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 03:09:45,191 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 91 [2019-09-10 03:09:45,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:09:45,192 INFO L225 Difference]: With dead ends: 59 [2019-09-10 03:09:45,192 INFO L226 Difference]: Without dead ends: 57 [2019-09-10 03:09:45,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=488, Invalid=3172, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 03:09:45,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-10 03:09:45,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-09-10 03:09:45,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-10 03:09:45,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-09-10 03:09:45,202 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 91 [2019-09-10 03:09:45,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:09:45,203 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-09-10 03:09:45,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-10 03:09:45,203 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-09-10 03:09:45,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 03:09:45,204 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:09:45,204 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:09:45,204 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:09:45,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:09:45,205 INFO L82 PathProgramCache]: Analyzing trace with hash 492436605, now seen corresponding path program 14 times [2019-09-10 03:09:45,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:09:45,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:45,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:09:45,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:45,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:09:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:09:45,880 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-09-10 03:09:45,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:45,880 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:09:45,880 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:09:45,881 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:09:45,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:45,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 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-10 03:09:45,891 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:09:45,891 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:09:46,251 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-10 03:09:46,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:09:46,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-10 03:09:46,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:09:46,300 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-09-10 03:09:46,300 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:09:49,581 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-09-10 03:09:49,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:09:49,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-09-10 03:09:49,586 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:09:49,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-10 03:09:49,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-10 03:09:49,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=552, Invalid=3608, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 03:09:49,588 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 34 states. [2019-09-10 03:09:50,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:09:50,095 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2019-09-10 03:09:50,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 03:09:50,096 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 97 [2019-09-10 03:09:50,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:09:50,097 INFO L225 Difference]: With dead ends: 62 [2019-09-10 03:09:50,097 INFO L226 Difference]: Without dead ends: 60 [2019-09-10 03:09:50,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 162 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=552, Invalid=3608, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 03:09:50,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-10 03:09:50,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-09-10 03:09:50,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-10 03:09:50,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-09-10 03:09:50,105 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 97 [2019-09-10 03:09:50,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:09:50,105 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-09-10 03:09:50,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-10 03:09:50,105 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-09-10 03:09:50,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 03:09:50,106 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:09:50,106 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:09:50,107 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:09:50,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:09:50,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1083048687, now seen corresponding path program 15 times [2019-09-10 03:09:50,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:09:50,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:50,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:09:50,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:50,108 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:09:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:09:50,747 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-09-10 03:09:50,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:50,747 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:09:50,747 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:09:50,748 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:09:50,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:50,748 INFO 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-10 03:09:50,760 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:09:50,760 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 03:09:50,792 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:09:50,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:09:50,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-10 03:09:50,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:09:50,859 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-09-10 03:09:50,859 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:09:54,459 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-09-10 03:09:54,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:09:54,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-09-10 03:09:54,463 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:09:54,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-10 03:09:54,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-10 03:09:54,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=620, Invalid=4072, Unknown=0, NotChecked=0, Total=4692 [2019-09-10 03:09:54,466 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 36 states. [2019-09-10 03:09:55,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:09:55,051 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2019-09-10 03:09:55,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-10 03:09:55,053 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 103 [2019-09-10 03:09:55,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:09:55,054 INFO L225 Difference]: With dead ends: 65 [2019-09-10 03:09:55,055 INFO L226 Difference]: Without dead ends: 63 [2019-09-10 03:09:55,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 172 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=620, Invalid=4072, Unknown=0, NotChecked=0, Total=4692 [2019-09-10 03:09:55,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-10 03:09:55,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-09-10 03:09:55,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-10 03:09:55,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-09-10 03:09:55,061 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 103 [2019-09-10 03:09:55,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:09:55,062 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-09-10 03:09:55,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-10 03:09:55,062 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-09-10 03:09:55,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 03:09:55,063 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:09:55,063 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:09:55,063 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:09:55,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:09:55,064 INFO L82 PathProgramCache]: Analyzing trace with hash 404015613, now seen corresponding path program 16 times [2019-09-10 03:09:55,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:09:55,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:55,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:09:55,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:09:55,065 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:09:55,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:09:56,051 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-09-10 03:09:56,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:56,052 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:09:56,052 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:09:56,052 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:09:56,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:09:56,052 INFO 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-10 03:09:56,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:09:56,074 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:09:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:09:56,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-10 03:09:56,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:09:56,167 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-09-10 03:09:56,167 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:10:00,335 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-09-10 03:10:00,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:10:00,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-09-10 03:10:00,339 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:10:00,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-10 03:10:00,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-10 03:10:00,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=692, Invalid=4564, Unknown=0, NotChecked=0, Total=5256 [2019-09-10 03:10:00,341 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 38 states. [2019-09-10 03:10:00,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:10:00,982 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2019-09-10 03:10:00,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 03:10:00,982 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 109 [2019-09-10 03:10:00,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:10:00,984 INFO L225 Difference]: With dead ends: 68 [2019-09-10 03:10:00,984 INFO L226 Difference]: Without dead ends: 66 [2019-09-10 03:10:00,986 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 182 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=692, Invalid=4564, Unknown=0, NotChecked=0, Total=5256 [2019-09-10 03:10:00,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-10 03:10:00,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-09-10 03:10:00,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-10 03:10:00,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2019-09-10 03:10:00,992 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 109 [2019-09-10 03:10:00,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:10:00,992 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2019-09-10 03:10:00,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-10 03:10:00,992 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2019-09-10 03:10:00,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 03:10:00,993 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:10:00,993 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:10:00,993 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:10:00,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:10:00,994 INFO L82 PathProgramCache]: Analyzing trace with hash -464475409, now seen corresponding path program 17 times [2019-09-10 03:10:00,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:10:00,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:00,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:10:00,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:00,998 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:10:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:10:01,836 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-09-10 03:10:01,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:01,836 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:10:01,836 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:10:01,836 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:10:01,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:01,837 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10 03:10:01,847 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:10:01,847 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:10:12,642 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-10 03:10:12,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:10:12,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 76 conjunts are in the unsatisfiable core [2019-09-10 03:10:12,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:10:12,936 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-09-10 03:10:12,936 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:10:17,542 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-09-10 03:10:17,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:10:17,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-09-10 03:10:17,548 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:10:17,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-10 03:10:17,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-10 03:10:17,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=768, Invalid=5084, Unknown=0, NotChecked=0, Total=5852 [2019-09-10 03:10:17,550 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 40 states. [2019-09-10 03:10:18,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:10:18,185 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2019-09-10 03:10:18,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-10 03:10:18,185 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 115 [2019-09-10 03:10:18,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:10:18,186 INFO L225 Difference]: With dead ends: 71 [2019-09-10 03:10:18,187 INFO L226 Difference]: Without dead ends: 69 [2019-09-10 03:10:18,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=768, Invalid=5084, Unknown=0, NotChecked=0, Total=5852 [2019-09-10 03:10:18,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-10 03:10:18,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-09-10 03:10:18,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-10 03:10:18,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-09-10 03:10:18,194 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 115 [2019-09-10 03:10:18,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:10:18,194 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-09-10 03:10:18,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-10 03:10:18,194 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-09-10 03:10:18,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 03:10:18,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:10:18,195 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:10:18,195 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:10:18,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:10:18,196 INFO L82 PathProgramCache]: Analyzing trace with hash 130115453, now seen corresponding path program 18 times [2019-09-10 03:10:18,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:10:18,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:18,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:10:18,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:18,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:10:18,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:10:19,176 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-09-10 03:10:19,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:19,176 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:10:19,176 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:10:19,177 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:10:19,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:19,177 INFO 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-10 03:10:19,188 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:10:19,188 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 03:10:19,223 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:10:19,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:10:19,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-10 03:10:19,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:10:19,297 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-09-10 03:10:19,297 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:10:24,300 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-09-10 03:10:24,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:10:24,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-09-10 03:10:24,304 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:10:24,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-10 03:10:24,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-10 03:10:24,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=848, Invalid=5632, Unknown=0, NotChecked=0, Total=6480 [2019-09-10 03:10:24,305 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 42 states. [2019-09-10 03:10:25,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:10:25,102 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2019-09-10 03:10:25,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-10 03:10:25,108 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 121 [2019-09-10 03:10:25,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:10:25,109 INFO L225 Difference]: With dead ends: 74 [2019-09-10 03:10:25,110 INFO L226 Difference]: Without dead ends: 72 [2019-09-10 03:10:25,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 202 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=848, Invalid=5632, Unknown=0, NotChecked=0, Total=6480 [2019-09-10 03:10:25,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-10 03:10:25,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-09-10 03:10:25,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-10 03:10:25,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2019-09-10 03:10:25,114 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 121 [2019-09-10 03:10:25,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:10:25,115 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2019-09-10 03:10:25,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-10 03:10:25,115 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2019-09-10 03:10:25,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 03:10:25,116 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:10:25,116 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:10:25,116 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:10:25,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:10:25,117 INFO L82 PathProgramCache]: Analyzing trace with hash -2010955025, now seen corresponding path program 19 times [2019-09-10 03:10:25,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:10:25,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:25,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:10:25,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:25,118 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:10:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:10:26,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-09-10 03:10:26,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:26,247 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:10:26,247 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:10:26,247 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:10:26,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:26,248 INFO 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-10 03:10:26,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:10:26,258 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:10:26,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:10:26,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 84 conjunts are in the unsatisfiable core [2019-09-10 03:10:26,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:10:26,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-09-10 03:10:26,365 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:10:31,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-09-10 03:10:31,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:10:31,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-09-10 03:10:31,877 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:10:31,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-10 03:10:31,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-10 03:10:31,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=932, Invalid=6208, Unknown=0, NotChecked=0, Total=7140 [2019-09-10 03:10:31,878 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 44 states. [2019-09-10 03:10:32,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:10:32,761 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2019-09-10 03:10:32,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-10 03:10:32,762 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 127 [2019-09-10 03:10:32,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:10:32,763 INFO L225 Difference]: With dead ends: 77 [2019-09-10 03:10:32,764 INFO L226 Difference]: Without dead ends: 75 [2019-09-10 03:10:32,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 212 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=932, Invalid=6208, Unknown=0, NotChecked=0, Total=7140 [2019-09-10 03:10:32,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-10 03:10:32,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-09-10 03:10:32,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-10 03:10:32,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-09-10 03:10:32,769 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 127 [2019-09-10 03:10:32,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:10:32,769 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-09-10 03:10:32,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-10 03:10:32,770 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-09-10 03:10:32,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 03:10:32,770 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:10:32,771 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:10:32,771 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:10:32,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:10:32,771 INFO L82 PathProgramCache]: Analyzing trace with hash -799288067, now seen corresponding path program 20 times [2019-09-10 03:10:32,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:10:32,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:32,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:10:32,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:32,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:10:32,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:10:33,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2019-09-10 03:10:33,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:33,878 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:10:33,878 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:10:33,879 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:10:33,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:33,879 INFO 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-10 03:10:33,889 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:10:33,889 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:11:53,302 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-10 03:11:53,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:11:54,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 88 conjunts are in the unsatisfiable core [2019-09-10 03:11:54,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:11:54,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2019-09-10 03:11:54,266 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:12:00,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2019-09-10 03:12:00,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:12:00,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-09-10 03:12:00,315 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:12:00,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-10 03:12:00,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-10 03:12:00,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1020, Invalid=6812, Unknown=0, NotChecked=0, Total=7832 [2019-09-10 03:12:00,317 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 46 states. [2019-09-10 03:12:01,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:12:01,235 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2019-09-10 03:12:01,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-10 03:12:01,235 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 133 [2019-09-10 03:12:01,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:12:01,237 INFO L225 Difference]: With dead ends: 80 [2019-09-10 03:12:01,237 INFO L226 Difference]: Without dead ends: 78 [2019-09-10 03:12:01,238 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1020, Invalid=6812, Unknown=0, NotChecked=0, Total=7832 [2019-09-10 03:12:01,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-10 03:12:01,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-09-10 03:12:01,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-10 03:12:01,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2019-09-10 03:12:01,242 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 133 [2019-09-10 03:12:01,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:12:01,243 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2019-09-10 03:12:01,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-10 03:12:01,243 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2019-09-10 03:12:01,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 03:12:01,244 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:12:01,244 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:12:01,244 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:12:01,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:12:01,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1226192145, now seen corresponding path program 21 times [2019-09-10 03:12:01,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:12:01,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:12:01,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:12:01,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:12:01,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:12:01,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:12:02,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2019-09-10 03:12:02,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:12:02,461 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:12:02,461 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:12:02,461 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:12:02,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:12:02,461 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:12:02,471 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:12:02,472 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 03:12:02,512 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:12:02,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:12:02,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 92 conjunts are in the unsatisfiable core [2019-09-10 03:12:02,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:12:02,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2019-09-10 03:12:02,605 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:12:09,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2019-09-10 03:12:09,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:12:09,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-09-10 03:12:09,526 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:12:09,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-10 03:12:09,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-10 03:12:09,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1112, Invalid=7444, Unknown=0, NotChecked=0, Total=8556 [2019-09-10 03:12:09,528 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 48 states. [2019-09-10 03:12:10,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:12:10,544 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2019-09-10 03:12:10,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-10 03:12:10,547 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 139 [2019-09-10 03:12:10,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:12:10,548 INFO L225 Difference]: With dead ends: 83 [2019-09-10 03:12:10,548 INFO L226 Difference]: Without dead ends: 81 [2019-09-10 03:12:10,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 232 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1112, Invalid=7444, Unknown=0, NotChecked=0, Total=8556 [2019-09-10 03:12:10,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-09-10 03:12:10,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-09-10 03:12:10,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-10 03:12:10,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-09-10 03:12:10,553 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 139 [2019-09-10 03:12:10,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:12:10,553 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-09-10 03:12:10,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-10 03:12:10,553 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-09-10 03:12:10,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 03:12:10,554 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:12:10,555 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:12:10,555 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:12:10,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:12:10,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1155535485, now seen corresponding path program 22 times [2019-09-10 03:12:10,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:12:10,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:12:10,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:12:10,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:12:10,556 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:12:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:12:11,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2019-09-10 03:12:11,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:12:11,733 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:12:11,733 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:12:11,734 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:12:11,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:12:11,734 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10 03:12:11,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:12:11,744 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:12:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:12:11,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 96 conjunts are in the unsatisfiable core [2019-09-10 03:12:11,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:12:11,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2019-09-10 03:12:11,860 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:12:19,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2019-09-10 03:12:19,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:12:19,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-09-10 03:12:19,052 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:12:19,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-10 03:12:19,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-10 03:12:19,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1208, Invalid=8104, Unknown=0, NotChecked=0, Total=9312 [2019-09-10 03:12:19,053 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 50 states. [2019-09-10 03:12:20,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:12:20,219 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2019-09-10 03:12:20,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-10 03:12:20,219 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 145 [2019-09-10 03:12:20,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:12:20,221 INFO L225 Difference]: With dead ends: 86 [2019-09-10 03:12:20,221 INFO L226 Difference]: Without dead ends: 84 [2019-09-10 03:12:20,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 242 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1208, Invalid=8104, Unknown=0, NotChecked=0, Total=9312 [2019-09-10 03:12:20,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-09-10 03:12:20,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-09-10 03:12:20,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-09-10 03:12:20,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2019-09-10 03:12:20,226 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 145 [2019-09-10 03:12:20,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:12:20,227 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2019-09-10 03:12:20,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-10 03:12:20,227 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2019-09-10 03:12:20,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-10 03:12:20,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:12:20,228 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:12:20,228 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:12:20,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:12:20,228 INFO L82 PathProgramCache]: Analyzing trace with hash 478692079, now seen corresponding path program 23 times [2019-09-10 03:12:20,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:12:20,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:12:20,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:12:20,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:12:20,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:12:20,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:12:21,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2019-09-10 03:12:21,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:12:21,484 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:12:21,484 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:12:21,484 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:12:21,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:12:21,485 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:12:21,498 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:12:21,498 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:14:33,519 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-09-10 03:14:33,519 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:14:33,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 100 conjunts are in the unsatisfiable core [2019-09-10 03:14:33,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:14:33,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2019-09-10 03:14:33,797 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:14:41,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2019-09-10 03:14:41,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:14:41,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-09-10 03:14:41,758 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:14:41,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-10 03:14:41,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-10 03:14:41,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1308, Invalid=8792, Unknown=0, NotChecked=0, Total=10100 [2019-09-10 03:14:41,759 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 52 states. [2019-09-10 03:14:42,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:14:42,940 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2019-09-10 03:14:42,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-10 03:14:42,940 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 151 [2019-09-10 03:14:42,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:14:42,942 INFO L225 Difference]: With dead ends: 89 [2019-09-10 03:14:42,942 INFO L226 Difference]: Without dead ends: 87 [2019-09-10 03:14:42,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 252 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1308, Invalid=8792, Unknown=0, NotChecked=0, Total=10100 [2019-09-10 03:14:42,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-09-10 03:14:42,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-09-10 03:14:42,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-10 03:14:42,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-09-10 03:14:42,947 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 151 [2019-09-10 03:14:42,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:14:42,948 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-09-10 03:14:42,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-10 03:14:42,948 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-09-10 03:14:42,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-10 03:14:42,949 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:14:42,949 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:14:42,950 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:14:42,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:14:42,950 INFO L82 PathProgramCache]: Analyzing trace with hash -414572547, now seen corresponding path program 24 times [2019-09-10 03:14:42,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:14:42,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:14:42,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:14:42,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:14:42,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:14:42,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:14:44,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2019-09-10 03:14:44,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:14:44,412 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:14:44,412 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:14:44,412 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:14:44,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:14:44,412 INFO 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-10 03:14:44,424 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:14:44,425 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 03:14:44,491 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:14:44,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:14:44,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 104 conjunts are in the unsatisfiable core [2019-09-10 03:14:44,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:14:44,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2019-09-10 03:14:44,643 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:14:53,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2019-09-10 03:14:53,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:14:53,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-09-10 03:14:53,189 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:14:53,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-10 03:14:53,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-10 03:14:53,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1412, Invalid=9508, Unknown=0, NotChecked=0, Total=10920 [2019-09-10 03:14:53,190 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 54 states. [2019-09-10 03:14:54,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:14:54,533 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2019-09-10 03:14:54,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-10 03:14:54,536 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 157 [2019-09-10 03:14:54,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:14:54,537 INFO L225 Difference]: With dead ends: 92 [2019-09-10 03:14:54,537 INFO L226 Difference]: Without dead ends: 90 [2019-09-10 03:14:54,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 262 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1412, Invalid=9508, Unknown=0, NotChecked=0, Total=10920 [2019-09-10 03:14:54,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-10 03:14:54,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-09-10 03:14:54,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-10 03:14:54,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2019-09-10 03:14:54,541 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 157 [2019-09-10 03:14:54,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:14:54,542 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2019-09-10 03:14:54,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-10 03:14:54,542 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2019-09-10 03:14:54,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-10 03:14:54,543 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:14:54,543 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:14:54,544 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:14:54,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:14:54,544 INFO L82 PathProgramCache]: Analyzing trace with hash -975000849, now seen corresponding path program 25 times [2019-09-10 03:14:54,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:14:54,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:14:54,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:14:54,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:14:54,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:14:54,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:14:56,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1900 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2019-09-10 03:14:56,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:14:56,203 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:14:56,203 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:14:56,203 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:14:56,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:14:56,203 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:14:56,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:14:56,214 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:14:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:14:56,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 108 conjunts are in the unsatisfiable core [2019-09-10 03:14:56,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:14:56,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1900 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2019-09-10 03:14:56,362 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:15:05,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1900 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2019-09-10 03:15:05,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:15:05,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2019-09-10 03:15:05,788 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:15:05,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-10 03:15:05,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-10 03:15:05,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1520, Invalid=10252, Unknown=0, NotChecked=0, Total=11772 [2019-09-10 03:15:05,790 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 56 states. [2019-09-10 03:15:07,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:15:07,208 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2019-09-10 03:15:07,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-10 03:15:07,208 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 163 [2019-09-10 03:15:07,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:15:07,210 INFO L225 Difference]: With dead ends: 95 [2019-09-10 03:15:07,210 INFO L226 Difference]: Without dead ends: 93 [2019-09-10 03:15:07,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 272 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1520, Invalid=10252, Unknown=0, NotChecked=0, Total=11772 [2019-09-10 03:15:07,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-10 03:15:07,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-09-10 03:15:07,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-09-10 03:15:07,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-09-10 03:15:07,215 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 163 [2019-09-10 03:15:07,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:15:07,216 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-09-10 03:15:07,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-10 03:15:07,216 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-09-10 03:15:07,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-10 03:15:07,217 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:15:07,217 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:15:07,217 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:15:07,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:15:07,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1466565251, now seen corresponding path program 26 times [2019-09-10 03:15:07,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:15:07,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:15:07,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:15:07,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:15:07,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:15:07,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:15:08,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2054 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2019-09-10 03:15:08,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:15:08,824 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:15:08,825 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:15:08,825 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:15:08,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:15:08,825 INFO 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-10 03:15:08,834 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:15:08,834 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:16:14,693 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-09-10 03:16:14,693 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:16:15,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 112 conjunts are in the unsatisfiable core [2019-09-10 03:16:15,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:16:15,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2054 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2019-09-10 03:16:15,173 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:16:25,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2054 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2019-09-10 03:16:25,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:16:25,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2019-09-10 03:16:25,289 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:16:25,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-10 03:16:25,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-10 03:16:25,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1632, Invalid=11024, Unknown=0, NotChecked=0, Total=12656 [2019-09-10 03:16:25,291 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 58 states. [2019-09-10 03:16:26,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:16:26,860 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2019-09-10 03:16:26,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-10 03:16:26,860 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 169 [2019-09-10 03:16:26,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:16:26,861 INFO L225 Difference]: With dead ends: 98 [2019-09-10 03:16:26,862 INFO L226 Difference]: Without dead ends: 96 [2019-09-10 03:16:26,863 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 282 SyntacticMatches, 1 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=1632, Invalid=11024, Unknown=0, NotChecked=0, Total=12656 [2019-09-10 03:16:26,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-10 03:16:26,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-09-10 03:16:26,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-10 03:16:26,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2019-09-10 03:16:26,867 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 169 [2019-09-10 03:16:26,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:16:26,867 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2019-09-10 03:16:26,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-10 03:16:26,868 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2019-09-10 03:16:26,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-10 03:16:26,869 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:16:26,869 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:16:26,869 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:16:26,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:16:26,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1625096943, now seen corresponding path program 27 times [2019-09-10 03:16:26,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:16:26,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:16:26,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:16:26,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:16:26,871 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:16:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:16:28,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2214 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked. [2019-09-10 03:16:28,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:16:28,658 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:16:28,658 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:16:28,658 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:16:28,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:16:28,658 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:16:28,669 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:16:28,669 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 03:16:28,726 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:16:28,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:16:28,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 116 conjunts are in the unsatisfiable core [2019-09-10 03:16:28,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:16:28,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2214 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked. [2019-09-10 03:16:28,841 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:16:39,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2214 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked. [2019-09-10 03:16:39,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:16:39,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2019-09-10 03:16:39,637 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:16:39,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-10 03:16:39,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-10 03:16:39,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1748, Invalid=11824, Unknown=0, NotChecked=0, Total=13572 [2019-09-10 03:16:39,639 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 60 states. [2019-09-10 03:16:41,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:16:41,247 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2019-09-10 03:16:41,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-10 03:16:41,247 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 175 [2019-09-10 03:16:41,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:16:41,249 INFO L225 Difference]: With dead ends: 101 [2019-09-10 03:16:41,249 INFO L226 Difference]: Without dead ends: 99 [2019-09-10 03:16:41,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 292 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 925 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=1748, Invalid=11824, Unknown=0, NotChecked=0, Total=13572 [2019-09-10 03:16:41,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-10 03:16:41,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-09-10 03:16:41,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-09-10 03:16:41,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-09-10 03:16:41,254 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 175 [2019-09-10 03:16:41,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:16:41,255 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-09-10 03:16:41,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-10 03:16:41,255 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-09-10 03:16:41,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 03:16:41,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:16:41,256 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:16:41,256 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:16:41,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:16:41,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1463833859, now seen corresponding path program 28 times [2019-09-10 03:16:41,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:16:41,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:16:41,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:16:41,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:16:41,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:16:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:16:43,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2019-09-10 03:16:43,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:16:43,076 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:16:43,077 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:16:43,077 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:16:43,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:16:43,077 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:16:43,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:16:43,088 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:16:43,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:16:43,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 120 conjunts are in the unsatisfiable core [2019-09-10 03:16:43,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:16:43,238 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2019-09-10 03:16:43,239 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:16:54,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2019-09-10 03:16:54,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:16:54,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2019-09-10 03:16:54,873 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:16:54,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-10 03:16:54,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-10 03:16:54,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1868, Invalid=12652, Unknown=0, NotChecked=0, Total=14520 [2019-09-10 03:16:54,876 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 62 states. [2019-09-10 03:16:56,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:16:56,618 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2019-09-10 03:16:56,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-10 03:16:56,618 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 181 [2019-09-10 03:16:56,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:16:56,620 INFO L225 Difference]: With dead ends: 104 [2019-09-10 03:16:56,621 INFO L226 Difference]: Without dead ends: 102 [2019-09-10 03:16:56,623 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 302 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=1868, Invalid=12652, Unknown=0, NotChecked=0, Total=14520 [2019-09-10 03:16:56,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-09-10 03:16:56,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-09-10 03:16:56,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-09-10 03:16:56,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2019-09-10 03:16:56,633 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 181 [2019-09-10 03:16:56,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:16:56,634 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2019-09-10 03:16:56,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-10 03:16:56,634 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2019-09-10 03:16:56,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 03:16:56,635 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:16:56,635 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:16:56,636 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:16:56,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:16:56,636 INFO L82 PathProgramCache]: Analyzing trace with hash 2086357743, now seen corresponding path program 29 times [2019-09-10 03:16:56,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:16:56,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:16:56,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:16:56,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:16:56,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:16:56,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:16:58,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2552 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 1276 trivial. 0 not checked. [2019-09-10 03:16:58,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:16:58,644 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:16:58,644 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:16:58,644 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:16:58,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:16:58,645 INFO 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-10 03:16:58,655 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:16:58,656 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:17:58,148 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-09-10 03:17:58,148 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:17:58,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 124 conjunts are in the unsatisfiable core [2019-09-10 03:17:58,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:17:58,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2552 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 1276 trivial. 0 not checked. [2019-09-10 03:17:58,467 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:18:10,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2552 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 1276 trivial. 0 not checked. [2019-09-10 03:18:10,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:18:10,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2019-09-10 03:18:10,691 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:18:10,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-10 03:18:10,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-10 03:18:10,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1992, Invalid=13508, Unknown=0, NotChecked=0, Total=15500 [2019-09-10 03:18:10,693 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 64 states. [2019-09-10 03:18:12,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:18:12,573 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2019-09-10 03:18:12,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-10 03:18:12,573 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 187 [2019-09-10 03:18:12,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:18:12,575 INFO L225 Difference]: With dead ends: 107 [2019-09-10 03:18:12,575 INFO L226 Difference]: Without dead ends: 105 [2019-09-10 03:18:12,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 312 SyntacticMatches, 1 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1051 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=1992, Invalid=13508, Unknown=0, NotChecked=0, Total=15500 [2019-09-10 03:18:12,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-09-10 03:18:12,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-09-10 03:18:12,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-09-10 03:18:12,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-09-10 03:18:12,581 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 187 [2019-09-10 03:18:12,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:18:12,581 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-09-10 03:18:12,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-10 03:18:12,581 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-09-10 03:18:12,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 03:18:12,583 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:18:12,583 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:18:12,583 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:18:12,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:18:12,583 INFO L82 PathProgramCache]: Analyzing trace with hash -154982275, now seen corresponding path program 30 times [2019-09-10 03:18:12,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:18:12,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:12,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:18:12,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:12,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:18:12,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:18:14,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2730 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 1365 trivial. 0 not checked. [2019-09-10 03:18:14,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:18:14,636 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:18:14,636 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:18:14,637 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:18:14,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:18:14,637 INFO 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-10 03:18:14,647 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:18:14,648 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 03:18:14,703 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:18:14,703 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:18:14,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 128 conjunts are in the unsatisfiable core [2019-09-10 03:18:14,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:18:14,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2730 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 1365 trivial. 0 not checked. [2019-09-10 03:18:14,820 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:18:28,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2730 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 1365 trivial. 0 not checked. [2019-09-10 03:18:28,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:18:28,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2019-09-10 03:18:28,118 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:18:28,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-10 03:18:28,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-10 03:18:28,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2120, Invalid=14392, Unknown=0, NotChecked=0, Total=16512 [2019-09-10 03:18:28,120 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 66 states. [2019-09-10 03:18:30,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:18:30,154 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2019-09-10 03:18:30,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-10 03:18:30,155 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 193 [2019-09-10 03:18:30,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:18:30,156 INFO L225 Difference]: With dead ends: 110 [2019-09-10 03:18:30,157 INFO L226 Difference]: Without dead ends: 108 [2019-09-10 03:18:30,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 322 SyntacticMatches, 1 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1117 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=2120, Invalid=14392, Unknown=0, NotChecked=0, Total=16512 [2019-09-10 03:18:30,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-09-10 03:18:30,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-09-10 03:18:30,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-09-10 03:18:30,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2019-09-10 03:18:30,163 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 193 [2019-09-10 03:18:30,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:18:30,163 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2019-09-10 03:18:30,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-10 03:18:30,163 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2019-09-10 03:18:30,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-10 03:18:30,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:18:30,165 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:18:30,165 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:18:30,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:18:30,165 INFO L82 PathProgramCache]: Analyzing trace with hash -935230737, now seen corresponding path program 31 times [2019-09-10 03:18:30,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:18:30,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:30,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:18:30,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:30,166 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:18:30,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:18:32,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2914 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 1457 trivial. 0 not checked. [2019-09-10 03:18:32,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:18:32,330 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:18:32,330 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:18:32,331 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:18:32,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:18:32,331 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 03:18:32,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:18:32,365 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:18:32,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:18:32,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 132 conjunts are in the unsatisfiable core [2019-09-10 03:18:32,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:18:32,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2914 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 1457 trivial. 0 not checked. [2019-09-10 03:18:32,526 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:18:46,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2914 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 1457 trivial. 0 not checked. [2019-09-10 03:18:46,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:18:46,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2019-09-10 03:18:46,694 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:18:46,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-10 03:18:46,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-10 03:18:46,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2252, Invalid=15304, Unknown=0, NotChecked=0, Total=17556 [2019-09-10 03:18:46,695 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 68 states. [2019-09-10 03:18:48,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:18:48,855 INFO L93 Difference]: Finished difference Result 113 states and 114 transitions. [2019-09-10 03:18:48,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-10 03:18:48,855 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 199 [2019-09-10 03:18:48,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:18:48,856 INFO L225 Difference]: With dead ends: 113 [2019-09-10 03:18:48,856 INFO L226 Difference]: Without dead ends: 111 [2019-09-10 03:18:48,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 332 SyntacticMatches, 1 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1185 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=2252, Invalid=15304, Unknown=0, NotChecked=0, Total=17556 [2019-09-10 03:18:48,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-10 03:18:48,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-09-10 03:18:48,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-09-10 03:18:48,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-09-10 03:18:48,863 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 199 [2019-09-10 03:18:48,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:18:48,863 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-09-10 03:18:48,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-10 03:18:48,863 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-09-10 03:18:48,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-10 03:18:48,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:18:48,864 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:18:48,865 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:18:48,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:18:48,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1352431101, now seen corresponding path program 32 times [2019-09-10 03:18:48,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:18:48,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:48,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:18:48,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:18:48,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:18:48,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:18:51,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3104 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 1552 trivial. 0 not checked. [2019-09-10 03:18:51,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:18:51,432 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:18:51,432 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:18:51,432 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:18:51,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:18:51,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 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-10 03:18:51,449 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:18:51,449 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:22:59,087 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-09-10 03:22:59,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:22:59,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 136 conjunts are in the unsatisfiable core [2019-09-10 03:22:59,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:23:00,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3104 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 1552 trivial. 0 not checked. [2019-09-10 03:23:00,097 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:23:15,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3104 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 1552 trivial. 0 not checked. [2019-09-10 03:23:15,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:23:15,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2019-09-10 03:23:15,374 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:23:15,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-10 03:23:15,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-10 03:23:15,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2388, Invalid=16244, Unknown=0, NotChecked=0, Total=18632 [2019-09-10 03:23:15,376 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 70 states. [2019-09-10 03:23:17,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:23:17,613 INFO L93 Difference]: Finished difference Result 116 states and 117 transitions. [2019-09-10 03:23:17,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-10 03:23:17,614 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 205 [2019-09-10 03:23:17,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:23:17,614 INFO L225 Difference]: With dead ends: 116 [2019-09-10 03:23:17,615 INFO L226 Difference]: Without dead ends: 114 [2019-09-10 03:23:17,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 342 SyntacticMatches, 1 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1255 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=2388, Invalid=16244, Unknown=0, NotChecked=0, Total=18632 [2019-09-10 03:23:17,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-10 03:23:17,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-09-10 03:23:17,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-09-10 03:23:17,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2019-09-10 03:23:17,621 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 205 [2019-09-10 03:23:17,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:23:17,621 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2019-09-10 03:23:17,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-10 03:23:17,621 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2019-09-10 03:23:17,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-10 03:23:17,622 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:23:17,623 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:23:17,623 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:23:17,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:23:17,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1433643759, now seen corresponding path program 33 times [2019-09-10 03:23:17,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:23:17,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:17,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:23:17,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:17,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:23:17,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:23:20,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3300 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 1650 trivial. 0 not checked. [2019-09-10 03:23:20,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:23:20,110 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:23:20,110 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:23:20,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:23:20,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:23:20,110 INFO 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-10 03:23:20,130 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:23:20,130 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 03:23:20,187 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:23:20,187 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:23:20,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 140 conjunts are in the unsatisfiable core [2019-09-10 03:23:20,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:23:20,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3300 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 1650 trivial. 0 not checked. [2019-09-10 03:23:20,376 INFO L322 TraceCheckSpWp]: Computing backward predicates...