java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-acceleration/overflow_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 20:37:21,858 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:37:21,860 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:37:21,872 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:37:21,872 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:37:21,873 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:37:21,875 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:37:21,888 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:37:21,891 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:37:21,892 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:37:21,895 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:37:21,897 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:37:21,898 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:37:21,899 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:37:21,902 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:37:21,903 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:37:21,904 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:37:21,908 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:37:21,909 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:37:21,911 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:37:21,913 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:37:21,914 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:37:21,915 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:37:21,915 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:37:21,918 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:37:21,918 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:37:21,918 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:37:21,919 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:37:21,919 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:37:21,920 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:37:21,921 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:37:21,921 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:37:21,922 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:37:21,923 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:37:21,924 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:37:21,924 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:37:21,925 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:37:21,925 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:37:21,925 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:37:21,926 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:37:21,927 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:37:21,928 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-03 20:37:21,942 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:37:21,943 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:37:21,943 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 20:37:21,943 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 20:37:21,944 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 20:37:21,944 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 20:37:21,945 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 20:37:21,945 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 20:37:21,945 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 20:37:21,945 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 20:37:21,946 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:37:21,946 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:37:21,947 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:37:21,947 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:37:21,947 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:37:21,947 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:37:21,947 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:37:21,948 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:37:21,948 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:37:21,948 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:37:21,948 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:37:21,948 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 20:37:21,949 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:37:21,949 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:37:21,949 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:37:21,949 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:37:21,950 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 20:37:21,950 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:37:21,950 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:37:21,950 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 20:37:21,978 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:37:21,990 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:37:21,993 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:37:21,995 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:37:21,995 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:37:21,996 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/overflow_1-1.c [2019-09-03 20:37:22,058 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f91ee39f/155e9f94339945c6bb3f14f0f19f4f06/FLAG3af0bf000 [2019-09-03 20:37:22,450 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:37:22,451 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/overflow_1-1.c [2019-09-03 20:37:22,457 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f91ee39f/155e9f94339945c6bb3f14f0f19f4f06/FLAG3af0bf000 [2019-09-03 20:37:22,886 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f91ee39f/155e9f94339945c6bb3f14f0f19f4f06 [2019-09-03 20:37:22,897 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:37:22,899 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:37:22,900 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:37:22,900 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:37:22,903 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:37:22,905 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:37:22" (1/1) ... [2019-09-03 20:37:22,907 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e1d362a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:22, skipping insertion in model container [2019-09-03 20:37:22,908 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:37:22" (1/1) ... [2019-09-03 20:37:22,915 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:37:22,932 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:37:23,137 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:37:23,142 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:37:23,162 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:37:23,181 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:37:23,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:23 WrapperNode [2019-09-03 20:37:23,182 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:37:23,183 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:37:23,183 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:37:23,183 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:37:23,276 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:23" (1/1) ... [2019-09-03 20:37:23,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:23" (1/1) ... [2019-09-03 20:37:23,283 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:23" (1/1) ... [2019-09-03 20:37:23,283 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:23" (1/1) ... [2019-09-03 20:37:23,289 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:23" (1/1) ... [2019-09-03 20:37:23,294 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:23" (1/1) ... [2019-09-03 20:37:23,294 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:23" (1/1) ... [2019-09-03 20:37:23,296 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:37:23,296 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:37:23,296 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:37:23,297 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:37:23,297 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:37:23,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:37:23,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:37:23,356 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 20:37:23,356 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:37:23,356 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:37:23,357 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:37:23,357 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:37:23,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:37:23,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:37:23,508 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:37:23,508 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-03 20:37:23,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:37:23 BoogieIcfgContainer [2019-09-03 20:37:23,510 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:37:23,511 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:37:23,511 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:37:23,514 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:37:23,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:37:22" (1/3) ... [2019-09-03 20:37:23,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68aa34a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:37:23, skipping insertion in model container [2019-09-03 20:37:23,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:37:23" (2/3) ... [2019-09-03 20:37:23,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68aa34a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:37:23, skipping insertion in model container [2019-09-03 20:37:23,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:37:23" (3/3) ... [2019-09-03 20:37:23,518 INFO L109 eAbstractionObserver]: Analyzing ICFG overflow_1-1.c [2019-09-03 20:37:23,527 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:37:23,535 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 20:37:23,551 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 20:37:23,574 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:37:23,574 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 20:37:23,574 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:37:23,574 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:37:23,574 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:37:23,575 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:37:23,575 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:37:23,575 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:37:23,588 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-09-03 20:37:23,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:37:23,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:23,597 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:23,599 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:23,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:23,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1846144830, now seen corresponding path program 1 times [2019-09-03 20:37:23,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:23,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:23,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:23,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:23,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:23,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:23,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:37:23,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:37:23,827 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:37:23,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:37:23,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:37:23,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:37:23,887 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-09-03 20:37:23,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:23,931 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-09-03 20:37:23,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:37:23,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-03 20:37:23,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:23,941 INFO L225 Difference]: With dead ends: 18 [2019-09-03 20:37:23,942 INFO L226 Difference]: Without dead ends: 12 [2019-09-03 20:37:23,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:37:23,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-03 20:37:23,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-03 20:37:23,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-03 20:37:23,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-09-03 20:37:23,978 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-09-03 20:37:23,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:23,979 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-09-03 20:37:23,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:37:23,979 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-09-03 20:37:23,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-03 20:37:23,980 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:23,980 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:23,981 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:23,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:23,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1432376145, now seen corresponding path program 1 times [2019-09-03 20:37:23,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:23,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:23,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:23,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:23,983 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:23,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:24,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:24,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:24,129 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:24,130 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2019-09-03 20:37:24,132 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [19], [22], [24], [30], [31], [32], [34] [2019-09-03 20:37:24,162 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:37:24,163 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:37:24,214 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-03 20:37:24,704 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 20:37:24,708 INFO L272 AbstractInterpreter]: Visited 11 different actions 35 times. Merged at 2 different actions 8 times. Widened at 1 different actions 2 times. Performed 48 root evaluator evaluations with a maximum evaluation depth of 13. Performed 48 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 2 variables. [2019-09-03 20:37:24,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:24,713 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 20:37:24,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:24,714 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:37:24,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:24,740 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:24,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:24,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 20:37:24,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:24,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:24,823 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:24,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:24,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:24,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-09-03 20:37:24,869 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:24,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:37:24,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:37:24,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:37:24,872 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 5 states. [2019-09-03 20:37:24,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:24,894 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-09-03 20:37:24,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:37:24,895 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-09-03 20:37:24,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:24,895 INFO L225 Difference]: With dead ends: 14 [2019-09-03 20:37:24,895 INFO L226 Difference]: Without dead ends: 14 [2019-09-03 20:37:24,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:37:24,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-03 20:37:24,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-09-03 20:37:24,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-03 20:37:24,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-09-03 20:37:24,900 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2019-09-03 20:37:24,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:24,900 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-09-03 20:37:24,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:37:24,901 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-09-03 20:37:24,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-03 20:37:24,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:24,901 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:24,902 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:24,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:24,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1004266255, now seen corresponding path program 2 times [2019-09-03 20:37:24,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:24,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:24,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:24,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:24,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:25,013 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:25,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:25,014 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:25,014 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:25,014 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:25,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:25,014 INFO 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-03 20:37:25,039 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:37:25,039 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:25,057 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 20:37:25,057 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:25,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 20:37:25,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:25,087 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:25,087 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:25,178 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:25,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:25,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-09-03 20:37:25,184 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:25,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:37:25,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:37:25,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:37:25,187 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 7 states. [2019-09-03 20:37:25,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:25,226 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-09-03 20:37:25,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:37:25,228 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-09-03 20:37:25,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:25,229 INFO L225 Difference]: With dead ends: 16 [2019-09-03 20:37:25,229 INFO L226 Difference]: Without dead ends: 16 [2019-09-03 20:37:25,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:37:25,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-03 20:37:25,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-03 20:37:25,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-03 20:37:25,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-09-03 20:37:25,234 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2019-09-03 20:37:25,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:25,235 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-09-03 20:37:25,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:37:25,235 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-09-03 20:37:25,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-03 20:37:25,236 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:25,237 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:25,237 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:25,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:25,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1860436335, now seen corresponding path program 3 times [2019-09-03 20:37:25,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:25,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:25,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:25,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:25,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:25,455 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:25,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:25,456 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:25,456 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:25,456 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:25,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:25,457 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:25,481 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:37:25,482 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:37:25,495 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:37:25,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:25,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 20:37:25,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:25,530 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:25,531 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:25,691 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:25,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:25,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-09-03 20:37:25,696 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:25,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 20:37:25,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 20:37:25,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-09-03 20:37:25,697 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 9 states. [2019-09-03 20:37:25,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:25,782 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-09-03 20:37:25,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:37:25,784 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-09-03 20:37:25,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:25,785 INFO L225 Difference]: With dead ends: 18 [2019-09-03 20:37:25,785 INFO L226 Difference]: Without dead ends: 18 [2019-09-03 20:37:25,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-09-03 20:37:25,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-03 20:37:25,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-03 20:37:25,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-03 20:37:25,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-09-03 20:37:25,791 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2019-09-03 20:37:25,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:25,792 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-09-03 20:37:25,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 20:37:25,792 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-09-03 20:37:25,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 20:37:25,794 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:25,794 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:25,794 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:25,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:25,795 INFO L82 PathProgramCache]: Analyzing trace with hash -6162383, now seen corresponding path program 4 times [2019-09-03 20:37:25,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:25,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:25,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:25,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:25,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:25,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:26,016 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:26,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:26,017 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:26,017 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:26,017 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:26,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:26,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 20:37:26,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:26,033 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:37:26,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:26,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-03 20:37:26,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:26,076 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:26,076 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:26,325 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:26,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:26,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-09-03 20:37:26,329 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:26,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 20:37:26,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 20:37:26,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2019-09-03 20:37:26,332 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 11 states. [2019-09-03 20:37:26,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:26,415 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-09-03 20:37:26,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 20:37:26,415 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2019-09-03 20:37:26,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:26,416 INFO L225 Difference]: With dead ends: 20 [2019-09-03 20:37:26,416 INFO L226 Difference]: Without dead ends: 20 [2019-09-03 20:37:26,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2019-09-03 20:37:26,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-03 20:37:26,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-09-03 20:37:26,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-03 20:37:26,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-09-03 20:37:26,420 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2019-09-03 20:37:26,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:26,421 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-09-03 20:37:26,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 20:37:26,421 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-09-03 20:37:26,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-03 20:37:26,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:26,422 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:26,422 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:26,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:26,422 INFO L82 PathProgramCache]: Analyzing trace with hash -460322351, now seen corresponding path program 5 times [2019-09-03 20:37:26,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:26,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:26,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:26,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:26,424 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:26,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:26,597 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:26,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:26,597 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:26,598 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:26,598 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:26,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:26,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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:37:26,619 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:37:26,620 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:26,646 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-03 20:37:26,646 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:26,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 20:37:26,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:26,683 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:26,683 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:27,032 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:27,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:27,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-09-03 20:37:27,039 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:27,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 20:37:27,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 20:37:27,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2019-09-03 20:37:27,042 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 13 states. [2019-09-03 20:37:27,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:27,176 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-09-03 20:37:27,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 20:37:27,177 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2019-09-03 20:37:27,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:27,177 INFO L225 Difference]: With dead ends: 22 [2019-09-03 20:37:27,178 INFO L226 Difference]: Without dead ends: 22 [2019-09-03 20:37:27,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2019-09-03 20:37:27,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-03 20:37:27,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-03 20:37:27,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-03 20:37:27,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-09-03 20:37:27,185 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2019-09-03 20:37:27,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:27,186 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-09-03 20:37:27,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 20:37:27,186 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-09-03 20:37:27,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-03 20:37:27,187 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:27,187 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:27,187 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:27,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:27,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1178612593, now seen corresponding path program 6 times [2019-09-03 20:37:27,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:27,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:27,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:27,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:27,189 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:27,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:27,415 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:27,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:27,416 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:27,416 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:27,416 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:27,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:27,417 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:27,434 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:37:27,435 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:37:27,457 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:37:27,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:27,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-03 20:37:27,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:27,497 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:27,497 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:27,952 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:27,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:27,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-09-03 20:37:27,956 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:27,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 20:37:27,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 20:37:27,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=505, Unknown=0, NotChecked=0, Total=702 [2019-09-03 20:37:27,957 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 15 states. [2019-09-03 20:37:28,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:28,135 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-09-03 20:37:28,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 20:37:28,136 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2019-09-03 20:37:28,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:28,137 INFO L225 Difference]: With dead ends: 24 [2019-09-03 20:37:28,137 INFO L226 Difference]: Without dead ends: 24 [2019-09-03 20:37:28,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=197, Invalid=505, Unknown=0, NotChecked=0, Total=702 [2019-09-03 20:37:28,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-03 20:37:28,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-03 20:37:28,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-03 20:37:28,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-09-03 20:37:28,141 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2019-09-03 20:37:28,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:28,142 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-09-03 20:37:28,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 20:37:28,142 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-09-03 20:37:28,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-03 20:37:28,143 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:28,143 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:28,143 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:28,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:28,144 INFO L82 PathProgramCache]: Analyzing trace with hash -57903855, now seen corresponding path program 7 times [2019-09-03 20:37:28,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:28,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:28,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:28,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:28,145 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:28,382 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:28,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:28,382 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:28,382 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:28,383 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:28,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:28,383 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:28,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:28,405 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:37:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:28,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-03 20:37:28,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:28,452 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:28,452 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:28,975 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:28,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:28,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-09-03 20:37:28,979 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:28,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 20:37:28,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 20:37:28,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=673, Unknown=0, NotChecked=0, Total=930 [2019-09-03 20:37:28,981 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 17 states. [2019-09-03 20:37:29,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:29,235 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-09-03 20:37:29,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 20:37:29,239 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2019-09-03 20:37:29,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:29,240 INFO L225 Difference]: With dead ends: 26 [2019-09-03 20:37:29,240 INFO L226 Difference]: Without dead ends: 26 [2019-09-03 20:37:29,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=257, Invalid=673, Unknown=0, NotChecked=0, Total=930 [2019-09-03 20:37:29,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-03 20:37:29,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-09-03 20:37:29,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-03 20:37:29,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-09-03 20:37:29,248 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2019-09-03 20:37:29,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:29,248 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-09-03 20:37:29,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 20:37:29,248 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-09-03 20:37:29,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-03 20:37:29,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:29,250 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:29,250 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:29,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:29,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1355730609, now seen corresponding path program 8 times [2019-09-03 20:37:29,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:29,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:29,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:29,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:29,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:29,538 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:29,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:29,538 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:29,539 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:29,539 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:29,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:29,539 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:29,552 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:37:29,552 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:37:36,711 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-03 20:37:36,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:36,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 20:37:36,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:36,766 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:36,766 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:37,369 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:37,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:37,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-09-03 20:37:37,376 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:37,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 20:37:37,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 20:37:37,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=865, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 20:37:37,377 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 19 states. [2019-09-03 20:37:37,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:37,679 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-09-03 20:37:37,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 20:37:37,681 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2019-09-03 20:37:37,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:37,682 INFO L225 Difference]: With dead ends: 28 [2019-09-03 20:37:37,682 INFO L226 Difference]: Without dead ends: 28 [2019-09-03 20:37:37,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=325, Invalid=865, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 20:37:37,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-03 20:37:37,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-09-03 20:37:37,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-03 20:37:37,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-09-03 20:37:37,687 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2019-09-03 20:37:37,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:37,687 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-09-03 20:37:37,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 20:37:37,687 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-09-03 20:37:37,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-03 20:37:37,688 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:37,688 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:37,689 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:37,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:37,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1646182319, now seen corresponding path program 9 times [2019-09-03 20:37:37,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:37,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:37,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:37,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:37,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:38,106 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:38,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:38,106 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:38,107 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:38,107 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:38,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:38,107 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:38,118 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:37:38,118 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:37:38,132 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:37:38,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:37:38,133 WARN L254 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-03 20:37:38,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:38,172 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:38,172 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:38,906 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:38,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:38,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-09-03 20:37:38,912 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:38,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 20:37:38,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 20:37:38,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=401, Invalid=1081, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 20:37:38,914 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 21 states. [2019-09-03 20:37:39,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:39,260 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-09-03 20:37:39,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 20:37:39,263 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2019-09-03 20:37:39,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:39,264 INFO L225 Difference]: With dead ends: 30 [2019-09-03 20:37:39,264 INFO L226 Difference]: Without dead ends: 30 [2019-09-03 20:37:39,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=401, Invalid=1081, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 20:37:39,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-03 20:37:39,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-03 20:37:39,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-03 20:37:39,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-09-03 20:37:39,268 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2019-09-03 20:37:39,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:39,269 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-09-03 20:37:39,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 20:37:39,269 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-09-03 20:37:39,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-03 20:37:39,270 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:39,270 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:39,270 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:39,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:39,270 INFO L82 PathProgramCache]: Analyzing trace with hash -266483215, now seen corresponding path program 10 times [2019-09-03 20:37:39,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:39,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:39,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:37:39,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:39,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:39,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:39,653 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:39,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:39,654 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:39,654 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:39,654 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:39,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:39,655 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:39,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:39,665 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:37:39,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:39,689 WARN L254 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-03 20:37:39,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:37:39,737 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:39,737 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:37:40,669 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:40,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:37:40,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-09-03 20:37:40,674 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:37:40,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 20:37:40,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 20:37:40,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=485, Invalid=1321, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 20:37:40,676 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 23 states. [2019-09-03 20:37:41,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:37:41,086 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-09-03 20:37:41,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 20:37:41,089 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 29 [2019-09-03 20:37:41,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:37:41,089 INFO L225 Difference]: With dead ends: 32 [2019-09-03 20:37:41,090 INFO L226 Difference]: Without dead ends: 32 [2019-09-03 20:37:41,090 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=485, Invalid=1321, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 20:37:41,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-03 20:37:41,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-09-03 20:37:41,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-03 20:37:41,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-09-03 20:37:41,094 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2019-09-03 20:37:41,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:37:41,094 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-09-03 20:37:41,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 20:37:41,095 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-09-03 20:37:41,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-03 20:37:41,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:37:41,096 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:37:41,096 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:37:41,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:37:41,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1520538735, now seen corresponding path program 11 times [2019-09-03 20:37:41,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:37:41,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:41,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:37:41,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:37:41,097 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:37:41,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:37:41,540 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:37:41,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:41,540 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:37:41,541 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:37:41,541 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:37:41,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:37:41,541 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:37:41,558 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:37:41,558 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:38:47,022 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-03 20:38:47,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:38:47,941 WARN L254 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-03 20:38:47,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:38:48,007 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:38:48,008 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:39:26,536 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 217 refuted. 14 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:39:26,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:39:26,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 27] total 50 [2019-09-03 20:39:26,542 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:39:26,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 20:39:26,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 20:39:26,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=627, Invalid=1805, Unknown=18, NotChecked=0, Total=2450 [2019-09-03 20:39:26,544 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 25 states. [2019-09-03 20:39:26,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:39:26,990 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-09-03 20:39:26,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 20:39:26,993 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2019-09-03 20:39:26,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:39:26,994 INFO L225 Difference]: With dead ends: 34 [2019-09-03 20:39:26,994 INFO L226 Difference]: Without dead ends: 34 [2019-09-03 20:39:26,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 38.9s TimeCoverageRelationStatistics Valid=627, Invalid=1805, Unknown=18, NotChecked=0, Total=2450 [2019-09-03 20:39:26,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-03 20:39:26,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-09-03 20:39:26,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-03 20:39:26,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-09-03 20:39:26,998 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2019-09-03 20:39:26,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:39:26,999 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-09-03 20:39:26,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 20:39:26,999 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-09-03 20:39:27,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-03 20:39:27,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:39:27,000 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:39:27,000 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:39:27,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:39:27,001 INFO L82 PathProgramCache]: Analyzing trace with hash 217916721, now seen corresponding path program 12 times [2019-09-03 20:39:27,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:39:27,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:27,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:39:27,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:27,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:39:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:39:27,460 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:39:27,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:27,460 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:39:27,460 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:39:27,460 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:39:27,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:27,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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:39:27,471 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:39:27,471 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:39:27,493 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:39:27,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:39:27,495 WARN L254 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-03 20:39:27,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:39:27,556 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:39:27,556 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:39:29,162 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:39:29,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:39:29,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-09-03 20:39:29,166 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:39:29,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 20:39:29,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 20:39:29,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=677, Invalid=1873, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 20:39:29,168 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 27 states. [2019-09-03 20:39:29,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:39:29,727 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-09-03 20:39:29,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 20:39:29,728 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 33 [2019-09-03 20:39:29,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:39:29,729 INFO L225 Difference]: With dead ends: 36 [2019-09-03 20:39:29,729 INFO L226 Difference]: Without dead ends: 36 [2019-09-03 20:39:29,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=677, Invalid=1873, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 20:39:29,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-03 20:39:29,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-09-03 20:39:29,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-03 20:39:29,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-09-03 20:39:29,734 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2019-09-03 20:39:29,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:39:29,734 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-09-03 20:39:29,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 20:39:29,735 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-09-03 20:39:29,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-03 20:39:29,735 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:39:29,736 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:39:29,736 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:39:29,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:39:29,736 INFO L82 PathProgramCache]: Analyzing trace with hash 131331793, now seen corresponding path program 13 times [2019-09-03 20:39:29,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:39:29,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:29,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:39:29,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:29,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:39:29,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:39:30,334 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:39:30,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:30,335 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:39:30,335 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:39:30,335 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:39:30,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:30,335 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:39:30,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:39:30,346 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:39:30,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:39:30,367 WARN L254 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-03 20:39:30,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:39:30,428 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:39:30,428 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:39:31,871 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:39:31,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:39:31,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-09-03 20:39:31,874 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:39:31,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 20:39:31,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 20:39:31,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=785, Invalid=2185, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 20:39:31,877 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 29 states. [2019-09-03 20:39:32,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:39:32,515 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-09-03 20:39:32,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 20:39:32,516 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 35 [2019-09-03 20:39:32,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:39:32,517 INFO L225 Difference]: With dead ends: 38 [2019-09-03 20:39:32,517 INFO L226 Difference]: Without dead ends: 38 [2019-09-03 20:39:32,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=785, Invalid=2185, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 20:39:32,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-03 20:39:32,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-09-03 20:39:32,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-03 20:39:32,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-09-03 20:39:32,521 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2019-09-03 20:39:32,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:39:32,522 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-09-03 20:39:32,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 20:39:32,522 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-09-03 20:39:32,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-03 20:39:32,523 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:39:32,523 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:39:32,523 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:39:32,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:39:32,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1472405391, now seen corresponding path program 14 times [2019-09-03 20:39:32,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:39:32,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:32,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:39:32,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:39:32,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:39:32,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:39:33,121 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:39:33,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:33,122 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:39:33,122 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:39:33,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:39:33,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:39:33,122 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:39:33,136 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:39:33,137 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:41:12,468 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-03 20:41:12,468 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:41:12,607 WARN L254 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-03 20:41:12,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:41:12,665 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:12,665 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:41:14,303 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:14,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:41:14,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-09-03 20:41:14,311 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:41:14,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 20:41:14,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 20:41:14,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=901, Invalid=2521, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 20:41:14,312 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 31 states. [2019-09-03 20:41:15,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:41:15,107 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-09-03 20:41:15,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 20:41:15,108 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 37 [2019-09-03 20:41:15,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:41:15,108 INFO L225 Difference]: With dead ends: 40 [2019-09-03 20:41:15,109 INFO L226 Difference]: Without dead ends: 40 [2019-09-03 20:41:15,111 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=901, Invalid=2521, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 20:41:15,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-03 20:41:15,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-09-03 20:41:15,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-03 20:41:15,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-09-03 20:41:15,122 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2019-09-03 20:41:15,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:41:15,123 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-09-03 20:41:15,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 20:41:15,123 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-09-03 20:41:15,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-03 20:41:15,124 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:41:15,124 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:41:15,125 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:41:15,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:41:15,128 INFO L82 PathProgramCache]: Analyzing trace with hash -770579951, now seen corresponding path program 15 times [2019-09-03 20:41:15,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:41:15,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:15,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:41:15,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:15,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:41:15,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:41:16,016 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:16,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:16,017 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:41:16,017 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:41:16,017 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:41:16,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:16,017 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:41:16,030 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:41:16,030 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:41:16,049 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:41:16,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:41:16,050 WARN L254 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-03 20:41:16,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:41:16,115 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:16,115 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:41:18,014 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:18,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:41:18,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-09-03 20:41:18,017 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:41:18,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 20:41:18,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 20:41:18,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1025, Invalid=2881, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 20:41:18,019 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 33 states. [2019-09-03 20:41:18,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:41:18,817 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-09-03 20:41:18,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 20:41:18,820 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 39 [2019-09-03 20:41:18,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:41:18,821 INFO L225 Difference]: With dead ends: 42 [2019-09-03 20:41:18,821 INFO L226 Difference]: Without dead ends: 42 [2019-09-03 20:41:18,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1025, Invalid=2881, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 20:41:18,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-03 20:41:18,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-09-03 20:41:18,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-03 20:41:18,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-09-03 20:41:18,826 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2019-09-03 20:41:18,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:41:18,826 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-09-03 20:41:18,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 20:41:18,826 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-09-03 20:41:18,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-03 20:41:18,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:41:18,827 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:41:18,827 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:41:18,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:41:18,828 INFO L82 PathProgramCache]: Analyzing trace with hash -626197583, now seen corresponding path program 16 times [2019-09-03 20:41:18,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:41:18,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:18,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:41:18,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:18,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:41:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:41:19,600 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:19,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:19,601 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:41:19,601 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:41:19,601 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:41:19,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:19,601 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:41:19,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:41:19,612 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:41:19,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:41:19,632 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-03 20:41:19,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:41:19,701 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:19,701 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:41:21,792 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:21,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:41:21,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-09-03 20:41:21,796 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:41:21,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-03 20:41:21,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-03 20:41:21,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1157, Invalid=3265, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 20:41:21,798 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 35 states. [2019-09-03 20:41:22,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:41:22,696 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-09-03 20:41:22,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 20:41:22,696 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 41 [2019-09-03 20:41:22,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:41:22,697 INFO L225 Difference]: With dead ends: 44 [2019-09-03 20:41:22,697 INFO L226 Difference]: Without dead ends: 44 [2019-09-03 20:41:22,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1157, Invalid=3265, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 20:41:22,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-03 20:41:22,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-09-03 20:41:22,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-03 20:41:22,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-09-03 20:41:22,701 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2019-09-03 20:41:22,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:41:22,702 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-09-03 20:41:22,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-03 20:41:22,702 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-09-03 20:41:22,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-03 20:41:22,702 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:41:22,703 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:41:22,703 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:41:22,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:41:22,703 INFO L82 PathProgramCache]: Analyzing trace with hash 686304593, now seen corresponding path program 17 times [2019-09-03 20:41:22,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:41:22,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:22,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:41:22,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:41:22,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:41:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:41:23,516 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:23,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:23,517 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:41:23,517 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:41:23,517 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:41:23,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:41:23,517 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:41:23,529 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:41:23,529 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:41:49,366 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-03 20:41:49,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:41:49,386 WARN L254 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-03 20:41:49,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:41:49,513 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:41:49,514 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:41:53,953 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 16 [2019-09-03 20:42:02,337 WARN L188 SmtUtils]: Spent 4.03 s on a formula simplification that was a NOOP. DAG size: 15 [2019-09-03 20:42:08,721 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 16 [2019-09-03 20:42:28,020 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 16 [2019-09-03 20:42:36,413 WARN L188 SmtUtils]: Spent 4.02 s on a formula simplification that was a NOOP. DAG size: 16 [2019-09-03 20:43:14,959 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 16 [2019-09-03 20:43:30,168 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 16 [2019-09-03 20:43:50,736 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 547 refuted. 14 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (18)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:43:50,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:43:50,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 39] total 74 [2019-09-03 20:43:50,743 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:43:50,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 20:43:50,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 20:43:50,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1371, Invalid=3995, Unknown=36, NotChecked=0, Total=5402 [2019-09-03 20:43:50,745 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 37 states. [2019-09-03 20:43:51,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:43:51,777 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-09-03 20:43:51,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-03 20:43:51,778 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 43 [2019-09-03 20:43:51,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:43:51,779 INFO L225 Difference]: With dead ends: 46 [2019-09-03 20:43:51,779 INFO L226 Difference]: Without dead ends: 46 [2019-09-03 20:43:51,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 122.0s TimeCoverageRelationStatistics Valid=1371, Invalid=3995, Unknown=36, NotChecked=0, Total=5402 [2019-09-03 20:43:51,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-03 20:43:51,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-09-03 20:43:51,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-03 20:43:51,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-09-03 20:43:51,786 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2019-09-03 20:43:51,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:43:51,786 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-09-03 20:43:51,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 20:43:51,786 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-09-03 20:43:51,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-03 20:43:51,787 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:43:51,787 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:43:51,788 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:43:51,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:43:51,788 INFO L82 PathProgramCache]: Analyzing trace with hash -719489295, now seen corresponding path program 18 times [2019-09-03 20:43:51,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:43:51,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:43:51,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:43:51,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:43:51,789 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:43:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:43:52,658 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:43:52,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:43:52,658 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:43:52,658 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:43:52,658 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:43:52,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:43:52,659 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:43:52,669 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:43:52,669 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:43:52,707 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:43:52,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:43:52,708 WARN L254 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 73 conjunts are in the unsatisfiable core [2019-09-03 20:43:52,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:43:52,763 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:43:52,763 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:43:55,453 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:43:55,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:43:55,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-09-03 20:43:55,456 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:43:55,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-03 20:43:55,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-03 20:43:55,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1445, Invalid=4105, Unknown=0, NotChecked=0, Total=5550 [2019-09-03 20:43:55,458 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 39 states. [2019-09-03 20:43:56,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:43:56,600 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-09-03 20:43:56,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 20:43:56,601 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 45 [2019-09-03 20:43:56,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:43:56,601 INFO L225 Difference]: With dead ends: 48 [2019-09-03 20:43:56,601 INFO L226 Difference]: Without dead ends: 48 [2019-09-03 20:43:56,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1445, Invalid=4105, Unknown=0, NotChecked=0, Total=5550 [2019-09-03 20:43:56,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-03 20:43:56,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-09-03 20:43:56,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-03 20:43:56,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-09-03 20:43:56,605 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2019-09-03 20:43:56,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:43:56,605 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-09-03 20:43:56,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-03 20:43:56,606 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-09-03 20:43:56,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-03 20:43:56,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:43:56,607 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:43:56,607 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:43:56,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:43:56,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1227282577, now seen corresponding path program 19 times [2019-09-03 20:43:56,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:43:56,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:43:56,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:43:56,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:43:56,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:43:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:43:57,553 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:43:57,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:43:57,553 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:43:57,553 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:43:57,553 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:43:57,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:43:57,553 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:43:57,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:43:57,564 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:43:57,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:43:57,595 WARN L254 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-03 20:43:57,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:43:57,649 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:43:57,649 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:44:00,616 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:44:00,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:44:00,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-09-03 20:44:00,620 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:44:00,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-03 20:44:00,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-03 20:44:00,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1601, Invalid=4561, Unknown=0, NotChecked=0, Total=6162 [2019-09-03 20:44:00,622 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 41 states. [2019-09-03 20:44:01,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:44:01,921 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-09-03 20:44:01,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-03 20:44:01,922 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 47 [2019-09-03 20:44:01,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:44:01,922 INFO L225 Difference]: With dead ends: 50 [2019-09-03 20:44:01,923 INFO L226 Difference]: Without dead ends: 50 [2019-09-03 20:44:01,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1601, Invalid=4561, Unknown=0, NotChecked=0, Total=6162 [2019-09-03 20:44:01,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-03 20:44:01,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-09-03 20:44:01,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-03 20:44:01,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-09-03 20:44:01,927 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2019-09-03 20:44:01,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:44:01,927 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-09-03 20:44:01,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-03 20:44:01,928 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-09-03 20:44:01,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-03 20:44:01,928 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:44:01,929 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:44:01,929 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:44:01,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:44:01,929 INFO L82 PathProgramCache]: Analyzing trace with hash -530689487, now seen corresponding path program 20 times [2019-09-03 20:44:01,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:44:01,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:44:01,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:44:01,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:44:01,930 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:44:01,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:44:02,993 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:44:02,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:44:02,993 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:44:02,993 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:44:02,994 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:44:02,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:44:02,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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:44:03,006 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:44:03,006 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:47:04,918 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-03 20:47:04,918 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:47:05,176 WARN L254 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 81 conjunts are in the unsatisfiable core [2019-09-03 20:47:05,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:47:05,246 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:47:05,246 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:47:08,516 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:47:08,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:47:08,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-09-03 20:47:08,523 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:47:08,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-03 20:47:08,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-03 20:47:08,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1765, Invalid=5041, Unknown=0, NotChecked=0, Total=6806 [2019-09-03 20:47:08,524 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 43 states. [2019-09-03 20:47:09,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:47:09,919 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-09-03 20:47:09,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-03 20:47:09,919 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 49 [2019-09-03 20:47:09,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:47:09,920 INFO L225 Difference]: With dead ends: 52 [2019-09-03 20:47:09,920 INFO L226 Difference]: Without dead ends: 52 [2019-09-03 20:47:09,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1765, Invalid=5041, Unknown=0, NotChecked=0, Total=6806 [2019-09-03 20:47:09,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-03 20:47:09,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-09-03 20:47:09,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-03 20:47:09,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-09-03 20:47:09,923 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2019-09-03 20:47:09,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:47:09,928 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-09-03 20:47:09,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-03 20:47:09,929 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-09-03 20:47:09,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-03 20:47:09,929 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:47:09,929 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:47:09,930 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:47:09,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:47:09,930 INFO L82 PathProgramCache]: Analyzing trace with hash -2019695663, now seen corresponding path program 21 times [2019-09-03 20:47:09,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:47:09,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:47:09,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:47:09,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:47:09,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:47:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:47:11,196 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:47:11,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:47:11,197 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:47:11,197 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:47:11,197 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:47:11,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:47:11,197 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 20:47:11,214 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:47:11,215 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:47:11,249 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:47:11,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:47:11,251 WARN L254 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 85 conjunts are in the unsatisfiable core [2019-09-03 20:47:11,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:47:11,314 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:47:11,314 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:47:14,926 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:47:14,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:47:14,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-09-03 20:47:14,929 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:47:14,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-03 20:47:14,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-03 20:47:14,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1937, Invalid=5545, Unknown=0, NotChecked=0, Total=7482 [2019-09-03 20:47:14,931 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 45 states. [2019-09-03 20:47:16,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:47:16,464 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-09-03 20:47:16,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-03 20:47:16,466 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 51 [2019-09-03 20:47:16,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:47:16,467 INFO L225 Difference]: With dead ends: 54 [2019-09-03 20:47:16,467 INFO L226 Difference]: Without dead ends: 54 [2019-09-03 20:47:16,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1937, Invalid=5545, Unknown=0, NotChecked=0, Total=7482 [2019-09-03 20:47:16,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-03 20:47:16,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-09-03 20:47:16,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-03 20:47:16,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-09-03 20:47:16,476 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2019-09-03 20:47:16,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:47:16,476 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-09-03 20:47:16,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-03 20:47:16,477 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-09-03 20:47:16,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-03 20:47:16,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:47:16,478 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:47:16,478 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:47:16,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:47:16,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1564446065, now seen corresponding path program 22 times [2019-09-03 20:47:16,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:47:16,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:47:16,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:47:16,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:47:16,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:47:16,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:47:17,806 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:47:17,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:47:17,806 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:47:17,807 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:47:17,807 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:47:17,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:47:17,807 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:47:17,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:47:17,818 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:47:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:47:17,849 WARN L254 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 89 conjunts are in the unsatisfiable core [2019-09-03 20:47:17,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:47:17,919 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:47:17,919 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:47:21,971 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:47:21,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:47:21,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2019-09-03 20:47:21,975 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:47:21,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-03 20:47:21,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-03 20:47:21,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2117, Invalid=6073, Unknown=0, NotChecked=0, Total=8190 [2019-09-03 20:47:21,977 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 47 states. [2019-09-03 20:47:23,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:47:23,649 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-09-03 20:47:23,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-03 20:47:23,649 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 53 [2019-09-03 20:47:23,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:47:23,650 INFO L225 Difference]: With dead ends: 56 [2019-09-03 20:47:23,650 INFO L226 Difference]: Without dead ends: 56 [2019-09-03 20:47:23,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=2117, Invalid=6073, Unknown=0, NotChecked=0, Total=8190 [2019-09-03 20:47:23,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-03 20:47:23,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-09-03 20:47:23,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-03 20:47:23,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-09-03 20:47:23,655 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2019-09-03 20:47:23,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:47:23,655 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-09-03 20:47:23,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-03 20:47:23,655 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-09-03 20:47:23,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-03 20:47:23,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:47:23,656 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:47:23,656 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:47:23,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:47:23,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1360875281, now seen corresponding path program 23 times [2019-09-03 20:47:23,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:47:23,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:47:23,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:47:23,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:47:23,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:47:23,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:47:25,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:47:25,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:47:25,246 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:47:25,246 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:47:25,246 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:47:25,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:47:25,246 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:47:25,257 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:47:25,257 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 20:51:04,389 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-09-03 20:51:04,389 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:51:05,439 WARN L254 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 93 conjunts are in the unsatisfiable core [2019-09-03 20:51:05,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:51:05,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:05,547 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:51:09,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:09,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:51:09,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-09-03 20:51:09,932 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:51:09,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-03 20:51:09,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-03 20:51:09,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2305, Invalid=6625, Unknown=0, NotChecked=0, Total=8930 [2019-09-03 20:51:09,933 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 49 states. [2019-09-03 20:51:11,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:11,761 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-09-03 20:51:11,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-03 20:51:11,762 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 55 [2019-09-03 20:51:11,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:11,763 INFO L225 Difference]: With dead ends: 58 [2019-09-03 20:51:11,763 INFO L226 Difference]: Without dead ends: 58 [2019-09-03 20:51:11,763 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=2305, Invalid=6625, Unknown=0, NotChecked=0, Total=8930 [2019-09-03 20:51:11,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-03 20:51:11,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-09-03 20:51:11,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-03 20:51:11,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-09-03 20:51:11,766 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2019-09-03 20:51:11,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:11,766 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-09-03 20:51:11,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-03 20:51:11,771 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-09-03 20:51:11,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-03 20:51:11,772 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:11,772 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:11,772 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:11,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:11,773 INFO L82 PathProgramCache]: Analyzing trace with hash -997119823, now seen corresponding path program 24 times [2019-09-03 20:51:11,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:11,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:11,773 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:51:11,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:11,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:13,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:13,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:51:13,264 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:51:13,264 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:51:13,264 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:51:13,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:51:13,264 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:51:13,275 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:51:13,275 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 20:51:13,310 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:51:13,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:51:13,312 WARN L254 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 97 conjunts are in the unsatisfiable core [2019-09-03 20:51:13,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:51:13,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:13,394 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:51:18,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:18,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:51:18,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-09-03 20:51:18,064 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:51:18,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-03 20:51:18,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-03 20:51:18,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2501, Invalid=7201, Unknown=0, NotChecked=0, Total=9702 [2019-09-03 20:51:18,066 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 51 states. [2019-09-03 20:51:20,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:20,110 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-09-03 20:51:20,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-03 20:51:20,111 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 57 [2019-09-03 20:51:20,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:20,112 INFO L225 Difference]: With dead ends: 60 [2019-09-03 20:51:20,112 INFO L226 Difference]: Without dead ends: 60 [2019-09-03 20:51:20,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=2501, Invalid=7201, Unknown=0, NotChecked=0, Total=9702 [2019-09-03 20:51:20,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-03 20:51:20,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-09-03 20:51:20,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-03 20:51:20,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-09-03 20:51:20,115 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2019-09-03 20:51:20,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:20,116 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-09-03 20:51:20,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-03 20:51:20,116 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-09-03 20:51:20,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-03 20:51:20,116 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:20,117 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:20,117 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:20,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:20,117 INFO L82 PathProgramCache]: Analyzing trace with hash 712317521, now seen corresponding path program 25 times [2019-09-03 20:51:20,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:20,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:20,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:51:20,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:20,118 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:20,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:21,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:21,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:51:21,727 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:51:21,727 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:51:21,727 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:51:21,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:51:21,728 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:51:21,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:21,737 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 20:51:21,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:21,771 WARN L254 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 101 conjunts are in the unsatisfiable core [2019-09-03 20:51:21,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:51:21,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:21,837 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 20:51:26,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:26,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-03 20:51:26,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-09-03 20:51:26,896 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 20:51:26,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-03 20:51:26,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-03 20:51:26,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2705, Invalid=7801, Unknown=0, NotChecked=0, Total=10506 [2019-09-03 20:51:26,898 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 53 states. [2019-09-03 20:51:29,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:29,046 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-09-03 20:51:29,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-03 20:51:29,047 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 59 [2019-09-03 20:51:29,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:29,048 INFO L225 Difference]: With dead ends: 62 [2019-09-03 20:51:29,048 INFO L226 Difference]: Without dead ends: 62 [2019-09-03 20:51:29,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=2705, Invalid=7801, Unknown=0, NotChecked=0, Total=10506 [2019-09-03 20:51:29,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-03 20:51:29,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-09-03 20:51:29,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-03 20:51:29,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-09-03 20:51:29,051 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2019-09-03 20:51:29,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:29,052 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-09-03 20:51:29,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-03 20:51:29,052 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-09-03 20:51:29,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-03 20:51:29,053 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:29,053 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:29,053 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:29,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:29,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1490869263, now seen corresponding path program 26 times [2019-09-03 20:51:29,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:29,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:29,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:29,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:29,054 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:29,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:31,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:31,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:51:31,003 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:51:31,004 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 20:51:31,004 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 20:51:31,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:51:31,004 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:51:31,014 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:51:31,014 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP)