java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-acceleration/nested_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 12:46:31,384 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 12:46:31,387 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 12:46:31,403 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 12:46:31,404 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 12:46:31,405 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 12:46:31,407 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 12:46:31,417 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 12:46:31,421 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 12:46:31,423 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 12:46:31,425 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 12:46:31,427 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 12:46:31,428 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 12:46:31,429 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 12:46:31,431 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 12:46:31,432 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 12:46:31,434 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 12:46:31,436 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 12:46:31,438 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 12:46:31,443 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 12:46:31,447 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 12:46:31,448 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 12:46:31,451 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 12:46:31,452 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 12:46:31,454 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 12:46:31,454 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 12:46:31,454 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 12:46:31,456 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 12:46:31,457 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 12:46:31,458 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 12:46:31,458 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 12:46:31,460 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 12:46:31,461 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 12:46:31,461 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 12:46:31,463 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 12:46:31,463 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 12:46:31,464 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 12:46:31,464 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 12:46:31,464 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 12:46:31,465 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 12:46:31,466 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 12:46:31,467 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 12:46:31,505 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 12:46:31,506 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 12:46:31,506 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-05 12:46:31,506 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-05 12:46:31,507 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-05 12:46:31,507 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-05 12:46:31,507 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-05 12:46:31,508 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-05 12:46:31,508 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-05 12:46:31,508 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-05 12:46:31,509 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 12:46:31,509 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 12:46:31,509 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 12:46:31,511 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 12:46:31,512 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 12:46:31,512 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 12:46:31,512 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 12:46:31,512 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 12:46:31,512 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 12:46:31,513 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 12:46:31,513 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 12:46:31,513 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-05 12:46:31,513 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 12:46:31,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 12:46:31,514 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 12:46:31,514 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 12:46:31,514 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-05 12:46:31,515 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 12:46:31,515 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 12:46:31,515 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-05 12:46:31,564 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 12:46:31,581 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 12:46:31,585 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 12:46:31,587 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 12:46:31,588 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 12:46:31,589 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/nested_1-2.c [2019-09-05 12:46:31,651 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3917b627/4644d7e56beb4359930be51bd030343f/FLAG7f63f851d [2019-09-05 12:46:32,089 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 12:46:32,089 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/nested_1-2.c [2019-09-05 12:46:32,096 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3917b627/4644d7e56beb4359930be51bd030343f/FLAG7f63f851d [2019-09-05 12:46:32,486 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3917b627/4644d7e56beb4359930be51bd030343f [2019-09-05 12:46:32,495 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 12:46:32,496 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 12:46:32,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 12:46:32,497 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 12:46:32,502 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 12:46:32,503 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 12:46:32" (1/1) ... [2019-09-05 12:46:32,506 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19027eb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:32, skipping insertion in model container [2019-09-05 12:46:32,506 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 12:46:32" (1/1) ... [2019-09-05 12:46:32,513 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 12:46:32,531 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 12:46:32,692 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 12:46:32,696 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 12:46:32,710 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 12:46:32,723 INFO L192 MainTranslator]: Completed translation [2019-09-05 12:46:32,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:32 WrapperNode [2019-09-05 12:46:32,724 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 12:46:32,724 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 12:46:32,725 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 12:46:32,725 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 12:46:32,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:32" (1/1) ... [2019-09-05 12:46:32,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:32" (1/1) ... [2019-09-05 12:46:32,823 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:32" (1/1) ... [2019-09-05 12:46:32,824 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:32" (1/1) ... [2019-09-05 12:46:32,827 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:32" (1/1) ... [2019-09-05 12:46:32,832 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:32" (1/1) ... [2019-09-05 12:46:32,833 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:32" (1/1) ... [2019-09-05 12:46:32,834 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 12:46:32,835 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 12:46:32,835 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 12:46:32,835 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 12:46:32,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:32" (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 12:46:32,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 12:46:32,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 12:46:32,888 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 12:46:32,889 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 12:46:32,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 12:46:32,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 12:46:32,889 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 12:46:32,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 12:46:32,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 12:46:33,044 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 12:46:33,045 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-05 12:46:33,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 12:46:33 BoogieIcfgContainer [2019-09-05 12:46:33,046 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 12:46:33,047 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 12:46:33,047 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 12:46:33,051 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 12:46:33,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 12:46:32" (1/3) ... [2019-09-05 12:46:33,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aee3e1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 12:46:33, skipping insertion in model container [2019-09-05 12:46:33,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:32" (2/3) ... [2019-09-05 12:46:33,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aee3e1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 12:46:33, skipping insertion in model container [2019-09-05 12:46:33,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 12:46:33" (3/3) ... [2019-09-05 12:46:33,054 INFO L109 eAbstractionObserver]: Analyzing ICFG nested_1-2.c [2019-09-05 12:46:33,083 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 12:46:33,095 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 12:46:33,140 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 12:46:33,179 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 12:46:33,179 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-05 12:46:33,179 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 12:46:33,179 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 12:46:33,179 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 12:46:33,180 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 12:46:33,180 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 12:46:33,180 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 12:46:33,196 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-09-05 12:46:33,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 12:46:33,204 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:33,205 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:33,207 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:33,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:33,212 INFO L82 PathProgramCache]: Analyzing trace with hash -873786703, now seen corresponding path program 1 times [2019-09-05 12:46:33,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:33,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:33,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:33,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:33,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:33,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:33,418 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 12:46:33,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:33,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 12:46:33,421 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:33,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 12:46:33,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 12:46:33,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 12:46:33,445 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-09-05 12:46:33,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:33,481 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-09-05 12:46:33,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 12:46:33,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-05 12:46:33,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:33,496 INFO L225 Difference]: With dead ends: 22 [2019-09-05 12:46:33,497 INFO L226 Difference]: Without dead ends: 16 [2019-09-05 12:46:33,500 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 12:46:33,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-05 12:46:33,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2019-09-05 12:46:33,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-05 12:46:33,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-09-05 12:46:33,544 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2019-09-05 12:46:33,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:33,544 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-09-05 12:46:33,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 12:46:33,545 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-09-05 12:46:33,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-05 12:46:33,547 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:33,548 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:33,549 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:33,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:33,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1621360120, now seen corresponding path program 1 times [2019-09-05 12:46:33,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:33,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:33,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:33,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:33,554 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:33,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:33,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:33,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:33,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 12:46:33,665 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:33,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 12:46:33,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 12:46:33,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 12:46:33,668 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 3 states. [2019-09-05 12:46:33,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:33,686 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-09-05 12:46:33,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 12:46:33,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-09-05 12:46:33,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:33,690 INFO L225 Difference]: With dead ends: 15 [2019-09-05 12:46:33,691 INFO L226 Difference]: Without dead ends: 15 [2019-09-05 12:46:33,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 12:46:33,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-09-05 12:46:33,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-09-05 12:46:33,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-05 12:46:33,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-09-05 12:46:33,697 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2019-09-05 12:46:33,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:33,699 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-09-05 12:46:33,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 12:46:33,699 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-09-05 12:46:33,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-05 12:46:33,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:33,700 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:33,700 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:33,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:33,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1574756514, now seen corresponding path program 1 times [2019-09-05 12:46:33,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:33,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:33,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:33,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:33,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:33,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:33,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:33,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:33,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:33,803 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2019-09-05 12:46:33,805 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [20], [22], [26], [32], [35], [37], [43], [44], [45], [47] [2019-09-05 12:46:33,839 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 12:46:33,839 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 12:46:33,907 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-05 12:46:34,441 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 12:46:34,444 INFO L272 AbstractInterpreter]: Visited 14 different actions 98 times. Merged at 5 different actions 38 times. Widened at 3 different actions 14 times. Performed 206 root evaluator evaluations with a maximum evaluation depth of 13. Performed 206 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 12 fixpoints after 3 different actions. Largest state had 4 variables. [2019-09-05 12:46:34,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:34,449 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 12:46:34,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:34,450 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:46:34,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:34,469 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 12:46:34,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:34,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-05 12:46:34,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:34,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:34,537 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:34,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 12:46:34,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:34,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 9 [2019-09-05 12:46:34,591 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:34,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 12:46:34,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 12:46:34,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-05 12:46:34,593 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 7 states. [2019-09-05 12:46:34,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:34,691 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-09-05 12:46:34,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-05 12:46:34,692 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-09-05 12:46:34,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:34,693 INFO L225 Difference]: With dead ends: 25 [2019-09-05 12:46:34,693 INFO L226 Difference]: Without dead ends: 25 [2019-09-05 12:46:34,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-09-05 12:46:34,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-05 12:46:34,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2019-09-05 12:46:34,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-05 12:46:34,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-09-05 12:46:34,698 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 14 [2019-09-05 12:46:34,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:34,698 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-09-05 12:46:34,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 12:46:34,698 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-09-05 12:46:34,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-05 12:46:34,699 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:34,699 INFO L399 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:34,700 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:34,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:34,700 INFO L82 PathProgramCache]: Analyzing trace with hash 93409041, now seen corresponding path program 2 times [2019-09-05 12:46:34,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:34,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:34,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:34,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:34,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:34,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:34,780 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-05 12:46:34,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:34,781 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:34,781 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:46:34,782 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:46:34,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:34,782 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:46:34,795 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:46:34,796 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 12:46:34,819 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-05 12:46:34,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:46:34,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-05 12:46:34,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:34,923 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:34,923 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:34,977 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-05 12:46:34,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:34,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 5] total 15 [2019-09-05 12:46:34,981 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:34,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-05 12:46:34,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-05 12:46:34,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2019-09-05 12:46:34,983 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 12 states. [2019-09-05 12:46:35,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:35,156 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2019-09-05 12:46:35,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-05 12:46:35,157 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-09-05 12:46:35,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:35,158 INFO L225 Difference]: With dead ends: 34 [2019-09-05 12:46:35,158 INFO L226 Difference]: Without dead ends: 34 [2019-09-05 12:46:35,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2019-09-05 12:46:35,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-05 12:46:35,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2019-09-05 12:46:35,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-05 12:46:35,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-09-05 12:46:35,164 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 20 [2019-09-05 12:46:35,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:35,164 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-09-05 12:46:35,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-05 12:46:35,164 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-09-05 12:46:35,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-05 12:46:35,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:35,165 INFO L399 BasicCegarLoop]: trace histogram [9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:35,166 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:35,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:35,166 INFO L82 PathProgramCache]: Analyzing trace with hash 50981508, now seen corresponding path program 3 times [2019-09-05 12:46:35,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:35,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:35,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:46:35,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:35,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:35,312 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 35 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-05 12:46:35,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:35,313 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:35,313 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:46:35,313 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:46:35,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:35,314 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 12:46:35,328 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:46:35,328 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 12:46:35,347 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:46:35,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:46:35,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-05 12:46:35,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:35,457 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-05 12:46:35,457 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:35,551 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-05 12:46:35,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:35,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 17 [2019-09-05 12:46:35,554 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:35,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-05 12:46:35,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-05 12:46:35,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2019-09-05 12:46:35,556 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 13 states. [2019-09-05 12:46:35,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:35,948 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2019-09-05 12:46:35,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-05 12:46:35,949 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2019-09-05 12:46:35,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:35,950 INFO L225 Difference]: With dead ends: 45 [2019-09-05 12:46:35,950 INFO L226 Difference]: Without dead ends: 45 [2019-09-05 12:46:35,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=674, Unknown=0, NotChecked=0, Total=870 [2019-09-05 12:46:35,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-05 12:46:35,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2019-09-05 12:46:35,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-05 12:46:35,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-09-05 12:46:35,957 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 28 [2019-09-05 12:46:35,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:35,957 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-09-05 12:46:35,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-05 12:46:35,957 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-09-05 12:46:35,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-05 12:46:35,959 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:35,959 INFO L399 BasicCegarLoop]: trace histogram [16, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:35,959 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:35,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:35,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1027694321, now seen corresponding path program 4 times [2019-09-05 12:46:35,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:35,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:35,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:46:35,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:35,961 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:35,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:36,091 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 79 proven. 10 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-05 12:46:36,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:36,092 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:36,092 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:46:36,093 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:46:36,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:36,093 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 12:46:36,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:36,117 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 12:46:36,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:36,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-05 12:46:36,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:36,276 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-05 12:46:36,277 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:36,394 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 166 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-05 12:46:36,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:36,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 7] total 21 [2019-09-05 12:46:36,399 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:36,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-05 12:46:36,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-05 12:46:36,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-09-05 12:46:36,401 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 16 states. [2019-09-05 12:46:36,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:36,924 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2019-09-05 12:46:36,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-05 12:46:36,925 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2019-09-05 12:46:36,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:36,926 INFO L225 Difference]: With dead ends: 58 [2019-09-05 12:46:36,926 INFO L226 Difference]: Without dead ends: 58 [2019-09-05 12:46:36,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=1397, Unknown=0, NotChecked=0, Total=1722 [2019-09-05 12:46:36,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-05 12:46:36,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2019-09-05 12:46:36,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-05 12:46:36,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2019-09-05 12:46:36,933 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 38 [2019-09-05 12:46:36,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:36,933 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2019-09-05 12:46:36,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-05 12:46:36,934 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2019-09-05 12:46:36,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-05 12:46:36,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:36,935 INFO L399 BasicCegarLoop]: trace histogram [25, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:36,936 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:36,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:36,936 INFO L82 PathProgramCache]: Analyzing trace with hash 79747558, now seen corresponding path program 5 times [2019-09-05 12:46:36,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:36,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:36,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:36,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:36,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:37,088 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 149 proven. 15 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2019-09-05 12:46:37,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:37,089 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:37,089 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:46:37,089 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:46:37,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:37,089 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 12:46:37,112 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:46:37,113 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 12:46:37,415 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-05 12:46:37,415 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:46:37,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-05 12:46:37,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:37,465 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 149 proven. 15 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2019-09-05 12:46:37,466 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:37,597 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 149 proven. 15 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2019-09-05 12:46:37,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:37,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-09-05 12:46:37,602 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:37,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-05 12:46:37,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-05 12:46:37,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-09-05 12:46:37,603 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 9 states. [2019-09-05 12:46:37,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:37,672 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2019-09-05 12:46:37,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 12:46:37,675 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2019-09-05 12:46:37,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:37,676 INFO L225 Difference]: With dead ends: 56 [2019-09-05 12:46:37,676 INFO L226 Difference]: Without dead ends: 56 [2019-09-05 12:46:37,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-09-05 12:46:37,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-05 12:46:37,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-09-05 12:46:37,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-05 12:46:37,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2019-09-05 12:46:37,682 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 50 [2019-09-05 12:46:37,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:37,683 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2019-09-05 12:46:37,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-05 12:46:37,683 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2019-09-05 12:46:37,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-05 12:46:37,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:37,684 INFO L399 BasicCegarLoop]: trace histogram [30, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:37,684 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:37,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:37,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1763701256, now seen corresponding path program 6 times [2019-09-05 12:46:37,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:37,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:37,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:46:37,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:37,686 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:37,800 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 201 proven. 21 refuted. 0 times theorem prover too weak. 398 trivial. 0 not checked. [2019-09-05 12:46:37,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:37,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:37,801 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:46:37,801 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:46:37,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:37,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:46:37,814 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:46:37,815 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 12:46:37,847 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:46:37,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:46:37,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-05 12:46:37,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:38,018 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 0 proven. 536 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-05 12:46:38,018 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:38,443 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 6 proven. 530 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:46:38,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:38,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 14] total 33 [2019-09-05 12:46:38,449 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:38,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-05 12:46:38,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-05 12:46:38,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=818, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 12:46:38,450 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 21 states. [2019-09-05 12:46:39,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:39,634 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2019-09-05 12:46:39,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-05 12:46:39,634 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 55 [2019-09-05 12:46:39,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:39,635 INFO L225 Difference]: With dead ends: 80 [2019-09-05 12:46:39,635 INFO L226 Difference]: Without dead ends: 80 [2019-09-05 12:46:39,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1065 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=880, Invalid=3812, Unknown=0, NotChecked=0, Total=4692 [2019-09-05 12:46:39,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-05 12:46:39,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2019-09-05 12:46:39,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-05 12:46:39,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2019-09-05 12:46:39,643 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 55 [2019-09-05 12:46:39,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:39,644 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2019-09-05 12:46:39,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-05 12:46:39,644 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2019-09-05 12:46:39,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-05 12:46:39,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:39,645 INFO L399 BasicCegarLoop]: trace histogram [42, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:39,645 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:39,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:39,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1703496983, now seen corresponding path program 7 times [2019-09-05 12:46:39,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:39,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:39,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:46:39,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:39,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:39,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:39,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 326 proven. 28 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2019-09-05 12:46:39,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:39,776 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:39,776 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:46:39,776 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:46:39,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:39,776 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:46:39,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:39,791 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 12:46:39,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:39,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-05 12:46:39,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:40,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-09-05 12:46:40,033 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:40,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 7 proven. 1017 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-09-05 12:46:40,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:40,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 16, 16] total 38 [2019-09-05 12:46:40,601 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:40,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-05 12:46:40,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-05 12:46:40,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=1096, Unknown=0, NotChecked=0, Total=1406 [2019-09-05 12:46:40,603 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 24 states. [2019-09-05 12:46:42,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:42,215 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2019-09-05 12:46:42,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-05 12:46:42,216 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 70 [2019-09-05 12:46:42,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:42,217 INFO L225 Difference]: With dead ends: 98 [2019-09-05 12:46:42,217 INFO L226 Difference]: Without dead ends: 98 [2019-09-05 12:46:42,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1813 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1283, Invalid=6199, Unknown=0, NotChecked=0, Total=7482 [2019-09-05 12:46:42,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-05 12:46:42,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2019-09-05 12:46:42,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-05 12:46:42,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2019-09-05 12:46:42,245 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 70 [2019-09-05 12:46:42,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:42,245 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2019-09-05 12:46:42,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-05 12:46:42,245 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2019-09-05 12:46:42,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-05 12:46:42,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:42,249 INFO L399 BasicCegarLoop]: trace histogram [56, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:42,249 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:42,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:42,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1048409624, now seen corresponding path program 8 times [2019-09-05 12:46:42,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:42,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:42,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:42,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:42,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:42,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:42,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 493 proven. 36 refuted. 0 times theorem prover too weak. 1473 trivial. 0 not checked. [2019-09-05 12:46:42,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:42,458 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:42,459 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:46:42,459 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:46:42,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:42,459 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) [2019-09-05 12:46:42,481 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:46:42,481 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:46:42,671 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-05 12:46:42,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:46:42,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-05 12:46:42,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:42,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 493 proven. 36 refuted. 0 times theorem prover too weak. 1473 trivial. 0 not checked. [2019-09-05 12:46:42,705 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:42,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 493 proven. 36 refuted. 0 times theorem prover too weak. 1473 trivial. 0 not checked. [2019-09-05 12:46:42,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:42,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-09-05 12:46:42,881 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:42,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-05 12:46:42,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-05 12:46:42,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2019-09-05 12:46:42,882 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 12 states. [2019-09-05 12:46:42,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:42,965 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2019-09-05 12:46:42,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-05 12:46:42,969 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 87 [2019-09-05 12:46:42,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:42,970 INFO L225 Difference]: With dead ends: 95 [2019-09-05 12:46:42,970 INFO L226 Difference]: Without dead ends: 95 [2019-09-05 12:46:42,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2019-09-05 12:46:42,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-09-05 12:46:42,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-09-05 12:46:42,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-05 12:46:42,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2019-09-05 12:46:42,990 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 87 [2019-09-05 12:46:42,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:42,991 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2019-09-05 12:46:42,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-05 12:46:42,991 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2019-09-05 12:46:42,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-05 12:46:42,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:42,992 INFO L399 BasicCegarLoop]: trace histogram [63, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:42,993 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:42,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:42,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1289232840, now seen corresponding path program 9 times [2019-09-05 12:46:42,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:42,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:42,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:46:42,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:42,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:43,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2464 backedges. 607 proven. 45 refuted. 0 times theorem prover too weak. 1812 trivial. 0 not checked. [2019-09-05 12:46:43,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:43,195 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:43,196 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:46:43,196 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:46:43,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:43,196 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 12:46:43,206 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:46:43,207 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 12:46:43,277 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:46:43,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:46:43,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-05 12:46:43,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:43,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2464 backedges. 0 proven. 2193 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2019-09-05 12:46:43,538 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:44,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2464 backedges. 16 proven. 2177 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:46:44,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:44,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 18] total 44 [2019-09-05 12:46:44,294 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:44,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-05 12:46:44,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-05 12:46:44,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=1489, Unknown=0, NotChecked=0, Total=1892 [2019-09-05 12:46:44,296 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand 28 states. [2019-09-05 12:46:47,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:47,126 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2019-09-05 12:46:47,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-09-05 12:46:47,126 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 94 [2019-09-05 12:46:47,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:47,127 INFO L225 Difference]: With dead ends: 127 [2019-09-05 12:46:47,127 INFO L226 Difference]: Without dead ends: 127 [2019-09-05 12:46:47,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3512 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1979, Invalid=11361, Unknown=0, NotChecked=0, Total=13340 [2019-09-05 12:46:47,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-09-05 12:46:47,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-09-05 12:46:47,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-05 12:46:47,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2019-09-05 12:46:47,139 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 123 transitions. Word has length 94 [2019-09-05 12:46:47,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:47,139 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 123 transitions. [2019-09-05 12:46:47,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-05 12:46:47,139 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2019-09-05 12:46:47,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-05 12:46:47,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:47,141 INFO L399 BasicCegarLoop]: trace histogram [80, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:47,141 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:47,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:47,142 INFO L82 PathProgramCache]: Analyzing trace with hash -352579535, now seen corresponding path program 10 times [2019-09-05 12:46:47,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:47,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:47,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:46:47,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:47,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:47,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:47,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3892 backedges. 0 proven. 3452 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2019-09-05 12:46:47,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:47,348 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:47,348 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:46:47,348 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:46:47,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:47,348 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:46:47,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:47,367 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:46:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:47,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-05 12:46:47,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:47,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3892 backedges. 0 proven. 3506 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2019-09-05 12:46:47,661 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:48,464 INFO L134 CoverageAnalysis]: Checked inductivity of 3892 backedges. 18 proven. 3488 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:46:48,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:48,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 20, 20] total 39 [2019-09-05 12:46:48,477 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:48,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-05 12:46:48,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-05 12:46:48,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=1029, Unknown=0, NotChecked=0, Total=1482 [2019-09-05 12:46:48,478 INFO L87 Difference]: Start difference. First operand 115 states and 123 transitions. Second operand 21 states. [2019-09-05 12:46:48,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:48,973 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2019-09-05 12:46:48,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-05 12:46:48,973 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 114 [2019-09-05 12:46:48,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:48,976 INFO L225 Difference]: With dead ends: 140 [2019-09-05 12:46:48,976 INFO L226 Difference]: Without dead ends: 140 [2019-09-05 12:46:48,977 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 200 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=453, Invalid=1029, Unknown=0, NotChecked=0, Total=1482 [2019-09-05 12:46:48,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-09-05 12:46:48,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 128. [2019-09-05 12:46:48,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-09-05 12:46:48,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2019-09-05 12:46:48,983 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 114 [2019-09-05 12:46:48,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:48,984 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2019-09-05 12:46:48,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-05 12:46:48,984 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2019-09-05 12:46:48,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-05 12:46:48,985 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:48,986 INFO L399 BasicCegarLoop]: trace histogram [90, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:48,986 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:48,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:48,986 INFO L82 PathProgramCache]: Analyzing trace with hash -535987528, now seen corresponding path program 11 times [2019-09-05 12:46:48,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:48,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:48,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:48,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:48,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:49,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:49,253 INFO L134 CoverageAnalysis]: Checked inductivity of 4932 backedges. 0 proven. 4437 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-09-05 12:46:49,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:49,253 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:49,254 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:46:49,254 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:46:49,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:49,254 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 12:46:49,280 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:46:49,281 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 12:48:28,649 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-09-05 12:48:28,649 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:48:29,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-05 12:48:29,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:48:29,748 INFO L134 CoverageAnalysis]: Checked inductivity of 4932 backedges. 0 proven. 4546 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2019-09-05 12:48:29,748 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:48:30,460 INFO L134 CoverageAnalysis]: Checked inductivity of 4932 backedges. 10 proven. 4482 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2019-09-05 12:48:30,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:48:30,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 31, 22] total 52 [2019-09-05 12:48:30,469 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:48:30,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-05 12:48:30,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-05 12:48:30,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=759, Invalid=1893, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 12:48:30,470 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand 32 states. [2019-09-05 12:48:31,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:48:31,373 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2019-09-05 12:48:31,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-05 12:48:31,374 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 127 [2019-09-05 12:48:31,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:48:31,376 INFO L225 Difference]: With dead ends: 153 [2019-09-05 12:48:31,376 INFO L226 Difference]: Without dead ends: 153 [2019-09-05 12:48:31,377 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 214 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=759, Invalid=1893, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 12:48:31,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-09-05 12:48:31,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 141. [2019-09-05 12:48:31,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-09-05 12:48:31,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 151 transitions. [2019-09-05 12:48:31,383 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 151 transitions. Word has length 127 [2019-09-05 12:48:31,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:48:31,383 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 151 transitions. [2019-09-05 12:48:31,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-05 12:48:31,384 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 151 transitions. [2019-09-05 12:48:31,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-05 12:48:31,385 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:48:31,385 INFO L399 BasicCegarLoop]: trace histogram [100, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:48:31,386 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:48:31,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:48:31,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1611506577, now seen corresponding path program 12 times [2019-09-05 12:48:31,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:48:31,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:48:31,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:48:31,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:48:31,387 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:48:31,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:48:31,650 INFO L134 CoverageAnalysis]: Checked inductivity of 6095 backedges. 0 proven. 5545 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2019-09-05 12:48:31,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:48:31,650 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:48:31,650 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:48:31,651 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:48:31,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:48:31,651 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:48:31,662 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:48:31,662 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 12:48:31,733 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:48:31,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:48:31,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-05 12:48:31,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:48:32,011 INFO L134 CoverageAnalysis]: Checked inductivity of 6095 backedges. 0 proven. 5600 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-09-05 12:48:32,012 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:48:32,315 INFO L134 CoverageAnalysis]: Checked inductivity of 6095 backedges. 0 proven. 5545 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2019-09-05 12:48:32,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:48:32,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 23, 13] total 35 [2019-09-05 12:48:32,319 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:48:32,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-05 12:48:32,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-05 12:48:32,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=850, Unknown=0, NotChecked=0, Total=1190 [2019-09-05 12:48:32,321 INFO L87 Difference]: Start difference. First operand 141 states and 151 transitions. Second operand 24 states. [2019-09-05 12:48:32,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:48:32,828 INFO L93 Difference]: Finished difference Result 166 states and 178 transitions. [2019-09-05 12:48:32,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-05 12:48:32,828 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 140 [2019-09-05 12:48:32,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:48:32,830 INFO L225 Difference]: With dead ends: 166 [2019-09-05 12:48:32,830 INFO L226 Difference]: Without dead ends: 166 [2019-09-05 12:48:32,831 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 258 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=340, Invalid=850, Unknown=0, NotChecked=0, Total=1190 [2019-09-05 12:48:32,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-09-05 12:48:32,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 154. [2019-09-05 12:48:32,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-09-05 12:48:32,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 165 transitions. [2019-09-05 12:48:32,836 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 165 transitions. Word has length 140 [2019-09-05 12:48:32,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:48:32,836 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 165 transitions. [2019-09-05 12:48:32,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-05 12:48:32,836 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 165 transitions. [2019-09-05 12:48:32,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-05 12:48:32,838 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:48:32,839 INFO L399 BasicCegarLoop]: trace histogram [110, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:48:32,839 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:48:32,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:48:32,839 INFO L82 PathProgramCache]: Analyzing trace with hash -57777320, now seen corresponding path program 13 times [2019-09-05 12:48:32,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:48:32,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:48:32,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:48:32,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:48:32,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:48:32,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:48:33,218 INFO L134 CoverageAnalysis]: Checked inductivity of 7381 backedges. 0 proven. 6776 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2019-09-05 12:48:33,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:48:33,219 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:48:33,219 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:48:33,219 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:48:33,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:48:33,219 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:48:33,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:48:33,244 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 12:48:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:48:33,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-05 12:48:33,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:48:33,396 INFO L134 CoverageAnalysis]: Checked inductivity of 7381 backedges. 0 proven. 6776 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2019-09-05 12:48:33,397 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:48:33,849 INFO L134 CoverageAnalysis]: Checked inductivity of 7381 backedges. 0 proven. 6776 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2019-09-05 12:48:33,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:48:33,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-09-05 12:48:33,852 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:48:33,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-05 12:48:33,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-05 12:48:33,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2019-09-05 12:48:33,854 INFO L87 Difference]: Start difference. First operand 154 states and 165 transitions. Second operand 15 states. [2019-09-05 12:48:34,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:48:34,099 INFO L93 Difference]: Finished difference Result 179 states and 192 transitions. [2019-09-05 12:48:34,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-05 12:48:34,099 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 153 [2019-09-05 12:48:34,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:48:34,101 INFO L225 Difference]: With dead ends: 179 [2019-09-05 12:48:34,101 INFO L226 Difference]: Without dead ends: 179 [2019-09-05 12:48:34,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 293 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2019-09-05 12:48:34,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-05 12:48:34,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 167. [2019-09-05 12:48:34,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-05 12:48:34,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 179 transitions. [2019-09-05 12:48:34,107 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 179 transitions. Word has length 153 [2019-09-05 12:48:34,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:48:34,107 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 179 transitions. [2019-09-05 12:48:34,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-05 12:48:34,108 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 179 transitions. [2019-09-05 12:48:34,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-05 12:48:34,109 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:48:34,109 INFO L399 BasicCegarLoop]: trace histogram [120, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:48:34,110 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:48:34,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:48:34,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1125925135, now seen corresponding path program 14 times [2019-09-05 12:48:34,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:48:34,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:48:34,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:48:34,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:48:34,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:48:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:48:34,508 INFO L134 CoverageAnalysis]: Checked inductivity of 8790 backedges. 0 proven. 8130 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2019-09-05 12:48:34,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:48:34,508 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:48:34,509 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:48:34,509 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:48:34,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:48:34,509 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 12:48:34,522 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:48:34,523 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:53:16,588 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-09-05 12:53:16,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:53:17,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-05 12:53:17,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:53:17,230 INFO L134 CoverageAnalysis]: Checked inductivity of 8790 backedges. 0 proven. 8130 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2019-09-05 12:53:17,230 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:53:17,649 INFO L134 CoverageAnalysis]: Checked inductivity of 8790 backedges. 0 proven. 8130 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (15)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:53:17,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:53:17,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-09-05 12:53:17,662 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:53:17,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-05 12:53:17,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-05 12:53:17,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2019-09-05 12:53:17,663 INFO L87 Difference]: Start difference. First operand 167 states and 179 transitions. Second operand 16 states. [2019-09-05 12:53:17,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:53:17,947 INFO L93 Difference]: Finished difference Result 192 states and 206 transitions. [2019-09-05 12:53:17,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-05 12:53:17,948 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 166 [2019-09-05 12:53:17,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:53:17,950 INFO L225 Difference]: With dead ends: 192 [2019-09-05 12:53:17,950 INFO L226 Difference]: Without dead ends: 192 [2019-09-05 12:53:17,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 318 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 12:53:17,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-09-05 12:53:17,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 180. [2019-09-05 12:53:17,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-05 12:53:17,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 193 transitions. [2019-09-05 12:53:17,955 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 193 transitions. Word has length 166 [2019-09-05 12:53:17,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:53:17,956 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 193 transitions. [2019-09-05 12:53:17,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-05 12:53:17,956 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 193 transitions. [2019-09-05 12:53:17,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-05 12:53:17,958 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:53:17,958 INFO L399 BasicCegarLoop]: trace histogram [130, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:53:17,958 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:53:17,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:53:17,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1024998408, now seen corresponding path program 15 times [2019-09-05 12:53:17,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:53:17,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:53:17,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:53:17,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:53:17,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:53:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:53:18,442 INFO L134 CoverageAnalysis]: Checked inductivity of 10322 backedges. 0 proven. 9607 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2019-09-05 12:53:18,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:53:18,443 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:53:18,443 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:53:18,443 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:53:18,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:53:18,444 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:53:18,465 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:53:18,465 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 12:53:18,555 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:53:18,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:53:18,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-05 12:53:18,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:53:18,634 INFO L134 CoverageAnalysis]: Checked inductivity of 10322 backedges. 0 proven. 9607 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2019-09-05 12:53:18,634 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:53:19,125 INFO L134 CoverageAnalysis]: Checked inductivity of 10322 backedges. 0 proven. 9607 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2019-09-05 12:53:19,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:53:19,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-09-05 12:53:19,128 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:53:19,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-05 12:53:19,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-05 12:53:19,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2019-09-05 12:53:19,130 INFO L87 Difference]: Start difference. First operand 180 states and 193 transitions. Second operand 17 states. [2019-09-05 12:53:19,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:53:19,465 INFO L93 Difference]: Finished difference Result 205 states and 220 transitions. [2019-09-05 12:53:19,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-05 12:53:19,466 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 179 [2019-09-05 12:53:19,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:53:19,468 INFO L225 Difference]: With dead ends: 205 [2019-09-05 12:53:19,468 INFO L226 Difference]: Without dead ends: 205 [2019-09-05 12:53:19,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 343 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2019-09-05 12:53:19,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-09-05 12:53:19,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 193. [2019-09-05 12:53:19,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-09-05 12:53:19,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 207 transitions. [2019-09-05 12:53:19,473 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 207 transitions. Word has length 179 [2019-09-05 12:53:19,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:53:19,474 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 207 transitions. [2019-09-05 12:53:19,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-05 12:53:19,474 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 207 transitions. [2019-09-05 12:53:19,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-05 12:53:19,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:53:19,475 INFO L399 BasicCegarLoop]: trace histogram [140, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:53:19,476 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:53:19,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:53:19,476 INFO L82 PathProgramCache]: Analyzing trace with hash 627335761, now seen corresponding path program 16 times [2019-09-05 12:53:19,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:53:19,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:53:19,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:53:19,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:53:19,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:53:19,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:53:19,843 INFO L134 CoverageAnalysis]: Checked inductivity of 11977 backedges. 0 proven. 11207 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2019-09-05 12:53:19,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:53:19,843 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:53:19,844 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:53:19,844 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:53:19,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:53:19,844 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:53:19,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:53:19,855 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 12:53:19,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:53:19,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-05 12:53:19,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:53:20,032 INFO L134 CoverageAnalysis]: Checked inductivity of 11977 backedges. 0 proven. 11207 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2019-09-05 12:53:20,032 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:53:20,575 INFO L134 CoverageAnalysis]: Checked inductivity of 11977 backedges. 0 proven. 11207 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2019-09-05 12:53:20,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:53:20,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-09-05 12:53:20,579 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:53:20,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-05 12:53:20,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-05 12:53:20,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 12:53:20,580 INFO L87 Difference]: Start difference. First operand 193 states and 207 transitions. Second operand 18 states. [2019-09-05 12:53:20,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:53:20,918 INFO L93 Difference]: Finished difference Result 218 states and 234 transitions. [2019-09-05 12:53:20,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-05 12:53:20,919 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 192 [2019-09-05 12:53:20,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:53:20,921 INFO L225 Difference]: With dead ends: 218 [2019-09-05 12:53:20,921 INFO L226 Difference]: Without dead ends: 218 [2019-09-05 12:53:20,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 368 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 12:53:20,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-09-05 12:53:20,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 206. [2019-09-05 12:53:20,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-05 12:53:20,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 221 transitions. [2019-09-05 12:53:20,926 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 221 transitions. Word has length 192 [2019-09-05 12:53:20,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:53:20,927 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 221 transitions. [2019-09-05 12:53:20,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-05 12:53:20,927 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 221 transitions. [2019-09-05 12:53:20,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-05 12:53:20,928 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:53:20,928 INFO L399 BasicCegarLoop]: trace histogram [150, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:53:20,928 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:53:20,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:53:20,929 INFO L82 PathProgramCache]: Analyzing trace with hash 351509656, now seen corresponding path program 17 times [2019-09-05 12:53:20,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:53:20,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:53:20,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:53:20,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:53:20,930 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:53:21,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:53:21,419 INFO L134 CoverageAnalysis]: Checked inductivity of 13755 backedges. 0 proven. 12930 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2019-09-05 12:53:21,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:53:21,420 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:53:21,420 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:53:21,421 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:53:21,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:53:21,421 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) [2019-09-05 12:53:21,447 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:53:21,447 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:00:24,104 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-09-05 13:00:24,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:00:24,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-05 13:00:24,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:00:24,733 INFO L134 CoverageAnalysis]: Checked inductivity of 13755 backedges. 0 proven. 12930 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2019-09-05 13:00:24,733 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:00:25,338 INFO L134 CoverageAnalysis]: Checked inductivity of 13755 backedges. 0 proven. 12930 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2019-09-05 13:00:25,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:00:25,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-09-05 13:00:25,349 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:00:25,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-05 13:00:25,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-05 13:00:25,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2019-09-05 13:00:25,351 INFO L87 Difference]: Start difference. First operand 206 states and 221 transitions. Second operand 19 states. [2019-09-05 13:00:25,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:00:25,764 INFO L93 Difference]: Finished difference Result 231 states and 248 transitions. [2019-09-05 13:00:25,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-05 13:00:25,764 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 205 [2019-09-05 13:00:25,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:00:25,766 INFO L225 Difference]: With dead ends: 231 [2019-09-05 13:00:25,766 INFO L226 Difference]: Without dead ends: 231 [2019-09-05 13:00:25,767 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 393 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2019-09-05 13:00:25,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-09-05 13:00:25,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 219. [2019-09-05 13:00:25,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-09-05 13:00:25,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 235 transitions. [2019-09-05 13:00:25,772 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 235 transitions. Word has length 205 [2019-09-05 13:00:25,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:00:25,773 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 235 transitions. [2019-09-05 13:00:25,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-05 13:00:25,773 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 235 transitions. [2019-09-05 13:00:25,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-05 13:00:25,774 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:00:25,775 INFO L399 BasicCegarLoop]: trace histogram [160, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:00:25,775 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:00:25,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:00:25,775 INFO L82 PathProgramCache]: Analyzing trace with hash 167087537, now seen corresponding path program 18 times [2019-09-05 13:00:25,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:00:25,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:00:25,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:00:25,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:00:25,776 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:00:25,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:00:26,219 INFO L134 CoverageAnalysis]: Checked inductivity of 15656 backedges. 0 proven. 14776 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2019-09-05 13:00:26,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:00:26,220 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:00:26,220 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:00:26,220 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:00:26,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:00:26,220 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:00:26,230 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:00:26,230 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:00:26,333 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:00:26,334 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:00:26,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-05 13:00:26,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:00:26,469 INFO L134 CoverageAnalysis]: Checked inductivity of 15656 backedges. 0 proven. 14776 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2019-09-05 13:00:26,469 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:00:27,122 INFO L134 CoverageAnalysis]: Checked inductivity of 15656 backedges. 0 proven. 14776 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2019-09-05 13:00:27,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:00:27,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-09-05 13:00:27,126 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:00:27,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-05 13:00:27,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-05 13:00:27,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2019-09-05 13:00:27,128 INFO L87 Difference]: Start difference. First operand 219 states and 235 transitions. Second operand 20 states. [2019-09-05 13:00:27,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:00:27,583 INFO L93 Difference]: Finished difference Result 244 states and 262 transitions. [2019-09-05 13:00:27,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-05 13:00:27,583 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 218 [2019-09-05 13:00:27,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:00:27,586 INFO L225 Difference]: With dead ends: 244 [2019-09-05 13:00:27,586 INFO L226 Difference]: Without dead ends: 244 [2019-09-05 13:00:27,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 418 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2019-09-05 13:00:27,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-09-05 13:00:27,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 232. [2019-09-05 13:00:27,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-09-05 13:00:27,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 249 transitions. [2019-09-05 13:00:27,592 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 249 transitions. Word has length 218 [2019-09-05 13:00:27,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:00:27,593 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 249 transitions. [2019-09-05 13:00:27,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-05 13:00:27,593 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 249 transitions. [2019-09-05 13:00:27,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-05 13:00:27,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:00:27,594 INFO L399 BasicCegarLoop]: trace histogram [170, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:00:27,594 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:00:27,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:00:27,595 INFO L82 PathProgramCache]: Analyzing trace with hash -670307016, now seen corresponding path program 19 times [2019-09-05 13:00:27,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:00:27,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:00:27,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:00:27,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:00:27,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:00:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:00:28,094 INFO L134 CoverageAnalysis]: Checked inductivity of 17680 backedges. 0 proven. 16745 refuted. 0 times theorem prover too weak. 935 trivial. 0 not checked. [2019-09-05 13:00:28,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:00:28,095 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:00:28,095 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:00:28,095 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:00:28,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:00:28,095 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) [2019-09-05 13:00:28,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:00:28,114 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:00:28,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:00:28,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-05 13:00:28,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:00:28,398 INFO L134 CoverageAnalysis]: Checked inductivity of 17680 backedges. 0 proven. 16745 refuted. 0 times theorem prover too weak. 935 trivial. 0 not checked. [2019-09-05 13:00:28,398 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:00:29,144 INFO L134 CoverageAnalysis]: Checked inductivity of 17680 backedges. 0 proven. 16745 refuted. 0 times theorem prover too weak. 935 trivial. 0 not checked. [2019-09-05 13:00:29,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:00:29,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-09-05 13:00:29,149 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:00:29,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-05 13:00:29,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-05 13:00:29,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2019-09-05 13:00:29,150 INFO L87 Difference]: Start difference. First operand 232 states and 249 transitions. Second operand 21 states. [2019-09-05 13:00:29,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:00:29,640 INFO L93 Difference]: Finished difference Result 257 states and 276 transitions. [2019-09-05 13:00:29,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-05 13:00:29,641 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 231 [2019-09-05 13:00:29,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:00:29,643 INFO L225 Difference]: With dead ends: 257 [2019-09-05 13:00:29,643 INFO L226 Difference]: Without dead ends: 257 [2019-09-05 13:00:29,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 443 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2019-09-05 13:00:29,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-09-05 13:00:29,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 245. [2019-09-05 13:00:29,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-09-05 13:00:29,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 263 transitions. [2019-09-05 13:00:29,649 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 263 transitions. Word has length 231 [2019-09-05 13:00:29,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:00:29,650 INFO L475 AbstractCegarLoop]: Abstraction has 245 states and 263 transitions. [2019-09-05 13:00:29,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-05 13:00:29,650 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 263 transitions. [2019-09-05 13:00:29,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-05 13:00:29,651 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:00:29,652 INFO L399 BasicCegarLoop]: trace histogram [180, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:00:29,652 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:00:29,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:00:29,652 INFO L82 PathProgramCache]: Analyzing trace with hash -2021834479, now seen corresponding path program 20 times [2019-09-05 13:00:29,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:00:29,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:00:29,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:00:29,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:00:29,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:00:29,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:00:30,415 INFO L134 CoverageAnalysis]: Checked inductivity of 19827 backedges. 0 proven. 18837 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-09-05 13:00:30,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:00:30,416 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:00:30,416 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:00:30,417 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:00:30,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:00:30,417 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:00:30,454 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:00:30,454 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP)