java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/nested3-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 13:13:56,154 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 13:13:56,156 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 13:13:56,167 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 13:13:56,167 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 13:13:56,168 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 13:13:56,170 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 13:13:56,171 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 13:13:56,173 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 13:13:56,174 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 13:13:56,175 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 13:13:56,176 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 13:13:56,176 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 13:13:56,177 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 13:13:56,178 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 13:13:56,179 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 13:13:56,180 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 13:13:56,181 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 13:13:56,182 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 13:13:56,184 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 13:13:56,186 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 13:13:56,186 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 13:13:56,187 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 13:13:56,188 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 13:13:56,190 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 13:13:56,191 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 13:13:56,191 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 13:13:56,192 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 13:13:56,192 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 13:13:56,193 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 13:13:56,193 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 13:13:56,194 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 13:13:56,194 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 13:13:56,195 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 13:13:56,196 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 13:13:56,196 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 13:13:56,197 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 13:13:56,197 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 13:13:56,197 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 13:13:56,198 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 13:13:56,199 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 13:13:56,200 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-05 13:13:56,214 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 13:13:56,214 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 13:13:56,214 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-05 13:13:56,215 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-05 13:13:56,215 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-05 13:13:56,215 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-05 13:13:56,216 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-05 13:13:56,216 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-05 13:13:56,216 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-05 13:13:56,216 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-05 13:13:56,217 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 13:13:56,217 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 13:13:56,217 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 13:13:56,217 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 13:13:56,218 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 13:13:56,218 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 13:13:56,218 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 13:13:56,218 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 13:13:56,218 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 13:13:56,219 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 13:13:56,219 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 13:13:56,219 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-05 13:13:56,219 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 13:13:56,219 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 13:13:56,220 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 13:13:56,220 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 13:13:56,220 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-05 13:13:56,220 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 13:13:56,220 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 13:13:56,221 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-05 13:13:56,248 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 13:13:56,262 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 13:13:56,266 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 13:13:56,267 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 13:13:56,267 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 13:13:56,268 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/nested3-1.c [2019-09-05 13:13:56,336 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc3b14ce6/aea1409baecc4e8bb9ea44063458822a/FLAG73f97945a [2019-09-05 13:13:56,762 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 13:13:56,763 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested3-1.c [2019-09-05 13:13:56,768 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc3b14ce6/aea1409baecc4e8bb9ea44063458822a/FLAG73f97945a [2019-09-05 13:13:57,163 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc3b14ce6/aea1409baecc4e8bb9ea44063458822a [2019-09-05 13:13:57,177 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 13:13:57,179 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 13:13:57,182 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 13:13:57,182 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 13:13:57,185 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 13:13:57,186 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 01:13:57" (1/1) ... [2019-09-05 13:13:57,189 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e1d362a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:13:57, skipping insertion in model container [2019-09-05 13:13:57,190 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 01:13:57" (1/1) ... [2019-09-05 13:13:57,197 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 13:13:57,216 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 13:13:57,403 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 13:13:57,407 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 13:13:57,423 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 13:13:57,435 INFO L192 MainTranslator]: Completed translation [2019-09-05 13:13:57,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:13:57 WrapperNode [2019-09-05 13:13:57,435 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 13:13:57,436 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 13:13:57,436 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 13:13:57,436 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 13:13:57,526 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:13:57" (1/1) ... [2019-09-05 13:13:57,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:13:57" (1/1) ... [2019-09-05 13:13:57,531 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:13:57" (1/1) ... [2019-09-05 13:13:57,531 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:13:57" (1/1) ... [2019-09-05 13:13:57,535 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:13:57" (1/1) ... [2019-09-05 13:13:57,543 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:13:57" (1/1) ... [2019-09-05 13:13:57,544 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:13:57" (1/1) ... [2019-09-05 13:13:57,551 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 13:13:57,552 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 13:13:57,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 13:13:57,552 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 13:13:57,553 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:13:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 13:13:57,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 13:13:57,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 13:13:57,608 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 13:13:57,608 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 13:13:57,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 13:13:57,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 13:13:57,608 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 13:13:57,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 13:13:57,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 13:13:57,808 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 13:13:57,808 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-05 13:13:57,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 01:13:57 BoogieIcfgContainer [2019-09-05 13:13:57,810 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 13:13:57,811 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 13:13:57,811 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 13:13:57,814 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 13:13:57,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 01:13:57" (1/3) ... [2019-09-05 13:13:57,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6796738b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 01:13:57, skipping insertion in model container [2019-09-05 13:13:57,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:13:57" (2/3) ... [2019-09-05 13:13:57,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6796738b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 01:13:57, skipping insertion in model container [2019-09-05 13:13:57,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 01:13:57" (3/3) ... [2019-09-05 13:13:57,818 INFO L109 eAbstractionObserver]: Analyzing ICFG nested3-1.c [2019-09-05 13:13:57,827 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 13:13:57,834 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 13:13:57,850 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 13:13:57,875 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 13:13:57,875 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-05 13:13:57,875 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 13:13:57,876 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 13:13:57,876 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 13:13:57,876 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 13:13:57,876 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 13:13:57,876 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 13:13:57,891 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-09-05 13:13:57,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 13:13:57,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:13:57,902 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:13:57,904 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:13:57,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:13:57,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1303616190, now seen corresponding path program 1 times [2019-09-05 13:13:57,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:13:57,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:57,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:13:57,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:57,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:13:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:13:57,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:13:57,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:13:57,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-05 13:13:57,997 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:13:58,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-05 13:13:58,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-05 13:13:58,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 13:13:58,018 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2019-09-05 13:13:58,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:13:58,034 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-09-05 13:13:58,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-05 13:13:58,035 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-05 13:13:58,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:13:58,044 INFO L225 Difference]: With dead ends: 23 [2019-09-05 13:13:58,045 INFO L226 Difference]: Without dead ends: 19 [2019-09-05 13:13:58,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 13:13:58,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-05 13:13:58,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-05 13:13:58,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-05 13:13:58,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-09-05 13:13:58,086 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 10 [2019-09-05 13:13:58,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:13:58,087 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-09-05 13:13:58,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-05 13:13:58,087 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2019-09-05 13:13:58,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 13:13:58,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:13:58,088 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:13:58,088 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:13:58,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:13:58,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1274063518, now seen corresponding path program 1 times [2019-09-05 13:13:58,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:13:58,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:58,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:13:58,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:58,091 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:13:58,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:13:58,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:13:58,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:13:58,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 13:13:58,225 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:13:58,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 13:13:58,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 13:13:58,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 13:13:58,228 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 3 states. [2019-09-05 13:13:58,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:13:58,262 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2019-09-05 13:13:58,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 13:13:58,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-05 13:13:58,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:13:58,265 INFO L225 Difference]: With dead ends: 26 [2019-09-05 13:13:58,265 INFO L226 Difference]: Without dead ends: 26 [2019-09-05 13:13:58,266 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-05 13:13:58,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-05 13:13:58,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2019-09-05 13:13:58,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-05 13:13:58,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-09-05 13:13:58,285 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 10 [2019-09-05 13:13:58,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:13:58,285 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-09-05 13:13:58,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 13:13:58,286 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-09-05 13:13:58,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-05 13:13:58,287 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:13:58,287 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:13:58,290 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:13:58,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:13:58,291 INFO L82 PathProgramCache]: Analyzing trace with hash 856543284, now seen corresponding path program 1 times [2019-09-05 13:13:58,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:13:58,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:58,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:13:58,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:58,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:13:58,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:13:58,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:13:58,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:13:58,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 13:13:58,416 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:13:58,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 13:13:58,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 13:13:58,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 13:13:58,418 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 3 states. [2019-09-05 13:13:58,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:13:58,435 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2019-09-05 13:13:58,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 13:13:58,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-09-05 13:13:58,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:13:58,437 INFO L225 Difference]: With dead ends: 24 [2019-09-05 13:13:58,437 INFO L226 Difference]: Without dead ends: 24 [2019-09-05 13:13:58,438 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-05 13:13:58,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-05 13:13:58,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-09-05 13:13:58,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-05 13:13:58,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-09-05 13:13:58,443 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 11 [2019-09-05 13:13:58,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:13:58,444 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-09-05 13:13:58,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 13:13:58,444 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-09-05 13:13:58,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-05 13:13:58,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:13:58,447 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:13:58,448 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:13:58,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:13:58,448 INFO L82 PathProgramCache]: Analyzing trace with hash 808417067, now seen corresponding path program 1 times [2019-09-05 13:13:58,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:13:58,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:58,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:13:58,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:58,450 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:13:58,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:13:58,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:13:58,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:13:58,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 13:13:58,546 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:13:58,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 13:13:58,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 13:13:58,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 13:13:58,547 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 3 states. [2019-09-05 13:13:58,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:13:58,557 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-09-05 13:13:58,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 13:13:58,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-09-05 13:13:58,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:13:58,559 INFO L225 Difference]: With dead ends: 23 [2019-09-05 13:13:58,559 INFO L226 Difference]: Without dead ends: 23 [2019-09-05 13:13:58,560 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-05 13:13:58,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-05 13:13:58,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-09-05 13:13:58,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-05 13:13:58,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-09-05 13:13:58,566 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 12 [2019-09-05 13:13:58,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:13:58,566 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-09-05 13:13:58,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 13:13:58,566 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-09-05 13:13:58,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-05 13:13:58,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:13:58,567 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:13:58,568 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:13:58,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:13:58,568 INFO L82 PathProgramCache]: Analyzing trace with hash -681648618, now seen corresponding path program 1 times [2019-09-05 13:13:58,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:13:58,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:58,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:13:58,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:58,570 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:13:58,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:13:58,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:13:58,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:58,665 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:13:58,666 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2019-09-05 13:13:58,668 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [22], [29], [31], [47], [50], [52], [58], [59], [60], [62] [2019-09-05 13:13:58,704 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:13:58,704 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:13:58,762 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-05 13:13:59,052 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:13:59,055 INFO L272 AbstractInterpreter]: Visited 13 different actions 55 times. Merged at 2 different actions 14 times. Widened at 1 different actions 5 times. Performed 92 root evaluator evaluations with a maximum evaluation depth of 12. Performed 92 inverse root evaluator evaluations with a maximum inverse evaluation depth of 12. Found 1 fixpoints after 1 different actions. Largest state had 5 variables. [2019-09-05 13:13:59,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:13:59,060 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:13:59,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:59,061 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-05 13:13:59,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:13:59,085 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-05 13:13:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:13:59,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-05 13:13:59,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:13:59,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:13:59,159 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:13:59,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:13:59,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:13:59,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-09-05 13:13:59,200 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:13:59,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:13:59,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:13:59,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-05 13:13:59,201 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 5 states. [2019-09-05 13:13:59,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:13:59,229 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2019-09-05 13:13:59,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 13:13:59,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-09-05 13:13:59,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:13:59,231 INFO L225 Difference]: With dead ends: 24 [2019-09-05 13:13:59,231 INFO L226 Difference]: Without dead ends: 24 [2019-09-05 13:13:59,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 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-05 13:13:59,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-05 13:13:59,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-09-05 13:13:59,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-05 13:13:59,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-09-05 13:13:59,236 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2019-09-05 13:13:59,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:13:59,237 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-09-05 13:13:59,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:13:59,237 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-09-05 13:13:59,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-05 13:13:59,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:13:59,238 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:13:59,238 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:13:59,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:13:59,238 INFO L82 PathProgramCache]: Analyzing trace with hash 370955403, now seen corresponding path program 2 times [2019-09-05 13:13:59,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:13:59,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:59,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:13:59,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:59,241 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:13:59,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:13:59,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:13:59,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:59,371 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:13:59,372 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:13:59,372 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:13:59,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:59,372 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:13:59,394 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:13:59,394 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:13:59,414 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-05 13:13:59,414 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:13:59,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-05 13:13:59,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:13:59,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:13:59,440 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:13:59,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:13:59,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:13:59,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-09-05 13:13:59,493 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:13:59,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 13:13:59,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 13:13:59,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-05 13:13:59,494 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2019-09-05 13:13:59,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:13:59,542 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2019-09-05 13:13:59,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:13:59,543 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-09-05 13:13:59,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:13:59,544 INFO L225 Difference]: With dead ends: 25 [2019-09-05 13:13:59,544 INFO L226 Difference]: Without dead ends: 25 [2019-09-05 13:13:59,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-05 13:13:59,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-05 13:13:59,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-09-05 13:13:59,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-05 13:13:59,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-09-05 13:13:59,552 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 14 [2019-09-05 13:13:59,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:13:59,554 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-09-05 13:13:59,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 13:13:59,554 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2019-09-05 13:13:59,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-05 13:13:59,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:13:59,555 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:13:59,555 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:13:59,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:13:59,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1358058314, now seen corresponding path program 3 times [2019-09-05 13:13:59,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:13:59,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:59,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:13:59,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:59,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:13:59,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:13:59,664 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:13:59,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:59,665 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:13:59,665 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:13:59,665 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:13:59,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:59,666 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:13:59,687 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:13:59,688 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:13:59,700 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:13:59,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:13:59,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-05 13:13:59,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:13:59,728 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:13:59,729 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:13:59,808 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:13:59,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:13:59,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-09-05 13:13:59,813 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:13:59,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 13:13:59,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 13:13:59,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-09-05 13:13:59,814 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 7 states. [2019-09-05 13:13:59,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:13:59,860 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2019-09-05 13:13:59,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 13:13:59,862 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-09-05 13:13:59,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:13:59,862 INFO L225 Difference]: With dead ends: 26 [2019-09-05 13:13:59,862 INFO L226 Difference]: Without dead ends: 26 [2019-09-05 13:13:59,863 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-09-05 13:13:59,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-05 13:13:59,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-09-05 13:13:59,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-05 13:13:59,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-09-05 13:13:59,866 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 15 [2019-09-05 13:13:59,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:13:59,867 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-09-05 13:13:59,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 13:13:59,867 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-09-05 13:13:59,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-05 13:13:59,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:13:59,868 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:13:59,868 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:13:59,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:13:59,868 INFO L82 PathProgramCache]: Analyzing trace with hash 877091307, now seen corresponding path program 4 times [2019-09-05 13:13:59,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:13:59,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:59,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:13:59,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:13:59,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:13:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:13:59,967 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:13:59,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:59,967 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:13:59,968 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:13:59,968 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:13:59,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:13:59,968 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:13:59,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:13:59,983 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:13:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:13:59,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-05 13:13:59,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:14:00,028 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:00,029 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:14:00,131 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:00,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:14:00,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-09-05 13:14:00,135 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:14:00,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 13:14:00,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 13:14:00,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-09-05 13:14:00,137 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 8 states. [2019-09-05 13:14:00,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:14:00,198 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2019-09-05 13:14:00,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 13:14:00,199 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-09-05 13:14:00,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:14:00,199 INFO L225 Difference]: With dead ends: 27 [2019-09-05 13:14:00,200 INFO L226 Difference]: Without dead ends: 27 [2019-09-05 13:14:00,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-09-05 13:14:00,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-05 13:14:00,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-09-05 13:14:00,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-05 13:14:00,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-09-05 13:14:00,204 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 16 [2019-09-05 13:14:00,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:14:00,204 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-09-05 13:14:00,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 13:14:00,205 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-09-05 13:14:00,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-05 13:14:00,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:14:00,205 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:14:00,206 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:14:00,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:14:00,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1447252822, now seen corresponding path program 5 times [2019-09-05 13:14:00,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:14:00,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:00,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:14:00,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:00,208 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:14:00,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:00,336 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:00,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:00,337 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:14:00,337 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:14:00,337 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:14:00,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:00,337 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:14:00,353 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:14:00,354 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:14:00,374 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-05 13:14:00,374 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:14:00,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-05 13:14:00,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:14:00,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:14:00,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:14:00,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:14:00,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:14:00,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:14:05,832 WARN L188 SmtUtils]: Spent 638.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 19 [2019-09-05 13:14:06,470 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-05 13:14:06,470 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:14:09,749 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-05 13:14:09,753 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-05 13:14:09,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [8] total 16 [2019-09-05 13:14:09,753 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:14:09,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 13:14:09,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 13:14:09,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=184, Unknown=2, NotChecked=0, Total=240 [2019-09-05 13:14:09,754 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 6 states. [2019-09-05 13:14:14,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:14:14,308 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-09-05 13:14:14,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 13:14:14,309 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-09-05 13:14:14,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:14:14,309 INFO L225 Difference]: With dead ends: 31 [2019-09-05 13:14:14,310 INFO L226 Difference]: Without dead ends: 31 [2019-09-05 13:14:14,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=60, Invalid=210, Unknown=2, NotChecked=0, Total=272 [2019-09-05 13:14:14,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-05 13:14:14,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-09-05 13:14:14,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-05 13:14:14,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-09-05 13:14:14,314 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 17 [2019-09-05 13:14:14,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:14:14,314 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-09-05 13:14:14,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 13:14:14,314 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-09-05 13:14:14,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-05 13:14:14,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:14:14,315 INFO L399 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:14:14,315 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:14:14,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:14:14,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1080485078, now seen corresponding path program 1 times [2019-09-05 13:14:14,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:14:14,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:14,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:14:14,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:14,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:14:14,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:14,411 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:14:14,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:14,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:14:14,412 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2019-09-05 13:14:14,412 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [20], [22], [29], [31], [36], [47], [50], [52], [55], [57], [58], [59], [60], [62], [63], [64] [2019-09-05 13:14:14,416 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:14:14,416 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:14:14,418 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-05 13:14:15,386 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:14:15,387 INFO L272 AbstractInterpreter]: Visited 19 different actions 206 times. Merged at 6 different actions 51 times. Widened at 3 different actions 16 times. Performed 310 root evaluator evaluations with a maximum evaluation depth of 12. Performed 310 inverse root evaluator evaluations with a maximum inverse evaluation depth of 12. Found 13 fixpoints after 3 different actions. Largest state had 6 variables. [2019-09-05 13:14:15,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:14:15,387 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:14:15,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:15,388 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:14:15,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:14:15,400 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:14:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:15,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-05 13:14:15,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:14:15,468 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-05 13:14:15,468 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:14:15,574 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-05 13:14:15,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:14:15,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2019-09-05 13:14:15,578 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:14:15,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-05 13:14:15,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-05 13:14:15,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-09-05 13:14:15,580 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 12 states. [2019-09-05 13:14:15,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:14:15,855 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2019-09-05 13:14:15,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-05 13:14:15,857 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2019-09-05 13:14:15,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:14:15,858 INFO L225 Difference]: With dead ends: 51 [2019-09-05 13:14:15,858 INFO L226 Difference]: Without dead ends: 51 [2019-09-05 13:14:15,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=494, Unknown=0, NotChecked=0, Total=650 [2019-09-05 13:14:15,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-05 13:14:15,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 41. [2019-09-05 13:14:15,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-05 13:14:15,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2019-09-05 13:14:15,868 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 24 [2019-09-05 13:14:15,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:14:15,868 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2019-09-05 13:14:15,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-05 13:14:15,868 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2019-09-05 13:14:15,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-05 13:14:15,873 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:14:15,873 INFO L399 BasicCegarLoop]: trace histogram [12, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:14:15,873 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:14:15,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:14:15,873 INFO L82 PathProgramCache]: Analyzing trace with hash 646358326, now seen corresponding path program 2 times [2019-09-05 13:14:15,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:14:15,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:15,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:14:15,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:15,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:14:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:16,019 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 55 proven. 21 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-05 13:14:16,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:16,022 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:14:16,022 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:14:16,022 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:14:16,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:16,022 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:14:16,036 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:14:16,036 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:14:16,106 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-05 13:14:16,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:14:16,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-05 13:14:16,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:14:16,200 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 4 proven. 69 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-05 13:14:16,200 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:14:16,358 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 16 proven. 57 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-05 13:14:16,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:14:16,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2019-09-05 13:14:16,362 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:14:16,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-05 13:14:16,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-05 13:14:16,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2019-09-05 13:14:16,363 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 15 states. [2019-09-05 13:14:16,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:14:16,861 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2019-09-05 13:14:16,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-05 13:14:16,865 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2019-09-05 13:14:16,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:14:16,866 INFO L225 Difference]: With dead ends: 65 [2019-09-05 13:14:16,866 INFO L226 Difference]: Without dead ends: 65 [2019-09-05 13:14:16,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=306, Invalid=1176, Unknown=0, NotChecked=0, Total=1482 [2019-09-05 13:14:16,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-05 13:14:16,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2019-09-05 13:14:16,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-05 13:14:16,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2019-09-05 13:14:16,873 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 39 [2019-09-05 13:14:16,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:14:16,874 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2019-09-05 13:14:16,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-05 13:14:16,874 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2019-09-05 13:14:16,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-05 13:14:16,876 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:14:16,876 INFO L399 BasicCegarLoop]: trace histogram [21, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:14:16,876 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:14:16,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:14:16,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1860941642, now seen corresponding path program 3 times [2019-09-05 13:14:16,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:14:16,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:16,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:14:16,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:16,878 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:14:16,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:17,011 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 137 proven. 28 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-09-05 13:14:17,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:17,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:14:17,012 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:14:17,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:14:17,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:17,012 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:14:17,024 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:14:17,024 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:14:17,063 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:14:17,064 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:14:17,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-05 13:14:17,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:14:17,186 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 6 proven. 226 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-09-05 13:14:17,187 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:14:17,421 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 22 proven. 210 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-09-05 13:14:17,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:14:17,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2019-09-05 13:14:17,428 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:14:17,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-05 13:14:17,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-05 13:14:17,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2019-09-05 13:14:17,430 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 18 states. [2019-09-05 13:14:18,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:14:18,239 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2019-09-05 13:14:18,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-05 13:14:18,242 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2019-09-05 13:14:18,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:14:18,242 INFO L225 Difference]: With dead ends: 81 [2019-09-05 13:14:18,242 INFO L226 Difference]: Without dead ends: 81 [2019-09-05 13:14:18,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=524, Invalid=2338, Unknown=0, NotChecked=0, Total=2862 [2019-09-05 13:14:18,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-09-05 13:14:18,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 69. [2019-09-05 13:14:18,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-05 13:14:18,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2019-09-05 13:14:18,250 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 56 [2019-09-05 13:14:18,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:14:18,250 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2019-09-05 13:14:18,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-05 13:14:18,251 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2019-09-05 13:14:18,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-05 13:14:18,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:14:18,252 INFO L399 BasicCegarLoop]: trace histogram [32, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:14:18,252 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:14:18,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:14:18,253 INFO L82 PathProgramCache]: Analyzing trace with hash -330095560, now seen corresponding path program 4 times [2019-09-05 13:14:18,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:14:18,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:18,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:14:18,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:18,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:14:18,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:18,413 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 255 proven. 36 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2019-09-05 13:14:18,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:18,414 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:14:18,414 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:14:18,414 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:14:18,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:18,414 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-05 13:14:18,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:14:18,446 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:14:18,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:18,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-05 13:14:18,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:14:18,653 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 8 proven. 538 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2019-09-05 13:14:18,653 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:14:18,966 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 28 proven. 518 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2019-09-05 13:14:18,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:14:18,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 31 [2019-09-05 13:14:18,969 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:14:18,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-05 13:14:18,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-05 13:14:18,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=743, Unknown=0, NotChecked=0, Total=930 [2019-09-05 13:14:18,972 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand 21 states. [2019-09-05 13:14:20,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:14:20,208 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2019-09-05 13:14:20,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-05 13:14:20,208 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 75 [2019-09-05 13:14:20,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:14:20,210 INFO L225 Difference]: With dead ends: 99 [2019-09-05 13:14:20,210 INFO L226 Difference]: Without dead ends: 99 [2019-09-05 13:14:20,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1135 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=822, Invalid=4148, Unknown=0, NotChecked=0, Total=4970 [2019-09-05 13:14:20,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-05 13:14:20,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 86. [2019-09-05 13:14:20,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-09-05 13:14:20,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 97 transitions. [2019-09-05 13:14:20,220 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 97 transitions. Word has length 75 [2019-09-05 13:14:20,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:14:20,220 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 97 transitions. [2019-09-05 13:14:20,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-05 13:14:20,220 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 97 transitions. [2019-09-05 13:14:20,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-05 13:14:20,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:14:20,222 INFO L399 BasicCegarLoop]: trace histogram [45, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:14:20,222 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:14:20,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:14:20,223 INFO L82 PathProgramCache]: Analyzing trace with hash -300648342, now seen corresponding path program 5 times [2019-09-05 13:14:20,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:14:20,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:20,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:14:20,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:20,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:14:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:20,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1310 backedges. 415 proven. 45 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2019-09-05 13:14:20,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:20,394 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:14:20,394 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:14:20,395 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:14:20,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:20,395 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:14:20,408 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:14:20,408 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:14:21,270 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-05 13:14:21,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:14:21,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-05 13:14:21,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:14:21,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1310 backedges. 437 proven. 45 refuted. 0 times theorem prover too weak. 828 trivial. 0 not checked. [2019-09-05 13:14:21,314 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:14:21,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1310 backedges. 423 proven. 45 refuted. 0 times theorem prover too weak. 842 trivial. 0 not checked. [2019-09-05 13:14:21,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:14:21,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-09-05 13:14:21,583 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:14:21,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-05 13:14:21,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-05 13:14:21,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-09-05 13:14:21,585 INFO L87 Difference]: Start difference. First operand 86 states and 97 transitions. Second operand 13 states. [2019-09-05 13:14:21,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:14:21,691 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2019-09-05 13:14:21,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-05 13:14:21,692 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2019-09-05 13:14:21,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:14:21,693 INFO L225 Difference]: With dead ends: 92 [2019-09-05 13:14:21,693 INFO L226 Difference]: Without dead ends: 92 [2019-09-05 13:14:21,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 181 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-09-05 13:14:21,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-09-05 13:14:21,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-09-05 13:14:21,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-05 13:14:21,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2019-09-05 13:14:21,701 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 96 [2019-09-05 13:14:21,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:14:21,702 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2019-09-05 13:14:21,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-05 13:14:21,702 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2019-09-05 13:14:21,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-05 13:14:21,703 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:14:21,703 INFO L399 BasicCegarLoop]: trace histogram [50, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:14:21,704 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:14:21,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:14:21,704 INFO L82 PathProgramCache]: Analyzing trace with hash 618162905, now seen corresponding path program 6 times [2019-09-05 13:14:21,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:14:21,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:21,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:14:21,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:21,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:14:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:21,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1570 backedges. 499 proven. 55 refuted. 0 times theorem prover too weak. 1016 trivial. 0 not checked. [2019-09-05 13:14:21,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:21,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:14:21,890 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:14:21,890 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:14:21,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:21,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:14:21,908 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:14:21,908 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:14:21,953 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:14:21,954 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:14:21,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-05 13:14:21,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:14:22,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1570 backedges. 10 proven. 1290 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2019-09-05 13:14:22,173 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:14:22,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1570 backedges. 40 proven. 1260 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2019-09-05 13:14:22,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:14:22,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 37 [2019-09-05 13:14:22,631 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:14:22,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-05 13:14:22,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-05 13:14:22,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=1083, Unknown=0, NotChecked=0, Total=1332 [2019-09-05 13:14:22,633 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand 25 states. [2019-09-05 13:14:24,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:14:24,601 INFO L93 Difference]: Finished difference Result 126 states and 141 transitions. [2019-09-05 13:14:24,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-09-05 13:14:24,601 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 101 [2019-09-05 13:14:24,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:14:24,602 INFO L225 Difference]: With dead ends: 126 [2019-09-05 13:14:24,603 INFO L226 Difference]: Without dead ends: 126 [2019-09-05 13:14:24,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 179 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2349 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1323, Invalid=7989, Unknown=0, NotChecked=0, Total=9312 [2019-09-05 13:14:24,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-09-05 13:14:24,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 111. [2019-09-05 13:14:24,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-09-05 13:14:24,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 124 transitions. [2019-09-05 13:14:24,612 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 124 transitions. Word has length 101 [2019-09-05 13:14:24,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:14:24,613 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 124 transitions. [2019-09-05 13:14:24,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-05 13:14:24,613 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 124 transitions. [2019-09-05 13:14:24,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-05 13:14:24,615 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:14:24,615 INFO L399 BasicCegarLoop]: trace histogram [66, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:14:24,616 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:14:24,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:14:24,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1206904052, now seen corresponding path program 7 times [2019-09-05 13:14:24,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:14:24,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:24,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:14:24,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:24,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:14:24,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:24,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2679 backedges. 738 proven. 66 refuted. 0 times theorem prover too weak. 1875 trivial. 0 not checked. [2019-09-05 13:14:24,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:24,822 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:14:24,822 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:14:24,823 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:14:24,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:24,823 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:14:24,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:14:24,844 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:14:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:24,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-05 13:14:24,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:14:25,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2679 backedges. 12 proven. 2267 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-09-05 13:14:25,212 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:14:25,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2679 backedges. 47 proven. 2232 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (13)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 13:14:25,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:14:25,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 16] total 42 [2019-09-05 13:14:25,999 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:14:26,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-05 13:14:26,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-05 13:14:26,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=1406, Unknown=0, NotChecked=0, Total=1722 [2019-09-05 13:14:26,003 INFO L87 Difference]: Start difference. First operand 111 states and 124 transitions. Second operand 28 states. [2019-09-05 13:14:28,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:14:28,610 INFO L93 Difference]: Finished difference Result 149 states and 166 transitions. [2019-09-05 13:14:28,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-09-05 13:14:28,611 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 125 [2019-09-05 13:14:28,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:14:28,613 INFO L225 Difference]: With dead ends: 149 [2019-09-05 13:14:28,613 INFO L226 Difference]: Without dead ends: 149 [2019-09-05 13:14:28,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 223 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3759 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1849, Invalid=12193, Unknown=0, NotChecked=0, Total=14042 [2019-09-05 13:14:28,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-09-05 13:14:28,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 133. [2019-09-05 13:14:28,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-09-05 13:14:28,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 148 transitions. [2019-09-05 13:14:28,627 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 148 transitions. Word has length 125 [2019-09-05 13:14:28,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:14:28,627 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 148 transitions. [2019-09-05 13:14:28,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-05 13:14:28,627 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 148 transitions. [2019-09-05 13:14:28,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-05 13:14:28,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:14:28,633 INFO L399 BasicCegarLoop]: trace histogram [84, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:14:28,633 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:14:28,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:14:28,633 INFO L82 PathProgramCache]: Analyzing trace with hash 337948795, now seen corresponding path program 8 times [2019-09-05 13:14:28,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:14:28,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:28,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:14:28,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:28,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:14:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:28,957 INFO L134 CoverageAnalysis]: Checked inductivity of 4263 backedges. 1035 proven. 78 refuted. 0 times theorem prover too weak. 3150 trivial. 0 not checked. [2019-09-05 13:14:28,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:28,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:14:28,958 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:14:28,958 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:14:28,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:28,958 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) [2019-09-05 13:14:28,980 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:14:28,980 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:14:54,545 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-05 13:14:54,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:14:54,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-05 13:14:54,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:14:54,697 INFO L134 CoverageAnalysis]: Checked inductivity of 4263 backedges. 1069 proven. 78 refuted. 0 times theorem prover too weak. 3116 trivial. 0 not checked. [2019-09-05 13:14:54,697 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:14:55,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4263 backedges. 1047 proven. 78 refuted. 0 times theorem prover too weak. 3138 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Exception during sending of exit command (exit): Stream closed [2019-09-05 13:14:55,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:14:55,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-09-05 13:14:55,110 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:14:55,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-05 13:14:55,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-05 13:14:55,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2019-09-05 13:14:55,111 INFO L87 Difference]: Start difference. First operand 133 states and 148 transitions. Second operand 16 states. [2019-09-05 13:14:55,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:14:55,276 INFO L93 Difference]: Finished difference Result 141 states and 156 transitions. [2019-09-05 13:14:55,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-05 13:14:55,277 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 151 [2019-09-05 13:14:55,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:14:55,278 INFO L225 Difference]: With dead ends: 141 [2019-09-05 13:14:55,278 INFO L226 Difference]: Without dead ends: 141 [2019-09-05 13:14:55,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 288 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2019-09-05 13:14:55,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-09-05 13:14:55,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2019-09-05 13:14:55,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-05 13:14:55,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 155 transitions. [2019-09-05 13:14:55,289 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 155 transitions. Word has length 151 [2019-09-05 13:14:55,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:14:55,289 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 155 transitions. [2019-09-05 13:14:55,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-05 13:14:55,290 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 155 transitions. [2019-09-05 13:14:55,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-05 13:14:55,298 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:14:55,298 INFO L399 BasicCegarLoop]: trace histogram [91, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:14:55,298 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:14:55,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:14:55,299 INFO L82 PathProgramCache]: Analyzing trace with hash -453638294, now seen corresponding path program 9 times [2019-09-05 13:14:55,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:14:55,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:55,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:14:55,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:14:55,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:14:55,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:14:55,563 INFO L134 CoverageAnalysis]: Checked inductivity of 4921 backedges. 1197 proven. 91 refuted. 0 times theorem prover too weak. 3633 trivial. 0 not checked. [2019-09-05 13:14:55,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:55,564 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:14:55,564 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:14:55,564 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:14:55,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:14:55,564 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:14:55,581 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:14:55,582 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:14:55,658 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:14:55,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:14:55,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-05 13:14:55,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:14:55,992 INFO L134 CoverageAnalysis]: Checked inductivity of 4921 backedges. 14 proven. 4262 refuted. 0 times theorem prover too weak. 645 trivial. 0 not checked. [2019-09-05 13:14:55,993 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:14:56,767 INFO L134 CoverageAnalysis]: Checked inductivity of 4921 backedges. 62 proven. 4214 refuted. 0 times theorem prover too weak. 645 trivial. 0 not checked. [2019-09-05 13:14:56,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:14:56,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 48 [2019-09-05 13:14:56,771 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:14:56,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-05 13:14:56,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-05 13:14:56,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=1862, Unknown=0, NotChecked=0, Total=2256 [2019-09-05 13:14:56,773 INFO L87 Difference]: Start difference. First operand 140 states and 155 transitions. Second operand 32 states. [2019-09-05 13:15:00,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:15:00,663 INFO L93 Difference]: Finished difference Result 183 states and 202 transitions. [2019-09-05 13:15:00,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2019-09-05 13:15:00,663 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 158 [2019-09-05 13:15:00,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:15:00,665 INFO L225 Difference]: With dead ends: 183 [2019-09-05 13:15:00,665 INFO L226 Difference]: Without dead ends: 183 [2019-09-05 13:15:00,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 285 SyntacticMatches, 1 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6568 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2674, Invalid=20278, Unknown=0, NotChecked=0, Total=22952 [2019-09-05 13:15:00,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-09-05 13:15:00,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 165. [2019-09-05 13:15:00,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-09-05 13:15:00,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 182 transitions. [2019-09-05 13:15:00,677 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 182 transitions. Word has length 158 [2019-09-05 13:15:00,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:15:00,677 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 182 transitions. [2019-09-05 13:15:00,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-05 13:15:00,677 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 182 transitions. [2019-09-05 13:15:00,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-05 13:15:00,680 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:15:00,680 INFO L399 BasicCegarLoop]: trace histogram [112, 9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:15:00,680 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:15:00,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:15:00,680 INFO L82 PathProgramCache]: Analyzing trace with hash 587682364, now seen corresponding path program 10 times [2019-09-05 13:15:00,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:15:00,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:15:00,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:15:00,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:15:00,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:15:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:15:00,959 INFO L134 CoverageAnalysis]: Checked inductivity of 7360 backedges. 1599 proven. 105 refuted. 0 times theorem prover too weak. 5656 trivial. 0 not checked. [2019-09-05 13:15:00,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:15:00,959 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:15:00,960 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:15:00,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:15:00,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:15:00,960 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:15:00,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:15:00,986 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:15:01,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:15:01,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-05 13:15:01,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:15:01,485 INFO L134 CoverageAnalysis]: Checked inductivity of 7360 backedges. 16 proven. 6482 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2019-09-05 13:15:01,486 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:15:02,487 INFO L134 CoverageAnalysis]: Checked inductivity of 7360 backedges. 70 proven. 6428 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2019-09-05 13:15:02,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:15:02,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20, 20] total 53 [2019-09-05 13:15:02,491 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:15:02,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-05 13:15:02,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-05 13:15:02,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=477, Invalid=2279, Unknown=0, NotChecked=0, Total=2756 [2019-09-05 13:15:02,493 INFO L87 Difference]: Start difference. First operand 165 states and 182 transitions. Second operand 35 states. [2019-09-05 13:15:07,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:15:07,985 INFO L93 Difference]: Finished difference Result 211 states and 232 transitions. [2019-09-05 13:15:07,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2019-09-05 13:15:07,990 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 187 [2019-09-05 13:15:07,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:15:07,993 INFO L225 Difference]: With dead ends: 211 [2019-09-05 13:15:07,993 INFO L226 Difference]: Without dead ends: 211 [2019-09-05 13:15:07,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 339 SyntacticMatches, 1 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9486 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3492, Invalid=28370, Unknown=0, NotChecked=0, Total=31862 [2019-09-05 13:15:07,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-05 13:15:08,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 192. [2019-09-05 13:15:08,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-05 13:15:08,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 211 transitions. [2019-09-05 13:15:08,005 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 211 transitions. Word has length 187 [2019-09-05 13:15:08,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:15:08,005 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 211 transitions. [2019-09-05 13:15:08,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-05 13:15:08,006 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 211 transitions. [2019-09-05 13:15:08,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-05 13:15:08,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:15:08,007 INFO L399 BasicCegarLoop]: trace histogram [135, 10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:15:08,007 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:15:08,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:15:08,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1970933494, now seen corresponding path program 11 times [2019-09-05 13:15:08,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:15:08,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:15:08,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:15:08,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:15:08,008 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:15:08,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:15:08,372 INFO L134 CoverageAnalysis]: Checked inductivity of 10575 backedges. 2075 proven. 120 refuted. 0 times theorem prover too weak. 8380 trivial. 0 not checked. [2019-09-05 13:15:08,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:15:08,372 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:15:08,372 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:15:08,372 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:15:08,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:15:08,373 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) [2019-09-05 13:15:08,386 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:15:08,386 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:16:26,050 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-05 13:16:26,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:16:26,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-05 13:16:26,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:16:26,149 INFO L134 CoverageAnalysis]: Checked inductivity of 10575 backedges. 1881 proven. 2145 refuted. 0 times theorem prover too weak. 6549 trivial. 0 not checked. [2019-09-05 13:16:26,149 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:16:26,797 INFO L134 CoverageAnalysis]: Checked inductivity of 10575 backedges. 2091 proven. 120 refuted. 0 times theorem prover too weak. 8364 trivial. 0 not checked. [2019-09-05 13:16:26,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:16:26,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-09-05 13:16:26,808 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:16:26,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-05 13:16:26,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-05 13:16:26,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2019-09-05 13:16:26,810 INFO L87 Difference]: Start difference. First operand 192 states and 211 transitions. Second operand 19 states. [2019-09-05 13:16:27,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:16:27,051 INFO L93 Difference]: Finished difference Result 202 states and 221 transitions. [2019-09-05 13:16:27,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-05 13:16:27,052 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 218 [2019-09-05 13:16:27,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:16:27,053 INFO L225 Difference]: With dead ends: 202 [2019-09-05 13:16:27,053 INFO L226 Difference]: Without dead ends: 202 [2019-09-05 13:16:27,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 418 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2019-09-05 13:16:27,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-05 13:16:27,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2019-09-05 13:16:27,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-09-05 13:16:27,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 220 transitions. [2019-09-05 13:16:27,061 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 220 transitions. Word has length 218 [2019-09-05 13:16:27,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:16:27,061 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 220 transitions. [2019-09-05 13:16:27,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-05 13:16:27,062 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 220 transitions. [2019-09-05 13:16:27,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-05 13:16:27,063 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:16:27,063 INFO L399 BasicCegarLoop]: trace histogram [144, 10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:16:27,064 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:16:27,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:16:27,064 INFO L82 PathProgramCache]: Analyzing trace with hash -613373251, now seen corresponding path program 12 times [2019-09-05 13:16:27,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:16:27,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:16:27,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:16:27,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:16:27,065 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:16:27,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:16:27,471 INFO L134 CoverageAnalysis]: Checked inductivity of 11907 backedges. 2339 proven. 136 refuted. 0 times theorem prover too weak. 9432 trivial. 0 not checked. [2019-09-05 13:16:27,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:16:27,472 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:16:27,472 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:16:27,472 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:16:27,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:16:27,472 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:16:27,493 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:16:27,494 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:16:27,654 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:16:27,655 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:16:27,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-05 13:16:27,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:16:28,227 INFO L134 CoverageAnalysis]: Checked inductivity of 11907 backedges. 18 proven. 10636 refuted. 0 times theorem prover too weak. 1253 trivial. 0 not checked. [2019-09-05 13:16:28,227 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:16:29,577 INFO L134 CoverageAnalysis]: Checked inductivity of 11907 backedges. 88 proven. 10566 refuted. 0 times theorem prover too weak. 1253 trivial. 0 not checked. [2019-09-05 13:16:29,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:16:29,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22, 22] total 59 [2019-09-05 13:16:29,580 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:16:29,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-05 13:16:29,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-05 13:16:29,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=571, Invalid=2851, Unknown=0, NotChecked=0, Total=3422 [2019-09-05 13:16:29,582 INFO L87 Difference]: Start difference. First operand 201 states and 220 transitions. Second operand 39 states. [2019-09-05 13:16:36,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:16:36,445 INFO L93 Difference]: Finished difference Result 252 states and 275 transitions. [2019-09-05 13:16:36,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2019-09-05 13:16:36,446 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 227 [2019-09-05 13:16:36,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:16:36,448 INFO L225 Difference]: With dead ends: 252 [2019-09-05 13:16:36,448 INFO L226 Difference]: Without dead ends: 252 [2019-09-05 13:16:36,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 633 GetRequests, 415 SyntacticMatches, 1 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14905 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=4721, Invalid=43021, Unknown=0, NotChecked=0, Total=47742 [2019-09-05 13:16:36,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-09-05 13:16:36,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 231. [2019-09-05 13:16:36,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-09-05 13:16:36,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 252 transitions. [2019-09-05 13:16:36,459 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 252 transitions. Word has length 227 [2019-09-05 13:16:36,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:16:36,460 INFO L475 AbstractCegarLoop]: Abstraction has 231 states and 252 transitions. [2019-09-05 13:16:36,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-05 13:16:36,460 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 252 transitions. [2019-09-05 13:16:36,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-05 13:16:36,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:16:36,462 INFO L399 BasicCegarLoop]: trace histogram [170, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:16:36,462 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:16:36,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:16:36,462 INFO L82 PathProgramCache]: Analyzing trace with hash -970228748, now seen corresponding path program 13 times [2019-09-05 13:16:36,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:16:36,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:16:36,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:16:36,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:16:36,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:16:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:16:36,927 INFO L134 CoverageAnalysis]: Checked inductivity of 16455 backedges. 2946 proven. 153 refuted. 0 times theorem prover too weak. 13356 trivial. 0 not checked. [2019-09-05 13:16:36,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:16:36,927 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:16:36,927 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:16:36,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:16:36,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:16:36,928 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:16:36,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:16:36,945 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:16:37,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:16:37,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-05 13:16:37,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:16:37,607 INFO L134 CoverageAnalysis]: Checked inductivity of 16455 backedges. 20 proven. 14857 refuted. 0 times theorem prover too weak. 1578 trivial. 0 not checked. [2019-09-05 13:16:37,607 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:16:39,257 INFO L134 CoverageAnalysis]: Checked inductivity of 16455 backedges. 97 proven. 14780 refuted. 0 times theorem prover too weak. 1578 trivial. 0 not checked. [2019-09-05 13:16:39,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:16:39,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 24, 24] total 64 [2019-09-05 13:16:39,261 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:16:39,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-05 13:16:39,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-05 13:16:39,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=670, Invalid=3362, Unknown=0, NotChecked=0, Total=4032 [2019-09-05 13:16:39,264 INFO L87 Difference]: Start difference. First operand 231 states and 252 transitions. Second operand 42 states. [2019-09-05 13:16:47,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:16:47,388 INFO L93 Difference]: Finished difference Result 285 states and 310 transitions. [2019-09-05 13:16:47,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 229 states. [2019-09-05 13:16:47,391 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 261 [2019-09-05 13:16:47,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:16:47,393 INFO L225 Difference]: With dead ends: 285 [2019-09-05 13:16:47,393 INFO L226 Difference]: Without dead ends: 285 [2019-09-05 13:16:47,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 729 GetRequests, 479 SyntacticMatches, 1 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20152 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=5895, Invalid=56855, Unknown=0, NotChecked=0, Total=62750 [2019-09-05 13:16:47,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-09-05 13:16:47,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 263. [2019-09-05 13:16:47,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-05 13:16:47,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 286 transitions. [2019-09-05 13:16:47,404 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 286 transitions. Word has length 261 [2019-09-05 13:16:47,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:16:47,404 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 286 transitions. [2019-09-05 13:16:47,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-05 13:16:47,404 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 286 transitions. [2019-09-05 13:16:47,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-09-05 13:16:47,406 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:16:47,406 INFO L399 BasicCegarLoop]: trace histogram [198, 12, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:16:47,406 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:16:47,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:16:47,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1582663135, now seen corresponding path program 14 times [2019-09-05 13:16:47,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:16:47,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:16:47,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:16:47,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:16:47,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:16:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:16:47,827 INFO L134 CoverageAnalysis]: Checked inductivity of 22154 backedges. 3643 proven. 171 refuted. 0 times theorem prover too weak. 18340 trivial. 0 not checked. [2019-09-05 13:16:47,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:16:47,827 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:16:47,827 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:16:47,827 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:16:47,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:16:47,827 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:16:47,840 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:16:47,840 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:20:05,225 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-05 13:20:05,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:20:05,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-05 13:20:05,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:20:05,361 INFO L134 CoverageAnalysis]: Checked inductivity of 22154 backedges. 3359 proven. 3744 refuted. 0 times theorem prover too weak. 15051 trivial. 0 not checked. [2019-09-05 13:20:05,362 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:21:22,451 INFO L134 CoverageAnalysis]: Checked inductivity of 22154 backedges. 3663 proven. 167 refuted. 4 times theorem prover too weak. 18320 trivial. 0 not checked. [2019-09-05 13:21:22,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:21:22,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-09-05 13:21:22,458 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:21:22,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-05 13:21:22,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-05 13:21:22,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=1134, Unknown=28, NotChecked=0, Total=1640 [2019-09-05 13:21:22,459 INFO L87 Difference]: Start difference. First operand 263 states and 286 transitions. Second operand 22 states. [2019-09-05 13:21:22,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:21:22,790 INFO L93 Difference]: Finished difference Result 275 states and 298 transitions. [2019-09-05 13:21:22,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-05 13:21:22,793 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 297 [2019-09-05 13:21:22,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:21:22,794 INFO L225 Difference]: With dead ends: 275 [2019-09-05 13:21:22,794 INFO L226 Difference]: Without dead ends: 275 [2019-09-05 13:21:22,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 615 GetRequests, 573 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 77.3s TimeCoverageRelationStatistics Valid=478, Invalid=1134, Unknown=28, NotChecked=0, Total=1640 [2019-09-05 13:21:22,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-09-05 13:21:22,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 274. [2019-09-05 13:21:22,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-09-05 13:21:22,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 297 transitions. [2019-09-05 13:21:22,801 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 297 transitions. Word has length 297 [2019-09-05 13:21:22,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:21:22,801 INFO L475 AbstractCegarLoop]: Abstraction has 274 states and 297 transitions. [2019-09-05 13:21:22,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-05 13:21:22,802 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 297 transitions. [2019-09-05 13:21:22,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-05 13:21:22,803 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:21:22,804 INFO L399 BasicCegarLoop]: trace histogram [209, 12, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:21:22,804 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:21:22,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:21:22,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1799634314, now seen corresponding path program 15 times [2019-09-05 13:21:22,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:21:22,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:21:22,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:21:22,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:21:22,805 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:21:22,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:21:23,269 INFO L134 CoverageAnalysis]: Checked inductivity of 24508 backedges. 4033 proven. 190 refuted. 0 times theorem prover too weak. 20285 trivial. 0 not checked. [2019-09-05 13:21:23,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:21:23,270 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:21:23,270 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:21:23,270 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:21:23,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:21:23,270 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:21:23,281 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:21:23,281 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:21:23,443 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:21:23,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:21:23,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 823 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-05 13:21:23,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:21:24,134 INFO L134 CoverageAnalysis]: Checked inductivity of 24508 backedges. 22 proven. 22338 refuted. 0 times theorem prover too weak. 2148 trivial. 0 not checked. [2019-09-05 13:21:24,135 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:21:25,811 INFO L134 CoverageAnalysis]: Checked inductivity of 24508 backedges. 118 proven. 22242 refuted. 0 times theorem prover too weak. 2148 trivial. 0 not checked. [2019-09-05 13:21:25,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:21:25,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 26, 26] total 70 [2019-09-05 13:21:25,816 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:21:25,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-05 13:21:25,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-05 13:21:25,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=4050, Unknown=0, NotChecked=0, Total=4830 [2019-09-05 13:21:25,818 INFO L87 Difference]: Start difference. First operand 274 states and 297 transitions. Second operand 46 states. [2019-09-05 13:21:36,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:21:36,579 INFO L93 Difference]: Finished difference Result 333 states and 360 transitions. [2019-09-05 13:21:36,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 274 states. [2019-09-05 13:21:36,580 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 308 [2019-09-05 13:21:36,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:21:36,583 INFO L225 Difference]: With dead ends: 333 [2019-09-05 13:21:36,583 INFO L226 Difference]: Without dead ends: 333 [2019-09-05 13:21:36,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 866 GetRequests, 569 SyntacticMatches, 1 SemanticMatches, 296 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29448 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=7608, Invalid=80898, Unknown=0, NotChecked=0, Total=88506 [2019-09-05 13:21:36,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-09-05 13:21:36,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 309. [2019-09-05 13:21:36,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-09-05 13:21:36,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 334 transitions. [2019-09-05 13:21:36,596 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 334 transitions. Word has length 308 [2019-09-05 13:21:36,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:21:36,596 INFO L475 AbstractCegarLoop]: Abstraction has 309 states and 334 transitions. [2019-09-05 13:21:36,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-05 13:21:36,596 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 334 transitions. [2019-09-05 13:21:36,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2019-09-05 13:21:36,599 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:21:36,599 INFO L399 BasicCegarLoop]: trace histogram [240, 13, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:21:36,599 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:21:36,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:21:36,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1626008000, now seen corresponding path program 16 times [2019-09-05 13:21:36,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:21:36,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:21:36,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:21:36,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:21:36,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:21:36,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:21:37,194 INFO L134 CoverageAnalysis]: Checked inductivity of 32124 backedges. 4887 proven. 210 refuted. 0 times theorem prover too weak. 27027 trivial. 0 not checked. [2019-09-05 13:21:37,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:21:37,195 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:21:37,195 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:21:37,195 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:21:37,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:21:37,195 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:21:37,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:21:37,209 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:21:37,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:21:37,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 931 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-05 13:21:37,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:21:38,226 INFO L134 CoverageAnalysis]: Checked inductivity of 32124 backedges. 24 proven. 29498 refuted. 0 times theorem prover too weak. 2602 trivial. 0 not checked. [2019-09-05 13:21:38,227 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:21:40,204 INFO L134 CoverageAnalysis]: Checked inductivity of 32124 backedges. 128 proven. 29394 refuted. 0 times theorem prover too weak. 2602 trivial. 0 not checked. [2019-09-05 13:21:40,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:21:40,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 28, 28] total 75 [2019-09-05 13:21:40,209 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:21:40,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-05 13:21:40,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-05 13:21:40,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=895, Invalid=4655, Unknown=0, NotChecked=0, Total=5550 [2019-09-05 13:21:40,211 INFO L87 Difference]: Start difference. First operand 309 states and 334 transitions. Second operand 49 states. [2019-09-05 13:21:53,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:21:53,441 INFO L93 Difference]: Finished difference Result 371 states and 400 transitions. [2019-09-05 13:21:53,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 309 states. [2019-09-05 13:21:53,441 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 347 [2019-09-05 13:21:53,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:21:53,444 INFO L225 Difference]: With dead ends: 371 [2019-09-05 13:21:53,444 INFO L226 Difference]: Without dead ends: 371 [2019-09-05 13:21:53,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 977 GetRequests, 643 SyntacticMatches, 1 SemanticMatches, 333 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38025 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=9202, Invalid=102688, Unknown=0, NotChecked=0, Total=111890 [2019-09-05 13:21:53,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-09-05 13:21:53,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 346. [2019-09-05 13:21:53,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-09-05 13:21:53,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 373 transitions. [2019-09-05 13:21:53,459 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 373 transitions. Word has length 347 [2019-09-05 13:21:53,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:21:53,459 INFO L475 AbstractCegarLoop]: Abstraction has 346 states and 373 transitions. [2019-09-05 13:21:53,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-05 13:21:53,459 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 373 transitions. [2019-09-05 13:21:53,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-09-05 13:21:53,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:21:53,462 INFO L399 BasicCegarLoop]: trace histogram [273, 14, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:21:53,463 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:21:53,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:21:53,463 INFO L82 PathProgramCache]: Analyzing trace with hash -882376790, now seen corresponding path program 17 times [2019-09-05 13:21:53,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:21:53,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:21:53,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:21:53,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:21:53,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:21:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:21:54,054 INFO L134 CoverageAnalysis]: Checked inductivity of 41340 backedges. 5847 proven. 231 refuted. 0 times theorem prover too weak. 35262 trivial. 0 not checked. [2019-09-05 13:21:54,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:21:54,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:21:54,055 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:21:54,055 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:21:54,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:21:54,056 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:21:54,065 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:21:54,065 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:24:50,433 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-09-05 13:24:50,433 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:24:51,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 90 conjunts are in the unsatisfiable core [2019-09-05 13:24:51,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:24:51,721 INFO L134 CoverageAnalysis]: Checked inductivity of 41340 backedges. 5455 proven. 5985 refuted. 0 times theorem prover too weak. 29900 trivial. 0 not checked. [2019-09-05 13:24:51,721 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:26:08,124 INFO L134 CoverageAnalysis]: Checked inductivity of 41340 backedges. 5871 proven. 228 refuted. 3 times theorem prover too weak. 35238 trivial. 0 not checked. [2019-09-05 13:26:08,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:26:08,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-09-05 13:26:08,133 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:26:08,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-05 13:26:08,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-05 13:26:08,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=1519, Unknown=24, NotChecked=0, Total=2162 [2019-09-05 13:26:08,139 INFO L87 Difference]: Start difference. First operand 346 states and 373 transitions. Second operand 25 states. [2019-09-05 13:26:08,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:26:08,532 INFO L93 Difference]: Finished difference Result 360 states and 387 transitions. [2019-09-05 13:26:08,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-05 13:26:08,533 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 388 [2019-09-05 13:26:08,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:26:08,534 INFO L225 Difference]: With dead ends: 360 [2019-09-05 13:26:08,534 INFO L226 Difference]: Without dead ends: 360 [2019-09-05 13:26:08,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 800 GetRequests, 752 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 76.6s TimeCoverageRelationStatistics Valid=619, Invalid=1519, Unknown=24, NotChecked=0, Total=2162 [2019-09-05 13:26:08,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-09-05 13:26:08,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 359. [2019-09-05 13:26:08,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-09-05 13:26:08,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 386 transitions. [2019-09-05 13:26:08,543 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 386 transitions. Word has length 388 [2019-09-05 13:26:08,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:26:08,543 INFO L475 AbstractCegarLoop]: Abstraction has 359 states and 386 transitions. [2019-09-05 13:26:08,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-05 13:26:08,543 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 386 transitions. [2019-09-05 13:26:08,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2019-09-05 13:26:08,546 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:26:08,546 INFO L399 BasicCegarLoop]: trace histogram [286, 14, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:26:08,546 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:26:08,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:26:08,547 INFO L82 PathProgramCache]: Analyzing trace with hash -704827743, now seen corresponding path program 18 times [2019-09-05 13:26:08,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:26:08,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:26:08,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:26:08,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:26:08,548 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:26:08,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:26:09,310 INFO L134 CoverageAnalysis]: Checked inductivity of 45136 backedges. 6387 proven. 253 refuted. 0 times theorem prover too weak. 38496 trivial. 0 not checked. [2019-09-05 13:26:09,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:26:09,311 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:26:09,311 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:26:09,312 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:26:09,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:26:09,312 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:26:09,342 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:26:09,342 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:26:09,560 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:26:09,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:26:09,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 1084 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-05 13:26:09,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:26:10,458 INFO L134 CoverageAnalysis]: Checked inductivity of 45136 backedges. 26 proven. 41726 refuted. 0 times theorem prover too weak. 3384 trivial. 0 not checked. [2019-09-05 13:26:10,458 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:26:12,827 INFO L134 CoverageAnalysis]: Checked inductivity of 45136 backedges. 152 proven. 41600 refuted. 0 times theorem prover too weak. 3384 trivial. 0 not checked. [2019-09-05 13:26:12,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:26:12,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 30, 30] total 81 [2019-09-05 13:26:12,832 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:26:12,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-05 13:26:12,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-05 13:26:12,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1021, Invalid=5459, Unknown=0, NotChecked=0, Total=6480 [2019-09-05 13:26:12,834 INFO L87 Difference]: Start difference. First operand 359 states and 386 transitions. Second operand 53 states. [2019-09-05 13:26:28,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:26:28,825 INFO L93 Difference]: Finished difference Result 426 states and 457 transitions. [2019-09-05 13:26:28,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 361 states. [2019-09-05 13:26:28,827 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 401 [2019-09-05 13:26:28,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:26:28,830 INFO L225 Difference]: With dead ends: 426 [2019-09-05 13:26:28,831 INFO L226 Difference]: Without dead ends: 426 [2019-09-05 13:26:28,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1135 GetRequests, 747 SyntacticMatches, 1 SemanticMatches, 387 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52717 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=11479, Invalid=139453, Unknown=0, NotChecked=0, Total=150932 [2019-09-05 13:26:28,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-09-05 13:26:28,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 399. [2019-09-05 13:26:28,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-09-05 13:26:28,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 428 transitions. [2019-09-05 13:26:28,846 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 428 transitions. Word has length 401 [2019-09-05 13:26:28,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:26:28,847 INFO L475 AbstractCegarLoop]: Abstraction has 399 states and 428 transitions. [2019-09-05 13:26:28,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-05 13:26:28,847 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 428 transitions. [2019-09-05 13:26:28,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2019-09-05 13:26:28,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:26:28,850 INFO L399 BasicCegarLoop]: trace histogram [322, 15, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:26:28,850 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:26:28,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:26:28,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1284109556, now seen corresponding path program 19 times [2019-09-05 13:26:28,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:26:28,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:26:28,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:26:28,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:26:28,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:26:28,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:26:29,660 INFO L134 CoverageAnalysis]: Checked inductivity of 56959 backedges. 7530 proven. 276 refuted. 0 times theorem prover too weak. 49153 trivial. 0 not checked. [2019-09-05 13:26:29,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:26:29,661 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:26:29,661 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:26:29,661 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:26:29,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:26:29,661 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:26:29,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:26:29,671 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:26:29,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:26:29,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 1207 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-05 13:26:29,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:26:30,909 INFO L134 CoverageAnalysis]: Checked inductivity of 56959 backedges. 28 proven. 52943 refuted. 0 times theorem prover too weak. 3988 trivial. 0 not checked. [2019-09-05 13:26:30,910 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:26:34,216 INFO L134 CoverageAnalysis]: Checked inductivity of 56959 backedges. 163 proven. 52808 refuted. 0 times theorem prover too weak. 3988 trivial. 0 not checked. [2019-09-05 13:26:34,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:26:34,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 32, 32] total 86 [2019-09-05 13:26:34,221 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:26:34,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-05 13:26:34,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-05 13:26:34,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1152, Invalid=6158, Unknown=0, NotChecked=0, Total=7310 [2019-09-05 13:26:34,223 INFO L87 Difference]: Start difference. First operand 399 states and 428 transitions. Second operand 56 states. [2019-09-05 13:26:57,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:26:57,049 INFO L93 Difference]: Finished difference Result 469 states and 502 transitions. [2019-09-05 13:26:57,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 401 states. [2019-09-05 13:26:57,049 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 445 [2019-09-05 13:26:57,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:26:57,052 INFO L225 Difference]: With dead ends: 469 [2019-09-05 13:26:57,052 INFO L226 Difference]: Without dead ends: 469 [2019-09-05 13:26:57,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1261 GetRequests, 831 SyntacticMatches, 1 SemanticMatches, 429 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65805 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=13557, Invalid=171773, Unknown=0, NotChecked=0, Total=185330 [2019-09-05 13:26:57,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2019-09-05 13:26:57,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 441. [2019-09-05 13:26:57,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-09-05 13:26:57,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 472 transitions. [2019-09-05 13:26:57,069 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 472 transitions. Word has length 445 [2019-09-05 13:26:57,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:26:57,070 INFO L475 AbstractCegarLoop]: Abstraction has 441 states and 472 transitions. [2019-09-05 13:26:57,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-05 13:26:57,070 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 472 transitions. [2019-09-05 13:26:57,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2019-09-05 13:26:57,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:26:57,073 INFO L399 BasicCegarLoop]: trace histogram [360, 16, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:26:57,074 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:26:57,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:26:57,074 INFO L82 PathProgramCache]: Analyzing trace with hash -941629629, now seen corresponding path program 20 times [2019-09-05 13:26:57,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:26:57,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:26:57,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:26:57,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:26:57,075 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:26:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:26:57,834 INFO L134 CoverageAnalysis]: Checked inductivity of 70905 backedges. 8795 proven. 300 refuted. 0 times theorem prover too weak. 61810 trivial. 0 not checked. [2019-09-05 13:26:57,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:26:57,835 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:26:57,835 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:26:57,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:26:57,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:26:57,835 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:26:57,845 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:26:57,845 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP)