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/locks/test_locks_9.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:26:57,411 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:26:57,413 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:26:57,425 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:26:57,425 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:26:57,427 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:26:57,429 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:26:57,436 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:26:57,441 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:26:57,442 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:26:57,443 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:26:57,444 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:26:57,444 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:26:57,445 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:26:57,446 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:26:57,447 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:26:57,448 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:26:57,449 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:26:57,450 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:26:57,452 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:26:57,454 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:26:57,457 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:26:57,459 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:26:57,459 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:26:57,462 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:26:57,462 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:26:57,462 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:26:57,463 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:26:57,463 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:26:57,464 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:26:57,464 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:26:57,465 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:26:57,466 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:26:57,467 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:26:57,467 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:26:57,468 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:26:57,468 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:26:57,469 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:26:57,469 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:26:57,470 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:26:57,470 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:26:57,471 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-20 13:26:57,486 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:26:57,486 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:26:57,487 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:26:57,487 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:26:57,488 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:26:57,488 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:26:57,488 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:26:57,488 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:26:57,488 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:26:57,489 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:26:57,489 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:26:57,490 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:26:57,490 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:26:57,490 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:26:57,490 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:26:57,490 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:26:57,490 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:26:57,491 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:26:57,491 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:26:57,491 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:26:57,491 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:26:57,491 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:26:57,492 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:26:57,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:26:57,492 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:26:57,492 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:26:57,493 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:26:57,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:26:57,493 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:26:57,493 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:26:57,522 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:26:57,535 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:26:57,538 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:26:57,540 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:26:57,540 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:26:57,541 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_9.c [2019-09-20 13:26:57,603 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ae85ce1a/f64b133f7a14470a830aa6f4f8df5a51/FLAG47b2dbf60 [2019-09-20 13:26:58,063 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:26:58,066 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_9.c [2019-09-20 13:26:58,075 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ae85ce1a/f64b133f7a14470a830aa6f4f8df5a51/FLAG47b2dbf60 [2019-09-20 13:26:58,406 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ae85ce1a/f64b133f7a14470a830aa6f4f8df5a51 [2019-09-20 13:26:58,421 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:26:58,423 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:26:58,424 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:26:58,424 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:26:58,428 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:26:58,429 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:26:58" (1/1) ... [2019-09-20 13:26:58,432 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@702bca65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:58, skipping insertion in model container [2019-09-20 13:26:58,432 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:26:58" (1/1) ... [2019-09-20 13:26:58,440 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:26:58,476 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:26:58,690 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:26:58,694 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:26:58,718 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:26:58,822 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:26:58,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:58 WrapperNode [2019-09-20 13:26:58,823 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:26:58,824 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:26:58,824 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:26:58,824 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:26:58,836 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:58" (1/1) ... [2019-09-20 13:26:58,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:58" (1/1) ... [2019-09-20 13:26:58,842 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:58" (1/1) ... [2019-09-20 13:26:58,843 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:58" (1/1) ... [2019-09-20 13:26:58,848 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:58" (1/1) ... [2019-09-20 13:26:58,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:58" (1/1) ... [2019-09-20 13:26:58,860 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:58" (1/1) ... [2019-09-20 13:26:58,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:26:58,863 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:26:58,863 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:26:58,863 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:26:58,864 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:26:58,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:26:58,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:26:58,921 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:26:58,921 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:26:58,921 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:26:58,921 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:26:58,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:26:58,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:26:59,243 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:26:59,243 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:26:59,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:26:59 BoogieIcfgContainer [2019-09-20 13:26:59,245 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:26:59,251 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:26:59,251 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:26:59,255 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:26:59,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:26:58" (1/3) ... [2019-09-20 13:26:59,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d10c261 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:26:59, skipping insertion in model container [2019-09-20 13:26:59,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:58" (2/3) ... [2019-09-20 13:26:59,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d10c261 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:26:59, skipping insertion in model container [2019-09-20 13:26:59,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:26:59" (3/3) ... [2019-09-20 13:26:59,258 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2019-09-20 13:26:59,270 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:26:59,277 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:26:59,290 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:26:59,316 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:26:59,316 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:26:59,316 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:26:59,316 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:26:59,316 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:26:59,317 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:26:59,317 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:26:59,317 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:26:59,337 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2019-09-20 13:26:59,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 13:26:59,347 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:59,348 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:59,350 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:59,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:59,356 INFO L82 PathProgramCache]: Analyzing trace with hash 691982780, now seen corresponding path program 1 times [2019-09-20 13:26:59,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:59,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:59,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:59,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:59,404 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:59,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:59,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:59,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:59,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:59,544 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:59,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:59,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:59,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:59,573 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 3 states. [2019-09-20 13:26:59,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:59,655 INFO L93 Difference]: Finished difference Result 74 states and 125 transitions. [2019-09-20 13:26:59,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:59,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-20 13:26:59,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:59,668 INFO L225 Difference]: With dead ends: 74 [2019-09-20 13:26:59,669 INFO L226 Difference]: Without dead ends: 66 [2019-09-20 13:26:59,670 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:59,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-20 13:26:59,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-09-20 13:26:59,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-20 13:26:59,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 81 transitions. [2019-09-20 13:26:59,711 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 81 transitions. Word has length 19 [2019-09-20 13:26:59,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:59,712 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 81 transitions. [2019-09-20 13:26:59,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:59,713 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 81 transitions. [2019-09-20 13:26:59,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 13:26:59,714 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:59,714 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:59,714 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:59,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:59,715 INFO L82 PathProgramCache]: Analyzing trace with hash 950148218, now seen corresponding path program 1 times [2019-09-20 13:26:59,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:59,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:59,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:59,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:59,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:59,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:59,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:59,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:59,788 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:59,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:59,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:59,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:59,790 INFO L87 Difference]: Start difference. First operand 46 states and 81 transitions. Second operand 3 states. [2019-09-20 13:26:59,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:59,821 INFO L93 Difference]: Finished difference Result 66 states and 114 transitions. [2019-09-20 13:26:59,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:59,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-20 13:26:59,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:59,823 INFO L225 Difference]: With dead ends: 66 [2019-09-20 13:26:59,823 INFO L226 Difference]: Without dead ends: 66 [2019-09-20 13:26:59,824 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:59,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-20 13:26:59,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-09-20 13:26:59,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-20 13:26:59,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 113 transitions. [2019-09-20 13:26:59,835 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 113 transitions. Word has length 19 [2019-09-20 13:26:59,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:59,835 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 113 transitions. [2019-09-20 13:26:59,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:59,836 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 113 transitions. [2019-09-20 13:26:59,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 13:26:59,837 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:59,837 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:59,837 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:59,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:59,838 INFO L82 PathProgramCache]: Analyzing trace with hash -23156596, now seen corresponding path program 1 times [2019-09-20 13:26:59,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:59,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:59,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:59,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:59,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:59,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:59,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:59,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:59,889 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:59,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:59,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:59,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:59,891 INFO L87 Difference]: Start difference. First operand 64 states and 113 transitions. Second operand 3 states. [2019-09-20 13:26:59,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:59,920 INFO L93 Difference]: Finished difference Result 69 states and 116 transitions. [2019-09-20 13:26:59,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:59,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-20 13:26:59,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:59,922 INFO L225 Difference]: With dead ends: 69 [2019-09-20 13:26:59,922 INFO L226 Difference]: Without dead ends: 69 [2019-09-20 13:26:59,923 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:59,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-20 13:26:59,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-09-20 13:26:59,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-20 13:26:59,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 115 transitions. [2019-09-20 13:26:59,941 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 115 transitions. Word has length 20 [2019-09-20 13:26:59,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:59,942 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 115 transitions. [2019-09-20 13:26:59,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:59,942 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 115 transitions. [2019-09-20 13:26:59,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 13:26:59,943 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:59,943 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:59,944 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:59,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:59,944 INFO L82 PathProgramCache]: Analyzing trace with hash -609962610, now seen corresponding path program 1 times [2019-09-20 13:26:59,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:59,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:59,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:59,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:59,947 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:00,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:00,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:00,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:00,002 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:00,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:00,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:00,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:00,004 INFO L87 Difference]: Start difference. First operand 67 states and 115 transitions. Second operand 3 states. [2019-09-20 13:27:00,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:00,023 INFO L93 Difference]: Finished difference Result 122 states and 213 transitions. [2019-09-20 13:27:00,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:00,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-20 13:27:00,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:00,026 INFO L225 Difference]: With dead ends: 122 [2019-09-20 13:27:00,026 INFO L226 Difference]: Without dead ends: 122 [2019-09-20 13:27:00,026 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:00,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-09-20 13:27:00,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 88. [2019-09-20 13:27:00,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-20 13:27:00,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 152 transitions. [2019-09-20 13:27:00,038 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 152 transitions. Word has length 20 [2019-09-20 13:27:00,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:00,039 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 152 transitions. [2019-09-20 13:27:00,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:00,039 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 152 transitions. [2019-09-20 13:27:00,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 13:27:00,040 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:00,040 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:00,041 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:00,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:00,041 INFO L82 PathProgramCache]: Analyzing trace with hash -351797172, now seen corresponding path program 1 times [2019-09-20 13:27:00,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:00,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:00,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:00,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:00,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:00,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:00,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:00,090 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:00,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:00,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:00,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:00,091 INFO L87 Difference]: Start difference. First operand 88 states and 152 transitions. Second operand 3 states. [2019-09-20 13:27:00,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:00,117 INFO L93 Difference]: Finished difference Result 124 states and 211 transitions. [2019-09-20 13:27:00,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:00,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-20 13:27:00,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:00,119 INFO L225 Difference]: With dead ends: 124 [2019-09-20 13:27:00,119 INFO L226 Difference]: Without dead ends: 124 [2019-09-20 13:27:00,119 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:00,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-09-20 13:27:00,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-09-20 13:27:00,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-20 13:27:00,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 210 transitions. [2019-09-20 13:27:00,131 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 210 transitions. Word has length 20 [2019-09-20 13:27:00,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:00,132 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 210 transitions. [2019-09-20 13:27:00,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:00,132 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 210 transitions. [2019-09-20 13:27:00,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-20 13:27:00,134 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:00,134 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:00,134 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:00,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:00,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1728757681, now seen corresponding path program 1 times [2019-09-20 13:27:00,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:00,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:00,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,137 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:00,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:00,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:00,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:00,175 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:00,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:00,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:00,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:00,177 INFO L87 Difference]: Start difference. First operand 122 states and 210 transitions. Second operand 3 states. [2019-09-20 13:27:00,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:00,208 INFO L93 Difference]: Finished difference Result 126 states and 211 transitions. [2019-09-20 13:27:00,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:00,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-20 13:27:00,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:00,210 INFO L225 Difference]: With dead ends: 126 [2019-09-20 13:27:00,210 INFO L226 Difference]: Without dead ends: 126 [2019-09-20 13:27:00,211 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:00,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-09-20 13:27:00,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2019-09-20 13:27:00,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-09-20 13:27:00,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 210 transitions. [2019-09-20 13:27:00,236 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 210 transitions. Word has length 21 [2019-09-20 13:27:00,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:00,237 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 210 transitions. [2019-09-20 13:27:00,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:00,237 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 210 transitions. [2019-09-20 13:27:00,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-20 13:27:00,239 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:00,239 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:00,241 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:00,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:00,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1979403601, now seen corresponding path program 1 times [2019-09-20 13:27:00,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:00,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:00,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,244 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:00,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:00,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:00,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:00,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:00,311 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:00,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:00,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:00,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:00,313 INFO L87 Difference]: Start difference. First operand 124 states and 210 transitions. Second operand 3 states. [2019-09-20 13:27:00,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:00,337 INFO L93 Difference]: Finished difference Result 226 states and 387 transitions. [2019-09-20 13:27:00,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:00,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-20 13:27:00,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:00,340 INFO L225 Difference]: With dead ends: 226 [2019-09-20 13:27:00,340 INFO L226 Difference]: Without dead ends: 226 [2019-09-20 13:27:00,340 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:00,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-09-20 13:27:00,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 168. [2019-09-20 13:27:00,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-09-20 13:27:00,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 282 transitions. [2019-09-20 13:27:00,356 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 282 transitions. Word has length 21 [2019-09-20 13:27:00,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:00,359 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 282 transitions. [2019-09-20 13:27:00,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:00,359 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 282 transitions. [2019-09-20 13:27:00,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-20 13:27:00,361 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:00,361 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:00,363 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:00,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:00,364 INFO L82 PathProgramCache]: Analyzing trace with hash -2057398257, now seen corresponding path program 1 times [2019-09-20 13:27:00,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:00,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:00,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:00,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:00,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:00,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:00,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:00,415 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:00,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:00,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:00,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:00,416 INFO L87 Difference]: Start difference. First operand 168 states and 282 transitions. Second operand 3 states. [2019-09-20 13:27:00,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:00,449 INFO L93 Difference]: Finished difference Result 234 states and 387 transitions. [2019-09-20 13:27:00,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:00,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-20 13:27:00,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:00,452 INFO L225 Difference]: With dead ends: 234 [2019-09-20 13:27:00,452 INFO L226 Difference]: Without dead ends: 234 [2019-09-20 13:27:00,453 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:00,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-09-20 13:27:00,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 232. [2019-09-20 13:27:00,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-09-20 13:27:00,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 386 transitions. [2019-09-20 13:27:00,473 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 386 transitions. Word has length 21 [2019-09-20 13:27:00,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:00,474 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 386 transitions. [2019-09-20 13:27:00,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:00,475 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 386 transitions. [2019-09-20 13:27:00,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-20 13:27:00,480 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:00,481 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:00,481 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:00,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:00,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1232183873, now seen corresponding path program 1 times [2019-09-20 13:27:00,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:00,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:00,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:00,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:00,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:00,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:00,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:00,533 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:00,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:00,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:00,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:00,535 INFO L87 Difference]: Start difference. First operand 232 states and 386 transitions. Second operand 3 states. [2019-09-20 13:27:00,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:00,569 INFO L93 Difference]: Finished difference Result 238 states and 387 transitions. [2019-09-20 13:27:00,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:00,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-20 13:27:00,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:00,572 INFO L225 Difference]: With dead ends: 238 [2019-09-20 13:27:00,572 INFO L226 Difference]: Without dead ends: 238 [2019-09-20 13:27:00,572 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:00,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-09-20 13:27:00,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2019-09-20 13:27:00,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-09-20 13:27:00,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 386 transitions. [2019-09-20 13:27:00,579 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 386 transitions. Word has length 22 [2019-09-20 13:27:00,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:00,580 INFO L475 AbstractCegarLoop]: Abstraction has 236 states and 386 transitions. [2019-09-20 13:27:00,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:00,580 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 386 transitions. [2019-09-20 13:27:00,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-20 13:27:00,581 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:00,581 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:00,581 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:00,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:00,582 INFO L82 PathProgramCache]: Analyzing trace with hash 645377859, now seen corresponding path program 1 times [2019-09-20 13:27:00,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:00,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:00,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,585 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:00,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:00,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:00,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:00,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:00,621 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:00,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:00,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:00,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:00,622 INFO L87 Difference]: Start difference. First operand 236 states and 386 transitions. Second operand 3 states. [2019-09-20 13:27:00,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:00,638 INFO L93 Difference]: Finished difference Result 426 states and 703 transitions. [2019-09-20 13:27:00,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:00,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-20 13:27:00,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:00,642 INFO L225 Difference]: With dead ends: 426 [2019-09-20 13:27:00,642 INFO L226 Difference]: Without dead ends: 426 [2019-09-20 13:27:00,642 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:00,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-09-20 13:27:00,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 328. [2019-09-20 13:27:00,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-09-20 13:27:00,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 526 transitions. [2019-09-20 13:27:00,652 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 526 transitions. Word has length 22 [2019-09-20 13:27:00,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:00,653 INFO L475 AbstractCegarLoop]: Abstraction has 328 states and 526 transitions. [2019-09-20 13:27:00,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:00,653 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 526 transitions. [2019-09-20 13:27:00,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-20 13:27:00,655 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:00,655 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:00,655 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:00,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:00,655 INFO L82 PathProgramCache]: Analyzing trace with hash 903543297, now seen corresponding path program 1 times [2019-09-20 13:27:00,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:00,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:00,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,657 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:00,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:00,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:00,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:00,687 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:00,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:00,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:00,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:00,689 INFO L87 Difference]: Start difference. First operand 328 states and 526 transitions. Second operand 3 states. [2019-09-20 13:27:00,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:00,705 INFO L93 Difference]: Finished difference Result 450 states and 711 transitions. [2019-09-20 13:27:00,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:00,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-20 13:27:00,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:00,709 INFO L225 Difference]: With dead ends: 450 [2019-09-20 13:27:00,709 INFO L226 Difference]: Without dead ends: 450 [2019-09-20 13:27:00,709 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:00,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-09-20 13:27:00,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 448. [2019-09-20 13:27:00,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-09-20 13:27:00,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 710 transitions. [2019-09-20 13:27:00,721 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 710 transitions. Word has length 22 [2019-09-20 13:27:00,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:00,722 INFO L475 AbstractCegarLoop]: Abstraction has 448 states and 710 transitions. [2019-09-20 13:27:00,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:00,722 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 710 transitions. [2019-09-20 13:27:00,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 13:27:00,723 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:00,723 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:00,724 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:00,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:00,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1467908124, now seen corresponding path program 1 times [2019-09-20 13:27:00,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:00,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:00,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,726 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:00,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:00,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:00,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:00,751 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:00,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:00,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:00,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:00,752 INFO L87 Difference]: Start difference. First operand 448 states and 710 transitions. Second operand 3 states. [2019-09-20 13:27:00,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:00,770 INFO L93 Difference]: Finished difference Result 458 states and 711 transitions. [2019-09-20 13:27:00,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:00,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-20 13:27:00,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:00,773 INFO L225 Difference]: With dead ends: 458 [2019-09-20 13:27:00,773 INFO L226 Difference]: Without dead ends: 458 [2019-09-20 13:27:00,774 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:00,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-09-20 13:27:00,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 456. [2019-09-20 13:27:00,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-09-20 13:27:00,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 710 transitions. [2019-09-20 13:27:00,786 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 710 transitions. Word has length 23 [2019-09-20 13:27:00,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:00,786 INFO L475 AbstractCegarLoop]: Abstraction has 456 states and 710 transitions. [2019-09-20 13:27:00,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:00,786 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 710 transitions. [2019-09-20 13:27:00,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 13:27:00,787 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:00,787 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:00,788 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:00,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:00,788 INFO L82 PathProgramCache]: Analyzing trace with hash -2054714138, now seen corresponding path program 1 times [2019-09-20 13:27:00,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:00,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:00,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,790 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:00,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:00,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:00,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:00,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:00,807 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:00,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:00,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:00,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:00,808 INFO L87 Difference]: Start difference. First operand 456 states and 710 transitions. Second operand 3 states. [2019-09-20 13:27:00,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:00,823 INFO L93 Difference]: Finished difference Result 810 states and 1271 transitions. [2019-09-20 13:27:00,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:00,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-20 13:27:00,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:00,828 INFO L225 Difference]: With dead ends: 810 [2019-09-20 13:27:00,828 INFO L226 Difference]: Without dead ends: 810 [2019-09-20 13:27:00,829 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:00,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2019-09-20 13:27:00,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 648. [2019-09-20 13:27:00,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-09-20 13:27:00,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 982 transitions. [2019-09-20 13:27:00,847 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 982 transitions. Word has length 23 [2019-09-20 13:27:00,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:00,847 INFO L475 AbstractCegarLoop]: Abstraction has 648 states and 982 transitions. [2019-09-20 13:27:00,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:00,847 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 982 transitions. [2019-09-20 13:27:00,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 13:27:00,849 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:00,849 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:00,849 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:00,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:00,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1796548700, now seen corresponding path program 1 times [2019-09-20 13:27:00,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:00,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:00,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:00,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:00,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:00,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:00,870 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:00,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:00,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:00,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:00,871 INFO L87 Difference]: Start difference. First operand 648 states and 982 transitions. Second operand 3 states. [2019-09-20 13:27:00,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:00,888 INFO L93 Difference]: Finished difference Result 874 states and 1303 transitions. [2019-09-20 13:27:00,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:00,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-20 13:27:00,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:00,893 INFO L225 Difference]: With dead ends: 874 [2019-09-20 13:27:00,893 INFO L226 Difference]: Without dead ends: 874 [2019-09-20 13:27:00,894 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:00,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-09-20 13:27:00,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 872. [2019-09-20 13:27:00,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2019-09-20 13:27:00,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1302 transitions. [2019-09-20 13:27:00,915 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1302 transitions. Word has length 23 [2019-09-20 13:27:00,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:00,915 INFO L475 AbstractCegarLoop]: Abstraction has 872 states and 1302 transitions. [2019-09-20 13:27:00,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:00,916 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1302 transitions. [2019-09-20 13:27:00,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 13:27:00,917 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:00,918 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:00,918 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:00,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:00,918 INFO L82 PathProgramCache]: Analyzing trace with hash 728586230, now seen corresponding path program 1 times [2019-09-20 13:27:00,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:00,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:00,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:00,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:00,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:00,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:00,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:00,940 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:00,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:00,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:00,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:00,941 INFO L87 Difference]: Start difference. First operand 872 states and 1302 transitions. Second operand 3 states. [2019-09-20 13:27:00,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:00,962 INFO L93 Difference]: Finished difference Result 890 states and 1303 transitions. [2019-09-20 13:27:00,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:00,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-20 13:27:00,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:00,967 INFO L225 Difference]: With dead ends: 890 [2019-09-20 13:27:00,967 INFO L226 Difference]: Without dead ends: 890 [2019-09-20 13:27:00,968 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:00,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2019-09-20 13:27:00,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 888. [2019-09-20 13:27:00,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2019-09-20 13:27:00,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1302 transitions. [2019-09-20 13:27:00,991 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1302 transitions. Word has length 24 [2019-09-20 13:27:00,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:00,992 INFO L475 AbstractCegarLoop]: Abstraction has 888 states and 1302 transitions. [2019-09-20 13:27:00,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:00,992 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1302 transitions. [2019-09-20 13:27:00,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 13:27:00,994 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:00,994 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:00,994 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:00,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:00,995 INFO L82 PathProgramCache]: Analyzing trace with hash 141780216, now seen corresponding path program 1 times [2019-09-20 13:27:00,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:00,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:00,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:01,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:01,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:01,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:01,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:01,016 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:01,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:01,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:01,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:01,017 INFO L87 Difference]: Start difference. First operand 888 states and 1302 transitions. Second operand 3 states. [2019-09-20 13:27:01,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:01,042 INFO L93 Difference]: Finished difference Result 1546 states and 2279 transitions. [2019-09-20 13:27:01,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:01,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-20 13:27:01,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:01,052 INFO L225 Difference]: With dead ends: 1546 [2019-09-20 13:27:01,052 INFO L226 Difference]: Without dead ends: 1546 [2019-09-20 13:27:01,053 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:01,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2019-09-20 13:27:01,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1288. [2019-09-20 13:27:01,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1288 states. [2019-09-20 13:27:01,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1830 transitions. [2019-09-20 13:27:01,086 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1830 transitions. Word has length 24 [2019-09-20 13:27:01,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:01,087 INFO L475 AbstractCegarLoop]: Abstraction has 1288 states and 1830 transitions. [2019-09-20 13:27:01,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:01,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1830 transitions. [2019-09-20 13:27:01,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 13:27:01,090 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:01,090 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:01,090 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:01,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:01,090 INFO L82 PathProgramCache]: Analyzing trace with hash 399945654, now seen corresponding path program 1 times [2019-09-20 13:27:01,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:01,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:01,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:01,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:01,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:01,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:01,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:01,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:01,108 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:01,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:01,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:01,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:01,109 INFO L87 Difference]: Start difference. First operand 1288 states and 1830 transitions. Second operand 3 states. [2019-09-20 13:27:01,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:01,135 INFO L93 Difference]: Finished difference Result 1706 states and 2375 transitions. [2019-09-20 13:27:01,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:01,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-20 13:27:01,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:01,144 INFO L225 Difference]: With dead ends: 1706 [2019-09-20 13:27:01,144 INFO L226 Difference]: Without dead ends: 1706 [2019-09-20 13:27:01,145 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:01,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2019-09-20 13:27:01,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1704. [2019-09-20 13:27:01,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2019-09-20 13:27:01,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 2374 transitions. [2019-09-20 13:27:01,191 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 2374 transitions. Word has length 24 [2019-09-20 13:27:01,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:01,191 INFO L475 AbstractCegarLoop]: Abstraction has 1704 states and 2374 transitions. [2019-09-20 13:27:01,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:01,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 2374 transitions. [2019-09-20 13:27:01,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:27:01,195 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:01,195 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:01,195 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:01,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:01,196 INFO L82 PathProgramCache]: Analyzing trace with hash 100434809, now seen corresponding path program 1 times [2019-09-20 13:27:01,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:01,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:01,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:01,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:01,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:01,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:01,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:01,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:01,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:01,218 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:01,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:01,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:01,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:01,219 INFO L87 Difference]: Start difference. First operand 1704 states and 2374 transitions. Second operand 3 states. [2019-09-20 13:27:01,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:01,253 INFO L93 Difference]: Finished difference Result 1738 states and 2375 transitions. [2019-09-20 13:27:01,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:01,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 13:27:01,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:01,261 INFO L225 Difference]: With dead ends: 1738 [2019-09-20 13:27:01,262 INFO L226 Difference]: Without dead ends: 1738 [2019-09-20 13:27:01,262 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:01,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2019-09-20 13:27:01,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1736. [2019-09-20 13:27:01,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1736 states. [2019-09-20 13:27:01,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1736 states and 2374 transitions. [2019-09-20 13:27:01,300 INFO L78 Accepts]: Start accepts. Automaton has 1736 states and 2374 transitions. Word has length 25 [2019-09-20 13:27:01,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:01,300 INFO L475 AbstractCegarLoop]: Abstraction has 1736 states and 2374 transitions. [2019-09-20 13:27:01,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:01,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 2374 transitions. [2019-09-20 13:27:01,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:27:01,303 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:01,303 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:01,304 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:01,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:01,304 INFO L82 PathProgramCache]: Analyzing trace with hash -486371205, now seen corresponding path program 1 times [2019-09-20 13:27:01,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:01,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:01,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:01,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:01,306 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:01,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:01,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:01,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:01,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:01,323 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:01,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:01,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:01,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:01,324 INFO L87 Difference]: Start difference. First operand 1736 states and 2374 transitions. Second operand 3 states. [2019-09-20 13:27:01,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:01,350 INFO L93 Difference]: Finished difference Result 2954 states and 4039 transitions. [2019-09-20 13:27:01,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:01,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 13:27:01,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:01,364 INFO L225 Difference]: With dead ends: 2954 [2019-09-20 13:27:01,364 INFO L226 Difference]: Without dead ends: 2954 [2019-09-20 13:27:01,364 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:01,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2019-09-20 13:27:01,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2568. [2019-09-20 13:27:01,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2568 states. [2019-09-20 13:27:01,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 3398 transitions. [2019-09-20 13:27:01,420 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 3398 transitions. Word has length 25 [2019-09-20 13:27:01,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:01,420 INFO L475 AbstractCegarLoop]: Abstraction has 2568 states and 3398 transitions. [2019-09-20 13:27:01,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:01,420 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 3398 transitions. [2019-09-20 13:27:01,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:27:01,425 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:01,425 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:01,425 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:01,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:01,426 INFO L82 PathProgramCache]: Analyzing trace with hash -228205767, now seen corresponding path program 1 times [2019-09-20 13:27:01,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:01,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:01,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:01,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:01,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:01,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:01,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:01,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:01,442 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:01,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:01,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:01,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:01,443 INFO L87 Difference]: Start difference. First operand 2568 states and 3398 transitions. Second operand 3 states. [2019-09-20 13:27:01,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:01,478 INFO L93 Difference]: Finished difference Result 3338 states and 4295 transitions. [2019-09-20 13:27:01,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:01,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 13:27:01,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:01,493 INFO L225 Difference]: With dead ends: 3338 [2019-09-20 13:27:01,494 INFO L226 Difference]: Without dead ends: 3338 [2019-09-20 13:27:01,494 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:01,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2019-09-20 13:27:01,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 3336. [2019-09-20 13:27:01,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states. [2019-09-20 13:27:01,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4294 transitions. [2019-09-20 13:27:01,568 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4294 transitions. Word has length 25 [2019-09-20 13:27:01,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:01,568 INFO L475 AbstractCegarLoop]: Abstraction has 3336 states and 4294 transitions. [2019-09-20 13:27:01,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:01,568 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4294 transitions. [2019-09-20 13:27:01,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 13:27:01,574 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:01,574 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:01,574 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:01,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:01,575 INFO L82 PathProgramCache]: Analyzing trace with hash 2102577579, now seen corresponding path program 1 times [2019-09-20 13:27:01,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:01,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:01,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:01,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:01,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:01,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:01,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:01,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:01,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:01,600 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:01,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:01,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:01,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:01,601 INFO L87 Difference]: Start difference. First operand 3336 states and 4294 transitions. Second operand 3 states. [2019-09-20 13:27:01,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:01,635 INFO L93 Difference]: Finished difference Result 3402 states and 4295 transitions. [2019-09-20 13:27:01,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:01,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-20 13:27:01,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:01,655 INFO L225 Difference]: With dead ends: 3402 [2019-09-20 13:27:01,656 INFO L226 Difference]: Without dead ends: 3402 [2019-09-20 13:27:01,656 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:01,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3402 states. [2019-09-20 13:27:01,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3402 to 3400. [2019-09-20 13:27:01,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3400 states. [2019-09-20 13:27:01,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3400 states to 3400 states and 4294 transitions. [2019-09-20 13:27:01,741 INFO L78 Accepts]: Start accepts. Automaton has 3400 states and 4294 transitions. Word has length 26 [2019-09-20 13:27:01,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:01,742 INFO L475 AbstractCegarLoop]: Abstraction has 3400 states and 4294 transitions. [2019-09-20 13:27:01,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:01,742 INFO L276 IsEmpty]: Start isEmpty. Operand 3400 states and 4294 transitions. [2019-09-20 13:27:01,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 13:27:01,749 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:01,750 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:01,750 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:01,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:01,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1515771565, now seen corresponding path program 1 times [2019-09-20 13:27:01,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:01,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:01,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:01,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:01,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:01,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:01,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:01,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:01,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:01,783 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:01,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:01,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:01,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:01,784 INFO L87 Difference]: Start difference. First operand 3400 states and 4294 transitions. Second operand 3 states. [2019-09-20 13:27:01,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:01,841 INFO L93 Difference]: Finished difference Result 6538 states and 7815 transitions. [2019-09-20 13:27:01,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:01,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-20 13:27:01,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:01,909 INFO L225 Difference]: With dead ends: 6538 [2019-09-20 13:27:01,909 INFO L226 Difference]: Without dead ends: 6538 [2019-09-20 13:27:01,910 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:01,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6538 states. [2019-09-20 13:27:02,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6538 to 6536. [2019-09-20 13:27:02,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2019-09-20 13:27:02,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 7814 transitions. [2019-09-20 13:27:02,089 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 7814 transitions. Word has length 26 [2019-09-20 13:27:02,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:02,090 INFO L475 AbstractCegarLoop]: Abstraction has 6536 states and 7814 transitions. [2019-09-20 13:27:02,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:02,090 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 7814 transitions. [2019-09-20 13:27:02,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 13:27:02,099 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:02,099 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:02,100 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:02,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:02,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1257606127, now seen corresponding path program 1 times [2019-09-20 13:27:02,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:02,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:02,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:02,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:02,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:02,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:02,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:02,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:02,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:02,123 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:02,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:02,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:02,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:02,124 INFO L87 Difference]: Start difference. First operand 6536 states and 7814 transitions. Second operand 3 states. [2019-09-20 13:27:02,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:02,168 INFO L93 Difference]: Finished difference Result 7050 states and 8455 transitions. [2019-09-20 13:27:02,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:02,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-20 13:27:02,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:02,187 INFO L225 Difference]: With dead ends: 7050 [2019-09-20 13:27:02,187 INFO L226 Difference]: Without dead ends: 7050 [2019-09-20 13:27:02,188 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:02,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7050 states. [2019-09-20 13:27:02,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7050 to 6536. [2019-09-20 13:27:02,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2019-09-20 13:27:02,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 7686 transitions. [2019-09-20 13:27:02,317 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 7686 transitions. Word has length 26 [2019-09-20 13:27:02,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:02,317 INFO L475 AbstractCegarLoop]: Abstraction has 6536 states and 7686 transitions. [2019-09-20 13:27:02,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:02,318 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 7686 transitions. [2019-09-20 13:27:02,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-20 13:27:02,327 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:02,328 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:02,328 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:02,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:02,329 INFO L82 PathProgramCache]: Analyzing trace with hash -255505650, now seen corresponding path program 1 times [2019-09-20 13:27:02,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:02,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:02,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:02,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:02,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:02,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:02,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:02,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:02,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:02,349 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:02,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:02,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:02,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:02,350 INFO L87 Difference]: Start difference. First operand 6536 states and 7686 transitions. Second operand 3 states. [2019-09-20 13:27:02,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:02,399 INFO L93 Difference]: Finished difference Result 10632 states and 12166 transitions. [2019-09-20 13:27:02,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:02,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-20 13:27:02,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:02,422 INFO L225 Difference]: With dead ends: 10632 [2019-09-20 13:27:02,422 INFO L226 Difference]: Without dead ends: 10632 [2019-09-20 13:27:02,427 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:02,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10632 states. [2019-09-20 13:27:02,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10632 to 10120. [2019-09-20 13:27:02,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10120 states. [2019-09-20 13:27:02,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10120 states to 10120 states and 11654 transitions. [2019-09-20 13:27:02,689 INFO L78 Accepts]: Start accepts. Automaton has 10120 states and 11654 transitions. Word has length 27 [2019-09-20 13:27:02,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:02,689 INFO L475 AbstractCegarLoop]: Abstraction has 10120 states and 11654 transitions. [2019-09-20 13:27:02,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:02,690 INFO L276 IsEmpty]: Start isEmpty. Operand 10120 states and 11654 transitions. [2019-09-20 13:27:02,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-20 13:27:02,714 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:02,714 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:02,714 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:02,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:02,715 INFO L82 PathProgramCache]: Analyzing trace with hash 2659788, now seen corresponding path program 1 times [2019-09-20 13:27:02,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:02,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:02,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:02,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:02,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:02,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:02,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:02,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:02,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:02,745 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:02,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:02,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:02,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:02,747 INFO L87 Difference]: Start difference. First operand 10120 states and 11654 transitions. Second operand 3 states. [2019-09-20 13:27:02,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:02,813 INFO L93 Difference]: Finished difference Result 12678 states and 13829 transitions. [2019-09-20 13:27:02,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:02,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-20 13:27:02,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:02,814 INFO L225 Difference]: With dead ends: 12678 [2019-09-20 13:27:02,814 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 13:27:02,815 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:02,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 13:27:02,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 13:27:02,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 13:27:02,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 13:27:02,816 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2019-09-20 13:27:02,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:02,816 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 13:27:02,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:02,816 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 13:27:02,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 13:27:02,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:27:02 BoogieIcfgContainer [2019-09-20 13:27:02,824 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 13:27:02,828 INFO L168 Benchmark]: Toolchain (without parser) took 4403.31 ms. Allocated memory was 136.3 MB in the beginning and 331.4 MB in the end (delta: 195.0 MB). Free memory was 86.8 MB in the beginning and 222.4 MB in the end (delta: -135.6 MB). Peak memory consumption was 59.4 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:02,829 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 136.3 MB. Free memory was 105.6 MB in the beginning and 105.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-20 13:27:02,832 INFO L168 Benchmark]: CACSL2BoogieTranslator took 399.42 ms. Allocated memory was 136.3 MB in the beginning and 199.8 MB in the end (delta: 63.4 MB). Free memory was 86.6 MB in the beginning and 178.2 MB in the end (delta: -91.6 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:02,834 INFO L168 Benchmark]: Boogie Preprocessor took 39.01 ms. Allocated memory is still 199.8 MB. Free memory was 178.2 MB in the beginning and 175.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:02,839 INFO L168 Benchmark]: RCFGBuilder took 381.76 ms. Allocated memory is still 199.8 MB. Free memory was 175.9 MB in the beginning and 157.4 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:02,840 INFO L168 Benchmark]: TraceAbstraction took 3572.92 ms. Allocated memory was 199.8 MB in the beginning and 331.4 MB in the end (delta: 131.6 MB). Free memory was 157.4 MB in the beginning and 222.4 MB in the end (delta: -65.0 MB). Peak memory consumption was 66.6 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:02,855 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.24 ms. Allocated memory is still 136.3 MB. Free memory was 105.6 MB in the beginning and 105.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 399.42 ms. Allocated memory was 136.3 MB in the beginning and 199.8 MB in the end (delta: 63.4 MB). Free memory was 86.6 MB in the beginning and 178.2 MB in the end (delta: -91.6 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.01 ms. Allocated memory is still 199.8 MB. Free memory was 178.2 MB in the beginning and 175.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 381.76 ms. Allocated memory is still 199.8 MB. Free memory was 175.9 MB in the beginning and 157.4 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3572.92 ms. Allocated memory was 199.8 MB in the beginning and 331.4 MB in the end (delta: 131.6 MB). Free memory was 157.4 MB in the beginning and 222.4 MB in the end (delta: -65.0 MB). Peak memory consumption was 66.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 147]: 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 3 procedures, 41 locations, 1 error locations. SAFE Result, 3.5s OverallTime, 25 OverallIterations, 1 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1937 SDtfs, 926 SDslu, 1314 SDs, 0 SdLazy, 133 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10120occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 575 NumberOfCodeBlocks, 575 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 550 ConstructedInterpolants, 0 QuantifiedInterpolants, 23930 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...