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/Mono1_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:14:25,493 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:14:25,495 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:14:25,513 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:14:25,513 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:14:25,515 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:14:25,517 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:14:25,526 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:14:25,530 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:14:25,532 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:14:25,533 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:14:25,534 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:14:25,534 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:14:25,535 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:14:25,536 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:14:25,537 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:14:25,537 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:14:25,538 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:14:25,539 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:14:25,541 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:14:25,542 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:14:25,543 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:14:25,544 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:14:25,545 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:14:25,547 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:14:25,547 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:14:25,547 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:14:25,548 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:14:25,549 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:14:25,549 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:14:25,550 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:14:25,550 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:14:25,551 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:14:25,552 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:14:25,555 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:14:25,555 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:14:25,556 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:14:25,556 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:14:25,557 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:14:25,558 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:14:25,559 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:14:25,560 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 02:14:25,586 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:14:25,586 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:14:25,586 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:14:25,587 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:14:25,587 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:14:25,588 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:14:25,588 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:14:25,588 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:14:25,588 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:14:25,588 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:14:25,589 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:14:25,589 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:14:25,590 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:14:25,590 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:14:25,590 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:14:25,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:14:25,590 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:14:25,591 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:14:25,591 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:14:25,591 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:14:25,591 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:14:25,591 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:14:25,592 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:14:25,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:14:25,592 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:14:25,592 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:14:25,592 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:14:25,593 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:14:25,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:14:25,593 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:14:25,645 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:14:25,662 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:14:25,666 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:14:25,667 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:14:25,668 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:14:25,669 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono1_1-2.c [2019-09-10 02:14:25,737 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f678832a1/b691708dc39d4d9caa4c0dfaa4adb266/FLAGa3ffc9d4b [2019-09-10 02:14:26,169 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:14:26,170 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono1_1-2.c [2019-09-10 02:14:26,177 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f678832a1/b691708dc39d4d9caa4c0dfaa4adb266/FLAGa3ffc9d4b [2019-09-10 02:14:26,573 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f678832a1/b691708dc39d4d9caa4c0dfaa4adb266 [2019-09-10 02:14:26,582 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:14:26,583 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:14:26,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:14:26,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:14:26,588 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:14:26,589 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:14:26" (1/1) ... [2019-09-10 02:14:26,592 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2090631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:14:26, skipping insertion in model container [2019-09-10 02:14:26,592 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:14:26" (1/1) ... [2019-09-10 02:14:26,600 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:14:26,615 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:14:26,758 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:14:26,763 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:14:26,779 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:14:26,794 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:14:26,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:14:26 WrapperNode [2019-09-10 02:14:26,795 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:14:26,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:14:26,796 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:14:26,796 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:14:26,899 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:14:26" (1/1) ... [2019-09-10 02:14:26,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:14:26" (1/1) ... [2019-09-10 02:14:26,905 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:14:26" (1/1) ... [2019-09-10 02:14:26,906 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:14:26" (1/1) ... [2019-09-10 02:14:26,909 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:14:26" (1/1) ... [2019-09-10 02:14:26,915 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:14:26" (1/1) ... [2019-09-10 02:14:26,915 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:14:26" (1/1) ... [2019-09-10 02:14:26,917 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:14:26,917 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:14:26,918 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:14:26,918 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:14:26,919 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:14:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:14:26,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:14:26,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:14:26,988 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-10 02:14:26,988 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:14:26,988 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:14:26,988 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 02:14:26,988 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:14:26,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:14:26,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:14:27,183 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:14:27,184 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 02:14:27,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:14:27 BoogieIcfgContainer [2019-09-10 02:14:27,186 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:14:27,187 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:14:27,187 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:14:27,190 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:14:27,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:14:26" (1/3) ... [2019-09-10 02:14:27,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c86c7bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:14:27, skipping insertion in model container [2019-09-10 02:14:27,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:14:26" (2/3) ... [2019-09-10 02:14:27,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c86c7bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:14:27, skipping insertion in model container [2019-09-10 02:14:27,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:14:27" (3/3) ... [2019-09-10 02:14:27,194 INFO L109 eAbstractionObserver]: Analyzing ICFG Mono1_1-2.c [2019-09-10 02:14:27,204 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:14:27,212 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:14:27,229 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:14:27,255 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:14:27,256 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:14:27,256 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:14:27,256 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:14:27,256 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:14:27,256 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:14:27,256 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:14:27,257 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:14:27,272 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-09-10 02:14:27,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-10 02:14:27,281 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:14:27,282 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:14:27,285 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:14:27,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:14:27,290 INFO L82 PathProgramCache]: Analyzing trace with hash -721501374, now seen corresponding path program 1 times [2019-09-10 02:14:27,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:14:27,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:27,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:14:27,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:27,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:14:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:14:27,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:14:27,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:14:27,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-10 02:14:27,391 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:14:27,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:14:27,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:14:27,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:14:27,409 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-09-10 02:14:27,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:14:27,425 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2019-09-10 02:14:27,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:14:27,426 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-10 02:14:27,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:14:27,434 INFO L225 Difference]: With dead ends: 18 [2019-09-10 02:14:27,435 INFO L226 Difference]: Without dead ends: 12 [2019-09-10 02:14:27,436 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-10 02:14:27,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-10 02:14:27,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-10 02:14:27,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-10 02:14:27,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-09-10 02:14:27,463 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2019-09-10 02:14:27,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:14:27,463 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-09-10 02:14:27,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:14:27,464 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-09-10 02:14:27,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-10 02:14:27,464 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:14:27,464 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:14:27,465 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:14:27,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:14:27,465 INFO L82 PathProgramCache]: Analyzing trace with hash -730736584, now seen corresponding path program 1 times [2019-09-10 02:14:27,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:14:27,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:27,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:14:27,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:27,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:14:27,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:14:27,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:14:27,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:14:27,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:14:27,576 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:14:27,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:14:27,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:14:27,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:14:27,580 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 3 states. [2019-09-10 02:14:27,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:14:27,614 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-09-10 02:14:27,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:14:27,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-10 02:14:27,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:14:27,616 INFO L225 Difference]: With dead ends: 14 [2019-09-10 02:14:27,616 INFO L226 Difference]: Without dead ends: 14 [2019-09-10 02:14:27,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:14:27,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-10 02:14:27,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-09-10 02:14:27,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-10 02:14:27,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-09-10 02:14:27,622 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2019-09-10 02:14:27,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:14:27,623 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-09-10 02:14:27,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:14:27,624 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-09-10 02:14:27,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-10 02:14:27,625 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:14:27,625 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:14:27,626 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:14:27,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:14:27,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1082855947, now seen corresponding path program 1 times [2019-09-10 02:14:27,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:14:27,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:27,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:14:27,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:27,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:14:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:14:27,787 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-10 02:14:27,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:14:27,790 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:14:27,791 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 13 with the following transitions: [2019-09-10 02:14:27,795 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [16], [25], [28], [30], [36], [37], [38], [40] [2019-09-10 02:14:27,828 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:14:27,828 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:14:27,892 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 02:14:27,972 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 02:14:27,975 INFO L272 AbstractInterpreter]: Visited 12 different actions 54 times. Merged at 3 different actions 18 times. Widened at 1 different actions 4 times. Performed 88 root evaluator evaluations with a maximum evaluation depth of 5. Performed 88 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 2 variables. [2019-09-10 02:14:27,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:14:27,978 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 02:14:27,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:14:27,979 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-10 02:14:27,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:14:27,990 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:14:28,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:14:28,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-10 02:14:28,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:14:28,039 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-10 02:14:28,040 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:14:28,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 02:14:28,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:14:28,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 7] total 10 [2019-09-10 02:14:28,169 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:14:28,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:14:28,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:14:28,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:14:28,170 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2019-09-10 02:14:28,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:14:28,216 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2019-09-10 02:14:28,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:14:28,218 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-09-10 02:14:28,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:14:28,219 INFO L225 Difference]: With dead ends: 16 [2019-09-10 02:14:28,219 INFO L226 Difference]: Without dead ends: 16 [2019-09-10 02:14:28,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:14:28,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-10 02:14:28,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-10 02:14:28,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-10 02:14:28,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-09-10 02:14:28,225 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2019-09-10 02:14:28,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:14:28,225 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-09-10 02:14:28,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:14:28,226 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-09-10 02:14:28,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-10 02:14:28,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:14:28,227 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:14:28,227 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:14:28,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:14:28,228 INFO L82 PathProgramCache]: Analyzing trace with hash -167147406, now seen corresponding path program 2 times [2019-09-10 02:14:28,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:14:28,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:28,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:14:28,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:28,232 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:14:28,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:14:28,330 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:14:28,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:14:28,330 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:14:28,331 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:14:28,331 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:14:28,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:14:28,331 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:14:28,357 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:14:28,358 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-10 02:14:28,370 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-10 02:14:28,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:14:28,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-10 02:14:28,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:14:28,394 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 02:14:28,394 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:14:28,471 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 02:14:28,475 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 02:14:28,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 6] imperfect sequences [5] total 10 [2019-09-10 02:14:28,475 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:14:28,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:14:28,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:14:28,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:14:28,477 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 3 states. [2019-09-10 02:14:28,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:14:28,496 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-09-10 02:14:28,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:14:28,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-09-10 02:14:28,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:14:28,498 INFO L225 Difference]: With dead ends: 18 [2019-09-10 02:14:28,498 INFO L226 Difference]: Without dead ends: 18 [2019-09-10 02:14:28,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:14:28,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-10 02:14:28,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-09-10 02:14:28,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-10 02:14:28,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-09-10 02:14:28,515 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-09-10 02:14:28,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:14:28,516 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-09-10 02:14:28,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:14:28,516 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-09-10 02:14:28,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-10 02:14:28,517 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:14:28,517 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:14:28,517 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:14:28,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:14:28,518 INFO L82 PathProgramCache]: Analyzing trace with hash -582276883, now seen corresponding path program 1 times [2019-09-10 02:14:28,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:14:28,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:28,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:14:28,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:28,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:14:28,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:14:28,646 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:14:28,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:14:28,647 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:14:28,647 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2019-09-10 02:14:28,647 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [16], [18], [25], [28], [30], [36], [37], [38], [40] [2019-09-10 02:14:28,650 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:14:28,650 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:14:28,652 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 02:14:28,706 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 02:14:28,706 INFO L272 AbstractInterpreter]: Visited 13 different actions 61 times. Merged at 4 different actions 18 times. Widened at 2 different actions 4 times. Performed 110 root evaluator evaluations with a maximum evaluation depth of 5. Performed 110 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 8 fixpoints after 2 different actions. Largest state had 2 variables. [2019-09-10 02:14:28,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:14:28,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 02:14:28,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:14:28,707 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-10 02:14:28,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:14:28,717 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:14:28,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:14:28,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 02:14:28,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:14:28,785 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:14:28,785 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:14:28,865 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:14:28,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:14:28,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 10 [2019-09-10 02:14:28,870 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:14:28,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:14:28,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:14:28,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:14:28,871 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 6 states. [2019-09-10 02:14:28,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:14:28,927 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-09-10 02:14:28,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:14:28,928 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-09-10 02:14:28,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:14:28,929 INFO L225 Difference]: With dead ends: 19 [2019-09-10 02:14:28,930 INFO L226 Difference]: Without dead ends: 19 [2019-09-10 02:14:28,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:14:28,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-10 02:14:28,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-10 02:14:28,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-10 02:14:28,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-09-10 02:14:28,938 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-09-10 02:14:28,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:14:28,939 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-09-10 02:14:28,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:14:28,939 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-09-10 02:14:28,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-10 02:14:28,941 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:14:28,941 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:14:28,941 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:14:28,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:14:28,942 INFO L82 PathProgramCache]: Analyzing trace with hash 719600874, now seen corresponding path program 2 times [2019-09-10 02:14:28,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:14:28,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:28,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:14:28,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:28,944 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:14:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:14:29,055 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:14:29,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:14:29,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:14:29,056 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:14:29,056 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:14:29,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:14:29,056 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-10 02:14:29,077 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:14:29,078 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-10 02:14:29,092 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-10 02:14:29,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:14:29,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-10 02:14:29,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:14:29,120 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 02:14:29,120 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:14:29,229 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 02:14:29,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:14:29,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 7] total 13 [2019-09-10 02:14:29,234 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:14:29,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:14:29,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:14:29,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:14:29,235 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 8 states. [2019-09-10 02:14:31,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:14:31,535 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2019-09-10 02:14:31,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:14:31,536 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-09-10 02:14:31,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:14:31,537 INFO L225 Difference]: With dead ends: 26 [2019-09-10 02:14:31,537 INFO L226 Difference]: Without dead ends: 26 [2019-09-10 02:14:31,538 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-09-10 02:14:31,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-10 02:14:31,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2019-09-10 02:14:31,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-10 02:14:31,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-09-10 02:14:31,542 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 18 [2019-09-10 02:14:31,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:14:31,542 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-09-10 02:14:31,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:14:31,543 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-09-10 02:14:31,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-10 02:14:31,543 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:14:31,544 INFO L399 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:14:31,544 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:14:31,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:14:31,544 INFO L82 PathProgramCache]: Analyzing trace with hash 957312226, now seen corresponding path program 3 times [2019-09-10 02:14:31,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:14:31,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:31,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:14:31,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:31,546 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:14:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:14:31,669 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 02:14:31,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:14:31,670 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:14:31,670 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:14:31,670 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:14:31,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:14:31,670 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-10 02:14:31,688 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:14:31,689 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:14:31,706 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:14:31,706 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:14:31,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-10 02:14:31,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:14:31,745 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 02:14:31,747 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:14:31,945 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 02:14:31,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:14:31,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 14 [2019-09-10 02:14:31,948 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:14:31,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:14:31,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:14:31,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-09-10 02:14:31,951 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 8 states. [2019-09-10 02:14:32,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:14:32,039 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2019-09-10 02:14:32,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:14:32,039 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-09-10 02:14:32,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:14:32,040 INFO L225 Difference]: With dead ends: 25 [2019-09-10 02:14:32,040 INFO L226 Difference]: Without dead ends: 25 [2019-09-10 02:14:32,041 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-09-10 02:14:32,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-10 02:14:32,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-09-10 02:14:32,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-10 02:14:32,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-09-10 02:14:32,045 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 22 [2019-09-10 02:14:32,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:14:32,045 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-09-10 02:14:32,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:14:32,046 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-09-10 02:14:32,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-10 02:14:32,047 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:14:32,047 INFO L399 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:14:32,047 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:14:32,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:14:32,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1915302113, now seen corresponding path program 4 times [2019-09-10 02:14:32,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:14:32,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:32,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:14:32,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:32,050 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:14:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:14:32,205 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 02:14:32,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:14:32,205 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:14:32,205 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:14:32,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:14:32,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:14:32,206 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:14:32,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:14:32,225 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:14:32,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:14:32,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 02:14:32,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:14:32,270 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 02:14:32,271 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:14:32,456 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 02:14:32,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:14:32,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 16 [2019-09-10 02:14:32,459 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:14:32,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:14:32,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:14:32,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:14:32,461 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 9 states. [2019-09-10 02:14:32,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:14:32,576 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2019-09-10 02:14:32,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:14:32,578 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-09-10 02:14:32,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:14:32,579 INFO L225 Difference]: With dead ends: 27 [2019-09-10 02:14:32,579 INFO L226 Difference]: Without dead ends: 27 [2019-09-10 02:14:32,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:14:32,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-10 02:14:32,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-10 02:14:32,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-10 02:14:32,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-09-10 02:14:32,583 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2019-09-10 02:14:32,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:14:32,584 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-09-10 02:14:32,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:14:32,584 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-09-10 02:14:32,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-10 02:14:32,585 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:14:32,585 INFO L399 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:14:32,585 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:14:32,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:14:32,585 INFO L82 PathProgramCache]: Analyzing trace with hash -833710564, now seen corresponding path program 5 times [2019-09-10 02:14:32,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:14:32,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:32,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:14:32,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:32,587 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:14:32,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:14:32,729 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 02:14:32,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:14:32,730 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:14:32,730 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:14:32,730 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:14:32,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:14:32,730 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:14:32,758 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:14:32,758 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:14:32,777 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-10 02:14:32,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:14:32,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 02:14:32,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:14:32,833 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 30 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-10 02:14:32,833 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:14:32,955 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 30 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-10 02:14:32,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:14:32,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 8] total 18 [2019-09-10 02:14:32,959 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:14:32,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 02:14:32,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 02:14:32,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2019-09-10 02:14:32,961 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 12 states. [2019-09-10 02:14:33,510 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2019-09-10 02:14:38,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:14:38,812 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2019-09-10 02:14:38,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:14:38,813 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-09-10 02:14:38,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:14:38,814 INFO L225 Difference]: With dead ends: 36 [2019-09-10 02:14:38,814 INFO L226 Difference]: Without dead ends: 36 [2019-09-10 02:14:38,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462 [2019-09-10 02:14:38,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-10 02:14:38,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2019-09-10 02:14:38,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-10 02:14:38,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-09-10 02:14:38,818 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 26 [2019-09-10 02:14:38,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:14:38,819 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-09-10 02:14:38,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 02:14:38,819 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-09-10 02:14:38,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-10 02:14:38,820 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:14:38,820 INFO L399 BasicCegarLoop]: trace histogram [10, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:14:38,820 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:14:38,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:14:38,821 INFO L82 PathProgramCache]: Analyzing trace with hash -644516716, now seen corresponding path program 6 times [2019-09-10 02:14:38,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:14:38,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:38,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:14:38,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:38,822 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:14:38,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:14:38,975 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 40 proven. 56 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 02:14:38,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:14:38,975 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:14:38,976 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:14:38,976 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:14:38,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:14:38,976 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:14:38,991 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:14:38,992 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:14:39,004 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:14:39,004 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:14:39,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-10 02:14:39,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:14:39,051 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 40 proven. 56 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 02:14:39,051 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:14:39,311 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 40 proven. 56 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 02:14:39,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:14:39,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 20 [2019-09-10 02:14:39,319 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:14:39,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 02:14:39,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 02:14:39,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2019-09-10 02:14:39,320 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 11 states. [2019-09-10 02:14:39,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:14:39,471 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2019-09-10 02:14:39,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 02:14:39,472 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2019-09-10 02:14:39,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:14:39,475 INFO L225 Difference]: With dead ends: 33 [2019-09-10 02:14:39,475 INFO L226 Difference]: Without dead ends: 33 [2019-09-10 02:14:39,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2019-09-10 02:14:39,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-10 02:14:39,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-10 02:14:39,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-10 02:14:39,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2019-09-10 02:14:39,480 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 30 [2019-09-10 02:14:39,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:14:39,480 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2019-09-10 02:14:39,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 02:14:39,481 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2019-09-10 02:14:39,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-10 02:14:39,481 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:14:39,482 INFO L399 BasicCegarLoop]: trace histogram [11, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:14:39,482 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:14:39,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:14:39,482 INFO L82 PathProgramCache]: Analyzing trace with hash -30848559, now seen corresponding path program 7 times [2019-09-10 02:14:39,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:14:39,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:39,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:14:39,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:39,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:14:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:14:39,633 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 45 proven. 72 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 02:14:39,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:14:39,634 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:14:39,634 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:14:39,634 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:14:39,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:14:39,635 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:14:39,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:14:39,658 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:14:39,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:14:39,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-10 02:14:39,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:14:39,712 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 45 proven. 72 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 02:14:39,712 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:14:40,451 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 45 proven. 72 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 02:14:40,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:14:40,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 22 [2019-09-10 02:14:40,455 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:14:40,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 02:14:40,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 02:14:40,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2019-09-10 02:14:40,456 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 12 states. [2019-09-10 02:14:40,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:14:40,661 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2019-09-10 02:14:40,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:14:40,662 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2019-09-10 02:14:40,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:14:40,663 INFO L225 Difference]: With dead ends: 35 [2019-09-10 02:14:40,663 INFO L226 Difference]: Without dead ends: 35 [2019-09-10 02:14:40,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2019-09-10 02:14:40,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-10 02:14:40,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-09-10 02:14:40,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-10 02:14:40,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2019-09-10 02:14:40,675 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 32 [2019-09-10 02:14:40,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:14:40,676 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-09-10 02:14:40,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 02:14:40,676 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2019-09-10 02:14:40,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-10 02:14:40,677 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:14:40,678 INFO L399 BasicCegarLoop]: trace histogram [12, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:14:40,678 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:14:40,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:14:40,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1293730766, now seen corresponding path program 8 times [2019-09-10 02:14:40,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:14:40,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:40,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:14:40,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:40,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:14:40,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:14:40,869 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 50 proven. 90 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 02:14:40,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:14:40,870 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:14:40,870 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:14:40,870 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:14:40,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:14:40,870 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) [2019-09-10 02:14:40,887 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:14:40,888 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:14:40,939 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-10 02:14:40,940 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:14:40,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 02:14:40,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:14:41,027 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 63 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-09-10 02:14:41,028 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:14:41,216 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 63 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-09-10 02:14:41,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:14:41,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 9] total 23 [2019-09-10 02:14:41,220 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:14:41,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 02:14:41,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 02:14:41,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2019-09-10 02:14:41,223 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 16 states. [2019-09-10 02:14:58,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:14:58,870 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2019-09-10 02:14:58,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 02:14:58,870 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2019-09-10 02:14:58,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:14:58,871 INFO L225 Difference]: With dead ends: 44 [2019-09-10 02:14:58,871 INFO L226 Difference]: Without dead ends: 44 [2019-09-10 02:14:58,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=196, Invalid=559, Unknown=1, NotChecked=0, Total=756 [2019-09-10 02:14:58,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-10 02:14:58,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2019-09-10 02:14:58,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-10 02:14:58,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-09-10 02:14:58,876 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 34 [2019-09-10 02:14:58,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:14:58,877 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-09-10 02:14:58,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 02:14:58,877 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-09-10 02:14:58,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-10 02:14:58,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:14:58,878 INFO L399 BasicCegarLoop]: trace histogram [14, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:14:58,879 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:14:58,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:14:58,879 INFO L82 PathProgramCache]: Analyzing trace with hash 284766406, now seen corresponding path program 9 times [2019-09-10 02:14:58,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:14:58,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:58,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:14:58,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:14:58,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:14:58,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:14:59,091 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 77 proven. 110 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 02:14:59,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:14:59,091 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:14:59,091 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:14:59,092 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:14:59,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:14:59,092 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:14:59,108 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:14:59,109 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:14:59,121 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:14:59,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:14:59,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 02:14:59,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:14:59,164 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 77 proven. 110 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 02:14:59,164 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:15:00,218 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 77 proven. 110 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 02:15:00,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:15:00,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 26 [2019-09-10 02:15:00,222 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:15:00,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 02:15:00,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 02:15:00,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=445, Unknown=0, NotChecked=0, Total=650 [2019-09-10 02:15:00,223 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 14 states. [2019-09-10 02:15:00,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:15:00,473 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2019-09-10 02:15:00,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 02:15:00,474 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2019-09-10 02:15:00,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:15:00,475 INFO L225 Difference]: With dead ends: 41 [2019-09-10 02:15:00,475 INFO L226 Difference]: Without dead ends: 41 [2019-09-10 02:15:00,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=205, Invalid=445, Unknown=0, NotChecked=0, Total=650 [2019-09-10 02:15:00,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-10 02:15:00,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-09-10 02:15:00,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-10 02:15:00,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-09-10 02:15:00,481 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 38 [2019-09-10 02:15:00,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:15:00,481 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-09-10 02:15:00,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 02:15:00,481 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-09-10 02:15:00,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-10 02:15:00,482 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:15:00,482 INFO L399 BasicCegarLoop]: trace histogram [15, 11, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:15:00,483 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:15:00,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:15:00,483 INFO L82 PathProgramCache]: Analyzing trace with hash 926316803, now seen corresponding path program 10 times [2019-09-10 02:15:00,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:15:00,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:15:00,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:15:00,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:15:00,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:15:00,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:15:00,697 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 84 proven. 132 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 02:15:00,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:15:00,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:15:00,697 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:15:00,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:15:00,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:15:00,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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:15:00,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:15:00,720 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:15:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:15:00,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-10 02:15:00,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:15:00,814 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 84 proven. 132 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 02:15:00,815 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:15:03,551 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 84 proven. 130 refuted. 2 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 02:15:03,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:15:03,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 28 [2019-09-10 02:15:03,555 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:15:03,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 02:15:03,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 02:15:03,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=520, Unknown=1, NotChecked=0, Total=756 [2019-09-10 02:15:03,556 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 15 states. [2019-09-10 02:15:03,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:15:03,865 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-09-10 02:15:03,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:15:03,870 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2019-09-10 02:15:03,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:15:03,871 INFO L225 Difference]: With dead ends: 43 [2019-09-10 02:15:03,871 INFO L226 Difference]: Without dead ends: 43 [2019-09-10 02:15:03,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=235, Invalid=520, Unknown=1, NotChecked=0, Total=756 [2019-09-10 02:15:03,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-10 02:15:03,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-09-10 02:15:03,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-10 02:15:03,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-09-10 02:15:03,880 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 40 [2019-09-10 02:15:03,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:15:03,881 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-09-10 02:15:03,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 02:15:03,881 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-09-10 02:15:03,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-10 02:15:03,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:15:03,882 INFO L399 BasicCegarLoop]: trace histogram [16, 12, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:15:03,882 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:15:03,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:15:03,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1019042304, now seen corresponding path program 11 times [2019-09-10 02:15:03,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:15:03,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:15:03,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:15:03,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:15:03,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:15:03,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:15:04,125 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 91 proven. 156 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 02:15:04,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:15:04,126 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:15:04,126 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:15:04,126 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:15:04,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:15:04,126 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:15:04,149 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:15:04,149 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:15:04,188 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-10 02:15:04,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:15:04,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-10 02:15:04,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:15:04,293 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 108 proven. 16 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-09-10 02:15:04,293 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:15:04,604 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 108 proven. 16 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-09-10 02:15:04,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:15:04,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7, 10] total 28 [2019-09-10 02:15:04,608 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:15:04,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 02:15:04,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 02:15:04,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=565, Unknown=0, NotChecked=0, Total=756 [2019-09-10 02:15:04,610 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 20 states. [2019-09-10 02:15:15,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:15:15,701 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2019-09-10 02:15:15,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 02:15:15,702 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2019-09-10 02:15:15,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:15:15,703 INFO L225 Difference]: With dead ends: 50 [2019-09-10 02:15:15,703 INFO L226 Difference]: Without dead ends: 50 [2019-09-10 02:15:15,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=271, Invalid=784, Unknown=1, NotChecked=0, Total=1056 [2019-09-10 02:15:15,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-10 02:15:15,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2019-09-10 02:15:15,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-10 02:15:15,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2019-09-10 02:15:15,708 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 42 [2019-09-10 02:15:15,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:15:15,709 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2019-09-10 02:15:15,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 02:15:15,709 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2019-09-10 02:15:15,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-10 02:15:15,710 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:15:15,710 INFO L399 BasicCegarLoop]: trace histogram [18, 13, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:15:15,710 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:15:15,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:15:15,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1622573432, now seen corresponding path program 12 times [2019-09-10 02:15:15,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:15:15,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:15:15,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:15:15,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:15:15,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:15:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:15:15,945 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 126 proven. 182 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 02:15:15,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:15:15,946 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:15:15,946 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:15:15,946 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:15:15,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:15:15,946 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) [2019-09-10 02:15:15,959 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:15:15,960 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:15:15,978 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:15:15,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:15:15,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-10 02:15:15,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:15:16,034 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 126 proven. 182 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 02:15:16,035 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:15:18,163 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 126 proven. 182 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 02:15:18,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:15:18,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 17] total 32 [2019-09-10 02:15:18,167 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:15:18,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 02:15:18,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 02:15:18,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=691, Unknown=0, NotChecked=0, Total=992 [2019-09-10 02:15:18,168 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 17 states. [2019-09-10 02:15:18,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:15:18,510 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-09-10 02:15:18,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 02:15:18,511 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2019-09-10 02:15:18,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:15:18,512 INFO L225 Difference]: With dead ends: 49 [2019-09-10 02:15:18,512 INFO L226 Difference]: Without dead ends: 49 [2019-09-10 02:15:18,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=301, Invalid=691, Unknown=0, NotChecked=0, Total=992 [2019-09-10 02:15:18,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-10 02:15:18,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-09-10 02:15:18,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-10 02:15:18,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2019-09-10 02:15:18,517 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 46 [2019-09-10 02:15:18,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:15:18,518 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2019-09-10 02:15:18,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 02:15:18,518 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2019-09-10 02:15:18,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-10 02:15:18,519 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:15:18,519 INFO L399 BasicCegarLoop]: trace histogram [19, 14, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:15:18,519 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:15:18,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:15:18,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1921368907, now seen corresponding path program 13 times [2019-09-10 02:15:18,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:15:18,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:15:18,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:15:18,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:15:18,521 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:15:18,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:15:18,738 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 135 proven. 210 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 02:15:18,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:15:18,738 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:15:18,738 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:15:18,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:15:18,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:15:18,739 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-10 02:15:18,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:15:18,750 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:15:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:15:18,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-10 02:15:18,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:15:18,813 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 135 proven. 210 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 02:15:18,813 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:15:19,786 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 135 proven. 210 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 02:15:19,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:15:19,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 34 [2019-09-10 02:15:19,790 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:15:19,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 02:15:19,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 02:15:19,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=785, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 02:15:19,792 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 18 states. [2019-09-10 02:15:20,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:15:20,218 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2019-09-10 02:15:20,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 02:15:20,219 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2019-09-10 02:15:20,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:15:20,219 INFO L225 Difference]: With dead ends: 51 [2019-09-10 02:15:20,219 INFO L226 Difference]: Without dead ends: 51 [2019-09-10 02:15:20,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=337, Invalid=785, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 02:15:20,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-10 02:15:20,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-09-10 02:15:20,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-10 02:15:20,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2019-09-10 02:15:20,224 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 48 [2019-09-10 02:15:20,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:15:20,224 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2019-09-10 02:15:20,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 02:15:20,224 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2019-09-10 02:15:20,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-10 02:15:20,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:15:20,225 INFO L399 BasicCegarLoop]: trace histogram [20, 15, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:15:20,225 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:15:20,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:15:20,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1740890958, now seen corresponding path program 14 times [2019-09-10 02:15:20,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:15:20,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:15:20,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:15:20,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:15:20,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:15:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:15:20,477 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 144 proven. 240 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 02:15:20,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:15:20,477 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:15:20,477 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:15:20,478 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:15:20,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:15:20,478 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:15:20,491 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:15:20,492 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:15:20,671 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-10 02:15:20,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:15:20,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-10 02:15:20,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:15:20,835 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 165 proven. 25 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-10 02:15:20,835 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:15:21,228 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 165 proven. 25 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-10 02:15:21,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:15:21,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8, 11] total 33 [2019-09-10 02:15:21,234 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:15:21,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 02:15:21,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 02:15:21,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=791, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 02:15:21,236 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 24 states. [2019-09-10 02:15:25,792 WARN L188 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-10 02:15:55,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:15:55,783 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2019-09-10 02:15:55,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 02:15:55,784 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2019-09-10 02:15:55,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:15:55,784 INFO L225 Difference]: With dead ends: 60 [2019-09-10 02:15:55,784 INFO L226 Difference]: Without dead ends: 60 [2019-09-10 02:15:55,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=399, Invalid=1156, Unknown=5, NotChecked=0, Total=1560 [2019-09-10 02:15:55,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-10 02:15:55,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2019-09-10 02:15:55,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-10 02:15:55,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2019-09-10 02:15:55,788 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 50 [2019-09-10 02:15:55,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:15:55,789 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2019-09-10 02:15:55,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 02:15:55,789 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2019-09-10 02:15:55,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-10 02:15:55,790 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:15:55,790 INFO L399 BasicCegarLoop]: trace histogram [22, 16, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:15:55,790 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:15:55,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:15:55,790 INFO L82 PathProgramCache]: Analyzing trace with hash -741259606, now seen corresponding path program 15 times [2019-09-10 02:15:55,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:15:55,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:15:55,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:15:55,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:15:55,792 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:15:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:15:56,185 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 187 proven. 272 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-10 02:15:56,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:15:56,185 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:15:56,185 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:15:56,186 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:15:56,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:15:56,186 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:15:56,215 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:15:56,215 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:15:56,245 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:15:56,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:15:56,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-10 02:15:56,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:15:56,347 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 187 proven. 272 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-10 02:15:56,347 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:15:57,632 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 187 proven. 272 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-10 02:15:57,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:15:57,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 20] total 38 [2019-09-10 02:15:57,636 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:15:57,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 02:15:57,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 02:15:57,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=415, Invalid=991, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 02:15:57,637 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 20 states. [2019-09-10 02:15:58,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:15:58,112 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2019-09-10 02:15:58,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 02:15:58,112 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 54 [2019-09-10 02:15:58,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:15:58,113 INFO L225 Difference]: With dead ends: 57 [2019-09-10 02:15:58,113 INFO L226 Difference]: Without dead ends: 57 [2019-09-10 02:15:58,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 88 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=415, Invalid=991, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 02:15:58,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-10 02:15:58,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-09-10 02:15:58,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-10 02:15:58,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2019-09-10 02:15:58,117 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 54 [2019-09-10 02:15:58,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:15:58,117 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2019-09-10 02:15:58,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 02:15:58,117 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2019-09-10 02:15:58,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 02:15:58,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:15:58,118 INFO L399 BasicCegarLoop]: trace histogram [23, 17, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:15:58,119 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:15:58,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:15:58,119 INFO L82 PathProgramCache]: Analyzing trace with hash -554142489, now seen corresponding path program 16 times [2019-09-10 02:15:58,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:15:58,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:15:58,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:15:58,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:15:58,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:15:58,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:15:58,451 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 198 proven. 306 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-10 02:15:58,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:15:58,452 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:15:58,452 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:15:58,452 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:15:58,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:15:58,452 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) [2019-09-10 02:15:58,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:15:58,466 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:15:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:15:58,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-10 02:15:58,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:15:58,554 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 198 proven. 306 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-10 02:15:58,555 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:16:00,477 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 198 proven. 306 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-10 02:16:00,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:16:00,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 21] total 40 [2019-09-10 02:16:00,486 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:16:00,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 02:16:00,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 02:16:00,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=1103, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 02:16:00,488 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 21 states. [2019-09-10 02:16:01,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:16:01,053 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2019-09-10 02:16:01,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 02:16:01,053 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 56 [2019-09-10 02:16:01,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:16:01,054 INFO L225 Difference]: With dead ends: 59 [2019-09-10 02:16:01,054 INFO L226 Difference]: Without dead ends: 59 [2019-09-10 02:16:01,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 91 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=457, Invalid=1103, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 02:16:01,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-10 02:16:01,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-09-10 02:16:01,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-10 02:16:01,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2019-09-10 02:16:01,061 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 56 [2019-09-10 02:16:01,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:16:01,061 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2019-09-10 02:16:01,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 02:16:01,061 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2019-09-10 02:16:01,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 02:16:01,062 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:16:01,062 INFO L399 BasicCegarLoop]: trace histogram [24, 18, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:16:01,063 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:16:01,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:16:01,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1123219484, now seen corresponding path program 17 times [2019-09-10 02:16:01,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:16:01,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:01,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:16:01,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:16:01,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:16:01,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:16:01,389 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 209 proven. 342 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-10 02:16:01,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:01,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:16:01,390 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:16:01,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:16:01,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:16:01,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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:16:01,401 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:16:01,401 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:16:01,450 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-10 02:16:01,450 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:16:01,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 02:16:01,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:16:01,660 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 234 proven. 36 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2019-09-10 02:16:01,660 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:16:02,078 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 234 proven. 36 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2019-09-10 02:16:02,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:16:02,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 9, 12] total 38 [2019-09-10 02:16:02,082 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:16:02,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 02:16:02,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 02:16:02,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=1055, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 02:16:02,084 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand 28 states. [2019-09-10 02:16:06,443 WARN L188 SmtUtils]: Spent 851.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-10 02:16:13,603 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-10 02:16:29,178 WARN L188 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-10 02:16:35,563 WARN L188 SmtUtils]: Spent 2.43 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-10 02:17:19,329 WARN L188 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-10 02:17:30,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:30,305 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2019-09-10 02:17:30,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 02:17:30,305 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 58 [2019-09-10 02:17:30,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:30,306 INFO L225 Difference]: With dead ends: 71 [2019-09-10 02:17:30,306 INFO L226 Difference]: Without dead ends: 71 [2019-09-10 02:17:30,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 104 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 64.0s TimeCoverageRelationStatistics Valid=613, Invalid=1727, Unknown=12, NotChecked=0, Total=2352 [2019-09-10 02:17:30,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-10 02:17:30,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 63. [2019-09-10 02:17:30,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-10 02:17:30,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2019-09-10 02:17:30,312 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 58 [2019-09-10 02:17:30,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:30,312 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2019-09-10 02:17:30,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 02:17:30,313 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2019-09-10 02:17:30,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-10 02:17:30,314 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:30,314 INFO L399 BasicCegarLoop]: trace histogram [26, 19, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:30,314 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:30,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:30,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1126866852, now seen corresponding path program 18 times [2019-09-10 02:17:30,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:30,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:30,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:17:30,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:30,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:30,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:30,822 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 260 proven. 380 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:17:30,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:30,822 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:30,823 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:30,823 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:30,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:30,823 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:17:30,859 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:17:30,860 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:17:30,890 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:17:30,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:17:30,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-10 02:17:30,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:31,001 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 260 proven. 380 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:17:31,001 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:36,728 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 260 proven. 378 refuted. 2 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:17:36,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:36,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 23] total 44 [2019-09-10 02:17:36,732 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:36,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 02:17:36,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 02:17:36,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=547, Invalid=1344, Unknown=1, NotChecked=0, Total=1892 [2019-09-10 02:17:36,734 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 23 states. [2019-09-10 02:17:37,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:37,416 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2019-09-10 02:17:37,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 02:17:37,420 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 62 [2019-09-10 02:17:37,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:37,420 INFO L225 Difference]: With dead ends: 65 [2019-09-10 02:17:37,420 INFO L226 Difference]: Without dead ends: 65 [2019-09-10 02:17:37,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 101 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=547, Invalid=1344, Unknown=1, NotChecked=0, Total=1892 [2019-09-10 02:17:37,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-10 02:17:37,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-09-10 02:17:37,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-10 02:17:37,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2019-09-10 02:17:37,430 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 62 [2019-09-10 02:17:37,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:37,431 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2019-09-10 02:17:37,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 02:17:37,431 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2019-09-10 02:17:37,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 02:17:37,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:37,432 INFO L399 BasicCegarLoop]: trace histogram [27, 20, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:37,432 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:37,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:37,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1362952601, now seen corresponding path program 19 times [2019-09-10 02:17:37,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:37,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:37,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:17:37,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:37,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:37,809 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 273 proven. 420 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:17:37,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:37,810 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:37,810 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:37,810 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:37,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:37,810 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:17:37,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:37,822 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:17:37,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:37,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-10 02:17:37,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:37,929 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 273 proven. 420 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:17:37,929 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:40,238 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 273 proven. 420 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:17:40,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:17:40,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 24] total 46 [2019-09-10 02:17:40,242 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:17:40,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 02:17:40,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 02:17:40,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=1475, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 02:17:40,244 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 24 states. [2019-09-10 02:17:41,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:17:41,029 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2019-09-10 02:17:41,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 02:17:41,029 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 64 [2019-09-10 02:17:41,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:17:41,030 INFO L225 Difference]: With dead ends: 67 [2019-09-10 02:17:41,030 INFO L226 Difference]: Without dead ends: 67 [2019-09-10 02:17:41,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 104 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=595, Invalid=1475, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 02:17:41,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-10 02:17:41,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-09-10 02:17:41,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-10 02:17:41,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2019-09-10 02:17:41,036 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 64 [2019-09-10 02:17:41,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:17:41,036 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2019-09-10 02:17:41,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 02:17:41,036 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2019-09-10 02:17:41,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 02:17:41,037 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:17:41,037 INFO L399 BasicCegarLoop]: trace histogram [28, 21, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:17:41,037 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:17:41,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:17:41,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1782663062, now seen corresponding path program 20 times [2019-09-10 02:17:41,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:17:41,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:41,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:17:41,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:17:41,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:17:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:17:41,445 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 286 proven. 462 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:17:41,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:41,445 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:17:41,445 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:17:41,446 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:17:41,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:17:41,446 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:17:41,457 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:17:41,457 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:17:42,522 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-10 02:17:42,522 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:17:42,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-10 02:17:42,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:17:51,782 WARN L188 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2019-09-10 02:17:51,787 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 315 proven. 47 refuted. 2 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:17:51,787 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:17:54,192 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ c_main_~x~0 4) 4294967296))) (or (= 100000000 .cse0) (< .cse0 100000000) (<= 100000000 (mod (+ c_main_~x~0 2) 4294967296)) (< (mod c_main_~x~0 4294967296) 10000000))) is different from true [2019-09-10 02:18:03,187 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 315 proven. 43 refuted. 0 times theorem prover too weak. 420 trivial. 6 not checked. [2019-09-10 02:18:03,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:18:03,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 10, 15] total 45 [2019-09-10 02:18:03,192 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:18:03,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-10 02:18:03,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-10 02:18:03,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=477, Invalid=1413, Unknown=6, NotChecked=84, Total=1980 [2019-09-10 02:18:03,193 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand 32 states. [2019-09-10 02:18:11,690 WARN L188 SmtUtils]: Spent 6.13 s on a formula simplification. DAG size of input: 28 DAG size of output: 16 [2019-09-10 02:18:25,159 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-10 02:18:37,865 WARN L188 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 12 [2019-09-10 02:18:56,475 WARN L188 SmtUtils]: Spent 9.24 s on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-10 02:19:08,518 WARN L188 SmtUtils]: Spent 3.21 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-10 02:19:23,550 WARN L188 SmtUtils]: Spent 4.88 s on a formula simplification. DAG size of input: 28 DAG size of output: 16 [2019-09-10 02:19:31,589 WARN L188 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-10 02:19:38,212 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-10 02:19:40,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:19:40,756 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2019-09-10 02:19:40,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-10 02:19:40,756 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 66 [2019-09-10 02:19:40,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:19:40,757 INFO L225 Difference]: With dead ends: 80 [2019-09-10 02:19:40,758 INFO L226 Difference]: Without dead ends: 80 [2019-09-10 02:19:40,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 116 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 102.7s TimeCoverageRelationStatistics Valid=682, Invalid=2170, Unknown=14, NotChecked=104, Total=2970 [2019-09-10 02:19:40,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-10 02:19:40,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2019-09-10 02:19:40,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-10 02:19:40,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2019-09-10 02:19:40,762 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 66 [2019-09-10 02:19:40,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:19:40,763 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2019-09-10 02:19:40,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-10 02:19:40,763 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2019-09-10 02:19:40,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 02:19:40,764 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:19:40,764 INFO L399 BasicCegarLoop]: trace histogram [30, 22, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:19:40,764 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:19:40,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:19:40,764 INFO L82 PathProgramCache]: Analyzing trace with hash -204034418, now seen corresponding path program 21 times [2019-09-10 02:19:40,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:19:40,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:19:40,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:19:40,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:19:40,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:19:40,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:19:41,156 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 345 proven. 506 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-10 02:19:41,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:19:41,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:19:41,157 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:19:41,157 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:19:41,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:19:41,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:19:41,167 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:19:41,167 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:19:41,189 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:19:41,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:19:41,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-10 02:19:41,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:19:41,292 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 345 proven. 506 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-10 02:19:41,293 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:19:43,329 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 345 proven. 506 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-10 02:19:43,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:19:43,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 26] total 50 [2019-09-10 02:19:43,333 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:19:43,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 02:19:43,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 02:19:43,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=697, Invalid=1753, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 02:19:43,334 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 26 states. [2019-09-10 02:19:44,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:19:44,259 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2019-09-10 02:19:44,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 02:19:44,260 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 70 [2019-09-10 02:19:44,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:19:44,261 INFO L225 Difference]: With dead ends: 78 [2019-09-10 02:19:44,261 INFO L226 Difference]: Without dead ends: 78 [2019-09-10 02:19:44,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 114 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=697, Invalid=1753, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 02:19:44,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-10 02:19:44,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-09-10 02:19:44,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-10 02:19:44,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2019-09-10 02:19:44,265 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 70 [2019-09-10 02:19:44,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:19:44,265 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2019-09-10 02:19:44,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 02:19:44,265 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2019-09-10 02:19:44,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 02:19:44,266 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:19:44,266 INFO L399 BasicCegarLoop]: trace histogram [31, 23, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:19:44,266 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:19:44,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:19:44,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1889811765, now seen corresponding path program 22 times [2019-09-10 02:19:44,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:19:44,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:19:44,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:19:44,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:19:44,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:19:44,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:19:44,809 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 360 proven. 552 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-10 02:19:44,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:19:44,809 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:19:44,809 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:19:44,809 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:19:44,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:19:44,810 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:19:44,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:19:44,831 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:19:44,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:19:44,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-10 02:19:44,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:19:44,941 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 360 proven. 552 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-10 02:19:44,942 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:19:49,647 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 360 proven. 552 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-10 02:19:49,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:19:49,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 27] total 52 [2019-09-10 02:19:49,651 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:19:49,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-10 02:19:49,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-10 02:19:49,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=751, Invalid=1901, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:19:49,653 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 27 states. [2019-09-10 02:19:50,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:19:50,592 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2019-09-10 02:19:50,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 02:19:50,592 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 72 [2019-09-10 02:19:50,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:19:50,593 INFO L225 Difference]: With dead ends: 80 [2019-09-10 02:19:50,594 INFO L226 Difference]: Without dead ends: 80 [2019-09-10 02:19:50,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 117 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=751, Invalid=1901, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:19:50,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-10 02:19:50,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-09-10 02:19:50,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-10 02:19:50,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2019-09-10 02:19:50,598 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 72 [2019-09-10 02:19:50,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:19:50,598 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2019-09-10 02:19:50,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-10 02:19:50,599 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2019-09-10 02:19:50,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 02:19:50,599 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:19:50,600 INFO L399 BasicCegarLoop]: trace histogram [32, 24, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:19:50,600 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:19:50,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:19:50,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1575795656, now seen corresponding path program 23 times [2019-09-10 02:19:50,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:19:50,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:19:50,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:19:50,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:19:50,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:19:50,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:19:51,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 375 proven. 600 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-10 02:19:51,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:19:51,132 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:19:51,132 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:19:51,132 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:19:51,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:19:51,132 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:19:51,144 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:19:51,144 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:20:22,041 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-10 02:20:22,041 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:20:25,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-10 02:20:25,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:20:25,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 408 proven. 64 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2019-09-10 02:20:25,835 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:20:26,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 408 proven. 64 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2019-09-10 02:20:26,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:20:26,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 11, 14] total 48 [2019-09-10 02:20:26,578 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:20:26,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-10 02:20:26,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-10 02:20:26,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=559, Invalid=1697, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 02:20:26,580 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand 36 states. [2019-09-10 02:20:36,228 WARN L188 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 40 DAG size of output: 12 [2019-09-10 02:20:50,442 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-10 02:21:00,996 WARN L188 SmtUtils]: Spent 5.58 s on a formula simplification. DAG size of input: 36 DAG size of output: 12 [2019-09-10 02:21:03,033 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967289) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967283) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967291) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967279) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967281) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967287) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967285) 4294967296) 10000000)) is different from false [2019-09-10 02:21:11,842 WARN L188 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-10 02:21:23,346 WARN L188 SmtUtils]: Spent 3.29 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-10 02:21:35,577 WARN L188 SmtUtils]: Spent 2.44 s on a formula simplification. DAG size of input: 36 DAG size of output: 12 [2019-09-10 02:21:45,534 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-10 02:22:01,389 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-10 02:22:35,048 WARN L188 SmtUtils]: Spent 4.47 s on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-10 02:22:35,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:22:35,051 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2019-09-10 02:22:35,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-10 02:22:35,051 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 74 [2019-09-10 02:22:35,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:22:35,052 INFO L225 Difference]: With dead ends: 91 [2019-09-10 02:22:35,052 INFO L226 Difference]: Without dead ends: 91 [2019-09-10 02:22:35,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 133 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 104.5s TimeCoverageRelationStatistics Valid=939, Invalid=2708, Unknown=17, NotChecked=118, Total=3782 [2019-09-10 02:22:35,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-10 02:22:35,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 83. [2019-09-10 02:22:35,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-10 02:22:35,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2019-09-10 02:22:35,057 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 74 [2019-09-10 02:22:35,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:22:35,057 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2019-09-10 02:22:35,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-10 02:22:35,057 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2019-09-10 02:22:35,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 02:22:35,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:22:35,058 INFO L399 BasicCegarLoop]: trace histogram [34, 25, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:22:35,059 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:22:35,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:22:35,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1804529344, now seen corresponding path program 24 times [2019-09-10 02:22:35,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:22:35,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:22:35,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:22:35,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:22:35,060 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:22:35,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:22:35,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 442 proven. 650 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-10 02:22:35,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:22:35,634 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:22:35,634 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:22:35,634 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:22:35,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:22:35,634 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:22:35,644 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:22:35,645 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:22:35,679 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:22:35,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:22:35,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-10 02:22:35,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:22:35,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 442 proven. 650 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-10 02:22:35,752 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:22:41,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 442 proven. 648 refuted. 2 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-10 02:22:41,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:22:41,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 29] total 56 [2019-09-10 02:22:41,166 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:22:41,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-10 02:22:41,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-10 02:22:41,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=865, Invalid=2214, Unknown=1, NotChecked=0, Total=3080 [2019-09-10 02:22:41,167 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 29 states. [2019-09-10 02:22:42,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:22:42,275 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2019-09-10 02:22:42,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 02:22:42,275 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 78 [2019-09-10 02:22:42,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:22:42,276 INFO L225 Difference]: With dead ends: 85 [2019-09-10 02:22:42,276 INFO L226 Difference]: Without dead ends: 85 [2019-09-10 02:22:42,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 127 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=865, Invalid=2214, Unknown=1, NotChecked=0, Total=3080 [2019-09-10 02:22:42,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-09-10 02:22:42,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-09-10 02:22:42,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-10 02:22:42,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2019-09-10 02:22:42,280 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 78 [2019-09-10 02:22:42,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:22:42,280 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2019-09-10 02:22:42,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-10 02:22:42,280 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2019-09-10 02:22:42,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 02:22:42,280 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:22:42,281 INFO L399 BasicCegarLoop]: trace histogram [35, 26, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:22:42,281 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:22:42,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:22:42,281 INFO L82 PathProgramCache]: Analyzing trace with hash -2014275459, now seen corresponding path program 25 times [2019-09-10 02:22:42,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:22:42,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:22:42,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:22:42,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:22:42,282 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:22:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:22:43,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 459 proven. 702 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-10 02:22:43,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:22:43,152 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:22:43,152 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:22:43,153 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:22:43,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:22:43,153 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:22:43,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:22:43,183 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:22:43,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:22:43,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-10 02:22:43,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:22:43,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 459 proven. 702 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-10 02:22:43,341 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:22:49,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 459 proven. 700 refuted. 2 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-10 02:22:49,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:22:49,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 30] total 58 [2019-09-10 02:22:49,337 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:22:49,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-10 02:22:49,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-10 02:22:49,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=925, Invalid=2380, Unknown=1, NotChecked=0, Total=3306 [2019-09-10 02:22:49,338 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 30 states. [2019-09-10 02:22:50,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:22:50,565 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2019-09-10 02:22:50,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 02:22:50,566 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 80 [2019-09-10 02:22:50,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:22:50,567 INFO L225 Difference]: With dead ends: 87 [2019-09-10 02:22:50,567 INFO L226 Difference]: Without dead ends: 87 [2019-09-10 02:22:50,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 130 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=925, Invalid=2380, Unknown=1, NotChecked=0, Total=3306 [2019-09-10 02:22:50,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-09-10 02:22:50,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-09-10 02:22:50,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-10 02:22:50,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2019-09-10 02:22:50,572 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 80 [2019-09-10 02:22:50,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:22:50,572 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2019-09-10 02:22:50,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-10 02:22:50,572 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2019-09-10 02:22:50,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 02:22:50,573 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:22:50,573 INFO L399 BasicCegarLoop]: trace histogram [36, 27, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:22:50,573 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:22:50,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:22:50,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1716829062, now seen corresponding path program 26 times [2019-09-10 02:22:50,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:22:50,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:22:50,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:22:50,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:22:50,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:22:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:22:51,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 476 proven. 756 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-10 02:22:51,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:22:51,111 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:22:51,112 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:22:51,112 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:22:51,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:22:51,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:22:51,121 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:22:51,122 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:23:47,734 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-09-10 02:23:47,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:23:47,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-10 02:23:47,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:24:04,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 513 proven. 74 refuted. 7 times theorem prover too weak. 702 trivial. 0 not checked. [2019-09-10 02:24:04,016 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:24:18,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 513 proven. 80 refuted. 1 times theorem prover too weak. 702 trivial. 0 not checked. [2019-09-10 02:24:18,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:24:18,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 12, 16] total 54 [2019-09-10 02:24:18,727 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:24:18,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-10 02:24:18,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-10 02:24:18,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=667, Invalid=2186, Unknown=9, NotChecked=0, Total=2862 [2019-09-10 02:24:18,730 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 40 states. [2019-09-10 02:24:29,200 WARN L188 SmtUtils]: Spent 4.36 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-10 02:24:40,625 WARN L188 SmtUtils]: Spent 3.05 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-10 02:25:01,507 WARN L188 SmtUtils]: Spent 4.84 s on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-10 02:25:13,464 WARN L188 SmtUtils]: Spent 3.43 s on a formula simplification. DAG size of input: 36 DAG size of output: 12 [2019-09-10 02:25:28,817 WARN L188 SmtUtils]: Spent 775.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 12 [2019-09-10 02:26:04,719 WARN L188 SmtUtils]: Spent 13.32 s on a formula simplification. DAG size of input: 44 DAG size of output: 12 [2019-09-10 02:26:28,038 WARN L188 SmtUtils]: Spent 3.03 s on a formula simplification. DAG size of input: 36 DAG size of output: 12 [2019-09-10 02:26:34,453 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967279) 4294967296) 10000000) (<= 10000000 (mod (+ c_main_~x~0 4294967288) 4294967296)) (<= 10000000 (mod (+ c_main_~x~0 4294967290) 4294967296)) (< (mod (+ c_main_~x~0 4294967277) 4294967296) 10000000) (< (mod (+ c_main_~x~0 4294967281) 4294967296) 10000000) (<= 10000000 (mod (+ c_main_~x~0 4294967286) 4294967296))) is different from false [2019-09-10 02:27:09,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:27:09,744 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2019-09-10 02:27:09,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-10 02:27:09,759 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 82 [2019-09-10 02:27:09,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:27:09,760 INFO L225 Difference]: With dead ends: 94 [2019-09-10 02:27:09,760 INFO L226 Difference]: Without dead ends: 94 [2019-09-10 02:27:09,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 146 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 168.8s TimeCoverageRelationStatistics Valid=882, Invalid=3129, Unknown=25, NotChecked=124, Total=4160 [2019-09-10 02:27:09,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-10 02:27:09,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2019-09-10 02:27:09,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-10 02:27:09,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2019-09-10 02:27:09,763 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 82 [2019-09-10 02:27:09,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:27:09,764 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2019-09-10 02:27:09,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-10 02:27:09,764 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2019-09-10 02:27:09,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 02:27:09,765 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:27:09,765 INFO L399 BasicCegarLoop]: trace histogram [38, 28, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:27:09,765 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:27:09,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:27:09,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1002989682, now seen corresponding path program 27 times [2019-09-10 02:27:09,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:27:09,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:27:09,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:27:09,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:27:09,767 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:27:09,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:27:10,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 551 proven. 812 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-10 02:27:10,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:27:10,353 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:27:10,353 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:27:10,354 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:27:10,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:27:10,354 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:27:10,364 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:27:10,364 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:27:10,395 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:27:10,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:27:10,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-10 02:27:10,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:27:10,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 551 proven. 812 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-10 02:27:10,474 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:27:16,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 551 proven. 812 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-10 02:27:16,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:27:16,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 32] total 62 [2019-09-10 02:27:16,273 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:27:16,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-10 02:27:16,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-10 02:27:16,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1051, Invalid=2731, Unknown=0, NotChecked=0, Total=3782 [2019-09-10 02:27:16,274 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand 32 states. [2019-09-10 02:27:17,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:27:17,679 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2019-09-10 02:27:17,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 02:27:17,680 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 86 [2019-09-10 02:27:17,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:27:17,681 INFO L225 Difference]: With dead ends: 93 [2019-09-10 02:27:17,681 INFO L226 Difference]: Without dead ends: 93 [2019-09-10 02:27:17,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 140 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1051, Invalid=2731, Unknown=0, NotChecked=0, Total=3782 [2019-09-10 02:27:17,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-10 02:27:17,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-09-10 02:27:17,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-09-10 02:27:17,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2019-09-10 02:27:17,685 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 86 [2019-09-10 02:27:17,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:27:17,686 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2019-09-10 02:27:17,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-10 02:27:17,686 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2019-09-10 02:27:17,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 02:27:17,687 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:27:17,687 INFO L399 BasicCegarLoop]: trace histogram [39, 29, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:27:17,687 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:27:17,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:27:17,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1424006481, now seen corresponding path program 28 times [2019-09-10 02:27:17,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:27:17,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:27:17,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:27:17,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:27:17,688 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:27:17,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:27:18,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 570 proven. 870 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-10 02:27:18,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:27:18,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:27:18,303 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:27:18,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:27:18,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:27:18,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10 02:27:18,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:27:18,314 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:27:18,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:27:18,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-10 02:27:18,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:27:18,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 570 proven. 870 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-10 02:27:18,424 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:27:27,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 570 proven. 868 refuted. 2 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-10 02:27:27,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:27:27,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 33] total 64 [2019-09-10 02:27:27,256 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:27:27,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-10 02:27:27,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-10 02:27:27,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1117, Invalid=2914, Unknown=1, NotChecked=0, Total=4032 [2019-09-10 02:27:27,257 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand 33 states. [2019-09-10 02:27:28,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:27:28,743 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2019-09-10 02:27:28,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 02:27:28,743 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 88 [2019-09-10 02:27:28,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:27:28,745 INFO L225 Difference]: With dead ends: 95 [2019-09-10 02:27:28,745 INFO L226 Difference]: Without dead ends: 95 [2019-09-10 02:27:28,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 143 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=1117, Invalid=2914, Unknown=1, NotChecked=0, Total=4032 [2019-09-10 02:27:28,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-09-10 02:27:28,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-09-10 02:27:28,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-10 02:27:28,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2019-09-10 02:27:28,749 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 88 [2019-09-10 02:27:28,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:27:28,750 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2019-09-10 02:27:28,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-10 02:27:28,750 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2019-09-10 02:27:28,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 02:27:28,750 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:27:28,750 INFO L399 BasicCegarLoop]: trace histogram [40, 30, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:27:28,751 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:27:28,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:27:28,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1600077396, now seen corresponding path program 29 times [2019-09-10 02:27:28,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:27:28,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:27:28,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:27:28,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:27:28,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:27:28,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:27:29,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 589 proven. 930 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-10 02:27:29,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:27:29,380 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:27:29,380 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:27:29,380 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:27:29,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:27:29,380 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:27:29,392 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:27:29,392 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:29:00,790 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-09-10 02:29:00,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat