java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-acceleration/phases_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 01:53:01,984 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 01:53:01,986 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 01:53:01,998 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 01:53:01,999 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 01:53:02,000 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 01:53:02,001 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 01:53:02,003 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 01:53:02,004 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 01:53:02,005 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 01:53:02,006 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 01:53:02,007 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 01:53:02,007 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 01:53:02,008 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 01:53:02,009 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 01:53:02,010 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 01:53:02,011 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 01:53:02,012 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 01:53:02,014 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 01:53:02,016 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 01:53:02,017 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 01:53:02,018 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 01:53:02,019 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 01:53:02,020 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 01:53:02,022 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 01:53:02,022 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 01:53:02,022 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 01:53:02,023 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 01:53:02,024 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 01:53:02,025 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 01:53:02,025 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 01:53:02,026 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 01:53:02,026 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 01:53:02,027 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 01:53:02,028 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 01:53:02,028 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 01:53:02,029 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 01:53:02,029 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 01:53:02,029 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 01:53:02,030 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 01:53:02,031 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 01:53:02,032 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 01:53:02,057 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 01:53:02,058 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 01:53:02,058 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 01:53:02,058 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 01:53:02,059 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 01:53:02,059 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 01:53:02,060 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 01:53:02,060 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 01:53:02,060 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 01:53:02,062 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 01:53:02,062 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 01:53:02,063 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 01:53:02,063 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 01:53:02,064 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 01:53:02,064 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 01:53:02,064 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 01:53:02,065 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 01:53:02,065 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 01:53:02,065 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 01:53:02,065 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 01:53:02,065 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 01:53:02,066 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 01:53:02,066 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 01:53:02,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 01:53:02,066 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 01:53:02,066 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 01:53:02,067 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 01:53:02,067 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 01:53:02,067 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 01:53:02,067 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 01:53:02,121 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 01:53:02,133 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 01:53:02,137 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 01:53:02,138 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 01:53:02,139 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 01:53:02,139 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/phases_1-2.c [2019-09-10 01:53:02,203 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc3c53551/edcb334398e54528b04a0888f09c8216/FLAG359f9220b [2019-09-10 01:53:02,640 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 01:53:02,641 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/phases_1-2.c [2019-09-10 01:53:02,646 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc3c53551/edcb334398e54528b04a0888f09c8216/FLAG359f9220b [2019-09-10 01:53:03,017 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc3c53551/edcb334398e54528b04a0888f09c8216 [2019-09-10 01:53:03,026 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 01:53:03,028 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 01:53:03,029 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 01:53:03,029 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 01:53:03,032 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 01:53:03,033 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:53:03" (1/1) ... [2019-09-10 01:53:03,036 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a2389e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:53:03, skipping insertion in model container [2019-09-10 01:53:03,036 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:53:03" (1/1) ... [2019-09-10 01:53:03,043 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 01:53:03,059 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 01:53:03,273 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:53:03,285 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 01:53:03,308 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:53:03,325 INFO L192 MainTranslator]: Completed translation [2019-09-10 01:53:03,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:53:03 WrapperNode [2019-09-10 01:53:03,326 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 01:53:03,326 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 01:53:03,327 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 01:53:03,327 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 01:53:03,484 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:53:03" (1/1) ... [2019-09-10 01:53:03,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:53:03" (1/1) ... [2019-09-10 01:53:03,493 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:53:03" (1/1) ... [2019-09-10 01:53:03,493 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:53:03" (1/1) ... [2019-09-10 01:53:03,498 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:53:03" (1/1) ... [2019-09-10 01:53:03,503 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:53:03" (1/1) ... [2019-09-10 01:53:03,504 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:53:03" (1/1) ... [2019-09-10 01:53:03,511 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 01:53:03,511 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 01:53:03,511 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 01:53:03,511 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 01:53:03,512 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:53:03" (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 01:53:03,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 01:53:03,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 01:53:03,559 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-10 01:53:03,560 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 01:53:03,560 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 01:53:03,560 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 01:53:03,560 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 01:53:03,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 01:53:03,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 01:53:03,721 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 01:53:03,722 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 01:53:03,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:53:03 BoogieIcfgContainer [2019-09-10 01:53:03,723 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 01:53:03,724 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 01:53:03,724 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 01:53:03,727 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 01:53:03,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 01:53:03" (1/3) ... [2019-09-10 01:53:03,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a2ed101 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:53:03, skipping insertion in model container [2019-09-10 01:53:03,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:53:03" (2/3) ... [2019-09-10 01:53:03,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a2ed101 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:53:03, skipping insertion in model container [2019-09-10 01:53:03,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:53:03" (3/3) ... [2019-09-10 01:53:03,731 INFO L109 eAbstractionObserver]: Analyzing ICFG phases_1-2.c [2019-09-10 01:53:03,740 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 01:53:03,748 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 01:53:03,763 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 01:53:03,789 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 01:53:03,789 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 01:53:03,789 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 01:53:03,790 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 01:53:03,790 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 01:53:03,790 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 01:53:03,790 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 01:53:03,790 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 01:53:03,803 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-09-10 01:53:03,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-10 01:53:03,813 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:53:03,814 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:53:03,816 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:53:03,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:53:03,821 INFO L82 PathProgramCache]: Analyzing trace with hash -721501374, now seen corresponding path program 1 times [2019-09-10 01:53:03,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:53:03,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:03,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:53:03,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:03,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:53:03,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:03,933 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 01:53:03,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:53:03,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-10 01:53:03,936 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:53:03,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 01:53:03,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 01:53:03,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 01:53:03,955 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-09-10 01:53:03,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:53:03,968 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2019-09-10 01:53:03,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 01:53:03,969 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-10 01:53:03,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:53:03,976 INFO L225 Difference]: With dead ends: 18 [2019-09-10 01:53:03,976 INFO L226 Difference]: Without dead ends: 12 [2019-09-10 01:53:03,977 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 01:53:03,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-10 01:53:04,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-10 01:53:04,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-10 01:53:04,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-09-10 01:53:04,007 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2019-09-10 01:53:04,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:53:04,007 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-09-10 01:53:04,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 01:53:04,007 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-09-10 01:53:04,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-10 01:53:04,008 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:53:04,008 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:53:04,009 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:53:04,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:53:04,009 INFO L82 PathProgramCache]: Analyzing trace with hash -730736584, now seen corresponding path program 1 times [2019-09-10 01:53:04,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:53:04,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:04,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:53:04,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:04,013 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:53:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:04,152 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 01:53:04,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:53:04,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 01:53:04,154 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:53:04,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 01:53:04,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 01:53:04,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:53:04,168 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 3 states. [2019-09-10 01:53:04,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:53:04,223 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-09-10 01:53:04,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 01:53:04,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-10 01:53:04,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:53:04,225 INFO L225 Difference]: With dead ends: 14 [2019-09-10 01:53:04,225 INFO L226 Difference]: Without dead ends: 14 [2019-09-10 01:53:04,226 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 01:53:04,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-10 01:53:04,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-09-10 01:53:04,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-10 01:53:04,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-09-10 01:53:04,234 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2019-09-10 01:53:04,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:53:04,235 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-09-10 01:53:04,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 01:53:04,240 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-09-10 01:53:04,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-10 01:53:04,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:53:04,241 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:53:04,241 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:53:04,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:53:04,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1082855947, now seen corresponding path program 1 times [2019-09-10 01:53:04,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:53:04,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:04,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:53:04,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:04,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:53:04,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:04,353 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 01:53:04,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:04,354 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:53:04,355 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 13 with the following transitions: [2019-09-10 01:53:04,357 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [16], [25], [28], [30], [36], [37], [38], [40] [2019-09-10 01:53:04,396 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 01:53:04,396 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 01:53:04,456 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 01:53:05,023 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 01:53:05,025 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 13. Performed 88 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 2 variables. [2019-09-10 01:53:05,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:53:05,030 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 01:53:05,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:05,031 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:53:05,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:53:05,057 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:53:05,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:05,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-10 01:53:05,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:53:05,153 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 01:53:05,158 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:53:05,199 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 01:53:05,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:53:05,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-09-10 01:53:05,208 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:53:05,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 01:53:05,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 01:53:05,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 01:53:05,210 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2019-09-10 01:53:05,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:53:05,254 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2019-09-10 01:53:05,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 01:53:05,256 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-09-10 01:53:05,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:53:05,257 INFO L225 Difference]: With dead ends: 16 [2019-09-10 01:53:05,257 INFO L226 Difference]: Without dead ends: 16 [2019-09-10 01:53:05,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 01:53:05,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-10 01:53:05,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-10 01:53:05,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-10 01:53:05,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-09-10 01:53:05,263 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2019-09-10 01:53:05,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:53:05,264 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-09-10 01:53:05,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 01:53:05,265 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-09-10 01:53:05,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-10 01:53:05,265 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:53:05,266 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:53:05,266 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:53:05,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:53:05,267 INFO L82 PathProgramCache]: Analyzing trace with hash -167147406, now seen corresponding path program 2 times [2019-09-10 01:53:05,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:53:05,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:05,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:53:05,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:05,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:53:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:05,390 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 01:53:05,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:05,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:53:05,391 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:53:05,392 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:53:05,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:05,392 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:53:05,415 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:53:05,415 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:53:05,426 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-10 01:53:05,426 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:53:05,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 01:53:05,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:53:05,444 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 01:53:05,444 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:53:05,466 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 01:53:05,470 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 01:53:05,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-09-10 01:53:05,470 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:53:05,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 01:53:05,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 01:53:05,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 01:53:05,472 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 3 states. [2019-09-10 01:53:05,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:53:05,492 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-09-10 01:53:05,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 01:53:05,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-09-10 01:53:05,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:53:05,494 INFO L225 Difference]: With dead ends: 18 [2019-09-10 01:53:05,494 INFO L226 Difference]: Without dead ends: 18 [2019-09-10 01:53:05,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 01:53:05,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-10 01:53:05,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-09-10 01:53:05,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-10 01:53:05,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-09-10 01:53:05,498 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-09-10 01:53:05,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:53:05,499 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-09-10 01:53:05,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 01:53:05,499 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-09-10 01:53:05,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-10 01:53:05,500 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:53:05,500 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:53:05,500 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:53:05,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:53:05,501 INFO L82 PathProgramCache]: Analyzing trace with hash -582276883, now seen corresponding path program 1 times [2019-09-10 01:53:05,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:53:05,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:05,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:53:05,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:05,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:53:05,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:05,615 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 01:53:05,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:05,616 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:53:05,616 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2019-09-10 01:53:05,617 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [16], [18], [25], [28], [30], [36], [37], [38], [40] [2019-09-10 01:53:05,618 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 01:53:05,619 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 01:53:05,621 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 01:53:05,860 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 01:53:05,860 INFO L272 AbstractInterpreter]: Visited 13 different actions 61 times. Merged at 4 different actions 18 times. Widened at 2 different actions 4 times. Performed 104 root evaluator evaluations with a maximum evaluation depth of 13. Performed 104 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 8 fixpoints after 2 different actions. Largest state had 2 variables. [2019-09-10 01:53:05,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:53:05,861 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 01:53:05,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:05,861 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:53:05,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:53:05,890 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:53:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:05,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 01:53:05,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:53:05,947 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 01:53:05,948 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:53:06,042 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 01:53:06,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:53:06,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 10 [2019-09-10 01:53:06,047 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:53:06,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 01:53:06,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 01:53:06,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-09-10 01:53:06,049 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 6 states. [2019-09-10 01:53:06,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:53:06,090 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-09-10 01:53:06,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 01:53:06,091 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-09-10 01:53:06,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:53:06,091 INFO L225 Difference]: With dead ends: 19 [2019-09-10 01:53:06,092 INFO L226 Difference]: Without dead ends: 19 [2019-09-10 01:53:06,092 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 01:53:06,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-10 01:53:06,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-10 01:53:06,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-10 01:53:06,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-09-10 01:53:06,096 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-09-10 01:53:06,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:53:06,096 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-09-10 01:53:06,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 01:53:06,096 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-09-10 01:53:06,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-10 01:53:06,097 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:53:06,097 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:53:06,097 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:53:06,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:53:06,098 INFO L82 PathProgramCache]: Analyzing trace with hash 719600874, now seen corresponding path program 2 times [2019-09-10 01:53:06,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:53:06,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:06,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:53:06,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:06,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:53:06,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:06,198 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 01:53:06,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:06,198 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:53:06,198 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:53:06,199 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:53:06,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:06,199 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:53:06,213 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:53:06,214 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:53:06,225 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-10 01:53:06,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:53:06,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 01:53:06,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:53:06,264 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 01:53:06,264 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:53:06,313 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 01:53:06,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:53:06,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 10 [2019-09-10 01:53:06,317 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:53:06,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 01:53:06,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 01:53:06,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-09-10 01:53:06,319 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 8 states. [2019-09-10 01:53:08,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:53:08,521 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2019-09-10 01:53:08,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 01:53:08,525 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-09-10 01:53:08,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:53:08,527 INFO L225 Difference]: With dead ends: 26 [2019-09-10 01:53:08,527 INFO L226 Difference]: Without dead ends: 26 [2019-09-10 01:53:08,528 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-09-10 01:53:08,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-10 01:53:08,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2019-09-10 01:53:08,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-10 01:53:08,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-09-10 01:53:08,533 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 18 [2019-09-10 01:53:08,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:53:08,533 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-09-10 01:53:08,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 01:53:08,533 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-09-10 01:53:08,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-10 01:53:08,534 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:53:08,534 INFO L399 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:53:08,534 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:53:08,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:53:08,534 INFO L82 PathProgramCache]: Analyzing trace with hash 957312226, now seen corresponding path program 3 times [2019-09-10 01:53:08,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:53:08,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:08,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:53:08,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:08,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:53:08,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:08,662 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 01:53:08,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:08,663 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:53:08,663 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:53:08,663 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:53:08,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:08,663 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 01:53:08,679 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:53:08,680 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:53:08,696 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:53:08,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:53:08,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-10 01:53:08,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:53:08,734 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 01:53:08,735 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:53:08,895 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 01:53:08,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:53:08,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 14 [2019-09-10 01:53:08,899 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:53:08,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 01:53:08,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 01:53:08,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-09-10 01:53:08,900 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 8 states. [2019-09-10 01:53:08,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:53:08,974 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2019-09-10 01:53:08,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 01:53:08,975 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-09-10 01:53:08,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:53:08,976 INFO L225 Difference]: With dead ends: 25 [2019-09-10 01:53:08,976 INFO L226 Difference]: Without dead ends: 25 [2019-09-10 01:53:08,977 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 01:53:08,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-10 01:53:08,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-09-10 01:53:08,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-10 01:53:08,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-09-10 01:53:08,985 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 22 [2019-09-10 01:53:08,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:53:08,985 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-09-10 01:53:08,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 01:53:08,986 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-09-10 01:53:08,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-10 01:53:08,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:53:08,992 INFO L399 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:53:08,993 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:53:08,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:53:08,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1915302113, now seen corresponding path program 4 times [2019-09-10 01:53:08,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:53:08,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:08,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:53:08,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:08,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:53:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:09,168 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 01:53:09,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:09,169 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:53:09,169 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:53:09,169 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:53:09,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:09,170 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:53:09,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:53:09,194 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:53:09,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:09,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 01:53:09,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:53:09,276 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 01:53:09,277 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:53:09,507 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 01:53:09,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:53:09,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 16 [2019-09-10 01:53:09,511 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:53:09,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 01:53:09,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 01:53:09,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-09-10 01:53:09,513 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 9 states. [2019-09-10 01:53:09,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:53:09,634 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2019-09-10 01:53:09,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 01:53:09,637 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-09-10 01:53:09,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:53:09,637 INFO L225 Difference]: With dead ends: 27 [2019-09-10 01:53:09,637 INFO L226 Difference]: Without dead ends: 27 [2019-09-10 01:53:09,638 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-09-10 01:53:09,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-10 01:53:09,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-10 01:53:09,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-10 01:53:09,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-09-10 01:53:09,644 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2019-09-10 01:53:09,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:53:09,645 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-09-10 01:53:09,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 01:53:09,645 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-09-10 01:53:09,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-10 01:53:09,646 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:53:09,646 INFO L399 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:53:09,647 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:53:09,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:53:09,648 INFO L82 PathProgramCache]: Analyzing trace with hash -833710564, now seen corresponding path program 5 times [2019-09-10 01:53:09,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:53:09,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:09,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:53:09,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:09,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:53:09,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:09,830 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 01:53:09,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:09,830 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:53:09,830 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:53:09,831 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:53:09,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:09,831 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:53:09,856 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:53:09,856 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:53:09,884 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-10 01:53:09,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:53:09,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 01:53:09,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:53:09,939 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 01:53:09,940 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:53:10,021 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 01:53:10,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:53:10,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 15 [2019-09-10 01:53:10,026 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:53:10,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 01:53:10,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 01:53:10,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-09-10 01:53:10,030 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 12 states. [2019-09-10 01:53:12,515 WARN L188 SmtUtils]: Spent 2.30 s on a formula simplification that was a NOOP. DAG size: 16 [2019-09-10 01:53:19,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:53:19,272 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2019-09-10 01:53:19,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 01:53:19,272 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-09-10 01:53:19,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:53:19,274 INFO L225 Difference]: With dead ends: 39 [2019-09-10 01:53:19,274 INFO L226 Difference]: Without dead ends: 39 [2019-09-10 01:53:19,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=127, Invalid=252, Unknown=1, NotChecked=0, Total=380 [2019-09-10 01:53:19,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-10 01:53:19,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2019-09-10 01:53:19,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-10 01:53:19,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-09-10 01:53:19,279 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 26 [2019-09-10 01:53:19,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:53:19,279 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-09-10 01:53:19,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 01:53:19,279 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-09-10 01:53:19,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-10 01:53:19,280 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:53:19,280 INFO L399 BasicCegarLoop]: trace histogram [10, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:53:19,280 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:53:19,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:53:19,281 INFO L82 PathProgramCache]: Analyzing trace with hash -644516716, now seen corresponding path program 6 times [2019-09-10 01:53:19,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:53:19,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:19,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:53:19,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:19,282 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:53:19,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:19,443 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 01:53:19,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:19,444 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:53:19,444 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:53:19,444 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:53:19,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:19,444 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 01:53:19,463 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:53:19,463 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:53:19,478 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:53:19,478 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:53:19,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-10 01:53:19,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:53:19,529 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 01:53:19,529 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:53:19,842 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 01:53:19,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:53:19,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 20 [2019-09-10 01:53:19,846 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:53:19,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 01:53:19,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 01:53:19,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2019-09-10 01:53:19,848 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 11 states. [2019-09-10 01:53:20,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:53:20,003 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2019-09-10 01:53:20,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 01:53:20,003 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2019-09-10 01:53:20,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:53:20,004 INFO L225 Difference]: With dead ends: 33 [2019-09-10 01:53:20,004 INFO L226 Difference]: Without dead ends: 33 [2019-09-10 01:53:20,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2019-09-10 01:53:20,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-10 01:53:20,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-10 01:53:20,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-10 01:53:20,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2019-09-10 01:53:20,009 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 30 [2019-09-10 01:53:20,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:53:20,009 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2019-09-10 01:53:20,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 01:53:20,009 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2019-09-10 01:53:20,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-10 01:53:20,010 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:53:20,010 INFO L399 BasicCegarLoop]: trace histogram [11, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:53:20,010 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:53:20,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:53:20,011 INFO L82 PathProgramCache]: Analyzing trace with hash -30848559, now seen corresponding path program 7 times [2019-09-10 01:53:20,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:53:20,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:20,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:53:20,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:20,012 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:53:20,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:20,198 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 01:53:20,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:20,199 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:53:20,199 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:53:20,199 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:53:20,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:20,200 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 01:53:20,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:53:20,210 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:53:20,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:20,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-10 01:53:20,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:53:20,284 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 01:53:20,285 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:53:20,922 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 01:53:20,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:53:20,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 22 [2019-09-10 01:53:20,926 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:53:20,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 01:53:20,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 01:53:20,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2019-09-10 01:53:20,928 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 12 states. [2019-09-10 01:53:21,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:53:21,133 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2019-09-10 01:53:21,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 01:53:21,134 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2019-09-10 01:53:21,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:53:21,135 INFO L225 Difference]: With dead ends: 35 [2019-09-10 01:53:21,135 INFO L226 Difference]: Without dead ends: 35 [2019-09-10 01:53:21,136 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 01:53:21,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-10 01:53:21,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-09-10 01:53:21,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-10 01:53:21,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2019-09-10 01:53:21,141 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 32 [2019-09-10 01:53:21,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:53:21,142 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-09-10 01:53:21,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 01:53:21,142 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2019-09-10 01:53:21,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-10 01:53:21,143 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:53:21,143 INFO L399 BasicCegarLoop]: trace histogram [12, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:53:21,143 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:53:21,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:53:21,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1293730766, now seen corresponding path program 8 times [2019-09-10 01:53:21,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:53:21,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:21,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:53:21,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:21,145 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:53:21,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:21,316 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 01:53:21,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:21,316 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:53:21,317 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:53:21,317 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:53:21,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:21,317 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:53:21,328 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:53:21,328 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:53:21,371 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-10 01:53:21,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:53:21,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-10 01:53:21,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:53:21,456 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 01:53:21,456 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:53:21,573 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 01:53:21,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:53:21,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 20 [2019-09-10 01:53:21,580 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:53:21,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 01:53:21,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 01:53:21,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-09-10 01:53:21,582 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 16 states. [2019-09-10 01:53:33,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:53:33,589 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2019-09-10 01:53:33,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 01:53:33,589 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2019-09-10 01:53:33,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:53:33,590 INFO L225 Difference]: With dead ends: 46 [2019-09-10 01:53:33,590 INFO L226 Difference]: Without dead ends: 46 [2019-09-10 01:53:33,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=205, Invalid=445, Unknown=0, NotChecked=0, Total=650 [2019-09-10 01:53:33,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-10 01:53:33,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2019-09-10 01:53:33,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-10 01:53:33,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-09-10 01:53:33,595 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 34 [2019-09-10 01:53:33,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:53:33,595 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-09-10 01:53:33,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 01:53:33,595 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-09-10 01:53:33,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-10 01:53:33,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:53:33,596 INFO L399 BasicCegarLoop]: trace histogram [14, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:53:33,597 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:53:33,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:53:33,597 INFO L82 PathProgramCache]: Analyzing trace with hash 284766406, now seen corresponding path program 9 times [2019-09-10 01:53:33,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:53:33,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:33,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:53:33,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:33,598 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:53:33,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:33,803 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 01:53:33,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:33,804 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:53:33,804 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:53:33,804 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:53:33,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:33,804 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 01:53:33,815 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:53:33,815 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:53:33,830 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:53:33,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:53:33,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 01:53:33,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:53:33,887 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 01:53:33,887 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:53:34,416 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 01:53:34,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:53:34,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 26 [2019-09-10 01:53:34,420 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:53:34,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 01:53:34,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 01:53:34,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=445, Unknown=0, NotChecked=0, Total=650 [2019-09-10 01:53:34,421 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 14 states. [2019-09-10 01:53:34,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:53:34,690 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2019-09-10 01:53:34,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 01:53:34,690 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2019-09-10 01:53:34,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:53:34,691 INFO L225 Difference]: With dead ends: 41 [2019-09-10 01:53:34,691 INFO L226 Difference]: Without dead ends: 41 [2019-09-10 01:53:34,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=205, Invalid=445, Unknown=0, NotChecked=0, Total=650 [2019-09-10 01:53:34,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-10 01:53:34,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-09-10 01:53:34,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-10 01:53:34,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-09-10 01:53:34,696 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 38 [2019-09-10 01:53:34,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:53:34,696 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-09-10 01:53:34,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 01:53:34,696 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-09-10 01:53:34,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-10 01:53:34,697 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:53:34,697 INFO L399 BasicCegarLoop]: trace histogram [15, 11, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:53:34,698 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:53:34,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:53:34,698 INFO L82 PathProgramCache]: Analyzing trace with hash 926316803, now seen corresponding path program 10 times [2019-09-10 01:53:34,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:53:34,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:34,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:53:34,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:34,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:53:34,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:34,943 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 01:53:34,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:34,943 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:53:34,943 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:53:34,943 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:53:34,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:34,944 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:53:34,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:53:34,970 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:53:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:34,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-10 01:53:34,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:53:35,039 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 01:53:35,040 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:53:35,876 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 01:53:35,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:53:35,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 28 [2019-09-10 01:53:35,880 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:53:35,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 01:53:35,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 01:53:35,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=521, Unknown=0, NotChecked=0, Total=756 [2019-09-10 01:53:35,882 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 15 states. [2019-09-10 01:53:36,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:53:36,233 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-09-10 01:53:36,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 01:53:36,240 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2019-09-10 01:53:36,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:53:36,241 INFO L225 Difference]: With dead ends: 43 [2019-09-10 01:53:36,241 INFO L226 Difference]: Without dead ends: 43 [2019-09-10 01:53:36,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=235, Invalid=521, Unknown=0, NotChecked=0, Total=756 [2019-09-10 01:53:36,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-10 01:53:36,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-09-10 01:53:36,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-10 01:53:36,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-09-10 01:53:36,245 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 40 [2019-09-10 01:53:36,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:53:36,246 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-09-10 01:53:36,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 01:53:36,246 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-09-10 01:53:36,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-10 01:53:36,246 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:53:36,247 INFO L399 BasicCegarLoop]: trace histogram [16, 12, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:53:36,247 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:53:36,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:53:36,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1019042304, now seen corresponding path program 11 times [2019-09-10 01:53:36,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:53:36,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:36,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:53:36,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:36,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:53:36,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:36,479 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 01:53:36,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:36,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:53:36,479 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:53:36,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:53:36,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:36,480 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 01:53:36,491 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:53:36,491 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:54:01,940 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-10 01:54:01,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:54:02,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-10 01:54:02,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:54:02,468 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 01:54:02,468 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:54:02,624 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 01:54:02,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:54:02,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7, 7] total 25 [2019-09-10 01:54:02,632 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:54:02,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 01:54:02,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 01:54:02,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=416, Unknown=0, NotChecked=0, Total=600 [2019-09-10 01:54:02,633 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 20 states. [2019-09-10 01:54:05,769 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-10 01:54:30,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:54:30,854 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2019-09-10 01:54:30,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 01:54:30,854 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2019-09-10 01:54:30,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:54:30,855 INFO L225 Difference]: With dead ends: 52 [2019-09-10 01:54:30,855 INFO L226 Difference]: Without dead ends: 52 [2019-09-10 01:54:30,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 78 SyntacticMatches, 6 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=280, Invalid=647, Unknown=3, NotChecked=0, Total=930 [2019-09-10 01:54:30,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-10 01:54:30,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2019-09-10 01:54:30,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-10 01:54:30,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2019-09-10 01:54:30,860 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 42 [2019-09-10 01:54:30,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:54:30,860 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2019-09-10 01:54:30,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 01:54:30,861 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2019-09-10 01:54:30,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-10 01:54:30,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:54:30,861 INFO L399 BasicCegarLoop]: trace histogram [18, 13, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:54:30,862 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:54:30,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:54:30,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1622573432, now seen corresponding path program 12 times [2019-09-10 01:54:30,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:54:30,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:30,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:54:30,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:30,863 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:54:30,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:54:31,129 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 01:54:31,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:31,130 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:54:31,130 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:54:31,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:54:31,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:31,130 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:54:31,143 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:54:31,143 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:54:31,161 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:54:31,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:54:31,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-10 01:54:31,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:54:31,234 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 01:54:31,234 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:54:34,863 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 126 proven. 180 refuted. 2 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 01:54:34,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:54:34,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 17] total 32 [2019-09-10 01:54:34,867 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:54:34,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 01:54:34,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 01:54:34,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=690, Unknown=1, NotChecked=0, Total=992 [2019-09-10 01:54:34,869 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 17 states. [2019-09-10 01:54:35,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:54:35,280 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-09-10 01:54:35,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 01:54:35,280 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2019-09-10 01:54:35,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:54:35,282 INFO L225 Difference]: With dead ends: 49 [2019-09-10 01:54:35,282 INFO L226 Difference]: Without dead ends: 49 [2019-09-10 01:54:35,283 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=301, Invalid=690, Unknown=1, NotChecked=0, Total=992 [2019-09-10 01:54:35,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-10 01:54:35,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-09-10 01:54:35,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-10 01:54:35,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2019-09-10 01:54:35,287 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 46 [2019-09-10 01:54:35,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:54:35,288 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2019-09-10 01:54:35,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 01:54:35,288 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2019-09-10 01:54:35,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-10 01:54:35,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:54:35,289 INFO L399 BasicCegarLoop]: trace histogram [19, 14, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:54:35,289 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:54:35,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:54:35,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1921368907, now seen corresponding path program 13 times [2019-09-10 01:54:35,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:54:35,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:35,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:54:35,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:35,291 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:54:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:54:35,589 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 01:54:35,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:35,589 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:54:35,590 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:54:35,590 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:54:35,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:35,590 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 01:54:35,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:54:35,602 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:54:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:54:35,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-10 01:54:35,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:54:35,674 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 01:54:35,674 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:54:36,867 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 01:54:36,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:54:36,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 34 [2019-09-10 01:54:36,871 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:54:36,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 01:54:36,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 01:54:36,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=785, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 01:54:36,872 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 18 states. [2019-09-10 01:54:37,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:54:37,348 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2019-09-10 01:54:37,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 01:54:37,349 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2019-09-10 01:54:37,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:54:37,350 INFO L225 Difference]: With dead ends: 51 [2019-09-10 01:54:37,350 INFO L226 Difference]: Without dead ends: 51 [2019-09-10 01:54:37,351 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=337, Invalid=785, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 01:54:37,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-10 01:54:37,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-09-10 01:54:37,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-10 01:54:37,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2019-09-10 01:54:37,362 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 48 [2019-09-10 01:54:37,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:54:37,363 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2019-09-10 01:54:37,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 01:54:37,363 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2019-09-10 01:54:37,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-10 01:54:37,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:54:37,364 INFO L399 BasicCegarLoop]: trace histogram [20, 15, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:54:37,366 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:54:37,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:54:37,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1740890958, now seen corresponding path program 14 times [2019-09-10 01:54:37,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:54:37,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:37,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:54:37,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:37,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:54:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:54:37,702 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 01:54:37,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:37,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:54:37,702 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:54:37,702 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:54:37,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:37,702 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 01:54:37,714 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:54:37,714 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:55:53,265 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-10 01:55:53,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:55:53,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 01:55:53,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:55:53,562 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 01:55:53,563 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:55:53,780 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 01:55:53,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:55:53,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8, 8] total 30 [2019-09-10 01:55:53,788 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:55:53,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 01:55:53,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 01:55:53,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=612, Unknown=0, NotChecked=0, Total=870 [2019-09-10 01:55:53,789 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 24 states. [2019-09-10 01:56:07,340 WARN L188 SmtUtils]: Spent 5.31 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-10 01:56:17,712 WARN L188 SmtUtils]: Spent 3.58 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-10 01:56:26,051 WARN L188 SmtUtils]: Spent 4.27 s on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-10 01:56:36,968 WARN L188 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-10 01:56:42,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:56:42,989 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2019-09-10 01:56:42,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 01:56:42,989 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2019-09-10 01:56:42,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:56:42,990 INFO L225 Difference]: With dead ends: 59 [2019-09-10 01:56:42,990 INFO L226 Difference]: Without dead ends: 59 [2019-09-10 01:56:42,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 41.6s TimeCoverageRelationStatistics Valid=395, Invalid=935, Unknown=2, NotChecked=0, Total=1332 [2019-09-10 01:56:42,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-10 01:56:42,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2019-09-10 01:56:42,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-10 01:56:42,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2019-09-10 01:56:42,996 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 50 [2019-09-10 01:56:42,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:56:42,996 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2019-09-10 01:56:42,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 01:56:42,996 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2019-09-10 01:56:42,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-10 01:56:42,997 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:56:42,997 INFO L399 BasicCegarLoop]: trace histogram [22, 16, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:56:42,997 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:56:42,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:56:42,998 INFO L82 PathProgramCache]: Analyzing trace with hash -741259606, now seen corresponding path program 15 times [2019-09-10 01:56:42,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:56:42,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:56:42,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:56:42,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:56:43,000 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:56:43,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:56:43,373 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 01:56:43,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:56:43,374 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:56:43,374 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:56:43,374 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:56:43,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:56:43,374 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 01:56:43,385 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:56:43,386 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:56:43,407 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:56:43,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:56:43,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-10 01:56:43,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:56:43,485 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 01:56:43,486 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:56:45,819 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 01:56:45,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:56:45,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 20] total 38 [2019-09-10 01:56:45,823 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:56:45,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 01:56:45,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 01:56:45,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=415, Invalid=991, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 01:56:45,824 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 20 states. [2019-09-10 01:56:46,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:56:46,363 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2019-09-10 01:56:46,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 01:56:46,363 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 54 [2019-09-10 01:56:46,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:56:46,364 INFO L225 Difference]: With dead ends: 57 [2019-09-10 01:56:46,364 INFO L226 Difference]: Without dead ends: 57 [2019-09-10 01:56:46,366 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 88 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=415, Invalid=991, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 01:56:46,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-10 01:56:46,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-09-10 01:56:46,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-10 01:56:46,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2019-09-10 01:56:46,370 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 54 [2019-09-10 01:56:46,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:56:46,370 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2019-09-10 01:56:46,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 01:56:46,371 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2019-09-10 01:56:46,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 01:56:46,371 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:56:46,371 INFO L399 BasicCegarLoop]: trace histogram [23, 17, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:56:46,372 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:56:46,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:56:46,372 INFO L82 PathProgramCache]: Analyzing trace with hash -554142489, now seen corresponding path program 16 times [2019-09-10 01:56:46,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:56:46,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:56:46,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:56:46,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:56:46,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:56:46,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:56:46,826 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 01:56:46,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:56:46,827 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:56:46,827 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:56:46,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:56:46,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:56:46,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:56:46,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:56:46,856 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:56:46,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:56:46,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-10 01:56:46,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:56:46,983 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 01:56:46,983 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:56:50,063 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 01:56:50,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:56:50,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 21] total 40 [2019-09-10 01:56:50,069 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:56:50,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 01:56:50,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 01:56:50,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=1103, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 01:56:50,073 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 21 states. [2019-09-10 01:56:50,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:56:50,694 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2019-09-10 01:56:50,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 01:56:50,695 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 56 [2019-09-10 01:56:50,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:56:50,696 INFO L225 Difference]: With dead ends: 59 [2019-09-10 01:56:50,696 INFO L226 Difference]: Without dead ends: 59 [2019-09-10 01:56:50,697 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 91 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=457, Invalid=1103, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 01:56:50,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-10 01:56:50,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-09-10 01:56:50,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-10 01:56:50,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2019-09-10 01:56:50,706 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 56 [2019-09-10 01:56:50,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:56:50,706 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2019-09-10 01:56:50,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 01:56:50,706 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2019-09-10 01:56:50,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 01:56:50,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:56:50,706 INFO L399 BasicCegarLoop]: trace histogram [24, 18, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:56:50,707 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:56:50,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:56:50,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1123219484, now seen corresponding path program 17 times [2019-09-10 01:56:50,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:56:50,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:56:50,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:56:50,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:56:50,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:56:50,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:56:51,159 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 01:56:51,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:56:51,160 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:56:51,160 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:56:51,160 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:56:51,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:56:51,160 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 01:56:51,176 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:56:51,176 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:58:09,650 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-10 01:58:09,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:58:10,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 01:58:10,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:58:10,519 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 01:58:10,520 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:58:10,813 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 01:58:10,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:58:10,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 9, 9] total 35 [2019-09-10 01:58:10,821 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:58:10,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 01:58:10,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 01:58:10,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=846, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 01:58:10,824 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand 28 states. [2019-09-10 01:58:16,118 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-10 01:58:21,085 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-10 01:58:25,699 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967285) 4294967296) 65521) (< (mod (+ c_main_~x~0 4294967291) 4294967296) 65521) (< (mod (+ c_main_~x~0 4294967293) 4294967296) 65521) (< (mod (+ c_main_~x~0 4294967295) 4294967296) 65521) (< (mod (+ c_main_~x~0 4294967287) 4294967296) 65521) (< (mod (+ c_main_~x~0 4294967283) 4294967296) 65521)) is different from false [2019-09-10 01:58:28,463 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-10 01:59:05,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:59:05,361 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2019-09-10 01:59:05,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 01:59:05,361 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 58 [2019-09-10 01:59:05,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:59:05,362 INFO L225 Difference]: With dead ends: 69 [2019-09-10 01:59:05,362 INFO L226 Difference]: Without dead ends: 69 [2019-09-10 01:59:05,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 108 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 36.5s TimeCoverageRelationStatistics Valid=522, Invalid=1283, Unknown=5, NotChecked=82, Total=1892 [2019-09-10 01:59:05,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-10 01:59:05,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2019-09-10 01:59:05,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-10 01:59:05,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2019-09-10 01:59:05,366 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 58 [2019-09-10 01:59:05,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:59:05,366 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2019-09-10 01:59:05,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 01:59:05,366 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2019-09-10 01:59:05,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-10 01:59:05,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:59:05,367 INFO L399 BasicCegarLoop]: trace histogram [26, 19, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:59:05,367 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:59:05,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:59:05,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1126866852, now seen corresponding path program 18 times [2019-09-10 01:59:05,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:59:05,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:59:05,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:59:05,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:59:05,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:59:05,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:59:05,840 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 01:59:05,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:59:05,840 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:59:05,841 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:59:05,841 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:59:05,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:59:05,841 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:59:05,862 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:59:05,862 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:59:05,885 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:59:05,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:59:05,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-10 01:59:05,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:59:05,951 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 01:59:05,951 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:59:09,416 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 01:59:09,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:59:09,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 23] total 44 [2019-09-10 01:59:09,420 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:59:09,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 01:59:09,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 01:59:09,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=547, Invalid=1344, Unknown=1, NotChecked=0, Total=1892 [2019-09-10 01:59:09,421 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 23 states. [2019-09-10 01:59:10,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:59:10,185 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2019-09-10 01:59:10,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 01:59:10,188 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 62 [2019-09-10 01:59:10,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:59:10,189 INFO L225 Difference]: With dead ends: 65 [2019-09-10 01:59:10,189 INFO L226 Difference]: Without dead ends: 65 [2019-09-10 01:59:10,190 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 101 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=547, Invalid=1344, Unknown=1, NotChecked=0, Total=1892 [2019-09-10 01:59:10,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-10 01:59:10,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-09-10 01:59:10,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-10 01:59:10,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2019-09-10 01:59:10,193 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 62 [2019-09-10 01:59:10,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:59:10,193 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2019-09-10 01:59:10,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 01:59:10,193 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2019-09-10 01:59:10,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 01:59:10,194 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:59:10,194 INFO L399 BasicCegarLoop]: trace histogram [27, 20, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:59:10,194 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:59:10,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:59:10,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1362952601, now seen corresponding path program 19 times [2019-09-10 01:59:10,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:59:10,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:59:10,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:59:10,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:59:10,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:59:10,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:59:10,803 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 01:59:10,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:59:10,804 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:59:10,804 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:59:10,804 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:59:10,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:59:10,814 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 01:59:10,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:59:10,835 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:59:10,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:59:10,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-10 01:59:10,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:59:10,941 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 01:59:10,941 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:59:13,517 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 01:59:13,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:59:13,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 24] total 46 [2019-09-10 01:59:13,521 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:59:13,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 01:59:13,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 01:59:13,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=1475, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 01:59:13,525 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 24 states. [2019-09-10 01:59:14,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:59:14,340 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2019-09-10 01:59:14,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 01:59:14,340 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 64 [2019-09-10 01:59:14,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:59:14,341 INFO L225 Difference]: With dead ends: 67 [2019-09-10 01:59:14,341 INFO L226 Difference]: Without dead ends: 67 [2019-09-10 01:59:14,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 104 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=595, Invalid=1475, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 01:59:14,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-10 01:59:14,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-09-10 01:59:14,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-10 01:59:14,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2019-09-10 01:59:14,347 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 64 [2019-09-10 01:59:14,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:59:14,347 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2019-09-10 01:59:14,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 01:59:14,347 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2019-09-10 01:59:14,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 01:59:14,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:59:14,348 INFO L399 BasicCegarLoop]: trace histogram [28, 21, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:59:14,348 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:59:14,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:59:14,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1782663062, now seen corresponding path program 20 times [2019-09-10 01:59:14,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:59:14,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:59:14,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:59:14,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:59:14,350 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:59:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:59:14,777 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 01:59:14,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:59:14,778 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:59:14,778 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:59:14,778 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:59:14,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:59:14,778 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 01:59:14,789 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:59:14,789 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:01:16,936 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-10 02:01:16,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:01:17,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-10 02:01:17,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:01:17,946 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 315 proven. 49 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:01:17,946 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:01:18,344 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 315 proven. 49 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-10 02:01:18,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:01:18,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 10, 10] total 40 [2019-09-10 02:01:18,351 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:01:18,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-10 02:01:18,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-10 02:01:18,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=1118, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 02:01:18,352 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand 32 states. [2019-09-10 02:01:19,746 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 15 [2019-09-10 02:01:33,327 WARN L188 SmtUtils]: Spent 9.12 s on a formula simplification. DAG size of input: 36 DAG size of output: 12 [2019-09-10 02:01:50,692 WARN L188 SmtUtils]: Spent 8.26 s on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-10 02:01:55,899 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967281) 4294967296) 65521) (< (mod (+ c_main_~x~0 4294967291) 4294967296) 65521) (< (mod (+ c_main_~x~0 4294967293) 4294967296) 65521) (< (mod (+ c_main_~x~0 4294967295) 4294967296) 65521) (< (mod (+ c_main_~x~0 4294967289) 4294967296) 65521) (< (mod (+ c_main_~x~0 4294967287) 4294967296) 65521) (< (mod (+ c_main_~x~0 4294967283) 4294967296) 65521)) is different from false [2019-09-10 02:02:03,092 WARN L188 SmtUtils]: Spent 2.67 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-10 02:02:06,646 WARN L188 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-10 02:02:25,552 WARN L188 SmtUtils]: Spent 4.49 s on a formula simplification. DAG size of input: 28 DAG size of output: 16 [2019-09-10 02:02:32,917 WARN L188 SmtUtils]: Spent 2.49 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-10 02:02:47,297 WARN L188 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-10 02:03:05,146 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967285) 4294967296) 65521) (< (mod (+ c_main_~x~0 4294967281) 4294967296) 65521) (< (mod (+ c_main_~x~0 4294967291) 4294967296) 65521) (< (mod (+ c_main_~x~0 4294967293) 4294967296) 65521) (< (mod (+ c_main_~x~0 4294967295) 4294967296) 65521) (< (mod (+ c_main_~x~0 4294967289) 4294967296) 65521) (< (mod (+ c_main_~x~0 4294967283) 4294967296) 65521)) is different from false [2019-09-10 02:03:19,870 WARN L188 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-10 02:03:19,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:03:19,876 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2019-09-10 02:03:19,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-10 02:03:19,877 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 66 [2019-09-10 02:03:19,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:03:19,877 INFO L225 Difference]: With dead ends: 81 [2019-09-10 02:03:19,878 INFO L226 Difference]: Without dead ends: 81 [2019-09-10 02:03:19,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 123 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 95.0s TimeCoverageRelationStatistics Valid=771, Invalid=1879, Unknown=10, NotChecked=202, Total=2862 [2019-09-10 02:03:19,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-09-10 02:03:19,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 71. [2019-09-10 02:03:19,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-10 02:03:19,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2019-09-10 02:03:19,881 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 66 [2019-09-10 02:03:19,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:03:19,881 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2019-09-10 02:03:19,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-10 02:03:19,881 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2019-09-10 02:03:19,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 02:03:19,882 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:03:19,882 INFO L399 BasicCegarLoop]: trace histogram [30, 22, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:03:19,882 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:03:19,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:03:19,883 INFO L82 PathProgramCache]: Analyzing trace with hash -204034418, now seen corresponding path program 21 times [2019-09-10 02:03:19,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:03:19,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:03:19,885 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:03:19,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:03:19,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:03:19,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:03:20,418 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:03:20,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:03:20,418 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:03:20,418 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:03:20,419 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:03:20,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:03:20,419 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:03:20,435 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:03:20,435 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:03:20,464 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:03:20,465 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:03:20,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-10 02:03:20,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:03:20,558 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:03:20,558 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:03:29,526 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 345 proven. 500 refuted. 6 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-10 02:03:29,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:03:29,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 26] total 50 [2019-09-10 02:03:29,529 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:03:29,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 02:03:29,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 02:03:29,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=697, Invalid=1750, Unknown=3, NotChecked=0, Total=2450 [2019-09-10 02:03:29,531 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand 26 states. [2019-09-10 02:03:30,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:03:30,501 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2019-09-10 02:03:30,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 02:03:30,501 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 70 [2019-09-10 02:03:30,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:03:30,503 INFO L225 Difference]: With dead ends: 73 [2019-09-10 02:03:30,503 INFO L226 Difference]: Without dead ends: 73 [2019-09-10 02:03:30,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 114 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=697, Invalid=1750, Unknown=3, NotChecked=0, Total=2450 [2019-09-10 02:03:30,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-09-10 02:03:30,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-09-10 02:03:30,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-10 02:03:30,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2019-09-10 02:03:30,507 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 70 [2019-09-10 02:03:30,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:03:30,507 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2019-09-10 02:03:30,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 02:03:30,507 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2019-09-10 02:03:30,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 02:03:30,508 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:03:30,508 INFO L399 BasicCegarLoop]: trace histogram [31, 23, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:03:30,508 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:03:30,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:03:30,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1889811765, now seen corresponding path program 22 times [2019-09-10 02:03:30,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:03:30,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:03:30,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:03:30,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:03:30,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:03:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:03:31,177 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:03:31,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:03:31,177 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:03:31,177 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:03:31,177 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:03:31,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:03:31,178 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:03:31,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:03:31,203 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:03:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:03:31,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-10 02:03:31,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:03:31,326 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:03:31,326 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:03:34,169 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:03:34,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:03:34,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 27] total 52 [2019-09-10 02:03:34,172 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:03:34,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-10 02:03:34,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-10 02:03:34,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=751, Invalid=1901, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:03:34,174 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand 27 states. [2019-09-10 02:03:35,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:03:35,210 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2019-09-10 02:03:35,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 02:03:35,211 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 72 [2019-09-10 02:03:35,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:03:35,212 INFO L225 Difference]: With dead ends: 75 [2019-09-10 02:03:35,212 INFO L226 Difference]: Without dead ends: 75 [2019-09-10 02:03:35,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 117 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=751, Invalid=1901, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:03:35,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-10 02:03:35,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-09-10 02:03:35,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-10 02:03:35,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2019-09-10 02:03:35,217 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 72 [2019-09-10 02:03:35,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:03:35,217 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2019-09-10 02:03:35,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-10 02:03:35,217 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2019-09-10 02:03:35,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 02:03:35,218 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:03:35,218 INFO L399 BasicCegarLoop]: trace histogram [32, 24, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:03:35,218 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:03:35,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:03:35,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1575795656, now seen corresponding path program 23 times [2019-09-10 02:03:35,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:03:35,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:03:35,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:03:35,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:03:35,220 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:03:35,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:03:35,759 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:03:35,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:03:35,760 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:03:35,760 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:03:35,760 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:03:35,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:03:35,760 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:03:35,770 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:03:35,770 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:06:07,550 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-10 02:06:07,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:06:08,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-10 02:06:08,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:08,433 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:06:08,433 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:08,919 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:06:08,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:08,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 11, 11] total 45 [2019-09-10 02:06:08,926 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:08,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-10 02:06:08,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-10 02:06:08,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=552, Invalid=1428, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 02:06:08,928 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand 36 states. [2019-09-10 02:06:20,343 WARN L188 SmtUtils]: Spent 6.34 s on a formula simplification. DAG size of input: 40 DAG size of output: 12 [2019-09-10 02:06:23,452 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967285) 4294967296) 65521) (< (mod (+ c_main_~x~0 4294967281) 4294967296) 65521) (< (mod (+ c_main_~x~0 4294967279) 4294967296) 65521) (< (mod (+ c_main_~x~0 4294967291) 4294967296) 65521) (< (mod (+ c_main_~x~0 4294967293) 4294967296) 65521) (< (mod (+ c_main_~x~0 4294967289) 4294967296) 65521) (< (mod (+ c_main_~x~0 4294967287) 4294967296) 65521) (< (mod (+ c_main_~x~0 4294967283) 4294967296) 65521)) is different from false [2019-09-10 02:06:36,505 WARN L188 SmtUtils]: Spent 6.66 s on a formula simplification. DAG size of input: 32 DAG size of output: 16 [2019-09-10 02:06:54,124 WARN L188 SmtUtils]: Spent 8.33 s on a formula simplification. DAG size of input: 36 DAG size of output: 16 [2019-09-10 02:07:00,807 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-10 02:07:09,889 WARN L188 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-10 02:07:23,810 WARN L188 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-10 02:07:32,810 WARN L188 SmtUtils]: Spent 854.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 12 [2019-09-10 02:07:35,522 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12