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/loops-crafted-1/Mono6_1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 13:13:41,192 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 13:13:41,194 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 13:13:41,205 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 13:13:41,206 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 13:13:41,207 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 13:13:41,208 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 13:13:41,210 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 13:13:41,212 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 13:13:41,212 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 13:13:41,213 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 13:13:41,214 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 13:13:41,215 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 13:13:41,216 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 13:13:41,217 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 13:13:41,218 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 13:13:41,219 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 13:13:41,219 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 13:13:41,221 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 13:13:41,223 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 13:13:41,224 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 13:13:41,225 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 13:13:41,227 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 13:13:41,227 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 13:13:41,230 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 13:13:41,230 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 13:13:41,230 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 13:13:41,231 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 13:13:41,231 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 13:13:41,232 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 13:13:41,232 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 13:13:41,233 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 13:13:41,234 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 13:13:41,235 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 13:13:41,236 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 13:13:41,236 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 13:13:41,236 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 13:13:41,237 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 13:13:41,237 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 13:13:41,238 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 13:13:41,238 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 13:13:41,239 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-05 13:13:41,256 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 13:13:41,256 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 13:13:41,257 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-05 13:13:41,257 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-05 13:13:41,258 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-05 13:13:41,258 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-05 13:13:41,258 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-05 13:13:41,258 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-05 13:13:41,258 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-05 13:13:41,259 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-05 13:13:41,259 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 13:13:41,260 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 13:13:41,260 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 13:13:41,260 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 13:13:41,260 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 13:13:41,260 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 13:13:41,260 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 13:13:41,261 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 13:13:41,261 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 13:13:41,261 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 13:13:41,261 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 13:13:41,261 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-05 13:13:41,262 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 13:13:41,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 13:13:41,262 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 13:13:41,262 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 13:13:41,262 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-05 13:13:41,263 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 13:13:41,263 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 13:13:41,263 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-05 13:13:41,292 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 13:13:41,302 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 13:13:41,306 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 13:13:41,307 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 13:13:41,307 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 13:13:41,308 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono6_1.c [2019-09-05 13:13:41,371 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/276135b27/17739d519cc14234b92f31e94f302266/FLAG550783159 [2019-09-05 13:13:41,832 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 13:13:41,832 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono6_1.c [2019-09-05 13:13:41,839 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/276135b27/17739d519cc14234b92f31e94f302266/FLAG550783159 [2019-09-05 13:13:42,216 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/276135b27/17739d519cc14234b92f31e94f302266 [2019-09-05 13:13:42,225 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 13:13:42,226 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 13:13:42,227 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 13:13:42,227 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 13:13:42,231 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 13:13:42,232 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 01:13:42" (1/1) ... [2019-09-05 13:13:42,234 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f05c7a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:13:42, skipping insertion in model container [2019-09-05 13:13:42,235 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 01:13:42" (1/1) ... [2019-09-05 13:13:42,242 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 13:13:42,258 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 13:13:42,398 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 13:13:42,403 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 13:13:42,417 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 13:13:42,428 INFO L192 MainTranslator]: Completed translation [2019-09-05 13:13:42,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:13:42 WrapperNode [2019-09-05 13:13:42,429 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 13:13:42,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 13:13:42,430 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 13:13:42,430 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 13:13:42,529 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:13:42" (1/1) ... [2019-09-05 13:13:42,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:13:42" (1/1) ... [2019-09-05 13:13:42,537 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:13:42" (1/1) ... [2019-09-05 13:13:42,537 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:13:42" (1/1) ... [2019-09-05 13:13:42,542 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:13:42" (1/1) ... [2019-09-05 13:13:42,549 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:13:42" (1/1) ... [2019-09-05 13:13:42,550 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:13:42" (1/1) ... [2019-09-05 13:13:42,551 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 13:13:42,552 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 13:13:42,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 13:13:42,552 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 13:13:42,553 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:13:42" (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-05 13:13:42,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 13:13:42,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 13:13:42,603 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 13:13:42,603 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 13:13:42,603 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 13:13:42,603 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 13:13:42,604 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 13:13:42,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 13:13:42,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 13:13:42,757 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 13:13:42,758 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-05 13:13:42,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 01:13:42 BoogieIcfgContainer [2019-09-05 13:13:42,759 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 13:13:42,760 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 13:13:42,760 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 13:13:42,763 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 13:13:42,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 01:13:42" (1/3) ... [2019-09-05 13:13:42,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bfd687c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 01:13:42, skipping insertion in model container [2019-09-05 13:13:42,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:13:42" (2/3) ... [2019-09-05 13:13:42,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bfd687c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 01:13:42, skipping insertion in model container [2019-09-05 13:13:42,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 01:13:42" (3/3) ... [2019-09-05 13:13:42,767 INFO L109 eAbstractionObserver]: Analyzing ICFG Mono6_1.c [2019-09-05 13:13:42,777 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 13:13:42,785 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 13:13:42,802 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 13:13:42,836 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 13:13:42,836 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-05 13:13:42,837 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 13:13:42,837 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 13:13:42,837 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 13:13:42,837 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 13:13:42,837 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 13:13:42,837 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 13:13:42,858 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-09-05 13:13:42,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 13:13:42,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:13:42,871 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:13:42,875 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:13:42,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:13:42,882 INFO L82 PathProgramCache]: Analyzing trace with hash -147882559, now seen corresponding path program 1 times [2019-09-05 13:13:42,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:13:42,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:42,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:13:42,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:42,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:13:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:13:43,024 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-05 13:13:43,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:13:43,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-05 13:13:43,027 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:13:43,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-05 13:13:43,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-05 13:13:43,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 13:13:43,046 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2019-09-05 13:13:43,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:13:43,062 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2019-09-05 13:13:43,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-05 13:13:43,063 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-05 13:13:43,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:13:43,073 INFO L225 Difference]: With dead ends: 20 [2019-09-05 13:13:43,074 INFO L226 Difference]: Without dead ends: 13 [2019-09-05 13:13:43,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 13:13:43,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-09-05 13:13:43,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-09-05 13:13:43,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-05 13:13:43,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-09-05 13:13:43,115 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-09-05 13:13:43,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:13:43,116 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-09-05 13:13:43,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-05 13:13:43,117 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-09-05 13:13:43,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 13:13:43,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:13:43,118 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:13:43,119 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:13:43,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:13:43,123 INFO L82 PathProgramCache]: Analyzing trace with hash -158041290, now seen corresponding path program 1 times [2019-09-05 13:13:43,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:13:43,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:43,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:13:43,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:43,129 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:13:43,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:13:43,366 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-05 13:13:43,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:13:43,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 13:13:43,368 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:13:43,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 13:13:43,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 13:13:43,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 13:13:43,373 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2019-09-05 13:13:43,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:13:43,416 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2019-09-05 13:13:43,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 13:13:43,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-05 13:13:43,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:13:43,418 INFO L225 Difference]: With dead ends: 16 [2019-09-05 13:13:43,419 INFO L226 Difference]: Without dead ends: 16 [2019-09-05 13:13:43,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 13:13:43,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-05 13:13:43,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2019-09-05 13:13:43,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-05 13:13:43,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-09-05 13:13:43,424 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2019-09-05 13:13:43,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:13:43,425 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-09-05 13:13:43,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 13:13:43,425 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-09-05 13:13:43,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-05 13:13:43,426 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:13:43,426 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:13:43,426 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:13:43,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:13:43,427 INFO L82 PathProgramCache]: Analyzing trace with hash 743821333, now seen corresponding path program 1 times [2019-09-05 13:13:43,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:13:43,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:43,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:13:43,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:43,429 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:13:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:13:43,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:13:43,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:13:43,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 13:13:43,492 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:13:43,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 13:13:43,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 13:13:43,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 13:13:43,494 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 3 states. [2019-09-05 13:13:43,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:13:43,526 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2019-09-05 13:13:43,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 13:13:43,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-09-05 13:13:43,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:13:43,529 INFO L225 Difference]: With dead ends: 16 [2019-09-05 13:13:43,529 INFO L226 Difference]: Without dead ends: 16 [2019-09-05 13:13:43,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 13:13:43,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-05 13:13:43,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-09-05 13:13:43,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-05 13:13:43,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-09-05 13:13:43,534 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2019-09-05 13:13:43,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:13:43,534 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-09-05 13:13:43,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 13:13:43,535 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-09-05 13:13:43,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-05 13:13:43,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:13:43,536 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:13:43,536 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:13:43,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:13:43,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1776138601, now seen corresponding path program 1 times [2019-09-05 13:13:43,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:13:43,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:43,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:13:43,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:43,538 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:13:43,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:13:43,678 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-05 13:13:43,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:43,679 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:13:43,680 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2019-09-05 13:13:43,682 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [18], [20], [27], [30], [32], [38], [39], [40], [42] [2019-09-05 13:13:43,713 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:13:43,713 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:13:43,780 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-05 13:13:43,870 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:13:43,873 INFO L272 AbstractInterpreter]: Visited 13 different actions 61 times. Merged at 4 different actions 24 times. Widened at 1 different actions 4 times. Performed 86 root evaluator evaluations with a maximum evaluation depth of 6. Performed 86 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 4 variables. [2019-09-05 13:13:43,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:13:43,877 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:13:43,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:43,877 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:13:43,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:13:43,889 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:13:43,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:13:43,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-05 13:13:43,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:13:43,969 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-05 13:13:43,969 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:13:44,078 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-05 13:13:44,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:13:44,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2019-09-05 13:13:44,084 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:13:44,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 13:13:44,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 13:13:44,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-09-05 13:13:44,089 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 7 states. [2019-09-05 13:13:44,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:13:44,160 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-09-05 13:13:44,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 13:13:44,162 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-09-05 13:13:44,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:13:44,163 INFO L225 Difference]: With dead ends: 19 [2019-09-05 13:13:44,163 INFO L226 Difference]: Without dead ends: 19 [2019-09-05 13:13:44,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-09-05 13:13:44,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-05 13:13:44,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-09-05 13:13:44,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-05 13:13:44,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-09-05 13:13:44,167 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2019-09-05 13:13:44,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:13:44,168 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-09-05 13:13:44,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 13:13:44,168 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-09-05 13:13:44,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-05 13:13:44,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:13:44,169 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:13:44,169 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:13:44,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:13:44,170 INFO L82 PathProgramCache]: Analyzing trace with hash 199799702, now seen corresponding path program 2 times [2019-09-05 13:13:44,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:13:44,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:44,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:13:44,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:44,172 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:13:44,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:13:44,365 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:13:44,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:44,366 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:13:44,366 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:13:44,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:13:44,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:44,367 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-05 13:13:44,391 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:13:44,392 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-05 13:13:44,402 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2019-09-05 13:13:44,403 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:13:44,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-05 13:13:44,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:13:44,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:13:44,516 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-05 13:13:44,516 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:13:44,648 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-05 13:13:44,652 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-05 13:13:44,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [6] total 14 [2019-09-05 13:13:44,652 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:13:44,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 13:13:44,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 13:13:44,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-09-05 13:13:44,654 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2019-09-05 13:13:44,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:13:44,751 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-09-05 13:13:44,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 13:13:44,752 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-09-05 13:13:44,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:13:44,753 INFO L225 Difference]: With dead ends: 24 [2019-09-05 13:13:44,753 INFO L226 Difference]: Without dead ends: 21 [2019-09-05 13:13:44,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-09-05 13:13:44,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-05 13:13:44,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-05 13:13:44,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-05 13:13:44,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-09-05 13:13:44,761 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2019-09-05 13:13:44,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:13:44,761 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-09-05 13:13:44,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 13:13:44,761 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-09-05 13:13:44,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-05 13:13:44,764 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:13:44,764 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:13:44,764 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:13:44,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:13:44,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1075985333, now seen corresponding path program 1 times [2019-09-05 13:13:44,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:13:44,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:44,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:13:44,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:44,768 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:13:44,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:13:44,894 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:13:44,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:44,895 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:13:44,898 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2019-09-05 13:13:44,899 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [16], [18], [20], [27], [30], [32], [38], [39], [40], [42] [2019-09-05 13:13:44,901 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:13:44,901 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:13:44,907 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-05 13:13:44,997 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:13:44,998 INFO L272 AbstractInterpreter]: Visited 14 different actions 72 times. Merged at 5 different actions 28 times. Widened at 1 different actions 4 times. Performed 139 root evaluator evaluations with a maximum evaluation depth of 6. Performed 139 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 8 fixpoints after 3 different actions. Largest state had 5 variables. [2019-09-05 13:13:44,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:13:44,998 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:13:44,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:44,999 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-05 13:13:45,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:13:45,015 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:13:45,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:13:45,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-05 13:13:45,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:13:45,060 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:13:45,061 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:13:45,101 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:13:45,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:13:45,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-09-05 13:13:45,106 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:13:45,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 13:13:45,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 13:13:45,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-05 13:13:45,108 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 6 states. [2019-09-05 13:13:45,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:13:45,172 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2019-09-05 13:13:45,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:13:45,173 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-09-05 13:13:45,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:13:45,174 INFO L225 Difference]: With dead ends: 25 [2019-09-05 13:13:45,174 INFO L226 Difference]: Without dead ends: 25 [2019-09-05 13:13:45,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-05 13:13:45,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-05 13:13:45,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-09-05 13:13:45,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-05 13:13:45,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-09-05 13:13:45,182 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 19 [2019-09-05 13:13:45,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:13:45,183 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-09-05 13:13:45,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 13:13:45,183 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-09-05 13:13:45,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-05 13:13:45,184 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:13:45,184 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:13:45,185 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:13:45,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:13:45,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1682133644, now seen corresponding path program 2 times [2019-09-05 13:13:45,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:13:45,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:45,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:13:45,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:45,187 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:13:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:13:45,311 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:13:45,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:45,311 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:13:45,312 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:13:45,312 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:13:45,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:45,312 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:13:45,328 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:13:45,328 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:13:45,345 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-05 13:13:45,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:13:45,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-05 13:13:45,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:13:45,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:13:45,431 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-05 13:13:45,431 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:13:45,593 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-05 13:13:45,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:13:45,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2019-09-05 13:13:45,597 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:13:45,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-05 13:13:45,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-05 13:13:45,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-09-05 13:13:45,600 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 11 states. [2019-09-05 13:13:45,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:13:45,829 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-09-05 13:13:45,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-05 13:13:45,830 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-09-05 13:13:45,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:13:45,831 INFO L225 Difference]: With dead ends: 34 [2019-09-05 13:13:45,831 INFO L226 Difference]: Without dead ends: 31 [2019-09-05 13:13:45,832 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2019-09-05 13:13:45,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-05 13:13:45,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-09-05 13:13:45,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-05 13:13:45,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-09-05 13:13:45,840 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 22 [2019-09-05 13:13:45,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:13:45,841 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-09-05 13:13:45,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-05 13:13:45,841 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-09-05 13:13:45,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-05 13:13:45,843 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:13:45,844 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:13:45,844 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:13:45,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:13:45,844 INFO L82 PathProgramCache]: Analyzing trace with hash -2062781546, now seen corresponding path program 3 times [2019-09-05 13:13:45,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:13:45,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:45,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:13:45,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:45,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:13:45,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:13:45,998 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:13:45,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:45,999 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:13:45,999 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:13:45,999 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:13:45,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:45,999 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:13:46,016 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:13:46,016 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:13:46,033 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:13:46,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:13:46,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-05 13:13:46,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:13:46,067 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:13:46,067 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:13:46,149 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:13:46,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:13:46,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-09-05 13:13:46,153 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:13:46,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 13:13:46,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 13:13:46,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-09-05 13:13:46,154 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 8 states. [2019-09-05 13:13:46,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:13:46,250 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-09-05 13:13:46,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 13:13:46,250 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-09-05 13:13:46,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:13:46,251 INFO L225 Difference]: With dead ends: 34 [2019-09-05 13:13:46,251 INFO L226 Difference]: Without dead ends: 34 [2019-09-05 13:13:46,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-09-05 13:13:46,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-05 13:13:46,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-09-05 13:13:46,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-05 13:13:46,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2019-09-05 13:13:46,256 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 28 [2019-09-05 13:13:46,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:13:46,256 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2019-09-05 13:13:46,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 13:13:46,257 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2019-09-05 13:13:46,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-05 13:13:46,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:13:46,258 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:13:46,258 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:13:46,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:13:46,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1147963575, now seen corresponding path program 4 times [2019-09-05 13:13:46,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:13:46,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:46,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:13:46,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:46,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:13:46,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:13:46,389 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 28 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:13:46,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:46,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:13:46,389 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:13:46,389 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:13:46,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:46,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:13:46,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:13:46,404 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:13:46,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:13:46,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-05 13:13:46,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:13:46,443 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 28 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:13:46,443 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:13:46,573 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 28 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:13:46,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:13:46,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-09-05 13:13:46,576 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:13:46,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-05 13:13:46,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-05 13:13:46,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-09-05 13:13:46,577 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 9 states. [2019-09-05 13:13:46,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:13:46,706 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-09-05 13:13:46,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 13:13:46,706 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-09-05 13:13:46,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:13:46,707 INFO L225 Difference]: With dead ends: 37 [2019-09-05 13:13:46,707 INFO L226 Difference]: Without dead ends: 37 [2019-09-05 13:13:46,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-09-05 13:13:46,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-05 13:13:46,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-09-05 13:13:46,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-05 13:13:46,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2019-09-05 13:13:46,712 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 31 [2019-09-05 13:13:46,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:13:46,712 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2019-09-05 13:13:46,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-05 13:13:46,712 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2019-09-05 13:13:46,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-05 13:13:46,713 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:13:46,713 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:13:46,714 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:13:46,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:13:46,714 INFO L82 PathProgramCache]: Analyzing trace with hash -760785930, now seen corresponding path program 5 times [2019-09-05 13:13:46,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:13:46,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:46,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:13:46,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:46,715 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:13:46,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:13:46,818 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 33 proven. 57 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:13:46,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:46,819 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:13:46,819 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:13:46,819 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:13:46,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:46,820 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-05 13:13:46,834 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:13:46,835 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:13:46,856 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-05 13:13:46,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:13:46,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-05 13:13:46,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:13:46,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:13:46,976 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-05 13:13:46,977 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:13:47,217 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 13:13:47,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:13:47,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2019-09-05 13:13:47,221 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:13:47,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-05 13:13:47,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-05 13:13:47,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-09-05 13:13:47,222 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 15 states. [2019-09-05 13:13:47,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:13:47,664 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2019-09-05 13:13:47,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-05 13:13:47,665 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2019-09-05 13:13:47,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:13:47,665 INFO L225 Difference]: With dead ends: 46 [2019-09-05 13:13:47,666 INFO L226 Difference]: Without dead ends: 43 [2019-09-05 13:13:47,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2019-09-05 13:13:47,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-05 13:13:47,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-09-05 13:13:47,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-05 13:13:47,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-09-05 13:13:47,671 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 34 [2019-09-05 13:13:47,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:13:47,671 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-09-05 13:13:47,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-05 13:13:47,671 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-09-05 13:13:47,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-05 13:13:47,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:13:47,673 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:13:47,673 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:13:47,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:13:47,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1911185236, now seen corresponding path program 6 times [2019-09-05 13:13:47,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:13:47,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:47,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:13:47,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:47,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:13:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:13:47,821 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 43 proven. 100 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:13:47,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:47,821 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:13:47,822 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:13:47,822 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:13:47,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:47,822 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 13:13:47,838 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:13:47,838 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:13:47,856 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:13:47,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:13:47,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-05 13:13:47,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:13:47,901 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:13:47,902 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:13:48,195 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:13:48,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:13:48,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 23 [2019-09-05 13:13:48,199 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:13:48,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-05 13:13:48,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-05 13:13:48,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2019-09-05 13:13:48,200 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 13 states. [2019-09-05 13:13:48,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:13:48,479 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2019-09-05 13:13:48,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-05 13:13:48,482 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-09-05 13:13:48,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:13:48,483 INFO L225 Difference]: With dead ends: 52 [2019-09-05 13:13:48,483 INFO L226 Difference]: Without dead ends: 52 [2019-09-05 13:13:48,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2019-09-05 13:13:48,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-05 13:13:48,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-09-05 13:13:48,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-05 13:13:48,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-09-05 13:13:48,489 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 40 [2019-09-05 13:13:48,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:13:48,490 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-09-05 13:13:48,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-05 13:13:48,490 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-09-05 13:13:48,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-05 13:13:48,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:13:48,492 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:13:48,492 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:13:48,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:13:48,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1672683157, now seen corresponding path program 7 times [2019-09-05 13:13:48,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:13:48,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:48,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:13:48,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:48,494 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:13:48,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:13:48,697 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 58 proven. 187 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:13:48,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:48,698 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:13:48,698 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:13:48,698 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:13:48,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:48,698 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:13:48,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:13:48,727 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:13:48,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:13:48,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-05 13:13:48,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:13:48,768 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 85 proven. 155 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-05 13:13:48,769 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:13:49,116 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 85 proven. 155 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-05 13:13:49,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:13:49,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 25 [2019-09-05 13:13:49,121 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:13:49,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-05 13:13:49,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-05 13:13:49,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2019-09-05 13:13:49,122 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 14 states. [2019-09-05 13:13:49,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:13:49,473 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2019-09-05 13:13:49,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-05 13:13:49,473 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 49 [2019-09-05 13:13:49,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:13:49,474 INFO L225 Difference]: With dead ends: 58 [2019-09-05 13:13:49,474 INFO L226 Difference]: Without dead ends: 58 [2019-09-05 13:13:49,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 87 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2019-09-05 13:13:49,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-05 13:13:49,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-09-05 13:13:49,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-05 13:13:49,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2019-09-05 13:13:49,479 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 49 [2019-09-05 13:13:49,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:13:49,480 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2019-09-05 13:13:49,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-05 13:13:49,480 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2019-09-05 13:13:49,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-05 13:13:49,481 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:13:49,481 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:13:49,481 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:13:49,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:13:49,482 INFO L82 PathProgramCache]: Analyzing trace with hash -271959499, now seen corresponding path program 8 times [2019-09-05 13:13:49,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:13:49,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:49,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:13:49,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:49,483 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:13:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:13:49,736 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 68 proven. 260 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:13:49,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:49,736 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:13:49,736 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:13:49,737 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:13:49,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:49,737 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-05 13:13:49,757 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:13:49,757 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:13:49,794 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-05 13:13:49,794 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:13:49,795 WARN L254 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-05 13:13:49,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:13:52,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:13:52,516 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-09-05 13:13:52,516 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:14:14,436 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 70 refuted. 38 times theorem prover too weak. 222 trivial. 0 not checked. [2019-09-05 13:14:14,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:14:14,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 36 [2019-09-05 13:14:14,440 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:14:14,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-05 13:14:14,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-05 13:14:14,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1066, Unknown=9, NotChecked=0, Total=1260 [2019-09-05 13:14:14,442 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 26 states. [2019-09-05 13:14:18,310 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 16 [2019-09-05 13:14:19,387 WARN L188 SmtUtils]: Spent 940.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2019-09-05 13:14:19,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:14:19,484 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2019-09-05 13:14:19,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-05 13:14:19,484 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2019-09-05 13:14:19,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:14:19,488 INFO L225 Difference]: With dead ends: 74 [2019-09-05 13:14:19,488 INFO L226 Difference]: Without dead ends: 71 [2019-09-05 13:14:19,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 26.2s TimeCoverageRelationStatistics Valid=408, Invalid=2339, Unknown=9, NotChecked=0, Total=2756 [2019-09-05 13:14:19,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-05 13:14:19,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2019-09-05 13:14:19,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-05 13:14:19,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2019-09-05 13:14:19,496 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 55 [2019-09-05 13:14:19,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:14:19,496 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2019-09-05 13:14:19,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-05 13:14:19,496 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2019-09-05 13:14:19,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-05 13:14:19,497 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:14:19,497 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 14, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:14:19,498 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:14:19,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:14:19,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1938737898, now seen corresponding path program 9 times [2019-09-05 13:14:19,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:14:19,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:19,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:14:19,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:19,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:14:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:19,789 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 83 proven. 392 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:14:19,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:19,790 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:14:19,790 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:14:19,790 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:14:19,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:19,790 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-05 13:14:19,816 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:14:19,816 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:14:19,835 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:14:19,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:14:19,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-05 13:14:19,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:14:19,855 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 161 proven. 301 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-05 13:14:19,856 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:14:20,452 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 161 proven. 301 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-05 13:14:20,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:14:20,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 34 [2019-09-05 13:14:20,456 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:14:20,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-05 13:14:20,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-05 13:14:20,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=786, Unknown=0, NotChecked=0, Total=1122 [2019-09-05 13:14:20,458 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 19 states. [2019-09-05 13:14:21,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:14:21,146 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2019-09-05 13:14:21,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-05 13:14:21,146 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 64 [2019-09-05 13:14:21,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:14:21,148 INFO L225 Difference]: With dead ends: 79 [2019-09-05 13:14:21,148 INFO L226 Difference]: Without dead ends: 79 [2019-09-05 13:14:21,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 113 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=336, Invalid=786, Unknown=0, NotChecked=0, Total=1122 [2019-09-05 13:14:21,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-09-05 13:14:21,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2019-09-05 13:14:21,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-05 13:14:21,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2019-09-05 13:14:21,155 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 64 [2019-09-05 13:14:21,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:14:21,155 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2019-09-05 13:14:21,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-05 13:14:21,155 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2019-09-05 13:14:21,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-05 13:14:21,156 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:14:21,157 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 17, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:14:21,157 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:14:21,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:14:21,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1072726359, now seen corresponding path program 10 times [2019-09-05 13:14:21,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:14:21,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:21,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:14:21,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:21,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:14:21,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:21,588 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 98 proven. 551 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:14:21,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:21,588 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:14:21,588 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:14:21,589 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:14:21,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:21,589 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:14:21,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:14:21,603 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:14:21,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:21,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-05 13:14:21,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:14:21,650 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 194 proven. 442 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-05 13:14:21,651 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:14:22,414 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 194 proven. 442 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-05 13:14:22,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:14:22,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 20] total 40 [2019-09-05 13:14:22,420 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:14:22,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-05 13:14:22,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-05 13:14:22,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=456, Invalid=1104, Unknown=0, NotChecked=0, Total=1560 [2019-09-05 13:14:22,422 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 22 states. [2019-09-05 13:14:23,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:14:23,311 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2019-09-05 13:14:23,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-05 13:14:23,312 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 73 [2019-09-05 13:14:23,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:14:23,314 INFO L225 Difference]: With dead ends: 88 [2019-09-05 13:14:23,314 INFO L226 Difference]: Without dead ends: 88 [2019-09-05 13:14:23,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=456, Invalid=1104, Unknown=0, NotChecked=0, Total=1560 [2019-09-05 13:14:23,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-05 13:14:23,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-09-05 13:14:23,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-05 13:14:23,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2019-09-05 13:14:23,321 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 73 [2019-09-05 13:14:23,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:14:23,322 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2019-09-05 13:14:23,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-05 13:14:23,322 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2019-09-05 13:14:23,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-05 13:14:23,323 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:14:23,323 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 20, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:14:23,324 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:14:23,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:14:23,324 INFO L82 PathProgramCache]: Analyzing trace with hash -544444874, now seen corresponding path program 11 times [2019-09-05 13:14:23,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:14:23,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:23,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:14:23,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:23,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:14:23,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:23,748 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 113 proven. 737 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:14:23,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:23,748 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:14:23,748 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:14:23,748 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:14:23,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:23,749 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-05 13:14:23,758 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:14:23,759 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:14:24,083 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-05 13:14:24,083 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:14:24,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-05 13:14:24,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:14:24,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:14:24,566 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2019-09-05 13:14:24,567 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:14:37,807 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2019-09-05 13:14:37,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:14:37,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 13, 13] total 47 [2019-09-05 13:14:37,813 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:14:37,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-05 13:14:37,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-05 13:14:37,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1948, Unknown=3, NotChecked=0, Total=2162 [2019-09-05 13:14:37,815 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 36 states. [2019-09-05 13:14:41,848 WARN L188 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 19 DAG size of output: 18 [2019-09-05 13:14:44,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:14:44,666 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2019-09-05 13:14:44,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-05 13:14:44,666 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 82 [2019-09-05 13:14:44,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:14:44,669 INFO L225 Difference]: With dead ends: 107 [2019-09-05 13:14:44,669 INFO L226 Difference]: Without dead ends: 104 [2019-09-05 13:14:44,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 143 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=597, Invalid=4802, Unknown=3, NotChecked=0, Total=5402 [2019-09-05 13:14:44,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-05 13:14:44,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2019-09-05 13:14:44,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-05 13:14:44,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2019-09-05 13:14:44,679 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 82 [2019-09-05 13:14:44,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:14:44,679 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2019-09-05 13:14:44,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-05 13:14:44,680 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2019-09-05 13:14:44,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-05 13:14:44,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:14:44,681 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 24, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:14:44,682 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:14:44,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:14:44,683 INFO L82 PathProgramCache]: Analyzing trace with hash 119959157, now seen corresponding path program 12 times [2019-09-05 13:14:44,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:14:44,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:44,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:14:44,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:44,684 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:14:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:45,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 260 proven. 805 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-05 13:14:45,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:45,236 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:14:45,237 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:14:45,237 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:14:45,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:45,237 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-05 13:14:45,256 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:14:45,256 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:14:45,288 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:14:45,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:14:45,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-05 13:14:45,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:14:45,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 260 proven. 805 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-05 13:14:45,358 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:14:46,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 260 proven. 805 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (15)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 13:14:47,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:14:47,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-09-05 13:14:47,012 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:14:47,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-05 13:14:47,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-05 13:14:47,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=723, Invalid=1827, Unknown=0, NotChecked=0, Total=2550 [2019-09-05 13:14:47,014 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 27 states. [2019-09-05 13:14:48,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:14:48,384 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2019-09-05 13:14:48,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-05 13:14:48,385 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 91 [2019-09-05 13:14:48,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:14:48,386 INFO L225 Difference]: With dead ends: 105 [2019-09-05 13:14:48,386 INFO L226 Difference]: Without dead ends: 105 [2019-09-05 13:14:48,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 157 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=723, Invalid=1827, Unknown=0, NotChecked=0, Total=2550 [2019-09-05 13:14:48,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-09-05 13:14:48,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-09-05 13:14:48,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-05 13:14:48,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 110 transitions. [2019-09-05 13:14:48,393 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 110 transitions. Word has length 91 [2019-09-05 13:14:48,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:14:48,394 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 110 transitions. [2019-09-05 13:14:48,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-05 13:14:48,394 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2019-09-05 13:14:48,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-05 13:14:48,395 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:14:48,395 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 25, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:14:48,395 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:14:48,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:14:48,396 INFO L82 PathProgramCache]: Analyzing trace with hash 463026484, now seen corresponding path program 13 times [2019-09-05 13:14:48,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:14:48,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:48,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:14:48,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:48,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:14:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:48,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 271 proven. 876 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-05 13:14:48,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:48,869 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:14:48,869 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:14:48,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:14:48,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:48,869 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-05 13:14:48,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:14:48,884 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:14:48,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:48,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-05 13:14:48,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:14:48,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 271 proven. 876 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-05 13:14:48,981 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:14:50,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 271 proven. 876 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-05 13:14:50,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:14:50,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-09-05 13:14:50,567 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:14:50,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-05 13:14:50,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-05 13:14:50,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2019-09-05 13:14:50,569 INFO L87 Difference]: Start difference. First operand 104 states and 110 transitions. Second operand 28 states. [2019-09-05 13:14:52,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:14:52,071 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2019-09-05 13:14:52,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-05 13:14:52,071 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 94 [2019-09-05 13:14:52,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:14:52,072 INFO L225 Difference]: With dead ends: 108 [2019-09-05 13:14:52,073 INFO L226 Difference]: Without dead ends: 108 [2019-09-05 13:14:52,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 162 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2019-09-05 13:14:52,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-09-05 13:14:52,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-09-05 13:14:52,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-09-05 13:14:52,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2019-09-05 13:14:52,080 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 94 [2019-09-05 13:14:52,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:14:52,080 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2019-09-05 13:14:52,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-05 13:14:52,080 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2019-09-05 13:14:52,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-05 13:14:52,084 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:14:52,084 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 26, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:14:52,084 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:14:52,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:14:52,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1240399339, now seen corresponding path program 14 times [2019-09-05 13:14:52,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:14:52,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:52,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:14:52,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:52,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:14:52,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:52,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 282 proven. 950 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-05 13:14:52,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:52,590 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:14:52,590 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:14:52,590 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:14:52,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:52,590 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-05 13:14:52,606 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:14:52,606 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:14:52,686 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-05 13:14:52,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:14:52,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-05 13:14:52,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:14:52,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 138 proven. 2 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked. [2019-09-05 13:14:52,989 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:14:54,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked. [2019-09-05 13:14:54,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:14:54,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 7, 8] total 39 [2019-09-05 13:14:54,721 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:14:54,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-05 13:14:54,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-05 13:14:54,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1271, Unknown=0, NotChecked=0, Total=1482 [2019-09-05 13:14:54,722 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 33 states. [2019-09-05 13:14:57,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:14:57,858 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2019-09-05 13:14:57,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-05 13:14:57,863 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 97 [2019-09-05 13:14:57,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:14:57,864 INFO L225 Difference]: With dead ends: 124 [2019-09-05 13:14:57,864 INFO L226 Difference]: Without dead ends: 124 [2019-09-05 13:14:57,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 183 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=607, Invalid=3683, Unknown=0, NotChecked=0, Total=4290 [2019-09-05 13:14:57,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-09-05 13:14:57,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 111. [2019-09-05 13:14:57,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-09-05 13:14:57,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2019-09-05 13:14:57,874 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 97 [2019-09-05 13:14:57,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:14:57,875 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2019-09-05 13:14:57,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-05 13:14:57,875 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2019-09-05 13:14:57,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-05 13:14:57,876 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:14:57,881 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 27, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:14:57,881 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:14:57,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:14:57,882 INFO L82 PathProgramCache]: Analyzing trace with hash 500456500, now seen corresponding path program 15 times [2019-09-05 13:14:57,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:14:57,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:57,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:14:57,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:57,883 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:14:57,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:58,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 153 proven. 1365 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:14:58,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:58,561 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:14:58,561 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:14:58,561 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:14:58,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:58,562 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-05 13:14:58,576 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:14:58,576 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:14:58,604 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:14:58,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:14:58,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-05 13:14:58,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:14:58,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 387 proven. 1107 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-05 13:14:58,644 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:15:00,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 387 proven. 1107 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-05 13:15:00,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:15:00,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 30, 30] total 61 [2019-09-05 13:15:00,684 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:15:00,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-05 13:15:00,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-05 13:15:00,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1017, Invalid=2643, Unknown=0, NotChecked=0, Total=3660 [2019-09-05 13:15:00,685 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand 33 states. [2019-09-05 13:15:02,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:15:02,691 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2019-09-05 13:15:02,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-05 13:15:02,691 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 106 [2019-09-05 13:15:02,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:15:02,692 INFO L225 Difference]: With dead ends: 124 [2019-09-05 13:15:02,692 INFO L226 Difference]: Without dead ends: 124 [2019-09-05 13:15:02,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 184 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1017, Invalid=2643, Unknown=0, NotChecked=0, Total=3660 [2019-09-05 13:15:02,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-09-05 13:15:02,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2019-09-05 13:15:02,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-09-05 13:15:02,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 127 transitions. [2019-09-05 13:15:02,698 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 127 transitions. Word has length 106 [2019-09-05 13:15:02,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:15:02,698 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 127 transitions. [2019-09-05 13:15:02,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-05 13:15:02,699 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2019-09-05 13:15:02,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-05 13:15:02,699 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:15:02,700 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 31, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:15:02,700 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:15:02,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:15:02,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1068497676, now seen corresponding path program 16 times [2019-09-05 13:15:02,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:15:02,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:15:02,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:15:02,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:15:02,701 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:15:02,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:15:03,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 173 proven. 1751 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:15:03,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:15:03,507 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:15:03,507 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:15:03,507 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:15:03,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:15:03,507 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 13:15:03,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:15:03,520 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:15:03,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:15:03,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-05 13:15:03,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:15:03,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 443 proven. 1457 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-05 13:15:03,597 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:15:05,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 443 proven. 1457 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-05 13:15:05,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:15:05,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 34, 34] total 69 [2019-09-05 13:15:05,853 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:15:05,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-05 13:15:05,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-05 13:15:05,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1289, Invalid=3403, Unknown=0, NotChecked=0, Total=4692 [2019-09-05 13:15:05,855 INFO L87 Difference]: Start difference. First operand 123 states and 127 transitions. Second operand 37 states. [2019-09-05 13:15:08,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:15:08,476 INFO L93 Difference]: Finished difference Result 136 states and 140 transitions. [2019-09-05 13:15:08,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-05 13:15:08,477 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 118 [2019-09-05 13:15:08,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:15:08,478 INFO L225 Difference]: With dead ends: 136 [2019-09-05 13:15:08,478 INFO L226 Difference]: Without dead ends: 136 [2019-09-05 13:15:08,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 204 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1289, Invalid=3403, Unknown=0, NotChecked=0, Total=4692 [2019-09-05 13:15:08,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-05 13:15:08,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2019-09-05 13:15:08,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-05 13:15:08,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2019-09-05 13:15:08,484 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 118 [2019-09-05 13:15:08,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:15:08,485 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2019-09-05 13:15:08,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-05 13:15:08,485 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2019-09-05 13:15:08,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-05 13:15:08,485 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:15:08,485 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 35, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:15:08,486 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:15:08,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:15:08,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1624542644, now seen corresponding path program 17 times [2019-09-05 13:15:08,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:15:08,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:15:08,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:15:08,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:15:08,487 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:15:08,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:15:09,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 193 proven. 2185 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:15:09,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:15:09,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:15:09,441 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:15:09,441 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:15:09,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:15:09,441 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-05 13:15:09,452 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:15:09,452 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:15:10,138 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-05 13:15:10,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:15:10,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-05 13:15:10,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:15:11,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:15:11,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 525 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2019-09-05 13:15:11,341 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:15:14,722 WARN L188 SmtUtils]: Spent 590.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-09-05 13:15:28,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 454 refuted. 71 times theorem prover too weak. 1855 trivial. 0 not checked. [2019-09-05 13:15:28,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:15:28,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 15, 15] total 67 [2019-09-05 13:15:28,168 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:15:28,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-05 13:15:28,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-05 13:15:28,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=3975, Unknown=5, NotChecked=0, Total=4422 [2019-09-05 13:15:28,172 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 54 states. [2019-09-05 13:15:38,834 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 16 [2019-09-05 13:15:39,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:15:39,354 INFO L93 Difference]: Finished difference Result 157 states and 161 transitions. [2019-09-05 13:15:39,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-05 13:15:39,359 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 130 [2019-09-05 13:15:39,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:15:39,360 INFO L225 Difference]: With dead ends: 157 [2019-09-05 13:15:39,360 INFO L226 Difference]: Without dead ends: 154 [2019-09-05 13:15:39,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 235 SyntacticMatches, 2 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1085 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=1138, Invalid=10629, Unknown=5, NotChecked=0, Total=11772 [2019-09-05 13:15:39,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-09-05 13:15:39,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 150. [2019-09-05 13:15:39,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-05 13:15:39,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 154 transitions. [2019-09-05 13:15:39,366 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 154 transitions. Word has length 130 [2019-09-05 13:15:39,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:15:39,366 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 154 transitions. [2019-09-05 13:15:39,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-05 13:15:39,367 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 154 transitions. [2019-09-05 13:15:39,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-05 13:15:39,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:15:39,368 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 39, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:15:39,368 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:15:39,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:15:39,368 INFO L82 PathProgramCache]: Analyzing trace with hash 348038167, now seen corresponding path program 18 times [2019-09-05 13:15:39,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:15:39,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:15:39,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:15:39,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:15:39,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:15:39,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:15:40,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 218 proven. 2795 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:15:40,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:15:40,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:15:40,798 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:15:40,798 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:15:40,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:15:40,798 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-05 13:15:40,814 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:15:40,814 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:15:40,864 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:15:40,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:15:40,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 85 conjunts are in the unsatisfiable core [2019-09-05 13:15:40,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:15:40,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 458 proven. 2542 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-05 13:15:40,911 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:15:44,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 458 proven. 2542 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-05 13:15:44,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:15:44,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 44, 44] total 88 [2019-09-05 13:15:44,612 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:15:44,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-05 13:15:44,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-05 13:15:44,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2064, Invalid=5592, Unknown=0, NotChecked=0, Total=7656 [2019-09-05 13:15:44,615 INFO L87 Difference]: Start difference. First operand 150 states and 154 transitions. Second operand 46 states. [2019-09-05 13:15:48,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:15:48,878 INFO L93 Difference]: Finished difference Result 166 states and 170 transitions. [2019-09-05 13:15:48,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-05 13:15:48,878 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 145 [2019-09-05 13:15:48,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:15:48,880 INFO L225 Difference]: With dead ends: 166 [2019-09-05 13:15:48,880 INFO L226 Difference]: Without dead ends: 166 [2019-09-05 13:15:48,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 248 SyntacticMatches, 3 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=2064, Invalid=5592, Unknown=0, NotChecked=0, Total=7656 [2019-09-05 13:15:48,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-09-05 13:15:48,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2019-09-05 13:15:48,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-09-05 13:15:48,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 169 transitions. [2019-09-05 13:15:48,885 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 169 transitions. Word has length 145 [2019-09-05 13:15:48,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:15:48,886 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 169 transitions. [2019-09-05 13:15:48,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-05 13:15:48,886 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 169 transitions. [2019-09-05 13:15:48,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-05 13:15:48,887 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:15:48,887 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 44, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:15:48,887 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:15:48,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:15:48,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1151450538, now seen corresponding path program 19 times [2019-09-05 13:15:48,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:15:48,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:15:48,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:15:48,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:15:48,889 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:15:48,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:15:50,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 243 proven. 3480 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:15:50,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:15:50,318 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:15:50,318 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:15:50,318 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:15:50,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:15:50,318 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:15:50,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:15:50,331 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:15:50,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:15:50,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 91 conjunts are in the unsatisfiable core [2019-09-05 13:15:50,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:15:50,438 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 759 proven. 2926 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-05 13:15:50,439 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:15:54,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 759 proven. 2926 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-05 13:15:54,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:15:54,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 47, 47] total 96 [2019-09-05 13:15:54,814 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:15:54,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-05 13:15:54,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-05 13:15:54,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2442, Invalid=6678, Unknown=0, NotChecked=0, Total=9120 [2019-09-05 13:15:54,816 INFO L87 Difference]: Start difference. First operand 165 states and 169 transitions. Second operand 51 states. [2019-09-05 13:16:00,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:16:00,073 INFO L93 Difference]: Finished difference Result 181 states and 185 transitions. [2019-09-05 13:16:00,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-05 13:16:00,074 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 160 [2019-09-05 13:16:00,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:16:00,076 INFO L225 Difference]: With dead ends: 181 [2019-09-05 13:16:00,076 INFO L226 Difference]: Without dead ends: 181 [2019-09-05 13:16:00,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 275 SyntacticMatches, 3 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=2442, Invalid=6678, Unknown=0, NotChecked=0, Total=9120 [2019-09-05 13:16:00,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-09-05 13:16:00,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2019-09-05 13:16:00,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-05 13:16:00,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 184 transitions. [2019-09-05 13:16:00,082 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 184 transitions. Word has length 160 [2019-09-05 13:16:00,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:16:00,083 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 184 transitions. [2019-09-05 13:16:00,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-05 13:16:00,083 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 184 transitions. [2019-09-05 13:16:00,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-05 13:16:00,084 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:16:00,084 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 49, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:16:00,084 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:16:00,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:16:00,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1397457353, now seen corresponding path program 20 times [2019-09-05 13:16:00,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:16:00,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:16:00,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:16:00,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:16:00,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:16:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:16:01,763 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 268 proven. 4240 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:16:01,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:16:01,763 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:16:01,763 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:16:01,763 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:16:01,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:16:01,764 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-05 13:16:01,775 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:16:01,775 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:16:02,800 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-05 13:16:02,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:16:02,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-05 13:16:02,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:16:03,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:16:03,775 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 0 proven. 884 refuted. 0 times theorem prover too weak. 3626 trivial. 0 not checked. [2019-09-05 13:16:03,775 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:16:26,235 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 0 proven. 881 refuted. 3 times theorem prover too weak. 3626 trivial. 0 not checked. [2019-09-05 13:16:26,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:16:26,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 15, 15] total 82 [2019-09-05 13:16:26,239 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:16:26,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-05 13:16:26,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-05 13:16:26,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=6255, Unknown=7, NotChecked=0, Total=6642 [2019-09-05 13:16:26,241 INFO L87 Difference]: Start difference. First operand 180 states and 184 transitions. Second operand 69 states. [2019-09-05 13:16:42,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:16:42,100 INFO L93 Difference]: Finished difference Result 205 states and 209 transitions. [2019-09-05 13:16:42,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-05 13:16:42,101 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 175 [2019-09-05 13:16:42,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:16:42,103 INFO L225 Difference]: With dead ends: 205 [2019-09-05 13:16:42,103 INFO L226 Difference]: Without dead ends: 202 [2019-09-05 13:16:42,104 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 325 SyntacticMatches, 2 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1765 ImplicationChecksByTransitivity, 27.0s TimeCoverageRelationStatistics Valid=1331, Invalid=17844, Unknown=7, NotChecked=0, Total=19182 [2019-09-05 13:16:42,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-05 13:16:42,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 198. [2019-09-05 13:16:42,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-09-05 13:16:42,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 202 transitions. [2019-09-05 13:16:42,109 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 202 transitions. Word has length 175 [2019-09-05 13:16:42,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:16:42,109 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 202 transitions. [2019-09-05 13:16:42,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-05 13:16:42,110 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 202 transitions. [2019-09-05 13:16:42,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-05 13:16:42,111 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:16:42,111 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 54, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:16:42,111 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:16:42,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:16:42,111 INFO L82 PathProgramCache]: Analyzing trace with hash -760166635, now seen corresponding path program 21 times [2019-09-05 13:16:42,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:16:42,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:16:42,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:16:42,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:16:42,113 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:16:42,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:16:44,110 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 298 proven. 5251 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:16:44,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:16:44,110 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:16:44,110 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:16:44,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:16:44,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:16:44,110 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 13:16:44,121 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:16:44,121 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:16:44,171 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:16:44,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:16:44,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 111 conjunts are in the unsatisfiable core [2019-09-05 13:16:44,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:16:44,261 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 1093 proven. 4401 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-05 13:16:44,262 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:16:51,173 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 1093 proven. 4401 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-05 13:16:51,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:16:51,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 57, 57] total 117 [2019-09-05 13:16:51,188 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:16:51,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-05 13:16:51,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-05 13:16:51,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3590, Invalid=9982, Unknown=0, NotChecked=0, Total=13572 [2019-09-05 13:16:51,189 INFO L87 Difference]: Start difference. First operand 198 states and 202 transitions. Second operand 62 states. [2019-09-05 13:16:59,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:16:59,047 INFO L93 Difference]: Finished difference Result 217 states and 221 transitions. [2019-09-05 13:16:59,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-05 13:16:59,048 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 193 [2019-09-05 13:16:59,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:16:59,050 INFO L225 Difference]: With dead ends: 217 [2019-09-05 13:16:59,050 INFO L226 Difference]: Without dead ends: 217 [2019-09-05 13:16:59,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 331 SyntacticMatches, 3 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=3590, Invalid=9982, Unknown=0, NotChecked=0, Total=13572 [2019-09-05 13:16:59,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-09-05 13:16:59,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 216. [2019-09-05 13:16:59,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-09-05 13:16:59,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 220 transitions. [2019-09-05 13:16:59,056 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 220 transitions. Word has length 193 [2019-09-05 13:16:59,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:16:59,056 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 220 transitions. [2019-09-05 13:16:59,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-05 13:16:59,056 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 220 transitions. [2019-09-05 13:16:59,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-05 13:16:59,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:16:59,058 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 60, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:16:59,058 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:16:59,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:16:59,058 INFO L82 PathProgramCache]: Analyzing trace with hash 24031733, now seen corresponding path program 22 times [2019-09-05 13:16:59,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:16:59,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:16:59,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:16:59,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:16:59,060 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:16:59,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:17:01,701 INFO L134 CoverageAnalysis]: Checked inductivity of 6700 backedges. 328 proven. 6370 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:17:01,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:17:01,701 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:17:01,701 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:17:01,701 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:17:01,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:17:01,701 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-05 13:17:01,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:01,711 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:17:01,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:17:01,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 123 conjunts are in the unsatisfiable core [2019-09-05 13:17:01,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:17:01,829 INFO L134 CoverageAnalysis]: Checked inductivity of 6700 backedges. 1213 proven. 5430 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-05 13:17:01,830 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:17:09,936 INFO L134 CoverageAnalysis]: Checked inductivity of 6700 backedges. 1213 proven. 5430 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-05 13:17:09,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:17:09,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 63, 63] total 129 [2019-09-05 13:17:09,940 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:17:09,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-05 13:17:09,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-05 13:17:09,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4346, Invalid=12166, Unknown=0, NotChecked=0, Total=16512 [2019-09-05 13:17:09,942 INFO L87 Difference]: Start difference. First operand 216 states and 220 transitions. Second operand 68 states. [2019-09-05 13:17:19,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:17:19,510 INFO L93 Difference]: Finished difference Result 235 states and 239 transitions. [2019-09-05 13:17:19,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-05 13:17:19,511 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 211 [2019-09-05 13:17:19,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:17:19,512 INFO L225 Difference]: With dead ends: 235 [2019-09-05 13:17:19,512 INFO L226 Difference]: Without dead ends: 235 [2019-09-05 13:17:19,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 361 SyntacticMatches, 3 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=4346, Invalid=12166, Unknown=0, NotChecked=0, Total=16512 [2019-09-05 13:17:19,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-09-05 13:17:19,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 234. [2019-09-05 13:17:19,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-09-05 13:17:19,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 238 transitions. [2019-09-05 13:17:19,521 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 238 transitions. Word has length 211 [2019-09-05 13:17:19,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:17:19,522 INFO L475 AbstractCegarLoop]: Abstraction has 234 states and 238 transitions. [2019-09-05 13:17:19,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-05 13:17:19,522 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 238 transitions. [2019-09-05 13:17:19,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-05 13:17:19,523 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:17:19,523 INFO L399 BasicCegarLoop]: trace histogram [73, 73, 66, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:17:19,524 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:17:19,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:17:19,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1923373867, now seen corresponding path program 23 times [2019-09-05 13:17:19,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:17:19,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:17:19,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:19,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:17:19,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:17:19,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:17:22,332 INFO L134 CoverageAnalysis]: Checked inductivity of 7957 backedges. 358 proven. 7597 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:17:22,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:17:22,332 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:17:22,332 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:17:22,332 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:17:22,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:17:22,332 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-05 13:17:22,344 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:17:22,344 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:17:27,342 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-05 13:17:27,342 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:17:27,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-05 13:17:27,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:17:34,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:17:34,278 INFO L134 CoverageAnalysis]: Checked inductivity of 7957 backedges. 0 proven. 1390 refuted. 0 times theorem prover too weak. 6567 trivial. 0 not checked. [2019-09-05 13:17:34,278 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:18:00,250 INFO L134 CoverageAnalysis]: Checked inductivity of 7957 backedges. 0 proven. 1390 refuted. 0 times theorem prover too weak. 6567 trivial. 0 not checked. [2019-09-05 13:18:00,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:18:00,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 17, 17] total 104 [2019-09-05 13:18:00,255 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:18:00,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-09-05 13:18:00,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-09-05 13:18:00,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=9980, Unknown=6, NotChecked=0, Total=10712 [2019-09-05 13:18:00,256 INFO L87 Difference]: Start difference. First operand 234 states and 238 transitions. Second operand 89 states. [2019-09-05 13:18:22,882 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ c_main_~x~0 4294967294) 4294967296)) (.cse1 (mod (+ c_main_~x~0 4294967295) 4294967296)) (.cse2 (mod c_main_~y~0 4294967296))) (and (<= 10000000 (mod c_main_~x~0 4294967296)) (= c_main_~z~0 5000007) (= 10000000 c_main_~y~0) (<= 5000000 .cse0) (< .cse1 10000000) (< .cse0 .cse2) (< .cse1 .cse2))) is different from false [2019-09-05 13:18:25,749 WARN L188 SmtUtils]: Spent 841.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2019-09-05 13:18:25,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:18:25,972 INFO L93 Difference]: Finished difference Result 262 states and 266 transitions. [2019-09-05 13:18:25,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-05 13:18:25,974 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 229 [2019-09-05 13:18:25,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:18:25,975 INFO L225 Difference]: With dead ends: 262 [2019-09-05 13:18:25,975 INFO L226 Difference]: Without dead ends: 259 [2019-09-05 13:18:25,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 429 SyntacticMatches, 2 SemanticMatches, 177 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3023 ImplicationChecksByTransitivity, 43.1s TimeCoverageRelationStatistics Valid=2116, Invalid=29387, Unknown=7, NotChecked=352, Total=31862 [2019-09-05 13:18:25,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-09-05 13:18:25,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 255. [2019-09-05 13:18:25,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-05 13:18:25,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 259 transitions. [2019-09-05 13:18:25,981 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 259 transitions. Word has length 229 [2019-09-05 13:18:25,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:18:25,981 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 259 transitions. [2019-09-05 13:18:25,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-09-05 13:18:25,982 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 259 transitions. [2019-09-05 13:18:25,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-05 13:18:25,983 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:18:25,983 INFO L399 BasicCegarLoop]: trace histogram [80, 80, 72, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:18:25,984 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:18:25,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:18:25,984 INFO L82 PathProgramCache]: Analyzing trace with hash -568596682, now seen corresponding path program 24 times [2019-09-05 13:18:25,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:18:25,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:25,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:18:25,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:25,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:18:26,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:18:29,444 INFO L134 CoverageAnalysis]: Checked inductivity of 9560 backedges. 393 proven. 9165 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:18:29,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:18:29,444 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:18:29,445 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:18:29,445 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:18:29,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:18:29,445 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-05 13:18:29,457 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:18:29,457 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:18:29,531 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:18:29,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:18:29,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 147 conjunts are in the unsatisfiable core [2019-09-05 13:18:29,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:18:29,742 INFO L134 CoverageAnalysis]: Checked inductivity of 9560 backedges. 1671 proven. 7812 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-05 13:18:29,742 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:18:42,138 INFO L134 CoverageAnalysis]: Checked inductivity of 9560 backedges. 1671 proven. 7812 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-05 13:18:42,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:18:42,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 75, 75] total 154 [2019-09-05 13:18:42,141 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:18:42,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-05 13:18:42,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-05 13:18:42,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6150, Invalid=17412, Unknown=0, NotChecked=0, Total=23562 [2019-09-05 13:18:42,143 INFO L87 Difference]: Start difference. First operand 255 states and 259 transitions. Second operand 81 states. [2019-09-05 13:18:56,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:18:56,018 INFO L93 Difference]: Finished difference Result 277 states and 281 transitions. [2019-09-05 13:18:56,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-05 13:18:56,019 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 250 [2019-09-05 13:18:56,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:18:56,022 INFO L225 Difference]: With dead ends: 277 [2019-09-05 13:18:56,022 INFO L226 Difference]: Without dead ends: 277 [2019-09-05 13:18:56,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 582 GetRequests, 427 SyntacticMatches, 3 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=6150, Invalid=17412, Unknown=0, NotChecked=0, Total=23562 [2019-09-05 13:18:56,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-09-05 13:18:56,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 276. [2019-09-05 13:18:56,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-09-05 13:18:56,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 280 transitions. [2019-09-05 13:18:56,029 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 280 transitions. Word has length 250 [2019-09-05 13:18:56,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:18:56,030 INFO L475 AbstractCegarLoop]: Abstraction has 276 states and 280 transitions. [2019-09-05 13:18:56,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-05 13:18:56,030 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 280 transitions. [2019-09-05 13:18:56,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-09-05 13:18:56,032 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:18:56,032 INFO L399 BasicCegarLoop]: trace histogram [87, 87, 79, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:18:56,032 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:18:56,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:18:56,033 INFO L82 PathProgramCache]: Analyzing trace with hash -147337353, now seen corresponding path program 25 times [2019-09-05 13:18:56,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:18:56,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:56,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:18:56,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:18:56,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:18:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:19:00,037 INFO L134 CoverageAnalysis]: Checked inductivity of 11310 backedges. 428 proven. 10880 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:19:00,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:19:00,038 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:19:00,038 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:19:00,038 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:19:00,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:19:00,038 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:19:00,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:19:00,051 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:19:00,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:19:00,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 161 conjunts are in the unsatisfiable core [2019-09-05 13:19:00,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:19:00,238 INFO L134 CoverageAnalysis]: Checked inductivity of 11310 backedges. 1832 proven. 9401 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-05 13:19:00,239 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:19:14,397 INFO L134 CoverageAnalysis]: Checked inductivity of 11310 backedges. 1832 proven. 9401 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-05 13:19:14,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:19:14,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 82, 82] total 168 [2019-09-05 13:19:14,401 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:19:14,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-09-05 13:19:14,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-09-05 13:19:14,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7298, Invalid=20758, Unknown=0, NotChecked=0, Total=28056 [2019-09-05 13:19:14,403 INFO L87 Difference]: Start difference. First operand 276 states and 280 transitions. Second operand 88 states. [2019-09-05 13:19:31,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:19:31,111 INFO L93 Difference]: Finished difference Result 298 states and 302 transitions. [2019-09-05 13:19:31,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-09-05 13:19:31,112 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 271 [2019-09-05 13:19:31,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:19:31,114 INFO L225 Difference]: With dead ends: 298 [2019-09-05 13:19:31,114 INFO L226 Difference]: Without dead ends: 298 [2019-09-05 13:19:31,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 631 GetRequests, 462 SyntacticMatches, 3 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=7298, Invalid=20758, Unknown=0, NotChecked=0, Total=28056 [2019-09-05 13:19:31,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-09-05 13:19:31,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2019-09-05 13:19:31,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-09-05 13:19:31,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 301 transitions. [2019-09-05 13:19:31,121 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 301 transitions. Word has length 271 [2019-09-05 13:19:31,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:19:31,121 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 301 transitions. [2019-09-05 13:19:31,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-09-05 13:19:31,122 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 301 transitions. [2019-09-05 13:19:31,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-09-05 13:19:31,123 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:19:31,124 INFO L399 BasicCegarLoop]: trace histogram [94, 94, 86, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:19:31,124 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:19:31,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:19:31,124 INFO L82 PathProgramCache]: Analyzing trace with hash -2045687338, now seen corresponding path program 26 times [2019-09-05 13:19:31,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:19:31,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:19:31,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:19:31,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:19:31,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:19:31,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:19:35,580 INFO L134 CoverageAnalysis]: Checked inductivity of 13207 backedges. 463 proven. 12742 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:19:35,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:19:35,581 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:19:35,581 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:19:35,581 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:19:35,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:19:35,581 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:19:35,591 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:19:35,591 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:20:37,675 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-05 13:20:37,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:20:37,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-05 13:20:37,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:20:41,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:42,151 INFO L134 CoverageAnalysis]: Checked inductivity of 13207 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 11137 trivial. 0 not checked. [2019-09-05 13:20:42,151 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:21:35,004 INFO L134 CoverageAnalysis]: Checked inductivity of 13207 backedges. 0 proven. 2065 refuted. 5 times theorem prover too weak. 11137 trivial. 0 not checked. [2019-09-05 13:21:35,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:21:35,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 18, 18] total 127 [2019-09-05 13:21:35,014 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:21:35,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-09-05 13:21:35,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-09-05 13:21:35,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=902, Invalid=15086, Unknown=14, NotChecked=0, Total=16002 [2019-09-05 13:21:35,015 INFO L87 Difference]: Start difference. First operand 297 states and 301 transitions. Second operand 111 states. [2019-09-05 13:22:07,728 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ c_main_~x~0 4294967294) 4294967296)) (.cse1 (mod (+ c_main_~x~0 4294967295) 4294967296)) (.cse2 (mod c_main_~y~0 4294967296))) (and (<= 10000000 (mod c_main_~x~0 4294967296)) (= 10000000 c_main_~y~0) (<= 5000000 .cse0) (< .cse1 10000000) (< .cse0 .cse2) (= c_main_~z~0 5000008) (< .cse1 .cse2))) is different from false [2019-09-05 13:22:10,827 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ c_main_~x~0 4294967294) 4294967296)) (.cse2 (mod (+ c_main_~x~0 4294967295) 4294967296)) (.cse1 (mod c_main_~y~0 4294967296))) (and (= 10000000 c_main_~y~0) (<= 5000000 .cse0) (< .cse0 .cse1) (= c_main_~z~0 5000008) (< .cse2 .cse1) (<= 5000000 .cse2) (< (mod c_main_~x~0 4294967296) .cse1))) is different from false [2019-09-05 13:22:10,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:22:10,985 INFO L93 Difference]: Finished difference Result 328 states and 333 transitions. [2019-09-05 13:22:10,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-09-05 13:22:10,985 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 292 [2019-09-05 13:22:10,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:22:10,988 INFO L225 Difference]: With dead ends: 328 [2019-09-05 13:22:10,988 INFO L226 Difference]: Without dead ends: 325 [2019-09-05 13:22:10,990 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 776 GetRequests, 553 SyntacticMatches, 2 SemanticMatches, 221 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 4747 ImplicationChecksByTransitivity, 70.3s TimeCoverageRelationStatistics Valid=2770, Invalid=45842, Unknown=16, NotChecked=878, Total=49506 [2019-09-05 13:22:10,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-09-05 13:22:10,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 323. [2019-09-05 13:22:10,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-09-05 13:22:10,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 327 transitions. [2019-09-05 13:22:10,996 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 327 transitions. Word has length 292 [2019-09-05 13:22:10,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:22:10,996 INFO L475 AbstractCegarLoop]: Abstraction has 323 states and 327 transitions. [2019-09-05 13:22:10,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-09-05 13:22:10,997 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 327 transitions. [2019-09-05 13:22:10,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-05 13:22:10,998 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:22:10,998 INFO L399 BasicCegarLoop]: trace histogram [102, 102, 93, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:22:10,999 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:22:10,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:22:10,999 INFO L82 PathProgramCache]: Analyzing trace with hash -541127980, now seen corresponding path program 27 times [2019-09-05 13:22:10,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:22:11,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:22:11,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:22:11,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:22:11,000 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:22:11,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:22:16,158 INFO L134 CoverageAnalysis]: Checked inductivity of 15555 backedges. 503 proven. 15050 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:22:16,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:22:16,158 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:22:16,158 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:22:16,159 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:22:16,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:22:16,159 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:22:16,170 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:22:16,170 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:22:16,271 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:22:16,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:22:16,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 189 conjunts are in the unsatisfiable core [2019-09-05 13:22:16,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:22:16,478 INFO L134 CoverageAnalysis]: Checked inductivity of 15555 backedges. 2435 proven. 13020 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-05 13:22:16,478 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:22:36,392 INFO L134 CoverageAnalysis]: Checked inductivity of 15555 backedges. 2435 proven. 13020 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-05 13:22:36,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:22:36,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 96, 96] total 197 [2019-09-05 13:22:36,396 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:22:36,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-09-05 13:22:36,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-09-05 13:22:36,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9985, Invalid=28627, Unknown=0, NotChecked=0, Total=38612 [2019-09-05 13:22:36,399 INFO L87 Difference]: Start difference. First operand 323 states and 327 transitions. Second operand 103 states. [2019-09-05 13:22:59,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:22:59,386 INFO L93 Difference]: Finished difference Result 348 states and 352 transitions. [2019-09-05 13:22:59,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-09-05 13:22:59,387 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 316 [2019-09-05 13:22:59,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:22:59,389 INFO L225 Difference]: With dead ends: 348 [2019-09-05 13:22:59,389 INFO L226 Difference]: Without dead ends: 348 [2019-09-05 13:22:59,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 538 SyntacticMatches, 3 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 24.6s TimeCoverageRelationStatistics Valid=9985, Invalid=28627, Unknown=0, NotChecked=0, Total=38612 [2019-09-05 13:22:59,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-09-05 13:22:59,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 347. [2019-09-05 13:22:59,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-09-05 13:22:59,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 351 transitions. [2019-09-05 13:22:59,397 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 351 transitions. Word has length 316 [2019-09-05 13:22:59,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:22:59,398 INFO L475 AbstractCegarLoop]: Abstraction has 347 states and 351 transitions. [2019-09-05 13:22:59,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-09-05 13:22:59,398 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 351 transitions. [2019-09-05 13:22:59,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-09-05 13:22:59,400 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:22:59,401 INFO L399 BasicCegarLoop]: trace histogram [110, 110, 101, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:22:59,401 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:22:59,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:22:59,401 INFO L82 PathProgramCache]: Analyzing trace with hash -155067308, now seen corresponding path program 28 times [2019-09-05 13:22:59,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:22:59,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:22:59,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:22:59,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:22:59,402 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:22:59,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:23:05,433 INFO L134 CoverageAnalysis]: Checked inductivity of 18095 backedges. 543 proven. 17550 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:23:05,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:23:05,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:23:05,433 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:23:05,434 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:23:05,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:23:05,434 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:23:05,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:23:05,443 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:23:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:23:05,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 205 conjunts are in the unsatisfiable core [2019-09-05 13:23:05,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:23:05,728 INFO L134 CoverageAnalysis]: Checked inductivity of 18095 backedges. 2643 proven. 15352 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-05 13:23:05,729 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:23:28,669 INFO L134 CoverageAnalysis]: Checked inductivity of 18095 backedges. 2643 proven. 15352 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-05 13:23:28,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:23:28,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 104, 104] total 213 [2019-09-05 13:23:28,672 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:23:28,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-09-05 13:23:28,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-09-05 13:23:28,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11649, Invalid=33507, Unknown=0, NotChecked=0, Total=45156 [2019-09-05 13:23:28,675 INFO L87 Difference]: Start difference. First operand 347 states and 351 transitions. Second operand 111 states. [2019-09-05 13:23:55,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:23:55,198 INFO L93 Difference]: Finished difference Result 372 states and 376 transitions. [2019-09-05 13:23:55,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-09-05 13:23:55,198 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 340 [2019-09-05 13:23:55,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:23:55,202 INFO L225 Difference]: With dead ends: 372 [2019-09-05 13:23:55,202 INFO L226 Difference]: Without dead ends: 372 [2019-09-05 13:23:55,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 792 GetRequests, 578 SyntacticMatches, 3 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 28.4s TimeCoverageRelationStatistics Valid=11649, Invalid=33507, Unknown=0, NotChecked=0, Total=45156 [2019-09-05 13:23:55,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-09-05 13:23:55,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 371. [2019-09-05 13:23:55,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2019-09-05 13:23:55,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 375 transitions. [2019-09-05 13:23:55,210 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 375 transitions. Word has length 340 [2019-09-05 13:23:55,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:23:55,210 INFO L475 AbstractCegarLoop]: Abstraction has 371 states and 375 transitions. [2019-09-05 13:23:55,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-09-05 13:23:55,210 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 375 transitions. [2019-09-05 13:23:55,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-09-05 13:23:55,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:23:55,213 INFO L399 BasicCegarLoop]: trace histogram [118, 118, 109, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:23:55,213 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:23:55,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:23:55,213 INFO L82 PathProgramCache]: Analyzing trace with hash 784870868, now seen corresponding path program 29 times [2019-09-05 13:23:55,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:23:55,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:23:55,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:23:55,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:23:55,214 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:23:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:24:02,351 INFO L134 CoverageAnalysis]: Checked inductivity of 20827 backedges. 583 proven. 20242 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:24:02,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:24:02,351 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:24:02,352 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:24:02,352 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:24:02,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:24:02,352 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:24:02,362 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:24:02,362 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:26:17,648 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-05 13:26:17,649 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:26:17,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-05 13:26:17,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:26:19,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:19,489 INFO L134 CoverageAnalysis]: Checked inductivity of 20827 backedges. 0 proven. 2951 refuted. 0 times theorem prover too weak. 17876 trivial. 0 not checked. [2019-09-05 13:26:19,490 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:26:23,137 INFO L134 CoverageAnalysis]: Checked inductivity of 20827 backedges. 0 proven. 2951 refuted. 0 times theorem prover too weak. 17876 trivial. 0 not checked. [2019-09-05 13:26:23,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:26:23,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119, 15, 15] total 145 [2019-09-05 13:26:23,143 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:26:23,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-09-05 13:26:23,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-09-05 13:26:23,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=506, Invalid=20374, Unknown=0, NotChecked=0, Total=20880 [2019-09-05 13:26:23,145 INFO L87 Difference]: Start difference. First operand 371 states and 375 transitions. Second operand 132 states. [2019-09-05 13:27:08,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:27:08,722 INFO L93 Difference]: Finished difference Result 412 states and 420 transitions. [2019-09-05 13:27:08,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2019-09-05 13:27:08,722 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 364 [2019-09-05 13:27:08,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:27:08,726 INFO L225 Difference]: With dead ends: 412 [2019-09-05 13:27:08,726 INFO L226 Difference]: Without dead ends: 409 [2019-09-05 13:27:08,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 967 GetRequests, 703 SyntacticMatches, 2 SemanticMatches, 262 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7080 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=2514, Invalid=66918, Unknown=0, NotChecked=0, Total=69432 [2019-09-05 13:27:08,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-09-05 13:27:08,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 398. [2019-09-05 13:27:08,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2019-09-05 13:27:08,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 403 transitions. [2019-09-05 13:27:08,736 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 403 transitions. Word has length 364 [2019-09-05 13:27:08,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:27:08,736 INFO L475 AbstractCegarLoop]: Abstraction has 398 states and 403 transitions. [2019-09-05 13:27:08,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-09-05 13:27:08,736 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 403 transitions. [2019-09-05 13:27:08,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-09-05 13:27:08,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:27:08,739 INFO L399 BasicCegarLoop]: trace histogram [127, 127, 117, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:27:08,739 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:27:08,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:27:08,739 INFO L82 PathProgramCache]: Analyzing trace with hash -192450761, now seen corresponding path program 30 times [2019-09-05 13:27:08,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:27:08,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:27:08,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:27:08,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:27:08,741 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:27:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:27:16,385 INFO L134 CoverageAnalysis]: Checked inductivity of 24130 backedges. 628 proven. 23500 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:27:16,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:27:16,385 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:27:16,385 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:27:16,386 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:27:16,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:27:16,386 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:27:16,395 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:27:16,396 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:27:16,502 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:27:16,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:27:16,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 237 conjunts are in the unsatisfiable core [2019-09-05 13:27:16,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:27:16,822 INFO L134 CoverageAnalysis]: Checked inductivity of 24130 backedges. 3412 proven. 20592 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-05 13:27:16,822 INFO L322 TraceCheckSpWp]: Computing backward predicates...