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-industry-pattern/nested-3.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:32:18,485 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:32:18,487 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:32:18,499 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:32:18,499 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:32:18,501 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:32:18,503 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:32:18,509 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:32:18,514 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:32:18,514 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:32:18,515 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:32:18,517 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:32:18,518 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:32:18,519 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:32:18,520 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:32:18,523 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:32:18,524 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:32:18,525 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:32:18,529 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:32:18,531 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:32:18,534 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:32:18,536 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:32:18,539 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:32:18,540 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:32:18,544 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:32:18,544 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:32:18,544 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:32:18,547 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:32:18,548 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:32:18,549 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:32:18,549 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:32:18,550 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:32:18,552 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:32:18,552 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:32:18,555 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:32:18,556 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:32:18,556 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:32:18,557 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:32:18,557 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:32:18,558 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:32:18,559 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:32:18,560 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 02:32:18,578 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:32:18,579 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:32:18,579 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:32:18,579 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:32:18,580 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:32:18,580 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:32:18,580 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:32:18,580 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:32:18,581 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:32:18,581 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:32:18,581 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:32:18,582 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:32:18,582 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:32:18,582 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:32:18,582 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:32:18,582 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:32:18,583 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:32:18,583 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:32:18,583 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:32:18,583 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:32:18,583 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:32:18,584 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:32:18,584 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:32:18,584 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:32:18,584 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:32:18,584 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:32:18,585 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:32:18,585 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:32:18,585 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:32:18,585 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:32:18,621 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:32:18,637 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:32:18,642 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:32:18,644 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:32:18,644 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:32:18,645 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-industry-pattern/nested-3.c [2019-10-03 02:32:18,713 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d33327a6/6d98d6c8f24a422aa456591c4e85550e/FLAG8dda389fb [2019-10-03 02:32:19,159 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:32:19,160 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/nested-3.c [2019-10-03 02:32:19,166 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d33327a6/6d98d6c8f24a422aa456591c4e85550e/FLAG8dda389fb [2019-10-03 02:32:19,532 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d33327a6/6d98d6c8f24a422aa456591c4e85550e [2019-10-03 02:32:19,545 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:32:19,547 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:32:19,548 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:32:19,548 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:32:19,552 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:32:19,553 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:32:19" (1/1) ... [2019-10-03 02:32:19,556 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f5c2100 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:19, skipping insertion in model container [2019-10-03 02:32:19,556 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:32:19" (1/1) ... [2019-10-03 02:32:19,563 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:32:19,576 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:32:19,747 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:32:19,753 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:32:19,774 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:32:19,785 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:32:19,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:19 WrapperNode [2019-10-03 02:32:19,786 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:32:19,786 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:32:19,786 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:32:19,787 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:32:19,878 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:19" (1/1) ... [2019-10-03 02:32:19,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:19" (1/1) ... [2019-10-03 02:32:19,884 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:19" (1/1) ... [2019-10-03 02:32:19,884 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:19" (1/1) ... [2019-10-03 02:32:19,888 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:19" (1/1) ... [2019-10-03 02:32:19,893 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:19" (1/1) ... [2019-10-03 02:32:19,894 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:19" (1/1) ... [2019-10-03 02:32:19,896 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:32:19,896 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:32:19,896 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:32:19,897 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:32:19,897 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:19" (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-10-03 02:32:19,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:32:19,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:32:19,959 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-03 02:32:19,960 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:32:19,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:32:19,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:32:19,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-03 02:32:19,960 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:32:19,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:32:19,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:32:20,172 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:32:20,172 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-03 02:32:20,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:32:20 BoogieIcfgContainer [2019-10-03 02:32:20,174 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:32:20,175 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:32:20,175 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:32:20,178 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:32:20,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:32:19" (1/3) ... [2019-10-03 02:32:20,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e579e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:32:20, skipping insertion in model container [2019-10-03 02:32:20,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:19" (2/3) ... [2019-10-03 02:32:20,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e579e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:32:20, skipping insertion in model container [2019-10-03 02:32:20,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:32:20" (3/3) ... [2019-10-03 02:32:20,182 INFO L109 eAbstractionObserver]: Analyzing ICFG nested-3.c [2019-10-03 02:32:20,202 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:32:20,220 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:32:20,261 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:32:20,295 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:32:20,296 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:32:20,296 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:32:20,296 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:32:20,296 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:32:20,296 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:32:20,296 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:32:20,297 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:32:20,315 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-10-03 02:32:20,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-03 02:32:20,325 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:20,326 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:20,330 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:20,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:20,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1419324422, now seen corresponding path program 1 times [2019-10-03 02:32:20,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:20,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:20,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:20,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:20,388 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:20,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:20,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:20,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:20,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:32:20,496 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:20,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:32:20,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:32:20,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:32:20,517 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2019-10-03 02:32:20,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:20,585 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2019-10-03 02:32:20,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:32:20,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-03 02:32:20,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:20,596 INFO L225 Difference]: With dead ends: 23 [2019-10-03 02:32:20,596 INFO L226 Difference]: Without dead ends: 23 [2019-10-03 02:32:20,598 INFO L640 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-10-03 02:32:20,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-03 02:32:20,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2019-10-03 02:32:20,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-03 02:32:20,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-10-03 02:32:20,636 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 14 [2019-10-03 02:32:20,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:20,637 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-10-03 02:32:20,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:32:20,638 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-10-03 02:32:20,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-03 02:32:20,638 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:20,639 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:20,639 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:20,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:20,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1519544262, now seen corresponding path program 1 times [2019-10-03 02:32:20,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:20,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:20,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:20,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:20,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:20,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:20,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:20,711 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:32:20,712 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2019-10-03 02:32:20,714 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [20], [22], [25], [29], [35], [41], [50], [53], [55], [61], [62], [63], [65] [2019-10-03 02:32:20,758 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:32:20,759 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:32:20,855 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:32:20,858 INFO L272 AbstractInterpreter]: Visited 11 different actions 14 times. Merged at 2 different actions 2 times. Never widened. Performed 25 root evaluator evaluations with a maximum evaluation depth of 4. Performed 25 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 8 variables. [2019-10-03 02:32:20,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:20,862 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:32:20,916 INFO L227 lantSequenceWeakener]: Weakened 9 states. On average, predicates are now at 61.11% of their original sizes. [2019-10-03 02:32:20,917 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:32:20,960 INFO L420 sIntCurrentIteration]: We unified 16 AI predicates to 16 [2019-10-03 02:32:20,960 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:32:20,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:32:20,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2019-10-03 02:32:20,962 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:20,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:32:20,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:32:20,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:32:20,965 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 6 states. [2019-10-03 02:32:21,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:21,232 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2019-10-03 02:32:21,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:32:21,232 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-10-03 02:32:21,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:21,235 INFO L225 Difference]: With dead ends: 30 [2019-10-03 02:32:21,235 INFO L226 Difference]: Without dead ends: 30 [2019-10-03 02:32:21,236 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:32:21,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-03 02:32:21,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-10-03 02:32:21,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-03 02:32:21,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2019-10-03 02:32:21,248 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 17 [2019-10-03 02:32:21,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:21,249 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2019-10-03 02:32:21,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:32:21,250 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2019-10-03 02:32:21,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-03 02:32:21,251 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:21,252 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:21,252 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:21,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:21,252 INFO L82 PathProgramCache]: Analyzing trace with hash -839485892, now seen corresponding path program 1 times [2019-10-03 02:32:21,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:21,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:21,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:21,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:21,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:21,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:21,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:21,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:21,333 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:32:21,333 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2019-10-03 02:32:21,334 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [20], [22], [27], [29], [35], [41], [50], [53], [55], [61], [62], [63], [65] [2019-10-03 02:32:21,337 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:32:21,337 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:32:21,371 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:32:21,372 INFO L272 AbstractInterpreter]: Visited 12 different actions 32 times. Merged at 3 different actions 15 times. Widened at 1 different actions 1 times. Performed 66 root evaluator evaluations with a maximum evaluation depth of 4. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 8 variables. [2019-10-03 02:32:21,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:21,373 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:32:21,385 INFO L227 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 53.33% of their original sizes. [2019-10-03 02:32:21,386 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:32:21,417 INFO L420 sIntCurrentIteration]: We unified 16 AI predicates to 16 [2019-10-03 02:32:21,418 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:32:21,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:32:21,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2019-10-03 02:32:21,418 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:21,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:32:21,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:32:21,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:32:21,420 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 6 states. [2019-10-03 02:32:21,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:21,530 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2019-10-03 02:32:21,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:32:21,530 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-10-03 02:32:21,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:21,532 INFO L225 Difference]: With dead ends: 34 [2019-10-03 02:32:21,532 INFO L226 Difference]: Without dead ends: 34 [2019-10-03 02:32:21,533 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:32:21,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-03 02:32:21,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2019-10-03 02:32:21,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-03 02:32:21,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2019-10-03 02:32:21,538 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 17 [2019-10-03 02:32:21,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:21,539 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2019-10-03 02:32:21,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:32:21,539 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2019-10-03 02:32:21,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-03 02:32:21,540 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:21,540 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:21,541 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:21,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:21,541 INFO L82 PathProgramCache]: Analyzing trace with hash -782227590, now seen corresponding path program 1 times [2019-10-03 02:32:21,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:21,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:21,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:21,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:21,544 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:21,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:21,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:21,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:21,578 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:32:21,578 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2019-10-03 02:32:21,578 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [20], [22], [27], [29], [37], [41], [50], [53], [55], [61], [62], [63], [65] [2019-10-03 02:32:21,580 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:32:21,580 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:32:21,597 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:32:21,598 INFO L272 AbstractInterpreter]: Visited 13 different actions 33 times. Merged at 3 different actions 15 times. Widened at 1 different actions 1 times. Performed 71 root evaluator evaluations with a maximum evaluation depth of 6. Performed 71 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 8 variables. [2019-10-03 02:32:21,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:21,598 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:32:21,612 INFO L227 lantSequenceWeakener]: Weakened 11 states. On average, predicates are now at 50% of their original sizes. [2019-10-03 02:32:21,612 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:32:21,649 INFO L420 sIntCurrentIteration]: We unified 16 AI predicates to 16 [2019-10-03 02:32:21,649 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:32:21,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:32:21,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2019-10-03 02:32:21,650 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:21,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:32:21,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:32:21,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:32:21,651 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand 7 states. [2019-10-03 02:32:21,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:21,836 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2019-10-03 02:32:21,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:32:21,836 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-10-03 02:32:21,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:21,838 INFO L225 Difference]: With dead ends: 37 [2019-10-03 02:32:21,838 INFO L226 Difference]: Without dead ends: 37 [2019-10-03 02:32:21,839 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:32:21,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-03 02:32:21,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2019-10-03 02:32:21,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-03 02:32:21,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2019-10-03 02:32:21,848 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 17 [2019-10-03 02:32:21,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:21,849 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2019-10-03 02:32:21,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:32:21,849 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2019-10-03 02:32:21,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-03 02:32:21,850 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:21,850 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:21,850 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:21,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:21,851 INFO L82 PathProgramCache]: Analyzing trace with hash -780380548, now seen corresponding path program 1 times [2019-10-03 02:32:21,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:21,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:21,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:21,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:21,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:21,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:21,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:21,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:21,881 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:32:21,881 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2019-10-03 02:32:21,882 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [20], [22], [27], [29], [37], [43], [50], [53], [55], [61], [62], [63], [65] [2019-10-03 02:32:21,884 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:32:21,884 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:32:21,912 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 02:32:21,912 INFO L272 AbstractInterpreter]: Visited 17 different actions 37 times. Merged at 3 different actions 15 times. Widened at 1 different actions 1 times. Performed 76 root evaluator evaluations with a maximum evaluation depth of 6. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 8 variables. [2019-10-03 02:32:21,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:21,914 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 02:32:21,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:21,914 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-10-03 02:32:21,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:21,934 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:32:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:21,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-03 02:32:21,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:32:21,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:21,985 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:32:22,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:22,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:32:22,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-03 02:32:22,022 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:32:22,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:32:22,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:32:22,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:32:22,025 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand 4 states. [2019-10-03 02:32:22,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:22,097 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2019-10-03 02:32:22,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:32:22,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-10-03 02:32:22,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:22,099 INFO L225 Difference]: With dead ends: 44 [2019-10-03 02:32:22,099 INFO L226 Difference]: Without dead ends: 44 [2019-10-03 02:32:22,099 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:32:22,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-03 02:32:22,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2019-10-03 02:32:22,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-03 02:32:22,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2019-10-03 02:32:22,112 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 17 [2019-10-03 02:32:22,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:22,113 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2019-10-03 02:32:22,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:32:22,113 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2019-10-03 02:32:22,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-03 02:32:22,115 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:22,115 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:22,115 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:22,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:22,116 INFO L82 PathProgramCache]: Analyzing trace with hash 231878024, now seen corresponding path program 1 times [2019-10-03 02:32:22,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:22,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:22,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:22,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:22,118 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:22,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:22,170 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-03 02:32:22,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:22,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:32:22,172 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:22,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:32:22,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:32:22,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:32:22,173 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand 3 states. [2019-10-03 02:32:22,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:22,201 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2019-10-03 02:32:22,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:32:22,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-03 02:32:22,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:22,203 INFO L225 Difference]: With dead ends: 39 [2019-10-03 02:32:22,203 INFO L226 Difference]: Without dead ends: 39 [2019-10-03 02:32:22,203 INFO L640 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-10-03 02:32:22,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-03 02:32:22,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-10-03 02:32:22,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-03 02:32:22,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2019-10-03 02:32:22,213 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 20 [2019-10-03 02:32:22,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:22,214 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2019-10-03 02:32:22,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:32:22,214 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2019-10-03 02:32:22,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-03 02:32:22,215 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:22,215 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:22,215 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:22,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:22,216 INFO L82 PathProgramCache]: Analyzing trace with hash 233725066, now seen corresponding path program 1 times [2019-10-03 02:32:22,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:22,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:22,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:22,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:22,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:22,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:22,288 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:22,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:22,289 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:32:22,289 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2019-10-03 02:32:22,289 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [20], [22], [25], [27], [29], [35], [43], [50], [53], [55], [61], [62], [63], [65] [2019-10-03 02:32:22,291 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:32:22,291 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:32:22,313 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 02:32:22,314 INFO L272 AbstractInterpreter]: Visited 18 different actions 52 times. Merged at 4 different actions 22 times. Widened at 1 different actions 1 times. Performed 119 root evaluator evaluations with a maximum evaluation depth of 6. Performed 119 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 8 fixpoints after 3 different actions. Largest state had 8 variables. [2019-10-03 02:32:22,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:22,314 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 02:32:22,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:22,315 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-10-03 02:32:22,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:22,353 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:32:22,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:22,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-03 02:32:22,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:32:22,411 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:22,412 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:32:22,479 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-10-03 02:32:22,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:32:22,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2019-10-03 02:32:22,484 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:32:22,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:32:22,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:32:22,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:32:22,485 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand 9 states. [2019-10-03 02:32:22,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:22,628 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2019-10-03 02:32:22,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:32:22,629 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-10-03 02:32:22,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:22,630 INFO L225 Difference]: With dead ends: 56 [2019-10-03 02:32:22,630 INFO L226 Difference]: Without dead ends: 56 [2019-10-03 02:32:22,631 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2019-10-03 02:32:22,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-03 02:32:22,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 45. [2019-10-03 02:32:22,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-03 02:32:22,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2019-10-03 02:32:22,640 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 20 [2019-10-03 02:32:22,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:22,641 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2019-10-03 02:32:22,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:32:22,641 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2019-10-03 02:32:22,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-03 02:32:22,642 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:22,642 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:22,643 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:22,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:22,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1592335484, now seen corresponding path program 2 times [2019-10-03 02:32:22,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:22,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:22,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:22,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:22,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:22,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:22,746 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:22,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:22,746 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:32:22,746 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:32:22,747 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:32:22,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:22,747 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-10-03 02:32:22,770 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:32:22,770 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:32:22,793 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-03 02:32:22,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:32:22,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-03 02:32:22,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:32:22,836 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-03 02:32:22,836 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:32:22,858 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-03 02:32:22,862 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:32:22,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [8] total 10 [2019-10-03 02:32:22,862 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:22,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:32:22,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:32:22,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:32:22,864 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand 4 states. [2019-10-03 02:32:22,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:22,935 INFO L93 Difference]: Finished difference Result 58 states and 75 transitions. [2019-10-03 02:32:22,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:32:22,935 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-10-03 02:32:22,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:22,936 INFO L225 Difference]: With dead ends: 58 [2019-10-03 02:32:22,937 INFO L226 Difference]: Without dead ends: 58 [2019-10-03 02:32:22,937 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:32:22,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-03 02:32:22,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 48. [2019-10-03 02:32:22,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-03 02:32:22,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2019-10-03 02:32:22,943 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 61 transitions. Word has length 23 [2019-10-03 02:32:22,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:22,943 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 61 transitions. [2019-10-03 02:32:22,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:32:22,943 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2019-10-03 02:32:22,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-03 02:32:22,946 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:22,946 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:22,946 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:22,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:22,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1647746744, now seen corresponding path program 1 times [2019-10-03 02:32:22,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:22,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:22,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:32:22,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:22,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:22,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:23,036 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:23,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:23,037 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:32:23,037 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2019-10-03 02:32:23,037 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [20], [22], [25], [27], [29], [37], [41], [50], [53], [55], [61], [62], [63], [65] [2019-10-03 02:32:23,039 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:32:23,039 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:32:23,056 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 02:32:23,056 INFO L272 AbstractInterpreter]: Visited 18 different actions 48 times. Merged at 4 different actions 20 times. Widened at 1 different actions 1 times. Performed 115 root evaluator evaluations with a maximum evaluation depth of 6. Performed 115 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 7 fixpoints after 2 different actions. Largest state had 8 variables. [2019-10-03 02:32:23,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:23,056 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 02:32:23,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:23,057 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-10-03 02:32:23,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:23,077 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-10-03 02:32:23,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:23,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-03 02:32:23,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:32:23,130 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:23,130 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:32:23,197 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:23,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:32:23,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2019-10-03 02:32:23,201 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:32:23,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:32:23,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:32:23,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2019-10-03 02:32:23,202 INFO L87 Difference]: Start difference. First operand 48 states and 61 transitions. Second operand 11 states. [2019-10-03 02:32:23,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:23,367 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2019-10-03 02:32:23,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-03 02:32:23,371 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-10-03 02:32:23,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:23,372 INFO L225 Difference]: With dead ends: 71 [2019-10-03 02:32:23,372 INFO L226 Difference]: Without dead ends: 71 [2019-10-03 02:32:23,373 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=280, Unknown=0, NotChecked=0, Total=420 [2019-10-03 02:32:23,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-03 02:32:23,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 60. [2019-10-03 02:32:23,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-03 02:32:23,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 77 transitions. [2019-10-03 02:32:23,378 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 77 transitions. Word has length 23 [2019-10-03 02:32:23,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:23,378 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 77 transitions. [2019-10-03 02:32:23,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:32:23,379 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 77 transitions. [2019-10-03 02:32:23,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-03 02:32:23,380 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:23,380 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:23,380 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:23,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:23,380 INFO L82 PathProgramCache]: Analyzing trace with hash 238911878, now seen corresponding path program 2 times [2019-10-03 02:32:23,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:23,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:23,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:23,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:23,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:23,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:23,467 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:23,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:23,468 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:32:23,468 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:32:23,468 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:32:23,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:23,468 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) [2019-10-03 02:32:23,488 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:32:23,488 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:32:23,504 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-03 02:32:23,504 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:32:23,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-03 02:32:23,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:32:23,549 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-03 02:32:23,549 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:32:23,589 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-03 02:32:23,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:32:23,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 13 [2019-10-03 02:32:23,593 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:32:23,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 02:32:23,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 02:32:23,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:32:23,597 INFO L87 Difference]: Start difference. First operand 60 states and 77 transitions. Second operand 12 states. [2019-10-03 02:32:23,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:23,955 INFO L93 Difference]: Finished difference Result 124 states and 159 transitions. [2019-10-03 02:32:23,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-03 02:32:23,955 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-10-03 02:32:23,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:23,957 INFO L225 Difference]: With dead ends: 124 [2019-10-03 02:32:23,957 INFO L226 Difference]: Without dead ends: 124 [2019-10-03 02:32:23,957 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2019-10-03 02:32:23,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-10-03 02:32:23,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 106. [2019-10-03 02:32:23,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-10-03 02:32:23,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 138 transitions. [2019-10-03 02:32:23,966 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 138 transitions. Word has length 26 [2019-10-03 02:32:23,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:23,966 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 138 transitions. [2019-10-03 02:32:23,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 02:32:23,967 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 138 transitions. [2019-10-03 02:32:23,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-03 02:32:23,968 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:23,968 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:23,968 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:23,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:23,969 INFO L82 PathProgramCache]: Analyzing trace with hash 240758920, now seen corresponding path program 1 times [2019-10-03 02:32:23,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:23,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:23,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:32:23,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:23,970 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:24,011 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:24,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:24,012 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:32:24,012 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2019-10-03 02:32:24,012 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [20], [22], [25], [27], [29], [37], [43], [50], [53], [55], [61], [62], [63], [65] [2019-10-03 02:32:24,014 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:32:24,014 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:32:24,035 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 02:32:24,035 INFO L272 AbstractInterpreter]: Visited 18 different actions 51 times. Merged at 4 different actions 21 times. Widened at 1 different actions 1 times. Performed 117 root evaluator evaluations with a maximum evaluation depth of 6. Performed 117 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 8 fixpoints after 3 different actions. Largest state had 8 variables. [2019-10-03 02:32:24,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:24,036 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 02:32:24,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:24,036 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-10-03 02:32:24,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:24,065 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:32:24,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:24,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-03 02:32:24,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:32:24,100 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:24,100 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:32:24,157 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:24,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:32:24,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2019-10-03 02:32:24,161 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:32:24,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:32:24,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:32:24,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:32:24,163 INFO L87 Difference]: Start difference. First operand 106 states and 138 transitions. Second operand 7 states. [2019-10-03 02:32:24,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:24,215 INFO L93 Difference]: Finished difference Result 194 states and 251 transitions. [2019-10-03 02:32:24,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:32:24,215 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-10-03 02:32:24,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:24,217 INFO L225 Difference]: With dead ends: 194 [2019-10-03 02:32:24,217 INFO L226 Difference]: Without dead ends: 194 [2019-10-03 02:32:24,217 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:32:24,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-10-03 02:32:24,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 133. [2019-10-03 02:32:24,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-10-03 02:32:24,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 174 transitions. [2019-10-03 02:32:24,228 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 174 transitions. Word has length 26 [2019-10-03 02:32:24,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:24,229 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 174 transitions. [2019-10-03 02:32:24,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:32:24,229 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 174 transitions. [2019-10-03 02:32:24,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-03 02:32:24,230 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:24,230 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:24,230 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:24,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:24,230 INFO L82 PathProgramCache]: Analyzing trace with hash 2055827132, now seen corresponding path program 2 times [2019-10-03 02:32:24,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:24,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:24,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:24,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:24,232 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:24,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:24,275 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:24,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:24,275 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:32:24,275 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:32:24,275 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:32:24,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:24,276 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-10-03 02:32:24,302 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:32:24,303 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:32:24,314 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-03 02:32:24,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:32:24,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-03 02:32:24,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:32:24,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:32:24,429 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-03 02:32:24,429 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:32:24,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:32:24,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:32:24,549 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-03 02:32:24,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-03 02:32:24,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [8, 8] total 21 [2019-10-03 02:32:24,555 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:24,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:32:24,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:32:24,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2019-10-03 02:32:24,557 INFO L87 Difference]: Start difference. First operand 133 states and 174 transitions. Second operand 9 states. [2019-10-03 02:32:24,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:24,653 INFO L93 Difference]: Finished difference Result 185 states and 240 transitions. [2019-10-03 02:32:24,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:32:24,653 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-10-03 02:32:24,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:24,655 INFO L225 Difference]: With dead ends: 185 [2019-10-03 02:32:24,655 INFO L226 Difference]: Without dead ends: 185 [2019-10-03 02:32:24,656 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2019-10-03 02:32:24,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-10-03 02:32:24,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2019-10-03 02:32:24,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-10-03 02:32:24,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 237 transitions. [2019-10-03 02:32:24,666 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 237 transitions. Word has length 29 [2019-10-03 02:32:24,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:24,666 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 237 transitions. [2019-10-03 02:32:24,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:32:24,666 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 237 transitions. [2019-10-03 02:32:24,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-03 02:32:24,667 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:24,667 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:24,668 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:24,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:24,668 INFO L82 PathProgramCache]: Analyzing trace with hash 604229432, now seen corresponding path program 3 times [2019-10-03 02:32:24,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:24,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:24,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:32:24,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:24,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:24,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:24,736 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 29 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:32:24,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:24,736 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:32:24,737 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:32:24,737 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:32:24,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:24,737 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-03 02:32:24,772 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-03 02:32:24,772 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:32:24,783 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-03 02:32:24,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:32:24,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-03 02:32:24,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:32:24,823 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-03 02:32:24,823 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:32:24,857 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-03 02:32:24,862 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:32:24,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [10] total 14 [2019-10-03 02:32:24,862 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:24,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:24,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:24,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:32:24,864 INFO L87 Difference]: Start difference. First operand 182 states and 237 transitions. Second operand 5 states. [2019-10-03 02:32:24,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:24,925 INFO L93 Difference]: Finished difference Result 160 states and 190 transitions. [2019-10-03 02:32:24,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:32:24,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-10-03 02:32:24,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:24,930 INFO L225 Difference]: With dead ends: 160 [2019-10-03 02:32:24,930 INFO L226 Difference]: Without dead ends: 160 [2019-10-03 02:32:24,931 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:32:24,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-10-03 02:32:24,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 121. [2019-10-03 02:32:24,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-10-03 02:32:24,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 147 transitions. [2019-10-03 02:32:24,939 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 147 transitions. Word has length 29 [2019-10-03 02:32:24,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:24,939 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 147 transitions. [2019-10-03 02:32:24,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:24,939 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 147 transitions. [2019-10-03 02:32:24,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-03 02:32:24,940 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:24,940 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:24,941 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:24,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:24,941 INFO L82 PathProgramCache]: Analyzing trace with hash -252932420, now seen corresponding path program 4 times [2019-10-03 02:32:24,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:24,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:24,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:32:24,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:24,943 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:24,999 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:25,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:25,000 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:32:25,000 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:32:25,000 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:32:25,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:25,000 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-10-03 02:32:25,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:25,029 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:32:25,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:25,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-03 02:32:25,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:32:25,058 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:25,059 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:32:25,135 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:25,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:32:25,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2019-10-03 02:32:25,139 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:32:25,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:32:25,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:32:25,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:32:25,141 INFO L87 Difference]: Start difference. First operand 121 states and 147 transitions. Second operand 8 states. [2019-10-03 02:32:25,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:25,207 INFO L93 Difference]: Finished difference Result 152 states and 184 transitions. [2019-10-03 02:32:25,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:32:25,207 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-10-03 02:32:25,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:25,208 INFO L225 Difference]: With dead ends: 152 [2019-10-03 02:32:25,208 INFO L226 Difference]: Without dead ends: 152 [2019-10-03 02:32:25,209 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:32:25,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-10-03 02:32:25,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 136. [2019-10-03 02:32:25,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-10-03 02:32:25,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 165 transitions. [2019-10-03 02:32:25,214 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 165 transitions. Word has length 29 [2019-10-03 02:32:25,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:25,214 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 165 transitions. [2019-10-03 02:32:25,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:32:25,214 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 165 transitions. [2019-10-03 02:32:25,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-03 02:32:25,215 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:25,215 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:25,216 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:25,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:25,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1328098874, now seen corresponding path program 5 times [2019-10-03 02:32:25,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:25,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:25,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:25,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:25,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:25,267 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:25,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:25,268 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:32:25,268 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:32:25,268 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:32:25,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:25,268 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:32:25,299 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:32:25,299 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:32:25,312 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-03 02:32:25,312 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:32:25,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-03 02:32:25,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:32:25,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:32:25,427 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-03 02:32:25,427 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:32:25,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:32:25,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:32:25,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:32:25,582 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-03 02:32:25,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-03 02:32:25,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 23 [2019-10-03 02:32:25,586 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:25,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:32:25,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:32:25,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-10-03 02:32:25,588 INFO L87 Difference]: Start difference. First operand 136 states and 165 transitions. Second operand 9 states. [2019-10-03 02:32:25,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:25,709 INFO L93 Difference]: Finished difference Result 143 states and 172 transitions. [2019-10-03 02:32:25,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:32:25,710 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2019-10-03 02:32:25,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:25,711 INFO L225 Difference]: With dead ends: 143 [2019-10-03 02:32:25,712 INFO L226 Difference]: Without dead ends: 143 [2019-10-03 02:32:25,713 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2019-10-03 02:32:25,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-10-03 02:32:25,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 136. [2019-10-03 02:32:25,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-10-03 02:32:25,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 165 transitions. [2019-10-03 02:32:25,718 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 165 transitions. Word has length 32 [2019-10-03 02:32:25,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:25,718 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 165 transitions. [2019-10-03 02:32:25,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:32:25,718 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 165 transitions. [2019-10-03 02:32:25,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-03 02:32:25,720 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:25,720 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 10, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:25,721 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:25,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:25,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1742732037, now seen corresponding path program 1 times [2019-10-03 02:32:25,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:25,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:25,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:32:25,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:25,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:25,891 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 17 proven. 212 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:25,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:25,892 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:32:25,892 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 60 with the following transitions: [2019-10-03 02:32:25,892 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [20], [22], [25], [27], [29], [37], [43], [50], [53], [55], [58], [60], [61], [62], [63], [65], [66] [2019-10-03 02:32:25,894 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:32:25,894 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:32:25,982 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 02:32:25,982 INFO L272 AbstractInterpreter]: Visited 21 different actions 103 times. Merged at 9 different actions 46 times. Widened at 2 different actions 4 times. Performed 247 root evaluator evaluations with a maximum evaluation depth of 8. Performed 247 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 15 fixpoints after 4 different actions. Largest state had 8 variables. [2019-10-03 02:32:25,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:25,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 02:32:25,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:25,983 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) [2019-10-03 02:32:26,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:26,022 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:32:26,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:26,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-03 02:32:26,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:32:26,139 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 122 proven. 51 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-03 02:32:26,140 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:32:26,284 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 124 proven. 51 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-03 02:32:26,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:32:26,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 9] total 31 [2019-10-03 02:32:26,288 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:32:26,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-03 02:32:26,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-03 02:32:26,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=640, Unknown=0, NotChecked=0, Total=930 [2019-10-03 02:32:26,290 INFO L87 Difference]: Start difference. First operand 136 states and 165 transitions. Second operand 24 states. [2019-10-03 02:32:26,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:26,705 INFO L93 Difference]: Finished difference Result 227 states and 262 transitions. [2019-10-03 02:32:26,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-03 02:32:26,705 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 59 [2019-10-03 02:32:26,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:26,707 INFO L225 Difference]: With dead ends: 227 [2019-10-03 02:32:26,707 INFO L226 Difference]: Without dead ends: 227 [2019-10-03 02:32:26,708 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=662, Invalid=1500, Unknown=0, NotChecked=0, Total=2162 [2019-10-03 02:32:26,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-10-03 02:32:26,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 151. [2019-10-03 02:32:26,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-10-03 02:32:26,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 183 transitions. [2019-10-03 02:32:26,714 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 183 transitions. Word has length 59 [2019-10-03 02:32:26,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:26,715 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 183 transitions. [2019-10-03 02:32:26,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-03 02:32:26,715 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 183 transitions. [2019-10-03 02:32:26,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-03 02:32:26,716 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:26,716 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 12, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:26,717 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:26,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:26,717 INFO L82 PathProgramCache]: Analyzing trace with hash 75585305, now seen corresponding path program 2 times [2019-10-03 02:32:26,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:26,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:26,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:26,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:26,719 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:26,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:26,911 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 19 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:26,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:26,911 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:32:26,911 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:32:26,911 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:32:26,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:26,912 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-10-03 02:32:26,935 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:32:26,936 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:32:26,951 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-03 02:32:26,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:32:26,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-03 02:32:26,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:32:27,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:32:27,121 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 21 proven. 166 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-10-03 02:32:27,122 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:32:27,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:32:27,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:32:27,259 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 5 proven. 41 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2019-10-03 02:32:27,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:32:27,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10, 8] total 34 [2019-10-03 02:32:27,263 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:32:27,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-03 02:32:27,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-03 02:32:27,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=952, Unknown=0, NotChecked=0, Total=1122 [2019-10-03 02:32:27,264 INFO L87 Difference]: Start difference. First operand 151 states and 183 transitions. Second operand 28 states. [2019-10-03 02:32:30,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:30,122 INFO L93 Difference]: Finished difference Result 631 states and 735 transitions. [2019-10-03 02:32:30,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-10-03 02:32:30,122 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 65 [2019-10-03 02:32:30,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:30,128 INFO L225 Difference]: With dead ends: 631 [2019-10-03 02:32:30,128 INFO L226 Difference]: Without dead ends: 631 [2019-10-03 02:32:30,134 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4803 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2317, Invalid=11489, Unknown=0, NotChecked=0, Total=13806 [2019-10-03 02:32:30,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-10-03 02:32:30,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 409. [2019-10-03 02:32:30,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-10-03 02:32:30,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 484 transitions. [2019-10-03 02:32:30,159 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 484 transitions. Word has length 65 [2019-10-03 02:32:30,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:30,160 INFO L475 AbstractCegarLoop]: Abstraction has 409 states and 484 transitions. [2019-10-03 02:32:30,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-03 02:32:30,160 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 484 transitions. [2019-10-03 02:32:30,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-03 02:32:30,163 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:30,163 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 12, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:30,164 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:30,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:30,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1646394911, now seen corresponding path program 1 times [2019-10-03 02:32:30,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:30,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:30,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:32:30,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:30,166 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:30,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:30,328 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 5 proven. 246 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-03 02:32:30,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:30,328 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:32:30,329 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2019-10-03 02:32:30,329 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [20], [22], [25], [27], [29], [35], [37], [43], [50], [53], [55], [58], [60], [61], [62], [63], [65], [66] [2019-10-03 02:32:30,331 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:32:30,331 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:32:30,503 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 02:32:30,503 INFO L272 AbstractInterpreter]: Visited 22 different actions 140 times. Merged at 10 different actions 57 times. Widened at 2 different actions 4 times. Performed 335 root evaluator evaluations with a maximum evaluation depth of 8. Performed 335 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 18 fixpoints after 3 different actions. Largest state had 8 variables. [2019-10-03 02:32:30,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:30,503 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 02:32:30,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:30,504 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-10-03 02:32:30,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:30,539 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:32:30,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:30,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-03 02:32:30,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:32:30,651 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 163 proven. 70 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-03 02:32:30,652 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:32:30,802 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 165 proven. 70 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2019-10-03 02:32:30,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:32:30,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 10] total 29 [2019-10-03 02:32:30,807 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:32:30,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-03 02:32:30,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-03 02:32:30,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=615, Unknown=0, NotChecked=0, Total=812 [2019-10-03 02:32:30,808 INFO L87 Difference]: Start difference. First operand 409 states and 484 transitions. Second operand 21 states. [2019-10-03 02:32:31,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:31,338 INFO L93 Difference]: Finished difference Result 405 states and 468 transitions. [2019-10-03 02:32:31,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-03 02:32:31,339 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 65 [2019-10-03 02:32:31,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:31,341 INFO L225 Difference]: With dead ends: 405 [2019-10-03 02:32:31,342 INFO L226 Difference]: Without dead ends: 405 [2019-10-03 02:32:31,343 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=701, Invalid=1555, Unknown=0, NotChecked=0, Total=2256 [2019-10-03 02:32:31,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2019-10-03 02:32:31,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 260. [2019-10-03 02:32:31,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-10-03 02:32:31,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 318 transitions. [2019-10-03 02:32:31,353 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 318 transitions. Word has length 65 [2019-10-03 02:32:31,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:31,353 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 318 transitions. [2019-10-03 02:32:31,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-03 02:32:31,353 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 318 transitions. [2019-10-03 02:32:31,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-03 02:32:31,354 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:31,355 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 14, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:31,355 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:31,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:31,355 INFO L82 PathProgramCache]: Analyzing trace with hash 406377145, now seen corresponding path program 2 times [2019-10-03 02:32:31,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:31,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:31,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:31,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:31,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:31,634 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 197 proven. 202 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:31,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:31,635 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:32:31,635 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:32:31,635 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:32:31,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:31,635 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:32:31,664 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:32:31,665 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:32:31,699 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-03 02:32:31,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:32:31,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-03 02:32:31,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:32:31,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:32:31,897 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 24 proven. 213 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-10-03 02:32:31,897 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:32:31,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:32:32,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:32:32,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:32:32,083 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 4 proven. 48 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2019-10-03 02:32:32,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:32:32,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 10, 9] total 38 [2019-10-03 02:32:32,096 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:32:32,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-03 02:32:32,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-03 02:32:32,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=1152, Unknown=0, NotChecked=0, Total=1406 [2019-10-03 02:32:32,098 INFO L87 Difference]: Start difference. First operand 260 states and 318 transitions. Second operand 34 states. [2019-10-03 02:32:36,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:36,508 INFO L93 Difference]: Finished difference Result 786 states and 963 transitions. [2019-10-03 02:32:36,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2019-10-03 02:32:36,509 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 71 [2019-10-03 02:32:36,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:36,515 INFO L225 Difference]: With dead ends: 786 [2019-10-03 02:32:36,515 INFO L226 Difference]: Without dead ends: 786 [2019-10-03 02:32:36,521 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7963 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3963, Invalid=17207, Unknown=0, NotChecked=0, Total=21170 [2019-10-03 02:32:36,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2019-10-03 02:32:36,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 433. [2019-10-03 02:32:36,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-10-03 02:32:36,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 513 transitions. [2019-10-03 02:32:36,545 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 513 transitions. Word has length 71 [2019-10-03 02:32:36,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:36,545 INFO L475 AbstractCegarLoop]: Abstraction has 433 states and 513 transitions. [2019-10-03 02:32:36,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-03 02:32:36,545 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 513 transitions. [2019-10-03 02:32:36,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-03 02:32:36,547 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:36,547 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 14, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:36,547 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:36,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:36,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1994081667, now seen corresponding path program 3 times [2019-10-03 02:32:36,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:36,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:36,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:32:36,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:36,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:36,770 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 198 proven. 201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:36,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:36,771 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:32:36,771 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:32:36,771 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:32:36,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:36,771 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-10-03 02:32:36,807 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-03 02:32:36,807 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-10-03 02:32:36,823 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-03 02:32:36,824 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:32:36,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-03 02:32:36,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:32:36,961 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 291 proven. 31 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-03 02:32:36,961 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:32:37,118 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 290 proven. 32 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-03 02:32:37,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:32:37,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 12, 12] total 42 [2019-10-03 02:32:37,122 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:32:37,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-03 02:32:37,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-03 02:32:37,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=1403, Unknown=0, NotChecked=0, Total=1722 [2019-10-03 02:32:37,124 INFO L87 Difference]: Start difference. First operand 433 states and 513 transitions. Second operand 34 states. [2019-10-03 02:32:38,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:38,468 INFO L93 Difference]: Finished difference Result 750 states and 857 transitions. [2019-10-03 02:32:38,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-03 02:32:38,469 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 71 [2019-10-03 02:32:38,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:38,473 INFO L225 Difference]: With dead ends: 750 [2019-10-03 02:32:38,474 INFO L226 Difference]: Without dead ends: 750 [2019-10-03 02:32:38,475 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 125 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1748 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=972, Invalid=4728, Unknown=0, NotChecked=0, Total=5700 [2019-10-03 02:32:38,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2019-10-03 02:32:38,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 614. [2019-10-03 02:32:38,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-10-03 02:32:38,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 721 transitions. [2019-10-03 02:32:38,493 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 721 transitions. Word has length 71 [2019-10-03 02:32:38,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:38,493 INFO L475 AbstractCegarLoop]: Abstraction has 614 states and 721 transitions. [2019-10-03 02:32:38,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-03 02:32:38,493 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 721 transitions. [2019-10-03 02:32:38,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-03 02:32:38,494 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:38,495 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:38,495 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:38,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:38,495 INFO L82 PathProgramCache]: Analyzing trace with hash 724450169, now seen corresponding path program 1 times [2019-10-03 02:32:38,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:38,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:38,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:32:38,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:38,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:38,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:38,536 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2019-10-03 02:32:38,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:38,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:32:38,537 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:38,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:32:38,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:32:38,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:32:38,538 INFO L87 Difference]: Start difference. First operand 614 states and 721 transitions. Second operand 4 states. [2019-10-03 02:32:38,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:38,555 INFO L93 Difference]: Finished difference Result 605 states and 712 transitions. [2019-10-03 02:32:38,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:32:38,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-10-03 02:32:38,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:38,559 INFO L225 Difference]: With dead ends: 605 [2019-10-03 02:32:38,559 INFO L226 Difference]: Without dead ends: 605 [2019-10-03 02:32:38,559 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:32:38,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-10-03 02:32:38,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 505. [2019-10-03 02:32:38,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-10-03 02:32:38,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 584 transitions. [2019-10-03 02:32:38,573 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 584 transitions. Word has length 71 [2019-10-03 02:32:38,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:38,573 INFO L475 AbstractCegarLoop]: Abstraction has 505 states and 584 transitions. [2019-10-03 02:32:38,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:32:38,573 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 584 transitions. [2019-10-03 02:32:38,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-03 02:32:38,574 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:38,575 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 16, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:38,575 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:38,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:38,575 INFO L82 PathProgramCache]: Analyzing trace with hash -630003643, now seen corresponding path program 4 times [2019-10-03 02:32:38,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:38,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:38,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:38,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:38,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:38,736 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 237 proven. 211 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-03 02:32:38,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:38,736 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:32:38,736 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:32:38,736 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:32:38,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:38,736 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-10-03 02:32:38,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:38,778 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:32:38,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:38,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-03 02:32:38,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:32:38,807 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 235 proven. 117 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-10-03 02:32:38,807 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:32:38,982 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 237 proven. 117 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-10-03 02:32:38,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:32:38,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 12, 12] total 33 [2019-10-03 02:32:38,985 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:32:38,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-03 02:32:38,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-03 02:32:38,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=615, Unknown=0, NotChecked=0, Total=1056 [2019-10-03 02:32:38,986 INFO L87 Difference]: Start difference. First operand 505 states and 584 transitions. Second operand 23 states. [2019-10-03 02:32:39,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:39,157 INFO L93 Difference]: Finished difference Result 423 states and 483 transitions. [2019-10-03 02:32:39,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 02:32:39,158 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 74 [2019-10-03 02:32:39,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:39,160 INFO L225 Difference]: With dead ends: 423 [2019-10-03 02:32:39,160 INFO L226 Difference]: Without dead ends: 423 [2019-10-03 02:32:39,161 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=441, Invalid=615, Unknown=0, NotChecked=0, Total=1056 [2019-10-03 02:32:39,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2019-10-03 02:32:39,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 332. [2019-10-03 02:32:39,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-10-03 02:32:39,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 387 transitions. [2019-10-03 02:32:39,170 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 387 transitions. Word has length 74 [2019-10-03 02:32:39,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:39,171 INFO L475 AbstractCegarLoop]: Abstraction has 332 states and 387 transitions. [2019-10-03 02:32:39,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-03 02:32:39,171 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 387 transitions. [2019-10-03 02:32:39,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-03 02:32:39,172 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:39,172 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 18, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:39,173 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:39,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:39,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1043330695, now seen corresponding path program 5 times [2019-10-03 02:32:39,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:39,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:39,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:39,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:39,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:39,432 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 306 proven. 311 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:39,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:39,432 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:32:39,432 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:32:39,432 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:32:39,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:39,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:32:39,498 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:32:39,498 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:32:39,523 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-03 02:32:39,523 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:32:39,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-03 02:32:39,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:32:39,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:32:39,777 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 30 proven. 325 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2019-10-03 02:32:39,778 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:32:39,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:32:39,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:32:39,893 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 5 proven. 59 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2019-10-03 02:32:39,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:32:39,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 10, 8] total 39 [2019-10-03 02:32:39,902 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:32:39,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-03 02:32:39,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-03 02:32:39,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=1153, Unknown=0, NotChecked=0, Total=1482 [2019-10-03 02:32:39,903 INFO L87 Difference]: Start difference. First operand 332 states and 387 transitions. Second operand 36 states. [2019-10-03 02:32:42,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:42,049 INFO L93 Difference]: Finished difference Result 541 states and 616 transitions. [2019-10-03 02:32:42,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-10-03 02:32:42,050 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 83 [2019-10-03 02:32:42,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:42,053 INFO L225 Difference]: With dead ends: 541 [2019-10-03 02:32:42,054 INFO L226 Difference]: Without dead ends: 541 [2019-10-03 02:32:42,059 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4104 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1787, Invalid=9555, Unknown=0, NotChecked=0, Total=11342 [2019-10-03 02:32:42,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2019-10-03 02:32:42,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 372. [2019-10-03 02:32:42,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-10-03 02:32:42,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 435 transitions. [2019-10-03 02:32:42,088 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 435 transitions. Word has length 83 [2019-10-03 02:32:42,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:42,089 INFO L475 AbstractCegarLoop]: Abstraction has 372 states and 435 transitions. [2019-10-03 02:32:42,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-03 02:32:42,089 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 435 transitions. [2019-10-03 02:32:42,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-03 02:32:42,092 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:42,093 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 27, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:42,093 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:42,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:42,094 INFO L82 PathProgramCache]: Analyzing trace with hash -85867160, now seen corresponding path program 3 times [2019-10-03 02:32:42,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:42,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:42,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:32:42,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:42,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:42,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1418 backedges. 37 proven. 1377 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-03 02:32:42,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:42,862 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:32:42,862 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:32:42,862 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:32:42,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:42,862 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-10-03 02:32:42,912 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-03 02:32:42,912 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-10-03 02:32:42,950 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-03 02:32:42,950 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:32:42,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-03 02:32:42,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:32:43,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1418 backedges. 644 proven. 145 refuted. 0 times theorem prover too weak. 629 trivial. 0 not checked. [2019-10-03 02:32:43,116 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:32:43,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1418 backedges. 648 proven. 145 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2019-10-03 02:32:43,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:32:43,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 13, 13] total 59 [2019-10-03 02:32:43,440 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:32:43,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-03 02:32:43,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-03 02:32:43,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=754, Invalid=2668, Unknown=0, NotChecked=0, Total=3422 [2019-10-03 02:32:43,442 INFO L87 Difference]: Start difference. First operand 372 states and 435 transitions. Second operand 48 states. [2019-10-03 02:32:44,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:44,372 INFO L93 Difference]: Finished difference Result 604 states and 672 transitions. [2019-10-03 02:32:44,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-03 02:32:44,382 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 122 [2019-10-03 02:32:44,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:44,386 INFO L225 Difference]: With dead ends: 604 [2019-10-03 02:32:44,386 INFO L226 Difference]: Without dead ends: 604 [2019-10-03 02:32:44,387 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1900 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1659, Invalid=5481, Unknown=0, NotChecked=0, Total=7140 [2019-10-03 02:32:44,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-10-03 02:32:44,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 363. [2019-10-03 02:32:44,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-10-03 02:32:44,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 422 transitions. [2019-10-03 02:32:44,399 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 422 transitions. Word has length 122 [2019-10-03 02:32:44,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:44,399 INFO L475 AbstractCegarLoop]: Abstraction has 363 states and 422 transitions. [2019-10-03 02:32:44,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-03 02:32:44,400 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 422 transitions. [2019-10-03 02:32:44,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-03 02:32:44,401 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:44,402 INFO L411 BasicCegarLoop]: trace histogram [33, 33, 30, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:44,402 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:44,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:44,402 INFO L82 PathProgramCache]: Analyzing trace with hash -2107743816, now seen corresponding path program 4 times [2019-10-03 02:32:44,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:44,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:44,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:32:44,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:44,405 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:44,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:45,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1706 backedges. 39 proven. 1663 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-03 02:32:45,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:45,048 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:32:45,049 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:32:45,049 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:32:45,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:45,049 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:32:45,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:45,101 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:32:45,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:45,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-03 02:32:45,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:32:45,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1706 backedges. 774 proven. 176 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2019-10-03 02:32:45,338 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:32:45,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1706 backedges. 778 proven. 176 refuted. 0 times theorem prover too weak. 752 trivial. 0 not checked. [2019-10-03 02:32:45,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:32:45,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 14, 14] total 64 [2019-10-03 02:32:45,678 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:32:45,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-10-03 02:32:45,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-10-03 02:32:45,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=888, Invalid=3144, Unknown=0, NotChecked=0, Total=4032 [2019-10-03 02:32:45,680 INFO L87 Difference]: Start difference. First operand 363 states and 422 transitions. Second operand 52 states. [2019-10-03 02:32:46,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:46,751 INFO L93 Difference]: Finished difference Result 637 states and 706 transitions. [2019-10-03 02:32:46,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-03 02:32:46,754 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 131 [2019-10-03 02:32:46,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:46,758 INFO L225 Difference]: With dead ends: 637 [2019-10-03 02:32:46,758 INFO L226 Difference]: Without dead ends: 637 [2019-10-03 02:32:46,760 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2335 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2043, Invalid=6699, Unknown=0, NotChecked=0, Total=8742 [2019-10-03 02:32:46,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-10-03 02:32:46,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 396. [2019-10-03 02:32:46,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-10-03 02:32:46,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 460 transitions. [2019-10-03 02:32:46,771 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 460 transitions. Word has length 131 [2019-10-03 02:32:46,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:46,771 INFO L475 AbstractCegarLoop]: Abstraction has 396 states and 460 transitions. [2019-10-03 02:32:46,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-10-03 02:32:46,771 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 460 transitions. [2019-10-03 02:32:46,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-03 02:32:46,773 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:46,774 INFO L411 BasicCegarLoop]: trace histogram [36, 36, 33, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:46,774 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:46,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:46,774 INFO L82 PathProgramCache]: Analyzing trace with hash 504488552, now seen corresponding path program 5 times [2019-10-03 02:32:46,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:46,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:46,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:46,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:46,778 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:46,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:47,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2021 backedges. 41 proven. 1976 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-03 02:32:47,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:47,453 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:32:47,453 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:32:47,453 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:32:47,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:47,454 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-10-03 02:32:47,522 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:32:47,522 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:32:47,549 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-03 02:32:47,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:32:47,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-03 02:32:47,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:32:47,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:32:47,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2021 backedges. 962 proven. 1 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2019-10-03 02:32:47,749 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:32:47,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:32:47,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:32:47,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:32:47,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2021 backedges. 928 proven. 35 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2019-10-03 02:32:47,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:32:47,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 10, 9] total 56 [2019-10-03 02:32:47,965 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:32:47,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-10-03 02:32:47,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-10-03 02:32:47,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=400, Invalid=2680, Unknown=0, NotChecked=0, Total=3080 [2019-10-03 02:32:47,966 INFO L87 Difference]: Start difference. First operand 396 states and 460 transitions. Second operand 52 states. [2019-10-03 02:32:54,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:54,127 INFO L93 Difference]: Finished difference Result 1953 states and 2254 transitions. [2019-10-03 02:32:54,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2019-10-03 02:32:54,129 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 140 [2019-10-03 02:32:54,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:54,130 INFO L225 Difference]: With dead ends: 1953 [2019-10-03 02:32:54,130 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:32:54,134 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 268 SyntacticMatches, 1 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12634 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=8878, Invalid=28178, Unknown=0, NotChecked=0, Total=37056 [2019-10-03 02:32:54,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:32:54,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:32:54,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:32:54,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:32:54,135 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 140 [2019-10-03 02:32:54,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:54,135 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:32:54,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-10-03 02:32:54,135 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:32:54,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:32:54,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:32:54 BoogieIcfgContainer [2019-10-03 02:32:54,141 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:32:54,143 INFO L168 Benchmark]: Toolchain (without parser) took 34595.63 ms. Allocated memory was 132.6 MB in the beginning and 548.9 MB in the end (delta: 416.3 MB). Free memory was 88.5 MB in the beginning and 252.6 MB in the end (delta: -164.1 MB). Peak memory consumption was 252.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:32:54,143 INFO L168 Benchmark]: CDTParser took 0.94 ms. Allocated memory is still 132.6 MB. Free memory was 106.8 MB in the beginning and 106.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:32:54,144 INFO L168 Benchmark]: CACSL2BoogieTranslator took 238.16 ms. Allocated memory is still 132.6 MB. Free memory was 88.3 MB in the beginning and 78.3 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-10-03 02:32:54,145 INFO L168 Benchmark]: Boogie Preprocessor took 109.63 ms. Allocated memory was 132.6 MB in the beginning and 199.8 MB in the end (delta: 67.1 MB). Free memory was 78.3 MB in the beginning and 176.2 MB in the end (delta: -97.9 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:32:54,146 INFO L168 Benchmark]: RCFGBuilder took 277.52 ms. Allocated memory is still 199.8 MB. Free memory was 176.2 MB in the beginning and 163.0 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. [2019-10-03 02:32:54,146 INFO L168 Benchmark]: TraceAbstraction took 33965.86 ms. Allocated memory was 199.8 MB in the beginning and 548.9 MB in the end (delta: 349.2 MB). Free memory was 163.0 MB in the beginning and 252.6 MB in the end (delta: -89.6 MB). Peak memory consumption was 259.6 MB. Max. memory is 7.1 GB. [2019-10-03 02:32:54,150 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.94 ms. Allocated memory is still 132.6 MB. Free memory was 106.8 MB in the beginning and 106.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 238.16 ms. Allocated memory is still 132.6 MB. Free memory was 88.3 MB in the beginning and 78.3 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 109.63 ms. Allocated memory was 132.6 MB in the beginning and 199.8 MB in the end (delta: 67.1 MB). Free memory was 78.3 MB in the beginning and 176.2 MB in the end (delta: -97.9 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 277.52 ms. Allocated memory is still 199.8 MB. Free memory was 176.2 MB in the beginning and 163.0 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 33965.86 ms. Allocated memory was 199.8 MB in the beginning and 548.9 MB in the end (delta: 349.2 MB). Free memory was 163.0 MB in the beginning and 252.6 MB in the end (delta: -89.6 MB). Peak memory consumption was 259.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. SAFE Result, 33.8s OverallTime, 26 OverallIterations, 36 TraceHistogramMax, 22.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 543 SDtfs, 1661 SDslu, 3473 SDs, 0 SdLazy, 9198 SolverSat, 783 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3221 GetRequests, 2124 SyntacticMatches, 7 SemanticMatches, 1090 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37177 ImplicationChecksByTransitivity, 19.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=614occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 9 AbstIntIterations, 3 AbstIntStrong, 0.8090277777777777 AbsIntWeakeningRatio, 0.7083333333333334 AbsIntAvgWeakeningVarsNumRemoved, 0.5 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 26 MinimizatonAttempts, 1980 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 2426 NumberOfCodeBlocks, 2133 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 3495 ConstructedInterpolants, 0 QuantifiedInterpolants, 839063 SizeOfPredicates, 56 NumberOfNonLiveVariables, 1905 ConjunctsInSsa, 219 ConjunctsInUnsatCore, 66 InterpolantComputations, 9 PerfectInterpolantSequences, 15490/24659 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...